Abstract
We introduce a shape descriptor that is based on the Symmetry Set. This set represents pairwise symmetric points and consists of several branches. The begin and end points of the branches relate to extrema of the curvature along the shape. Consequently, extrema of the curvature are pairwise connected via a Symmetry Set branch with a certain finite length. The novel shape descriptor is given by a string representing these extrema, together with the pair wise connections and a length measure. Next, an algorithm is given to match strings. This algorithm is based on a modified shortest path algorithm, taking into account the allowed changes of the Symmetry Set. Examples show the usability of the presented theory, applied to different types of shapes, including noise and occlusions.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
