2017
DOI: 10.1111/cgf.13160
|View full text |Cite
|
Sign up to set email alerts
|

Regularized Pointwise Map Recovery from Functional Correspondence

Abstract: The concept of using functional maps for representing dense correspondences between deformable shapes has proven to be extremely effective in many applications. However, despite the impact of this framework, the problem of recovering the point‐to‐point correspondence from a given functional map has received surprisingly little interest. In this paper, we analyse the aforementioned problem and propose a novel method for reconstructing pointwise correspondences from a given functional map. The proposed algorithm… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
47
0

Year Published

2017
2017
2024
2024

Publication Types

Select...
10

Relationship

3
7

Authors

Journals

citations
Cited by 39 publications
(47 citation statements)
references
References 42 publications
0
47
0
Order By: Relevance
“…The latter category has been particularly prominent, especially since methods built on the notion of soft mappings can take advantage of the recent advances in solving optimal transport problems, [Mandad et al 2017;Solomon et al 2015Solomon et al , 2016, or, alternatively, reduce to solving a simple least squares problem in the case of the functional maps framework [Kovnatsky et al 2013;Ovsjanikov et al 2012. At the same time, while computing soft or functional maps can be done efficiently, extracting continuous or bijective pointwise maps is often challenging and error prone [Rodolà et al 2015].…”
Section: Introductionmentioning
confidence: 99%
“…The latter category has been particularly prominent, especially since methods built on the notion of soft mappings can take advantage of the recent advances in solving optimal transport problems, [Mandad et al 2017;Solomon et al 2015Solomon et al , 2016, or, alternatively, reduce to solving a simple least squares problem in the case of the functional maps framework [Kovnatsky et al 2013;Ovsjanikov et al 2012. At the same time, while computing soft or functional maps can be done efficiently, extracting continuous or bijective pointwise maps is often challenging and error prone [Rodolà et al 2015].…”
Section: Introductionmentioning
confidence: 99%
“…We then solve the problem above globally by a nearest‐neighbour approach akin to [OBCS*12]. Note that while more sophisticated approaches exist for this step, they either tend to be very slow [RMC17, VLR*17] or do not demonstrate any result with partial shapes [RMC15, EBC17]. Conversely, problem is both scalable and works under missing geometry.…”
Section: Proposed Methodsmentioning
confidence: 99%
“…This is popular because it reduces the dimensionality of the problem from the number of vertices to the number of basis functions chosen [OBS*12]. Nevertheless, extracting the correspondence from the low dimensional representation is still a complex problem and often retrieved solutions are noisy or hard to compute [RMC15]. One major problem with purely spectral approaches is that intrinsic symmetries can not be distinguished, [RPWO18] being one of few exceptions.…”
Section: Shape Registration and Matchingmentioning
confidence: 99%