Hierarchical procrustes matching for shape retrieval

Conference item

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.

Authors: McNeill, G; Vijayakumer, S

• Publication status: Published
• Peer review status: Peer reviewed
• Publisher: Institute of Electrical and Electronics Engineers
• Host title: 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'06)
• Journal: 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'06)
• Pages: 885-894
• Publication date: 2006-07-05
• Acceptance date: 2006-05-01
• DOI: 10.1109/CVPR.2006.133
• ISSN: 1063-6919
• ISBN: 0769525970