DocumentCode
2400939
Title
Efficient computation of a reflection symmetry measure for convex polygons based on Minkowski addition
Author
Tuzikov, A.V. ; Margolin, G.L. ; Heijmans, H.J.A.M.
Author_Institution
CWI, Amsterdam, Netherlands
Volume
2
fYear
1996
fDate
25-29 Aug 1996
Firstpage
236
Abstract
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(k3) 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
Keywords
computational complexity; image processing; set theory; Minkowski addition; O(k3) time; convex polygons; perimetric measure representation; reflection symmetry measure; Area measurement; Computer vision; Cybernetics; Image edge detection; Image recognition; Object recognition; Q measurement; Reflection; Shape measurement; Time measurement;
fLanguage
English
Publisher
ieee
Conference_Titel
Pattern Recognition, 1996., Proceedings of the 13th International Conference on
Conference_Location
Vienna
ISSN
1051-4651
Print_ISBN
0-8186-7282-X
Type
conf
DOI
10.1109/ICPR.1996.546824
Filename
546824
Link To Document