2015
DOI: 10.1007/978-3-319-16220-1_20
|View full text |Cite
|
Sign up to set email alerts
|

Supervised Descriptor Learning for Non-Rigid Shape Matching

Abstract: Abstract. We present a novel method for computing correspondences between pairs of non-rigid shapes. Unlike the majority of existing techniques that assume a deformation model, such as intrinsic isometries, a priori and use a pre-defined set of point or part descriptors, we consider the problem of learning a correspondence model given a collection of reference pairs with known mappings between them. Our formulation is purely intrinsic and does not rely on a consistent parametrization or spatial positions of ve… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
52
0

Year Published

2015
2015
2021
2021

Publication Types

Select...
5
5

Relationship

2
8

Authors

Journals

citations
Cited by 48 publications
(52 citation statements)
references
References 41 publications
0
52
0
Order By: Relevance
“…While later approaches extended the use of functional maps to non‐isometric maps (e.g. [KBBV15, PBB*13, RRBW*14, SK14, KBB*13, ERGB16]) and new consistent descriptors have been suggested [COC14, GSTOG16], these methods did not adjust the point‐wise recovery method. Recently, this framework was extended to computing partial correspondence [RCB*16, LRB*16, LRBB17], and to computing correspondences in shape collections [SBC14, HWG14, KGB16].…”
Section: Related Workmentioning
confidence: 99%
“…While later approaches extended the use of functional maps to non‐isometric maps (e.g. [KBBV15, PBB*13, RRBW*14, SK14, KBB*13, ERGB16]) and new consistent descriptors have been suggested [COC14, GSTOG16], these methods did not adjust the point‐wise recovery method. Recently, this framework was extended to computing partial correspondence [RCB*16, LRB*16, LRBB17], and to computing correspondences in shape collections [SBC14, HWG14, KGB16].…”
Section: Related Workmentioning
confidence: 99%
“…A wide range of fundamental shape analysis problems such as classification [BBGO11], segmentation [KHS10], and correspondence [COC14] have been addressed with machine learning techniques (see [XKH*16] for a survey). Due to recent developments and success of deep neural networks, researchers have focused on developing appropriate shape representations suitable for deep learning.…”
Section: Related Workmentioning
confidence: 99%
“…Functional maps express maps between surfaces through linear operators transporting functions on one surface to functions on another. Beyond the technique proposed in the original paper, many algorithms exist for computing functional maps, e.g., via sparsity [Pokrass et al 2013], joint diagonalization [Kovnatsky et al 2013], consistency [Huang and Guibas 2013], supervised learning [Corman et al 2014], matrix completion [Kovnatsky et al 2015], or estimation from a point-to-point map [Corman et al 2015]. Our goal of using functional maps to characterize local and global geometry builds upon the machinery of shape differences [Rustamov et al 2013]; see §4 for a summary.…”
Section: Related Workmentioning
confidence: 99%