Hierarchical Procrustes Matching for Shape Retrieval
Authors:
- G. McNeillGMG. McNeill
- S. VijayakumarSVS. Vijayakumar
- 5 July 2006
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 1, 885-894
Abstract
We introduce Hierarchical Procrustes Matching (HPM), a segment-based shape matching algorithm which avoids problems associated with purely global or local methods and performs well on benchmark shape retrieval tests. The simplicity of the shape representation leads to a powerful matching algorithm which incorporates intuitive ideas about the perceptual nature of shape while being computationally efficient. This includes the ability to match similar parts even when they occur at different scales or positions. While comparison of multiscale shape representations is typically based on specific features, HPM avoids the need to extract such features. The hierarchical structure of the algorithm captures the appealing notion that matching should proceed in a global to local directionKeywords
This publication has 15 references indexed in Scilit:
- Robust shape similarity retrieval based on contour segmentation polygonal multiresolution and elastic matchingPattern Recognition, 2005
- Learning Chance Probability Functions for Shape Retrieval or Classification2005
- A Multiscale Representation Method for Nonrigid Shapes With a Single Closed ContourIEEE Transactions on Circuits and Systems for Video Technology, 2004
- Object representation and recognition in shape spacesPattern Recognition, 2003
- On aligning curvesIEEE Transactions on Pattern Analysis and Machine Intelligence, 2003
- Curvature Scale Space Representation: Theory, Applications, and MPEG-7 Standardization2003
- Shape descriptors for non-rigid shapes with a single closed contour2002
- Application of planar shape comparison to object retrieval in image databasesPattern Recognition, 2002
- Matching with shape contexts2000
- Shape retrieval based on dynamic programmingIEEE Transactions on Image Processing, 2000