Functional Correspondence by Matrix Completion

Artiom Kovnatsky, Michael M. Bronstein, Xavier Bresson, Pierre Vandergheynst

CVPR 2015

doi:10.1109/CVPR.2015.7298692 /cvpr/2015/kovnatsky2015cvpr-functional/

Abstract

In this paper, we consider the problem of finding dense intrinsic correspondence between manifolds using the recently introduced functional framework. We pose the functional correspondence problem as matrix completion with manifold geometric structure and inducing functional localization with the L1 norm. We discuss efficient numerical procedures for the solution of our problem. Our method compares favorably to the accuracy of state-of-the-art correspondence algorithms on non-rigid shape matching benchmarks, and is especially advantageous in settings when only scarce data is available.

PDF CVPR Semantic Scholar

Cite

Text

Kovnatsky et al. "Functional Correspondence by Matrix Completion." Conference on Computer Vision and Pattern Recognition, 2015. doi:10.1109/CVPR.2015.7298692

Markdown

[Kovnatsky et al. "Functional Correspondence by Matrix Completion." Conference on Computer Vision and Pattern Recognition, 2015.](https://mlanthology.org/cvpr/2015/kovnatsky2015cvpr-functional/) doi:10.1109/CVPR.2015.7298692

BibTeX

@inproceedings{kovnatsky2015cvpr-functional,
  title     = {{Functional Correspondence by Matrix Completion}},
  author    = {Kovnatsky, Artiom and Bronstein, Michael M. and Bresson, Xavier and Vandergheynst, Pierre},
  booktitle = {Conference on Computer Vision and Pattern Recognition},
  year      = {2015},
  doi       = {10.1109/CVPR.2015.7298692},
  url       = {https://mlanthology.org/cvpr/2015/kovnatsky2015cvpr-functional/}
}