Robust Structure‐Based Shape Correspondence

We present a robust method to find region‐level correspondences between shapes, which are invariant to changes in geometry and applicable across multiple shape representations. We generate simplified shape graphs by jointly decomposing the shapes, and devise an adapted graph‐matching technique, from...

Full description

Saved in:
Bibliographic Details
Published in:Computer graphics forum Vol. 38; no. 1; pp. 7 - 20
Main Authors: Kleiman, Yanir, Ovsjanikov, Maks
Format: Journal Article
Language:English
Published: Oxford Blackwell Publishing Ltd 01.02.2019
Subjects:
ISSN:0167-7055, 1467-8659
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract We present a robust method to find region‐level correspondences between shapes, which are invariant to changes in geometry and applicable across multiple shape representations. We generate simplified shape graphs by jointly decomposing the shapes, and devise an adapted graph‐matching technique, from which we infer correspondences between shape regions. The simplified shape graphs are designed to primarily capture the overall structure of the shapes, without reflecting precise information about the geometry of each region, which enables us to find correspondences between shapes that might have significant geometric differences. Moreover, due to the special care we take to ensure the robustness of each part of our pipeline, our method can find correspondences between shapes with different representations, such as triangular meshes and point clouds. We demonstrate that the region‐wise matching that we obtain can be used to find correspondences between feature points, reveal the intrinsic self‐similarities of each shape and even construct point‐to‐point maps across shapes. Our method is both time and space efficient, leading to a pipeline that is significantly faster than comparable approaches. We demonstrate the performance of our approach through an extensive quantitative and qualitative evaluation on several benchmarks where we achieve comparable or superior performance to existing methods. We present a robust method to find region‐level correspondences between shapes, which are invariant to changes in geometry and applicable across multiple shape representations. We generate simplified shape graphs by jointly decomposing the shapes, and devise an adapted graph‐matching technique, from which we infer correspondences between shape regions. The simplified shape graphs are designed to primarily capture the overall structure of the shapes, without reflecting precise information about the geometry of each region, which enables us to find correspondences between shapes that might have significant geometric differences. Moreover, due to the special care we take to ensure the robustness of each part of our pipeline, our method can find correspondences between shapes with different representations, such as triangular meshes and point clouds.
AbstractList We present a robust method to find region‐level correspondences between shapes, which are invariant to changes in geometry and applicable across multiple shape representations. We generate simplified shape graphs by jointly decomposing the shapes, and devise an adapted graph‐matching technique, from which we infer correspondences between shape regions. The simplified shape graphs are designed to primarily capture the overall structure of the shapes, without reflecting precise information about the geometry of each region, which enables us to find correspondences between shapes that might have significant geometric differences. Moreover, due to the special care we take to ensure the robustness of each part of our pipeline, our method can find correspondences between shapes with different representations, such as triangular meshes and point clouds. We demonstrate that the region‐wise matching that we obtain can be used to find correspondences between feature points, reveal the intrinsic self‐similarities of each shape and even construct point‐to‐point maps across shapes. Our method is both time and space efficient, leading to a pipeline that is significantly faster than comparable approaches. We demonstrate the performance of our approach through an extensive quantitative and qualitative evaluation on several benchmarks where we achieve comparable or superior performance to existing methods.
We present a robust method to find region‐level correspondences between shapes, which are invariant to changes in geometry and applicable across multiple shape representations. We generate simplified shape graphs by jointly decomposing the shapes, and devise an adapted graph‐matching technique, from which we infer correspondences between shape regions. The simplified shape graphs are designed to primarily capture the overall structure of the shapes, without reflecting precise information about the geometry of each region, which enables us to find correspondences between shapes that might have significant geometric differences. Moreover, due to the special care we take to ensure the robustness of each part of our pipeline, our method can find correspondences between shapes with different representations, such as triangular meshes and point clouds. We demonstrate that the region‐wise matching that we obtain can be used to find correspondences between feature points, reveal the intrinsic self‐similarities of each shape and even construct point‐to‐point maps across shapes. Our method is both time and space efficient, leading to a pipeline that is significantly faster than comparable approaches. We demonstrate the performance of our approach through an extensive quantitative and qualitative evaluation on several benchmarks where we achieve comparable or superior performance to existing methods. We present a robust method to find region‐level correspondences between shapes, which are invariant to changes in geometry and applicable across multiple shape representations. We generate simplified shape graphs by jointly decomposing the shapes, and devise an adapted graph‐matching technique, from which we infer correspondences between shape regions. The simplified shape graphs are designed to primarily capture the overall structure of the shapes, without reflecting precise information about the geometry of each region, which enables us to find correspondences between shapes that might have significant geometric differences. Moreover, due to the special care we take to ensure the robustness of each part of our pipeline, our method can find correspondences between shapes with different representations, such as triangular meshes and point clouds.
Author Kleiman, Yanir
Ovsjanikov, Maks
Author_xml – sequence: 1
  givenname: Yanir
  orcidid: 0000-0002-6004-1299
  surname: Kleiman
  fullname: Kleiman, Yanir
  email: yanirk@gmail.com
  organization: Ecole Polytechnique
