A New Joint Clustering and Diffeomorphism Estimation Algorithm for Non-Rigid Shape Matching
Abstract
Matching shapes parameterized as unlabeled point-sets is a challenging problem since we have to solve for point correspondences in a non-rigid setting. Previous work on this problem such as modal matching, linear assignment, shape contexts etc. has focused more on the correspondence aspect and not on the non-rigid deformations. The principal motivation for the present work is to establish a distance measure between shapes on a shape manifold. A pre-requisite for achieving this goal is the diffeomorphic matching of point-sets. We show that a joint clustering and diffeomorphism estimation strategy is capable of simultaneously estimating correspondences and a diffeomorphism between unlabeled point-sets. Cluster centers for the two point-sets having the same label are always in correspondence. Essentially, as the cluster centers evolve during the iterations of an incremental EM algorithm, we estimate a diffeomorphism between the two sets of cluster centers. We apply our algorithm to 2D corpus callosum shapes.
Cite
Text
Guo et al. "A New Joint Clustering and Diffeomorphism Estimation Algorithm for Non-Rigid Shape Matching." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2004. doi:10.1109/CVPR.2004.283Markdown
[Guo et al. "A New Joint Clustering and Diffeomorphism Estimation Algorithm for Non-Rigid Shape Matching." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2004.](https://mlanthology.org/cvpr/2004/guo2004cvpr-new/) doi:10.1109/CVPR.2004.283BibTeX
@inproceedings{guo2004cvpr-new,
title = {{A New Joint Clustering and Diffeomorphism Estimation Algorithm for Non-Rigid Shape Matching}},
author = {Guo, Hongyu and Rangarajan, Anand and Joshi, Sarang C. and Younes, Laurent},
booktitle = {IEEE/CVF Conference on Computer Vision and Pattern Recognition},
year = {2004},
pages = {16-22},
doi = {10.1109/CVPR.2004.283},
url = {https://mlanthology.org/cvpr/2004/guo2004cvpr-new/}
}