An algebraic approach to symmetry detection
暂无分享,去创建一个
We present an algorithm for detecting cyclic and dihedral symmetries of an object. Both symmetry types can be detected by the special patterns they generate in the object's Fourier transform. These patterns are effectively detected and analyzed using the "angular difference function" (ADF), which measures the difference in the angular content of images. The ADF is accurately computed by using the pseudo-polar Fourier transform, which rapidly computes the Fourier transform of an object on a near-polar grid. The algorithm detects all the axes of centered and non-centered symmetries. The proposed algorithm is algebraically accurate and uses no interpolations.
[1] Luca Lucchese,et al. A frequency domain algorithm for detection and classification of cyclic and dihedral symmetries in two-dimensional patterns , 2002, Proceedings. International Conference on Image Processing.
[2] D. Donoho,et al. Fast Slant Stack: a notion of Radon transform for data in a Cartesian grid which is rapidly computable, algebraically exact, geometrically faithful and invertible , 2003 .
[3] Yehezkel Yeshurun,et al. Context-free attentional operators: The generalized symmetry transform , 1995, International Journal of Computer Vision.