We describe a simple and novel approach to identify main similarity axes by maximizing self-similarity of object contour parts divided by the axes. For a symmetric or approximately symmetric shape, the main self-similarity axis coincides with the main axis of symmetry. However, the concept of the main self-similarity axis is more general, and significantly easier to compute. By identifying critical points on the contour self-similarity computation can be expressed as a discrete problem of finding two subsets of the critical points such that the two contour parts determined by the subsets are maximally similar. In other words, for each shape, we compute its division into two parts so that the parts are maximally similar. Our experimental results yield correctly placed maximal symmetry axes for articulated and highly distorted shapes. © 2008 Springer Berlin Heidelberg.
CITATION STYLE
Yang, X., Adluru, N., Latecki, L. J., Bai, X., & Pizlo, Z. (2008). Symmetry of shapes via self-similarity. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5359 LNCS, pp. 561–570). https://doi.org/10.1007/978-3-540-89646-3_55
Mendeley helps you to discover research relevant for your work.