– sequence: 2
  givenname: Maks
  surname: Ovsjanikov
  fullname: Ovsjanikov, Maks
  email: maks@lix.polytechnique.fr
  organization: Ecole Polytechnique
BookMark eNp1kEFOwzAQRS0EEm1hwQ0qsWKRdhw7dryEiBakSkgU1pbrTCBViYOdCHXHETgjJ8HQrhDMZmbx_p-vPySHjWuQkDMKExpnap-qCWUsVwdkQLmQSS4ydUgGQOMtIcuOyTCENQBwKbIBSe7dqg_deNn53na9x8_3jysTsBwvn02L48J5j6F1TYmNxRNyVJlNwNP9HpHH2fVDcZMs7ua3xeUisUyBSqTMuUkRUqAoM7BKiVymRlq2UpTGRDZnKTdYKSgFh6pMDXJhJK4qZhQKNiLnO9_Wu9ceQ6fXrvdNfKlTqiiTSgCP1HRHWe9C8FhpW3emq13TeVNvNAX93YmOneifTqLi4pei9fWL8ds_2b37W73B7f-gLuazneILycpxzg
CitedBy_id crossref_primary_10_1016_j_cag_2020_08_008
crossref_primary_10_32604_cmes_2023_025662
crossref_primary_10_1007_s11042_021_11373_2
crossref_primary_10_1111_cgf_14360
crossref_primary_10_1007_s11042_020_08933_3
crossref_primary_10_1111_cgf_14599
crossref_primary_10_1007_s00371_020_01851_3
crossref_primary_10_1111_cgf_14579
Cites_doi 10.4208/nmtma.2013.mssvm12
10.1111/cgf.12797
10.1111/j.1467-8659.2008.01286.x
10.1145/2185520.2185526
10.1111/cgf.12066
10.1111/cgf.12734
10.1145/2601097.2601220
10.1111/j.1467-8659.2009.01517.x
10.1111/j.1467-8659.2009.01515.x
10.1111/j.1467-8659.2011.02020.x
10.1073/pnas.0508601103
10.1111/j.1467-8659.2010.01764.x
10.1109/TVCG.2012.115
10.1111/cgf.13124
10.1109/CVPR.2014.491
10.1145/2897824.2925903
10.1145/2185520.2185551
10.1145/2010324.1964974
10.1109/SMI.2003.1199609
10.1137/1.9781611973068.112
10.1111/cgf.12435
10.1111/cgf.12167
10.1111/cgf.12701
10.1111/j.1467-8659.2012.03166.x
10.1007/s10208-011-9093-5
10.1145/2070781.2024160
10.1145/1276377.1276404
10.1145/1531326.1531378
10.1145/1073204.1073207
10.1111/j.1467-8659.2011.01884.x
10.1016/j.patcog.2013.03.019
10.1145/1531326.1531379
10.1111/j.1467-8659.2012.03167.x
10.1111/cgf.12969
10.1111/j.1467-8659.2008.01282.x
ContentType Journal Article
Copyright 2018 The Authors Computer Graphics Forum © 2018 The Eurographics Association and John Wiley & Sons Ltd.
2019 The Eurographics Association and John Wiley & Sons Ltd.
Copyright_xml – notice: 2018 The Authors Computer Graphics Forum © 2018 The Eurographics Association and John Wiley & Sons Ltd.
– notice: 2019 The Eurographics Association and John Wiley & Sons Ltd.
DBID AAYXX
CITATION
7SC
8FD
JQ2
L7M
L~C
L~D
DOI 10.1111/cgf.13389
DatabaseName CrossRef
Computer and Information Systems Abstracts
Technology Research Database
ProQuest Computer Science Collection
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
DatabaseTitle CrossRef
Computer and Information Systems Abstracts
Technology Research Database
Computer and Information Systems Abstracts – Academic
Advanced Technologies Database with Aerospace
ProQuest Computer Science Collection
Computer and Information Systems Abstracts Professional
DatabaseTitleList CrossRef
Computer and Information Systems Abstracts

