Hierarchical procrustes matching for shape retrieval

Graham McNeill, S. Vijayakumar

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract / Description of output

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 direction.
Original languageEnglish
Title of host publicationComputer Vision and Pattern Recognition, 2006 IEEE Computer Society Conference on
Number of pages10
Publication statusPublished - 2006


Dive into the research topics of 'Hierarchical procrustes matching for shape retrieval'. Together they form a unique fingerprint.

Cite this