English

Functional correspondence by matrix completion

Computer Vision and Pattern Recognition 2025-10-30 v2

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

Keywords

Cite

@article{arxiv.1412.8070,
  title  = {Functional correspondence by matrix completion},
  author = {Artiom Kovnatsky and Michael M. Bronstein and Xavier Bresson and Pierre Vandergheynst},
  journal= {arXiv preprint arXiv:1412.8070},
  year   = {2025}
}

Comments

"Functional Correspondence by Matrix Completion" (CVPR 2015): This paper, presented at one of the world's top AI conferences, is almost entirely fabricated, and its results are not reproducible

R2 v1 2026-06-22T07:44:46.269Z