DeliveryMethod fulltext_linktorsrc
Discipline Engineering
EISSN 1467-8659
EndPage 20
ExternalDocumentID 10_1111_cgf_13389
CGF13389
Genre article
GrantInformation_xml – fundername: FP7 People: Marie‐Curie Actions
  funderid: CIG‐334283
– fundername: École Polytechnique, Université Paris-Saclay
  funderid: TANDEM 2
– fundername: Campus France
  funderid: Chateaubriand Fellowship
– fundername: Centre National de la Recherche Scientifique
  funderid: chaire d'excellence
– fundername: Google
  funderid: Focused Research Award
– fundername: Fonds Unique Interministériel
  funderid: TANDEM 2
GroupedDBID .3N
.4S
.DC
.GA
.Y3
05W
0R~
10A
15B
1OB
1OC
29F
31~
33P
3SF
4.4
50Y
50Z
51W
51X
52M
52N
52O
52P
52S
52T
52U
52W
52X
5GY
5HH
5LA
5VS
66C
6J9
702
7PT
8-0
8-1
8-3
8-4
8-5
8UM
8VB
930
A03
AAESR
AAEVG
AAHQN
AAMMB
AAMNL
AANHP
AANLZ
AAONW
AASGY
AAXRX
AAYCA
AAZKR
ABCQN
ABCUV
ABDBF
ABDPE
ABEML
ABPVW
ACAHQ
ACBWZ
ACCZN
ACFBH
ACGFS
ACPOU
ACRPL
ACSCC
ACUHS
ACXBN
ACXQS
ACYXJ
ADBBV
ADEOM
ADIZJ
ADKYN
ADMGS
ADMLS
ADNMO
ADOZA
ADXAS
ADZMN
AEFGJ
AEGXH
AEIGN
AEIMD
AEMOZ
AENEX
AEUYR
AEYWJ
AFBPY
AFEBI
AFFNX
AFFPM
AFGKR
AFWVQ
AFZJQ
AGHNM
AGQPQ
AGXDD
AGYGG
AHBTC
AHEFC
AHQJS
AIDQK
AIDYY
AIQQE
AITYG
AIURR
AJXKR
AKVCP
ALAGY
ALMA_UNASSIGNED_HOLDINGS
ALUQN
ALVPJ
AMBMR
AMYDB
ARCSS
ASPBG
ATUGU
AUFTA
AVWKF
AZBYB
AZFZN
AZVAB
BAFTC
BDRZF
BFHJK
BHBCM
BMNLL
BMXJE
BNHUX
BROTX
BRXPI
BY8
CAG
COF
CS3
CWDTD
D-E
D-F
DCZOG
DPXWK
DR2
DRFUL
DRSTM
DU5
EAD
EAP
EBA
EBO
EBR
EBS
EBU
EDO
EJD
EMK
EST
ESX
F00
F01
F04
F5P
FEDTE
FZ0
G-S
G.N
GODZA
H.T
H.X
HF~
HGLYW
HVGLF
HZI
HZ~
I-F
IHE
IX1
J0M
K1G
K48
LATKE
LC2
LC3
LEEKS
LH4
LITHE
LOXES
LP6
LP7
LUTES
LW6
LYRES
MEWTI
MK4
MRFUL
MRSTM
MSFUL
MSSTM
MXFUL
MXSTM
N04
N05
N9A
NF~
O66
O9-
OIG
P2W
P2X
P4D
PALCI
PQQKQ
Q.N
Q11
QB0
QWB
R.K
RDJ
RIWAO
RJQFR
ROL
RX1
SAMSI
SUPJJ
TH9
TN5
TUS
UB1
V8K
W8V
W99
WBKPD
WIH
WIK
WOHZO
WQJ
WXSBR
WYISQ
WZISG
XG1
ZL0
ZZTAW
~IA
~IF
~WT
AAYXX
CITATION
O8X
7SC
8FD
JQ2
L7M
L~C
L~D
ID FETCH-LOGICAL-c3909-7784a2e0201e750c996872a7c3b911865c8324aef90d640fd2ae46a7ebf3a9e63
IEDL.DBID DRFUL
ISICitedReferencesCount 10
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000462660600002&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0167-7055
IngestDate Wed Nov 26 02:57:30 EST 2025
Tue Nov 18 22:05:33 EST 2025
Sat Nov 29 03:41:15 EST 2025
Sun Sep 21 06:13:49 EDT 2025
IsDoiOpenAccess false
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 1
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c3909-7784a2e0201e750c996872a7c3b911865c8324aef90d640fd2ae46a7ebf3a9e63
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ORCID 0000-0002-6004-1299
OpenAccessLink https://hal.science/hal-01741753/file/region_mapper_cgf18.pdf
PQID 2191379604
PQPubID 30877
PageCount 14
ParticipantIDs proquest_journals_2191379604
crossref_citationtrail_10_1111_cgf_13389
crossref_primary_10_1111_cgf_13389
wiley_primary_10_1111_cgf_13389_CGF13389
PublicationCentury 2000
PublicationDate February 2019
PublicationDateYYYYMMDD 2019-02-01
PublicationDate_xml – month: 02
  year: 2019
  text: February 2019
