By Topic

Matching 2D Shapes using their Symmetry Sets

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)

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

Published in:

Pattern Recognition, 2006. ICPR 2006. 18th International Conference on  (Volume:2 )

Date of Conference:

0-0 0