Functional correspondence by matrix completion

12/27/2014
by   Artiom Kovnatsky, et al.
0

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.

READ FULL TEXT

page 6

page 9

page 10

page 12

page 15

page 16

page 17

research
11/17/2019

Deep geometric matrix completion: Are we doing it right?

We address the problem of reconstructing a matrix from a subset of its e...
research
09/29/2020

Geometric Matrix Completion: A Functional View

We propose a totally functional view of geometric matrix completion prob...
research
06/17/2015

Partial Functional Correspondence

In this paper, we propose a method for computing partial functional corr...
research
05/26/2019

A Genetic Algorithm for Fully Automatic Non-Isometric Shape Matching

Automatically computing shape correspondence is a difficult problem, esp...
research
01/16/2019

A Functional Representation for Graph Matching

Graph matching is an important and persistent problem in computer vision...
research
08/26/2021

A functional skeleton transfer

The animation community has spent significant effort trying to ease rigg...
research
12/24/2004

Global minimization of a quadratic functional: neural network approach

The problem of finding out the global minimum of a multiextremal functio...

Please sign up or login with your details

Forgot password? Click here to reset