PublicationDecade 2010
PublicationPlace Oxford
PublicationPlace_xml – name: Oxford
PublicationTitle Computer graphics forum
PublicationYear 2019
Publisher Blackwell Publishing Ltd
Publisher_xml – name: Blackwell Publishing Ltd
References 2015; 34
2013; 1
2011
2013; 46
2009
2008
2011; 30
2011; 11
2007
2005
2003
2016; 35
2012; 31
2005; 24
2009; 28
2013; 19
2017; 36
2013; 32
2010; 29
2008; 27
2015
2014
2014; 33
2006; 103
2007; 26
Bronstein A. M. (e_1_2_9_6_1) 2008
e_1_2_9_30_1
e_1_2_9_31_1
e_1_2_9_11_1
e_1_2_9_34_1
e_1_2_9_10_1
e_1_2_9_35_1
e_1_2_9_32_1
e_1_2_9_12_1
e_1_2_9_33_1
Kleiman Y. (e_1_2_9_22_1) 2015; 34
Aubry M. (e_1_2_9_2_1) 2011
e_1_2_9_15_1
e_1_2_9_38_1
e_1_2_9_14_1
e_1_2_9_39_1
e_1_2_9_17_1
e_1_2_9_16_1
e_1_2_9_37_1
e_1_2_9_19_1
e_1_2_9_18_1
e_1_2_9_41_1
e_1_2_9_42_1
Berg A. C. (e_1_2_9_7_1) 2005
e_1_2_9_20_1
e_1_2_9_40_1
e_1_2_9_45_1
e_1_2_9_21_1
Singh G. (e_1_2_9_36_1) 2007
Chang W. (e_1_2_9_13_1) 2011
e_1_2_9_23_1
e_1_2_9_44_1
e_1_2_9_8_1
Leordeanu M. (e_1_2_9_24_1) 2005
e_1_2_9_5_1
e_1_2_9_4_1
e_1_2_9_3_1
e_1_2_9_9_1
e_1_2_9_26_1
e_1_2_9_25_1
e_1_2_9_28_1
e_1_2_9_27_1
e_1_2_9_29_1
Tam G. K. (e_1_2_9_43_1) 2013; 19
References_xml – start-page: 26
  year: 2005
  end-page: 33
  article-title: Shape matching and object recognition using low distortion correspondences
  publication-title: Proceedings of IEEE Conference on CVPR
– year: 2011
– volume: 36
  start-page: 259
  year: 2017
  end-page: 267
  article-title: Informative descriptor preservation via commutativity for shape matching
  publication-title: Computer Graphics Forum (Proc. SGP)
– start-page: 130
  year: 2003
  end-page: 139
– volume: 46
  start-page: 2985
  issue: 11
  year: 2013
  end-page: 2999
  article-title: 3D shape retrieval using kernels on extended Reeb graphs
  publication-title: Pattern Recognition
– start-page: 91
  year: 2007
  end-page: 100
  article-title: Topological methods for the analysis of high dimensional data sets and 3D object recognition
  publication-title: Proceedings of SPBG
