Fast Multiple Shape Correspondence by Pre-Organizing Shape Instances

Abstract

Accurately identifying corresponded landmarks from a population of shape instances is the major challenge in constructing statistical shape models. In general, shape-correspondence methods can be grouped into one of two categories: global methods and pair-wise methods. In this paper, we develop a new method that attempts to address the limitations of both the global and pair-wise methods. In particular, we reorganize the input population into a tree structure that incorporates global information about the population of shape instances, where each node in the tree represents a shape instance and each edge connects two very similar shape instances. Using this organized tree, neighboring shape instances can be corresponded efficiently and accurately by a pair-wise method. In the experiments, we evaluate the proposed method and compare its performance to five available shape correspondence methods and show the proposed method achieves the accuracy of a global method with speed of a pair-wise method.

Cite

Text

Munsell et al. "Fast Multiple Shape Correspondence by Pre-Organizing Shape Instances." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2009. doi:10.1109/CVPR.2009.5206611

Markdown

[Munsell et al. "Fast Multiple Shape Correspondence by Pre-Organizing Shape Instances." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2009.](https://mlanthology.org/cvpr/2009/munsell2009cvpr-fast/) doi:10.1109/CVPR.2009.5206611

BibTeX

@inproceedings{munsell2009cvpr-fast,
  title     = {{Fast Multiple Shape Correspondence by Pre-Organizing Shape Instances}},
  author    = {Munsell, Brent C. and Temlyakov, Andrew and Wang, Song},
  booktitle = {IEEE/CVF Conference on Computer Vision and Pattern Recognition},
  year      = {2009},
  pages     = {840-847},
  doi       = {10.1109/CVPR.2009.5206611},
  url       = {https://mlanthology.org/cvpr/2009/munsell2009cvpr-fast/}
}