ML Anthology

Hierarchical Procrustes Matching for Shape Retrieval

Graham McNeill, Sethu Vijayakumar
CVPR 2006 pp. 885-894
doi:10.1109/CVPR.2006.133 /cvpr/2006/mcneill2006cvpr-hierarchical/

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 direction.

PDF CVPR Semantic Scholar

Cite

Text

McNeill and Vijayakumar. "Hierarchical Procrustes Matching for Shape Retrieval." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2006. doi:10.1109/CVPR.2006.133

Markdown

[McNeill and Vijayakumar. "Hierarchical Procrustes Matching for Shape Retrieval." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2006.](https://mlanthology.org/cvpr/2006/mcneill2006cvpr-hierarchical/) doi:10.1109/CVPR.2006.133

BibTeX

@inproceedings{mcneill2006cvpr-hierarchical,
  title     = {{Hierarchical Procrustes Matching for Shape Retrieval}},
  author    = {McNeill, Graham and Vijayakumar, Sethu},
  booktitle = {IEEE/CVF Conference on Computer Vision and Pattern Recognition},
  year      = {2006},
  pages     = {885-894},
  doi       = {10.1109/CVPR.2006.133},
  url       = {https://mlanthology.org/cvpr/2006/mcneill2006cvpr-hierarchical/}
}