– volume: 31
  start-page: 1617
  year: 2012
  end-page: 1626
  article-title: Soft maps between surfaces
  publication-title: Computer Graphics Forum
– volume: 26
  start-page: 21
  year: 2007
  article-title: Global non‐rigid alignment of 3‐d scans
  publication-title: ACM Transactions on Graphics (TOG)
– volume: 103
  start-page: 1168
  issue: 5
  year: 2006
  end-page: 1172
  article-title: Generalized multidimensional scaling: A framework for isometry‐invariant partial surface matching
  publication-title: Proceedings of the National Academy of Sciences
– volume: 11
  start-page: 417
  issue: 4
  year: 2011
  end-page: 487
  article-title: Gromov–Wasserstein distances and the metric approach to object matching
  publication-title: Foundations of Computational Mathematics
– volume: 35
  start-page: 87
  year: 2016
  end-page: 119
  article-title: Recent trends, applications, and perspectives in 3d shape similarity assessment
  publication-title: Computer Graphics Forum
– volume: 30
  start-page: 1681
  year: 2011
  end-page: 1707
  article-title: A survey on shape correspondence
  publication-title: Computer Graphics Forum
– volume: 24
  start-page: 408
  year: 2005
  end-page: 416
  article-title: SCAPE: Shape completion and animation of people
  publication-title: ACM Transactions on Graphics (TOG)
– start-page: 1482
  year: 2005
  end-page: 1489
  article-title: A spectral technique for correspondence problems using pairwise constraints
  publication-title: Proceedings of ICCV
– volume: 31
  issue: 4
  year: 2012
  article-title: Functional maps: A flexible representation of maps between shapes
  publication-title: ACM Transactions on Graphics (TOG)
– volume: 30
  start-page: 126:1
  issue: 6
  year: 2011
  end-page: 126:10
  article-title: Unsupervised co‐segmentation of a set of shapes via descriptor‐space spectral clustering
  publication-title: ACM Transactions on Graphics (SIGGRAPH Asia)
– volume: 35
  start-page: 121
  year: 2016
  end-page: 133
  article-title: Stable region correspondences between non‐isometric shapes
  publication-title: Computer Graphics Forum
– volume: 31
  start-page: 55:1
  issue: 4
  year: 2012
  end-page: 11
  article-title: A probabilistic model of component‐based shape synthesis
  publication-title: ACM Transactions on Graphics (SIGGRAPH)
– volume: 32
  start-page: 459
  issue: 2pt4
  year: 2013
  end-page: 468
  article-title: Sparse modeling of intrinsic correspondences
  publication-title: Computer Graphics Forum
– volume: 28
  start-page: 72:1
  year: 2009
  end-page: 72:12
  article-title: Möbius voting for surface correspondence
  publication-title: ACM Transactions on Graphics (TOG)
– volume: 36
  start-page: 222
  year: 2017
  end-page: 236
  article-title: Partial functional correspondence
  publication-title: Computer Graphics Forum
– year: 2014
– volume: 34
  start-page: 115
  issue: 5
  year: 2015
  end-page: 128
  article-title: Tight relaxation of quadratic matching
  publication-title: Computer Graphics Forum
– volume: 30
  start-page: 1461
  year: 2011
  end-page: 1470
  article-title: Coarse‐to‐fine combinatorial matching for dense isometric shape correspondence
  publication-title: Computer Graphics Forum
– volume: 28
  start-page: 1383
  year: 2009
  end-page: 1392
  article-title: A concise and provably informative multi‐scale signature based on heat diffusion
  publication-title: Computer Graphics Forum
– volume: 29
  start-page: 1555
  issue: 5
  year: 2010
  end-page: 1564
  article-title: One point isometric matching with the heat kernel
  publication-title: Computer Graphics Forum (SGP)
– volume: 19
  start-page: 1199
  issue: 7
  year: 2013
  end-page: 1217
  article-title: Registration of 3d point clouds and meshes: A survey from rigid to nonrigid
  publication-title: TVCG
– volume: 1
  start-page: 223
  year: 2013
  end-page: 244
  article-title: Partial shape matching without point‐wise correspondence
  publication-title: Numerical Mathematics: Theory, Methods and Applications
– volume: 30
  start-page: 79:1
  year: 2011
  end-page: 79:12
  article-title: Blended intrinsic maps
  publication-title: ACM Transactions on Graphics (TOG)
