By Topic

Shape Recognition Using a New Spatial Representation and a D.P. Matching Algorithm

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

2 Author(s)
Shiyuan Gu ; Dept. of Math., Louisiana State Univ., Baton Rouge, LA ; Kundu, S.

We propose a new method for the recognition and retrieval of shapes whose contours are simple closed curves. First, we give a new shape representation by a sequence of 2D-vectors of angles, which is independent of rotation and scaling. Each 2D-vector captures the local shape information around a point in the contour. Next, we apply a dynamic programming method to match the points of two contours and identify the outlier (unmatched) points in each contour with respect to the other. Then, we define the similarity of a pair of contours by the number of unmatched points and the matching cost for the matched points. Finally, the recognition and retrieval are done using the nearest-neighbor method. Our experiments on MPEG-7 database show that the performance of the new algorithm is very similar to that of the best-known algorithms in the literature in spite of its significantly less computational complexity and simplicity.

Published in:

Advances in Pattern Recognition, 2009. ICAPR '09. Seventh International Conference on

Date of Conference:

4-6 Feb. 2009