论文信息 - Efficient computation of a reflection symmetry measure for convex polygons based on Minkowski addition

Efficient computation of a reflection symmetry measure for convex polygons based on Minkowski addition

This paper introduces a reflection symmetry measure for convex polygons based on Minkowski addition. An interesting property of this measure is that it can be computed in O(k/sup 3/) time, where k is the number of edges of the polygon. The proposed algorithm as well as the symmetry measure computation uses the perimetric measure representation of convex polygons.

Henk J. A. M. Heijmans | Alexander V. Tuzikov | G. L. Margolin

[1] R. Schneider. Convex Bodies: The Brunn–Minkowski Theory: Minkowski addition , 1993 .

[2] Hagit Hel-Or,et al. Symmetry as a Continuous Feature , 1995, IEEE Trans. Pattern Anal. Mach. Intell..

[3] Esther M. Arkin,et al. An efficiently computable metric for comparing polygonal shapes , 1991, SODA '90.

[4] H. Hadwiger. Vorlesungen über Inhalt, Oberfläche und Isoperimetrie , 1957 .

[5] Mikhail J. Atallah,et al. On Symmetry Detection , 1985, IEEE Transactions on Computers.

[6] B. Abel Devalcourt. Measures of axial symmetry for ovals , 1966 .

[7] B. Grünbaum. Measures of symmetry for convex sets , 1963 .

[8] Hideo Ogawa,et al. Symmetry analysis of line drawings using the Hough transform , 1991, Pattern Recognit. Lett..

[9] Changming Sun. Symmetry detection using gradient information , 1995, Pattern Recognit. Lett..

[10] Hiromitsu Yamada,et al. Detection of partial symmetry using correlation with rotated-reflected images , 1993, Pattern Recognit..

[11] Giovanni Marola,et al. On the Detection of the Axes of Symmetry of Symmetric and Almost Symmetric Planar Images , 1989, IEEE Trans. Pattern Anal. Mach. Intell..