– volume: 32
  year: 2013
  article-title: Shape matching via quotient spaces
  publication-title: Computer Graphics Forum
– volume: 35
  start-page: 72:1
  issue: 4
  year: 2016
  end-page: 72:1
  article-title: Entropic metric alignment for correspondence problems
  publication-title: ACM Transactions on Graphics (Proc. SIGGRAPH)
– volume: 27
  start-page: 1459
  year: 2008
  end-page: 1468
  article-title: Automatic registration for articulated shapes
  publication-title: Computer Graphics Forum
– volume: 33
  start-page: 97
  year: 2014
  end-page: 106
  article-title: Robust region detection via consensus segmentation of deformable shapes
  publication-title: Computer Graphics Forum
– year: 2008
– volume: 34
  start-page: 235:1
  issue: 6
  year: 2015
  end-page: 235:11
  article-title: SHED: Shape edit distance for fine‐grained shape similarity
  publication-title: ACM Transactions on Graphics (SIGGRAPH Asia)
– volume: 28
  start-page: 1405
  year: 2009
  end-page: 1413
  article-title: Shape analysis using the auto diffusion function
  publication-title: Computer Graphics Forum
– start-page: 1031
  year: 2009
  end-page: 1040
  article-title: Constructing laplace operator from point clouds in rd
  publication-title: Proceedings of 20th ACM‐SIAM Symposium on Discrete Algorithms
– volume: 31
  start-page: 1607
  year: 2012
  end-page: 1616
  article-title: Finding surface correspondences using symmetry axis curves
  publication-title: Computer Graphics Forum
– volume: 33
  start-page: 119:1
  issue: 4
  year: 2014
  end-page: 119:12
  article-title: Relating shapes via geometric symmetries and regularities
  publication-title: ACM Transactions on Graphics
– volume: 28
  start-page: 73:1
  issue: 3
  year: 2009
  end-page: 12
  article-title: A benchmark for 3D mesh segmentation
  publication-title: ACM Transactions on Graphics (SIGGRAPH)
– volume: 27
  start-page: 1421
  year: 2008
  end-page: 1430
  article-title: Global correspondence optimization for non‐rigid registration of depth scans
  publication-title: Computer Graphics Forum
– year: 2015
– year: 2011
  article-title: The wave kernel signature: A quantum mechanical approach to shape analysis
  publication-title: Proceedings of ICCV
– volume: 19
  start-page: 249
  issue: 2
  year: 2013
  end-page: 262
  article-title: Computing Reeb graphs as a union of contour trees
  publication-title: IEEE Transactions on Visualization and Computer Graphics
– ident: e_1_2_9_32_1
  doi: 10.4208/nmtma.2013.mssvm12
– ident: e_1_2_9_14_1
– ident: e_1_2_9_35_1
  doi: 10.1111/cgf.12797
– ident: e_1_2_9_15_1
  doi: 10.1111/j.1467-8659.2008.01286.x
– ident: e_1_2_9_29_1
  doi: 10.1145/2185520.2185526
– ident: e_1_2_9_33_1
  doi: 10.1111/cgf.12066
– ident: e_1_2_9_8_1
  doi: 10.1111/cgf.12734
– ident: e_1_2_9_44_1
  doi: 10.1145/2601097.2601220
– start-page: 1482
  year: 2005
  ident: e_1_2_9_24_1
  article-title: A spectral technique for correspondence problems using pairwise constraints
  publication-title: Proceedings of ICCV
– ident: e_1_2_9_17_1
  doi: 10.1111/j.1467-8659.2009.01517.x
– ident: e_1_2_9_38_1
  doi: 10.1111/j.1467-8659.2009.01515.x
– ident: e_1_2_9_42_1
  doi: 10.1111/j.1467-8659.2011.02020.x
– ident: e_1_2_9_5_1
  doi: 10.1073/pnas.0508601103
– ident: e_1_2_9_30_1
  doi: 10.1111/j.1467-8659.2010.01764.x
– ident: e_1_2_9_16_1
  doi: 10.1109/TVCG.2012.115
– ident: e_1_2_9_28_1
  doi: 10.1111/cgf.13124
– start-page: 91
  year: 2007
  ident: e_1_2_9_36_1
  article-title: Topological methods for the analysis of high dimensional data sets and 3D object recognition
  publication-title: Proceedings of SPBG
– ident: e_1_2_9_10_1
  doi: 10.1109/CVPR.2014.491
