Functional correspondence by matrix completion
Fuente:
arXiv
Guardado en:
| Autores principales: | , , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2014
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866914119345504256 |
|---|---|
| author | Kovnatsky, Artiom Bronstein, Michael M. Bresson, Xavier Vandergheynst, Pierre |
| author_facet | Kovnatsky, Artiom Bronstein, Michael M. Bresson, Xavier Vandergheynst, Pierre |
| contents | 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 $L_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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_1412_8070 |
| institution | arXiv |
| publishDate | 2014 |
| record_format | arxiv |
| spellingShingle | Functional correspondence by matrix completion Kovnatsky, Artiom Bronstein, Michael M. Bresson, Xavier Vandergheynst, Pierre Computer Vision and Pattern Recognition 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 $L_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. |
| title | Functional correspondence by matrix completion |
| topic | Computer Vision and Pattern Recognition |
| url | https://arxiv.org/abs/1412.8070 |