– ident: e_1_2_9_39_1
  doi: 10.1145/2897824.2925903
– ident: e_1_2_9_19_1
  doi: 10.1145/2185520.2185551
– ident: e_1_2_9_21_1
  doi: 10.1145/2010324.1964974
– ident: e_1_2_9_40_1
  doi: 10.1109/SMI.2003.1199609
– ident: e_1_2_9_11_1
  doi: 10.1137/1.9781611973068.112
– ident: e_1_2_9_34_1
  doi: 10.1111/cgf.12435
– volume-title: Numerical Geometry of Non‐Rigid Shapes
  year: 2008
  ident: e_1_2_9_6_1
– ident: e_1_2_9_31_1
  doi: 10.1111/cgf.12167
– ident: e_1_2_9_20_1
  doi: 10.1111/cgf.12701
– volume: 19
  start-page: 1199
  issue: 7
  year: 2013
  ident: e_1_2_9_43_1
  article-title: Registration of 3d point clouds and meshes: A survey from rigid to nonrigid
  publication-title: TVCG
– start-page: 26
  year: 2005
  ident: e_1_2_9_7_1
  article-title: Shape matching and object recognition using low distortion correspondences
  publication-title: Proceedings of IEEE Conference on CVPR
– volume-title: Eurographics 2011 ‐ Tutorials
  year: 2011
  ident: e_1_2_9_13_1
– ident: e_1_2_9_25_1
  doi: 10.1111/j.1467-8659.2012.03166.x
– ident: e_1_2_9_27_1
  doi: 10.1007/s10208-011-9093-5
– volume: 34
  start-page: 235:1
  issue: 6
  year: 2015
  ident: e_1_2_9_22_1
  article-title: SHED: Shape edit distance for fine‐grained shape similarity
  publication-title: ACM Transactions on Graphics (SIGGRAPH Asia)
– ident: e_1_2_9_41_1
  doi: 10.1145/2070781.2024160
– ident: e_1_2_9_9_1
  doi: 10.1145/1276377.1276404
– ident: e_1_2_9_23_1
  doi: 10.1145/1531326.1531378
– ident: e_1_2_9_3_1
  doi: 10.1145/1073204.1073207
– ident: e_1_2_9_45_1
  doi: 10.1111/j.1467-8659.2011.01884.x
– ident: e_1_2_9_4_1
  doi: 10.1016/j.patcog.2013.03.019
– year: 2011
  ident: e_1_2_9_2_1
  article-title: The wave kernel signature: A quantum mechanical approach to shape analysis
  publication-title: Proceedings of ICCV
– ident: e_1_2_9_12_1
  doi: 10.1145/1531326.1531379
– ident: e_1_2_9_37_1
  doi: 10.1111/j.1467-8659.2012.03167.x
– ident: e_1_2_9_18_1
  doi: 10.1111/cgf.12969
– ident: e_1_2_9_26_1
  doi: 10.1111/j.1467-8659.2008.01282.x
SSID ssj0004765
Score 2.3379722
Snippet We present a robust method to find region‐level correspondences between shapes, which are invariant to changes in geometry and applicable across multiple shape...
SourceID proquest
crossref
wiley
SourceType Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 7
SubjectTerms 3D shape matching
Computer graphics
digital geometry processing
Graph matching
Graphical representations
Graphs
I.3.5 [Computer Graphics]: Computational Geometry and Object Modelling Geometric algorithms
modelling
Shape recognition
Title Robust Structure‐Based Shape Correspondence
URI https://onlinelibrary.wiley.com/doi/abs/10.1111%2Fcgf.13389
https://www.proquest.com/docview/2191379604
Volume 38
WOSCitedRecordID wos000462660600002&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVWIB
  databaseName: Wiley Online Library Full Collection 2020
  customDbUrl:
  eissn: 1467-8659
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0004765
  issn: 0167-7055
  databaseCode: DRFUL
  dateStart: 19970101
  isFulltext: true
  titleUrlDefault: https://onlinelibrary.wiley.com
  providerName: Wiley-Blackwell
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV09T8MwED1BywAD34hCQRFiYAlKHSeOxQSFwIAq1FKpW-Q4DiChtGpaZn4Cv5FfwtlJ2iKBhMSW4eJEz3e-d4n9DuAUawpJkajaif7TSknq2bGIE4x4jskMGXssUtNsgnU6wWDAH5bgojoLU-hDzD646cgw67UOcBHnC0Eun9JzXWDxZagT9Ftag_p1N-zfz49FMt-rpL21aEwpLKQ38sxu_p6O5hxzkamaVBNu_OslN2G9ZJjWZeESW7Cksm1YW9Ad3AG7O4yn-cTqGfHY6Vh9vn9cYTpLrN6zGCmrbVp2jIaZaTi6C_3w5rF9Z5d9E2zpcocjYQ6oIAqJYEshIZBY0gSMCCbdGJe2wPckhjEVKuVO4lMnTYhQ1BdMxakruPLdPahlw0ztg6UEo0o4OB5OKUMjztxAeIQFEjMf8RtwVsEXyVJUXPe2eI2q4gIRiAwCDTiZmY4KJY2fjJrVHERlMOURLqotl2kVGXycQfv3AaL2bWguDv5uegirCBUv9mI3oYbYqyNYkW-Tl3x8XHrVF0QYzbw
linkProvider Wiley-Blackwell
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1LS8NAEB5qK6gH32K1ahAPXiJpsslmwYtWY8VapA_wFjabjQrSlj48-xP8jf4SZzdJW0FB8JbDZBPmsfPNPr4BOMGaQhAEqmasdlqJnbhmxKMYI55hMkPEHvFEN5ugzab_-MgeCnCe34VJ-SGmC24qMvR8rQJcLUjPRbl4Ss5UhcUWoETQjdwilK5aQbcxuxdJPTfn9lasMRmzkDrJM335ez6agcx5qKpzTbD2v79ch9UMYxoXqVNsQEH2NmFljnlwC8xWP5qMxkZb08dOhvLz_eMSE1pstJ_5QBo13bRj0O_plqPb0A2uO7W6mXVOMIXDLIaQ2SfclggFqxIhgcCixqc2p8KJcHLzPVdgIBMuE2bFHrGS2OaSeJzKKHE4k56zA8Vevyd3wZCcEsktHA-NSlGIUcfnrk19gbnP9spwmusvFBmtuOpu8Rrm5QVqINQaKMPxVHSQcmn8JFTJjRBm4TQKcVqtOlTxyODntLp_HyCs3QT6Ye_vokewVO_cN8LGbfNuH5ZRbSw9mV2BItpBHsCieBu_jIaHmYt9AaX60aw
linkToPdf http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1LS8NAEB5qK6IH32K1ahAPXiJpXpsFL9oaFUsprYXewmazUUHS0Idnf4K_0V_i7CZpKygI3nKY7IbZ_Xa-ye5-A3CGOQW3kajqkdxptc3Y0UMWRoh4isEMGXvIYlVsgrTb3mBAOyW4LO7CZPoQsx9uEhlqvZYAF2kUL6CcP8UXMsOiS1DB7lyEZaXZ9fut-b1I4jqFtrdUjcmVheRJntnL3-PRnGQuUlUVa_yN_33lJqznHFO7yibFFpREsg1rC8qDO6B3h-F0PNF6Sj52OhKf7x_XGNAirffMUqE1VNGOdJiokqO70PdvHht3el45QecWNShSZs9mpkAqWBdICTgmNR4xGeFWiIub5zocgWwzEVMjcm0jjkwmbJcREcYWo8K19qCcDBOxD5pgxBbMwPZwUAkaUWJ5zDGJxzH2mW4Vzgv_BTyXFZfVLV6DIr1ADwTKA1U4nZmmmZbGT0a1YhCCHE7jAJfVukWkjgx2p9z9ewNB49ZXDwd_Nz2BlU7TD1r37YdDWEWv0exgdg3KOAziCJb52-RlPDrOZ9gXdD_RJw
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Robust+Structure%E2%80%90Based+Shape+Correspondence&rft.jtitle=Computer+graphics+forum&rft.au=Kleiman%2C+Yanir&rft.au=Ovsjanikov%2C+Maks&rft.date=2019-02-01&rft.issn=0167-7055&rft.eissn=1467-8659&rft.volume=38&rft.issue=1&rft.spage=7&rft.epage=20&rft_id=info:doi/10.1111%2Fcgf.13389&rft.externalDBID=n%2Fa&rft.externalDocID=10_1111_cgf_13389
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0167-7055&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0167-7055&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0167-7055&client=summon