Fully Spectral Partial Shape Matching
We propose an efficient procedure for calculating partial dense intrinsic correspondence between deformable shapes performed entirely in the spectral domain. Our technique relies on the recently introduced partial functional maps formalism and on the joint approximate diagonalization (JAD) of the La...
Saved in:
Published in | Computer graphics forum Vol. 36; no. 2; pp. 247 - 258 |
---|---|
Main Authors | , , , |
Format | Journal Article |
Language | English |
Published |
Oxford
Blackwell Publishing Ltd
01.05.2017
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Abstract | We propose an efficient procedure for calculating partial dense intrinsic correspondence between deformable shapes performed entirely in the spectral domain. Our technique relies on the recently introduced partial functional maps formalism and on the joint approximate diagonalization (JAD) of the Laplace‐Beltrami operators previously introduced for matching non‐isometric shapes. We show that a variant of the JAD problem with an appropriately modified coupling term (surprisingly) allows to construct quasi‐harmonic bases localized on the latent corresponding parts. This circumvents the need to explicitly compute the unknown parts by means of the cumbersome alternating minimization used in the previous approaches, and allows performing all the calculations in the spectral domain with constant complexity independent of the number of shape vertices. We provide an extensive evaluation of the proposed technique on standard non‐rigid correspondence benchmarks and show state‐of‐the‐art performance in various settings, including partiality and the presence of topological noise. |
---|---|
AbstractList | We propose an efficient procedure for calculating partial dense intrinsic correspondence between deformable shapes performed entirely in the spectral domain. Our technique relies on the recently introduced partial functional maps formalism and on the joint approximate diagonalization (JAD) of the Laplace-Beltrami operators previously introduced for matching non-isometric shapes. We show that a variant of the JAD problem with an appropriately modified coupling term (surprisingly) allows to construct quasi-harmonic bases localized on the latent corresponding parts. This circumvents the need to explicitly compute the unknown parts by means of the cumbersome alternating minimization used in the previous approaches, and allows performing all the calculations in the spectral domain with constant complexity independent of the number of shape vertices. We provide an extensive evaluation of the proposed technique on standard non-rigid correspondence benchmarks and show state-of-the-art performance in various settings, including partiality and the presence of topological noise. |
Author | Bronstein, M. M. Rodolà, E. Litany, O. Bronstein, A. M. |
Author_xml | – sequence: 1 givenname: O. surname: Litany fullname: Litany, O. organization: Tel Aviv Univeristy – sequence: 2 givenname: E. surname: Rodolà fullname: Rodolà, E. organization: University of Lugano – sequence: 3 givenname: A. M. surname: Bronstein fullname: Bronstein, A. M. organization: Tel Aviv Univeristy – sequence: 4 givenname: M. M. surname: Bronstein fullname: Bronstein, M. M. organization: University of Lugano |
BookMark | eNp1kDFPwzAQhS1UJNLCwD-IhBgY0vrsxHFHVJGCVARSYbYc22ldhSQ4iar8ewzphOCWd8P33uneFE2qujIIXQOeg5-F2hVzoEDoGQogZmnEWbKcoACD31OcJBdo2rYHjHGcsiRAt1lflkO4bYzqnCzDV-k663W7l40Jn2Wn9rbaXaLzQpatuTrpDL1nD2-rx2jzsn5a3W8iRVlKI8AcNKMqlaASzbTJDVbEUA68IBpk7jddEEaJ5kBlwWOdSs5wThNGtMrpDN2MuY2rP3vTduJQ967yJwUsMcSYEaCeWoyUcnXbOlMIZTvZ2bryL9hSABbfXQjfhfjpwjvufjkaZz-kG_5kT-lHW5rhf1Cs1tno-AIzVm2U |
CitedBy_id | crossref_primary_10_1109_TVCG_2024_3368083 crossref_primary_10_1145_3495208 crossref_primary_10_1145_3243593 crossref_primary_10_1145_3292480 crossref_primary_10_1109_TPAMI_2022_3164653 crossref_primary_10_1111_cgf_13487 crossref_primary_10_1111_cgf_13785 crossref_primary_10_1111_cgf_14359 crossref_primary_10_1111_cgf_13788 crossref_primary_10_1016_j_displa_2022_102336 crossref_primary_10_1109_TVCG_2019_2915567 crossref_primary_10_1111_cgf_14913 crossref_primary_10_1111_cgf_13309 crossref_primary_10_1111_cgf_142645 crossref_primary_10_1145_3561058 crossref_primary_10_1016_j_cag_2020_02_002 crossref_primary_10_1109_TMI_2022_3158065 crossref_primary_10_1145_3355089_3356524 crossref_primary_10_1016_j_cag_2019_05_011 crossref_primary_10_1016_j_cag_2020_09_004 crossref_primary_10_1111_cgf_14084 crossref_primary_10_1111_cgf_14360 crossref_primary_10_1111_cgf_14483 crossref_primary_10_1007_s11390_018_1880_x crossref_primary_10_1111_cgf_13253 crossref_primary_10_1111_cgf_13352 crossref_primary_10_1016_j_cad_2018_04_005 crossref_primary_10_1111_cgf_13254 crossref_primary_10_1111_cgf_13496 crossref_primary_10_1111_cgf_13751 crossref_primary_10_1016_j_cagd_2019_04_014 crossref_primary_10_1016_j_heliyon_2021_e08214 crossref_primary_10_1111_cgf_14502 crossref_primary_10_1111_cgf_14746 crossref_primary_10_1145_3267347 crossref_primary_10_1007_s00371_021_02337_6 crossref_primary_10_1007_s00371_019_01760_0 crossref_primary_10_1016_j_disc_2022_113246 crossref_primary_10_1145_3414685_3417800 crossref_primary_10_1016_j_jas_2022_105598 |
Cites_doi | 10.1016/j.jorganchem.2013.11.031 10.1145/1531326.1531378 10.1142/S0218654307000968 10.1111/j.1467-8659.2008.01282.x 10.1109/CVPR.2014.532 10.1145/2897824.2925913 10.1145/2601097.2601111 10.1137/S0895479893259546 10.1016/j.patcog.2015.01.020 10.1111/j.1467-8659.2011.01884.x 10.1016/j.gmod.2013.11.003 10.1109/CVPR.2012.6247674 10.1007/978-3-662-05105-4_2 10.1111/j.1467-8659.2011.01893.x 10.1145/2766921 10.1111/cgf.12064 10.1080/10586458.1993.10504266 10.1007/978-3-642-15558-1_26 10.1111/cgf.12970 10.1111/cgf.12480 10.1145/2010324.1964974 10.1109/ICCV.2013.149 10.1007/s11263-008-0147-3 10.1109/TPAMI.2012.26 10.4208/nmtma.2013.mssvm12 10.1145/2185520.2185526 10.1145/2897824.2925903 10.1073/pnas.0508601103 10.1145/1360612.1360684 10.1111/j.1467-8659.2011.02021.x 10.1111/cgf.12066 |
ContentType | Journal Article |
Copyright | 2017 The Author(s) Computer Graphics Forum © 2017 The Eurographics Association and John Wiley & Sons Ltd. Published by John Wiley & Sons Ltd. 2017 The Eurographics Association and John Wiley & Sons Ltd. |
Copyright_xml | – notice: 2017 The Author(s) Computer Graphics Forum © 2017 The Eurographics Association and John Wiley & Sons Ltd. Published by John Wiley & Sons Ltd. – notice: 2017 The Eurographics Association and John Wiley & Sons Ltd. |
DBID | AAYXX CITATION 7SC 8FD JQ2 L7M L~C L~D |
DOI | 10.1111/cgf.13123 |
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 | Computer and Information Systems Abstracts |
DeliveryMethod | fulltext_linktorsrc |
Discipline | Engineering |
EISSN | 1467-8659 |
EndPage | 258 |
ExternalDocumentID | 10_1111_cgf_13123 CGF13123 |
Genre | article |
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 AAHHS AAHQN AAMNL AANHP AANLZ AAONW AASGY AAXRX AAYCA AAZKR ABCQN ABCUV ABDBF ABDPE ABEML ABPVW ACAHQ ACBWZ ACCFJ ACCZN ACFBH ACGFS ACPOU ACRPL ACSCC ACUHS ACXBN ACXQS ACYXJ ADBBV ADEOM ADIZJ ADKYN ADMGS ADNMO ADOZA ADXAS ADZMN ADZOD AEEZP AEGXH AEIGN AEIMD AEMOZ AENEX AEQDE AEUQT AEUYR AFBPY AFEBI AFFNX AFFPM AFGKR AFPWT AFWVQ AFZJQ AHBTC AHEFC AHQJS AITYG AIURR AIWBW AJBDE 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 WRC WXSBR WYISQ WZISG XG1 ZL0 ZZTAW ~IA ~IF ~WT AAMMB AAYXX ADMLS AEFGJ AEYWJ AGHNM AGQPQ AGXDD AGYGG AIDQK AIDYY CITATION 7SC 8FD JQ2 L7M L~C L~D |
ID | FETCH-LOGICAL-c3673-1081d63c7a1c5d6debe0c2e3818f2d1ab381df2632d813af84d7a860b3562dcb3 |
IEDL.DBID | DR2 |
ISSN | 0167-7055 |
IngestDate | Fri Jul 25 02:49:40 EDT 2025 Thu Jul 03 08:28:03 EDT 2025 Thu Apr 24 22:53:47 EDT 2025 Wed Jan 22 16:30:01 EST 2025 |
IsPeerReviewed | true |
IsScholarly | true |
Issue | 2 |
Language | English |
License | http://onlinelibrary.wiley.com/termsAndConditions http://doi.wiley.com/10.1002/tdm_license_1 |
LinkModel | DirectLink |
MergedId | FETCHMERGED-LOGICAL-c3673-1081d63c7a1c5d6debe0c2e3818f2d1ab381df2632d813af84d7a860b3562dcb3 |
Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
PQID | 1901406213 |
PQPubID | 30877 |
PageCount | 12 |
ParticipantIDs | proquest_journals_1901406213 crossref_citationtrail_10_1111_cgf_13123 crossref_primary_10_1111_cgf_13123 wiley_primary_10_1111_cgf_13123_CGF13123 |
PublicationCentury | 2000 |
PublicationDate | May 2017 |
PublicationDateYYYYMMDD | 2017-05-01 |
PublicationDate_xml | – month: 05 year: 2017 text: May 2017 |
PublicationDecade | 2010 |
PublicationPlace | Oxford |
PublicationPlace_xml | – name: Oxford |
PublicationTitle | Computer graphics forum |
PublicationYear | 2017 |
Publisher | Blackwell Publishing Ltd |
Publisher_xml | – name: Blackwell Publishing Ltd |
References | 2015; 34 2009; 84 1996; 17 2012 2010 2008 2011; 30 2003 2012; 34 2013; 6 1993; 2 2007; 13 2016; 35 2012; 31 2009; 28 2015; 48 2013; 32 2008; 27 2014; 15 2017 2016 2015 2014 2013 2014; 33 2006; 103 2014; 76 Sahillioğlu (10.1111/cgf.13123-BIB0040|cgf13123-cit-0040) 2012; 31 Van Kaick (10.1111/cgf.13123-BIB0043|cgf13123-cit-0043) 2011; 30 Maron (10.1111/cgf.13123-BIB0026|cgf13123-cit-0026) 2016; 35 10.1111/cgf.13123-BIB0013|cgf13123-cit-0013 Bronstein (10.1111/cgf.13123-BIB0005|cgf13123-cit-0005) 2009; 84 Albarelli (10.1111/cgf.13123-BIB0003|cgf13123-cit-0003) 2015; 48 10.1111/cgf.13123-BIB0042|cgf13123-cit-0042 Kim (10.1111/cgf.13123-BIB0021|cgf13123-cit-0021) 2011; 30 Sahillioğlu (10.1111/cgf.13123-BIB0041|cgf13123-cit-0041) 2014; 33 10.1111/cgf.13123-BIB0010|cgf13123-cit-0010 10.1111/cgf.13123-BIB0025|cgf13123-cit-0025 10.1111/cgf.13123-BIB0045|cgf13123-cit-0045 10.1111/cgf.13123-BIB0037|cgf13123-cit-0037 Aigerman (10.1111/cgf.13123-BIB0002|cgf13123-cit-0002) 2015; 34 10.1111/cgf.13123-BIB0020|cgf13123-cit-0020 10.1111/cgf.13123-BIB0014|cgf13123-cit-0014 Huang (10.1111/cgf.13123-BIB0016|cgf13123-cit-0016) 2014; 33 Litany (10.1111/cgf.13123-BIB0024|cgf13123-cit-0024) 2016; 35 Aiger (10.1111/cgf.13123-BIB0001|cgf13123-cit-0001) 2008; 27 10.1111/cgf.13123-BIB0023|cgf13123-cit-0023 Pokrass (10.1111/cgf.13123-BIB0031|cgf13123-cit-0031) 2013; 32 10.1111/cgf.13123-BIB0034|cgf13123-cit-0034 10.1111/cgf.13123-BIB0046|cgf13123-cit-0046 10.1111/cgf.13123-BIB0011|cgf13123-cit-0011 Windheuser (10.1111/cgf.13123-BIB0047|cgf13123-cit-0047) 2011; 30 10.1111/cgf.13123-BIB0012|cgf13123-cit-0012 Sahillioğlu (10.1111/cgf.13123-BIB0039|cgf13123-cit-0039) 2012; 34 Jain (10.1111/cgf.13123-BIB0017|cgf13123-cit-0017) 2007; 13 Ovsjanikov (10.1111/cgf.13123-BIB0029|cgf13123-cit-0029) 2012; 31 Lipman (10.1111/cgf.13123-BIB0022|cgf13123-cit-0022) 2009; 28 Pinkall (10.1111/cgf.13123-BIB0032|cgf13123-cit-0032) 1993; 2 10.1111/cgf.13123-BIB0035|cgf13123-cit-0035 Solomon (10.1111/cgf.13123-BIB0038|cgf13123-cit-0038) 2016; 35 van Kaick (10.1111/cgf.13123-BIB0044|cgf13123-cit-0044) 2011; 30 Bronstein (10.1111/cgf.13123-BIB0006|cgf13123-cit-0006) 2006; 103 Kovnatsky (10.1111/cgf.13123-BIB0018|cgf13123-cit-0018) 2013; 32 10.1111/cgf.13123-BIB0008|cgf13123-cit-0008 10.1111/cgf.13123-BIB0027|cgf13123-cit-0027 10.1111/cgf.13123-BIB0028|cgf13123-cit-0028 Pokrass (10.1111/cgf.13123-BIB0030|cgf13123-cit-0030) 2013; 6 Brunton (10.1111/cgf.13123-BIB0009|cgf13123-cit-0009) 2014; 76 10.1111/cgf.13123-BIB0033|cgf13123-cit-0033 10.1111/cgf.13123-BIB0019|cgf13123-cit-0019 10.1111/cgf.13123-BIB0004|cgf13123-cit-0004 Cardoso (10.1111/cgf.13123-BIB0015|cgf13123-cit-0015) 1996; 17 10.1111/cgf.13123-BIB0036|cgf13123-cit-0036 Boumal (10.1111/cgf.13123-BIB0007|cgf13123-cit-0007) 2014; 15 |
References_xml | – start-page: 4177 year: 2014 end-page: 4184 – volume: 34 start-page: 2203 issue: 11 year: 2012 end-page: 2215 article-title: Minimum‐distortion isometric shape correspondence using EM algorithm publication-title: IEEE Trans. Pattern Anal. Mach. Intell. – volume: 13 start-page: 101 issue: 01 year: 2007 end-page: 124 article-title: Non‐rigid spectral correspondence of triangle meshes publication-title: International Journal of Shape Modeling – start-page: 100 year: 2014 end-page: 108 – volume: 35 start-page: 72:1 issue: 4 year: 2016 end-page: 72:13 article-title: Entropic metric alignment for correspondence problems publication-title: ACM Trans. Graph. – 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: PNAS – volume: 2 start-page: 15 issue: 1 year: 1993 end-page: 36 article-title: Computing discrete minimal surfaces and their conjugates publication-title: Experimental math. – volume: 30 start-page: 1681 issue: 6 year: 2011 end-page: 1707 article-title: A survey on shape correspondence publication-title: Computer Graphics Forum – start-page: 1421 year: 2008 end-page: 1430 – start-page: 1169 year: 2013 end-page: 1176 – start-page: 182 year: 2012 end-page: 189 – volume: 34 start-page: 72:1 issue: 4 year: 2015 end-page: 72:13 article-title: Seamless surface mappings publication-title: ACM Trans. Graph. – start-page: 356 year: 2010 end-page: 369 – volume: 48 start-page: 2209 year: 2015 end-page: 2226 article-title: Fast and accurate surface alignment through an isometry‐enforcing game publication-title: Pattern Recognition – year: 2016 – volume: 15 start-page: 1455 year: 2014 end-page: 1459 article-title: Manopt, a Matlab toolbox for optimization on manifolds publication-title: Journal of Machine Learning Research – volume: 35 start-page: 135 issue: 5 year: 2016 end-page: 143 article-title: Non‐rigid puzzles publication-title: Computer Graphics Forum – year: 2014 – volume: 35 start-page: 73:1 issue: 4 year: 2016 end-page: 73:12 article-title: Point registration via efficient convex relaxation publication-title: ACM Trans. Graph. – volume: 32 start-page: 439 year: 2013 end-page: 448 article-title: Coupled quasi‐harmonic bases publication-title: Computer Graphics Forum – start-page: 35 year: 2003 end-page: 57 – volume: 33 start-page: 36 issue: 4 year: 2014 article-title: Functional map networks for analyzing and exploring large shape collections publication-title: TOG – volume: 31 start-page: 30:1 issue: 4 year: 2012 end-page: 30:11 article-title: Functional maps: a flexible representation of maps between shapes publication-title: ACM Trans. Graph. – volume: 76 start-page: 70 issue: 2 year: 2014 end-page: 85 article-title: A low‐dimensional representation for robust partial isometric correspondences computation publication-title: Graphical Models – volume: 84 start-page: 163 issue: 2 year: 2009 end-page: 183 article-title: Partial similarity of objects, or how to compare a centaur to a horse publication-title: IJCV – volume: 17 start-page: 161 issue: 1 year: 1996 end-page: 164 article-title: Jacobi angles for simultaneous diagonalization publication-title: SIAM J. Matrix Anal. Appl. – volume: 6 start-page: 223 year: 2013 end-page: 244 article-title: Partial shape matching without point‐wise correspondence publication-title: Numer. Math. Theor. Meth. Appl. – volume: 31 issue: 7 year: 2012 article-title: Scale normalization for isometric shape matching publication-title: Computer Graphics Forum (Proc. Pacific Graphics) – year: 2008 – volume: 28 issue: 3 year: 2009 article-title: Möbius voting for surface correspondence publication-title: Trans. Graphics – volume: 33 start-page: 121 year: 2014 end-page: 130 article-title: Multiple shape correspondence by dynamic programming publication-title: Computer Graphics Forum – volume: 27 start-page: 85 issue: 3 year: 2008 article-title: 4‐points congruent sets for robust pairwise surface registration publication-title: Trans. Graphics – volume: 30 start-page: 553 issue: 2 year: 2011 end-page: 562 article-title: Prior knowledge for part correspondence publication-title: Computer Graphics Forum – volume: 30 start-page: 1471 issue: 5 year: 2011 end-page: 1480 article-title: Large‐scale integer linear programming for orientation preserving 3d shape matching publication-title: Computer Graphics Forum – volume: 32 start-page: 459 issue: 2 year: 2013 end-page: 468 article-title: Sparse modeling of intrinsic correspondences publication-title: Computer Graphics Forum – year: 2017 – volume: 30 start-page: 79 issue: 4 year: 2011 article-title: Blended intrinsic maps publication-title: TOG – year: 2015 – volume: 15 start-page: 1455 year: 2014 ident: 10.1111/cgf.13123-BIB0007|cgf13123-cit-0007 article-title: Manopt, a Matlab toolbox for optimization on manifolds publication-title: Journal of Machine Learning Research – ident: 10.1111/cgf.13123-BIB0010|cgf13123-cit-0010 doi: 10.1016/j.jorganchem.2013.11.031 – ident: 10.1111/cgf.13123-BIB0011|cgf13123-cit-0011 – volume: 28 issue: 3 year: 2009 ident: 10.1111/cgf.13123-BIB0022|cgf13123-cit-0022 article-title: Möbius voting for surface correspondence publication-title: Trans. Graphics doi: 10.1145/1531326.1531378 – ident: 10.1111/cgf.13123-BIB0019|cgf13123-cit-0019 – volume: 13 start-page: 101 issue: 01 year: 2007 ident: 10.1111/cgf.13123-BIB0017|cgf13123-cit-0017 article-title: Non-rigid spectral correspondence of triangle meshes publication-title: International Journal of Shape Modeling doi: 10.1142/S0218654307000968 – ident: 10.1111/cgf.13123-BIB0025|cgf13123-cit-0025 doi: 10.1111/j.1467-8659.2008.01282.x – ident: 10.1111/cgf.13123-BIB0036|cgf13123-cit-0036 doi: 10.1109/CVPR.2014.532 – volume: 35 start-page: 73:1 issue: 4 year: 2016 ident: 10.1111/cgf.13123-BIB0026|cgf13123-cit-0026 article-title: Point registration via efficient convex relaxation publication-title: ACM Trans. Graph. doi: 10.1145/2897824.2925913 – volume: 33 start-page: 36 issue: 4 year: 2014 ident: 10.1111/cgf.13123-BIB0016|cgf13123-cit-0016 article-title: Functional map networks for analyzing and exploring large shape collections publication-title: TOG doi: 10.1145/2601097.2601111 – volume: 17 start-page: 161 issue: 1 year: 1996 ident: 10.1111/cgf.13123-BIB0015|cgf13123-cit-0015 article-title: Jacobi angles for simultaneous diagonalization publication-title: SIAM J. Matrix Anal. Appl. doi: 10.1137/S0895479893259546 – volume: 48 start-page: 2209 year: 2015 ident: 10.1111/cgf.13123-BIB0003|cgf13123-cit-0003 article-title: Fast and accurate surface alignment through an isometry-enforcing game publication-title: Pattern Recognition doi: 10.1016/j.patcog.2015.01.020 – volume: 30 start-page: 1681 issue: 6 year: 2011 ident: 10.1111/cgf.13123-BIB0044|cgf13123-cit-0044 article-title: A survey on shape correspondence publication-title: Computer Graphics Forum doi: 10.1111/j.1467-8659.2011.01884.x – volume: 76 start-page: 70 issue: 2 year: 2014 ident: 10.1111/cgf.13123-BIB0009|cgf13123-cit-0009 article-title: A low-dimensional representation for robust partial isometric correspondences computation publication-title: Graphical Models doi: 10.1016/j.gmod.2013.11.003 – ident: 10.1111/cgf.13123-BIB0033|cgf13123-cit-0033 doi: 10.1109/CVPR.2012.6247674 – ident: 10.1111/cgf.13123-BIB0027|cgf13123-cit-0027 doi: 10.1007/978-3-662-05105-4_2 – ident: 10.1111/cgf.13123-BIB0028|cgf13123-cit-0028 – volume: 30 start-page: 553 issue: 2 year: 2011 ident: 10.1111/cgf.13123-BIB0043|cgf13123-cit-0043 article-title: Prior knowledge for part correspondence publication-title: Computer Graphics Forum doi: 10.1111/j.1467-8659.2011.01893.x – ident: 10.1111/cgf.13123-BIB0008|cgf13123-cit-0008 – volume: 34 start-page: 72:1 issue: 4 year: 2015 ident: 10.1111/cgf.13123-BIB0002|cgf13123-cit-0002 article-title: Seamless surface mappings publication-title: ACM Trans. Graph. doi: 10.1145/2766921 – ident: 10.1111/cgf.13123-BIB0046|cgf13123-cit-0046 – ident: 10.1111/cgf.13123-BIB0035|cgf13123-cit-0035 – volume: 32 start-page: 439 year: 2013 ident: 10.1111/cgf.13123-BIB0018|cgf13123-cit-0018 article-title: Coupled quasi-harmonic bases publication-title: Computer Graphics Forum doi: 10.1111/cgf.12064 – volume: 2 start-page: 15 issue: 1 year: 1993 ident: 10.1111/cgf.13123-BIB0032|cgf13123-cit-0032 article-title: Computing discrete minimal surfaces and their conjugates publication-title: Experimental math. doi: 10.1080/10586458.1993.10504266 – ident: 10.1111/cgf.13123-BIB0042|cgf13123-cit-0042 doi: 10.1007/978-3-642-15558-1_26 – ident: 10.1111/cgf.13123-BIB0045|cgf13123-cit-0045 – ident: 10.1111/cgf.13123-BIB0014|cgf13123-cit-0014 – volume: 35 start-page: 135 issue: 5 year: 2016 ident: 10.1111/cgf.13123-BIB0024|cgf13123-cit-0024 article-title: Non-rigid puzzles publication-title: Computer Graphics Forum doi: 10.1111/cgf.12970 – ident: 10.1111/cgf.13123-BIB0034|cgf13123-cit-0034 – volume: 33 start-page: 121 year: 2014 ident: 10.1111/cgf.13123-BIB0041|cgf13123-cit-0041 article-title: Multiple shape correspondence by dynamic programming publication-title: Computer Graphics Forum doi: 10.1111/cgf.12480 – ident: 10.1111/cgf.13123-BIB0004|cgf13123-cit-0004 – volume: 30 start-page: 79 issue: 4 year: 2011 ident: 10.1111/cgf.13123-BIB0021|cgf13123-cit-0021 article-title: Blended intrinsic maps publication-title: TOG doi: 10.1145/2010324.1964974 – ident: 10.1111/cgf.13123-BIB0037|cgf13123-cit-0037 doi: 10.1109/ICCV.2013.149 – ident: 10.1111/cgf.13123-BIB0013|cgf13123-cit-0013 – volume: 31 issue: 7 year: 2012 ident: 10.1111/cgf.13123-BIB0040|cgf13123-cit-0040 article-title: Scale normalization for isometric shape matching publication-title: Computer Graphics Forum (Proc. Pacific Graphics) – volume: 84 start-page: 163 issue: 2 year: 2009 ident: 10.1111/cgf.13123-BIB0005|cgf13123-cit-0005 article-title: Partial similarity of objects, or how to compare a centaur to a horse publication-title: IJCV doi: 10.1007/s11263-008-0147-3 – volume: 34 start-page: 2203 issue: 11 year: 2012 ident: 10.1111/cgf.13123-BIB0039|cgf13123-cit-0039 article-title: Minimum-distortion isometric shape correspondence using EM algorithm publication-title: IEEE Trans. Pattern Anal. Mach. Intell. doi: 10.1109/TPAMI.2012.26 – ident: 10.1111/cgf.13123-BIB0023|cgf13123-cit-0023 – volume: 6 start-page: 223 year: 2013 ident: 10.1111/cgf.13123-BIB0030|cgf13123-cit-0030 article-title: Partial shape matching without point-wise correspondence publication-title: Numer. Math. Theor. Meth. Appl. doi: 10.4208/nmtma.2013.mssvm12 – ident: 10.1111/cgf.13123-BIB0012|cgf13123-cit-0012 – volume: 31 start-page: 30:1 issue: 4 year: 2012 ident: 10.1111/cgf.13123-BIB0029|cgf13123-cit-0029 article-title: Functional maps: a flexible representation of maps between shapes publication-title: ACM Trans. Graph. doi: 10.1145/2185520.2185526 – volume: 35 start-page: 72:1 issue: 4 year: 2016 ident: 10.1111/cgf.13123-BIB0038|cgf13123-cit-0038 article-title: Entropic metric alignment for correspondence problems publication-title: ACM Trans. Graph. doi: 10.1145/2897824.2925903 – volume: 103 start-page: 1168 issue: 5 year: 2006 ident: 10.1111/cgf.13123-BIB0006|cgf13123-cit-0006 article-title: Generalized multidimensional scaling: a framework for isometry-invariant partial surface matching publication-title: PNAS doi: 10.1073/pnas.0508601103 – volume: 27 start-page: 85 issue: 3 year: 2008 ident: 10.1111/cgf.13123-BIB0001|cgf13123-cit-0001 article-title: 4-points congruent sets for robust pairwise surface registration publication-title: Trans. Graphics doi: 10.1145/1360612.1360684 – volume: 30 start-page: 1471 issue: 5 year: 2011 ident: 10.1111/cgf.13123-BIB0047|cgf13123-cit-0047 article-title: Large-scale integer linear programming for orientation preserving 3d shape matching publication-title: Computer Graphics Forum doi: 10.1111/j.1467-8659.2011.02021.x – volume: 32 start-page: 459 issue: 2 year: 2013 ident: 10.1111/cgf.13123-BIB0031|cgf13123-cit-0031 article-title: Sparse modeling of intrinsic correspondences publication-title: Computer Graphics Forum doi: 10.1111/cgf.12066 – ident: 10.1111/cgf.13123-BIB0020|cgf13123-cit-0020 |
SSID | ssj0004765 |
Score | 2.4378576 |
Snippet | We propose an efficient procedure for calculating partial dense intrinsic correspondence between deformable shapes performed entirely in the spectral domain.... |
SourceID | proquest crossref wiley |
SourceType | Aggregation Database Enrichment Source Index Database Publisher |
StartPage | 247 |
SubjectTerms | Categories and Subject Descriptors (according to ACM CCS) Computer graphics Deformation Formability I.3.5 [Computer Graphics]: Computational Geometry and Object Modeling—Shape Analysis Image processing systems Matching Mathematical analysis Shape recognition Spectra Topological manifolds |
Title | Fully Spectral Partial Shape Matching |
URI | https://onlinelibrary.wiley.com/doi/abs/10.1111%2Fcgf.13123 https://www.proquest.com/docview/1901406213 |
Volume | 36 |
hasFullText | 1 |
inHoldings | 1 |
isFullTextHit | |
isPrint | |
link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1bS8MwFA5jT_rgXZxOKaKwl46mza34JMM5hImogz0IpUkaBWUOtz3or_ecXrYpCuJTA01Kk5zLd8LJdwg5iZ3VQjPqG7yDxpiNfaUy51OnOAYkWjq879y_Fr0BuxryYY2cVXdhCn6I-YEbakZur1HBUz1ZUnLz6No0AsML9hdztRAQ3S6oo5gUvOL1RsaYklUIs3jmI7_6ogXAXIapuZ_prpOH6g-L9JLn9myq2-bjG3njP6ewQdZK_OmdFwKzSWrZaIusLrESbpNTDEvfPaxMj8cg3g1KFzzvntJx5vXBduOp1Q4ZdC_uOz2_rKbgm0hITEADaCoiI1NquBUWdi8wYYYe24WWphpa1iF9u1U0Sp1iVqZKBDoCiGSNjnZJffQ6yvaIJyGqjXnguIwps1Qq5ngQGQBvsLUi5Q3SqtY1MSXVOFa8eEmqkANmnuQzb5Djeddxwa_xU6dmtTlJqWKTBJEMoJGQwutWvsq_fyDpXHbzxv7fux6QlRBdeJ7c2CT16dssOwQAMtVHuaR9Agbq0uI |
linkProvider | Wiley-Blackwell |
linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3dS8MwED_mfFAf_BanU4so7KWjaZukBV9kOKduQ3QDX6Q0SaOgzKHbg_715vqxTVEQnxpoUnpJLve74_I7gKNQK8GET2yJd9B8X4V2ECTaJjqg6JAIrvG-c6fLWn3_8o7eleCkuAuT8UNMAm6oGel5jQqOAekZLZcPuk48c_LOwTxW9E4dqpspeZTPGS2YvZEzJucVwjyeydCv1mgKMWeBamppmitwX_xjlmDyVB-PRF1-fKNv_K8Qq7CcQ1DrNNsza1BKBuuwNENMuAHH6Jm-W1icHiMh1jVuMPO8fYyHidUxxzcGrjah3zzrNVp2XlDBlh7jmINm0CnzJI-JpIops4COdBM02tpVJBampTQyuKuAeLEOfMXjgDnCMyhJSeFtQXnwMki2weLGsQ2poykPia8ID3xNHU8a_GZWl8W0ArViYiOZs41j0YvnqPA6jORRKnkFDiddhxnFxk-dqsXqRLmWvUUIZgwgcYl5XUun-fcPRI3zZtrY-XvXA1ho9TrtqH3RvdqFRRcteprrWIXy6HWc7Bk8MhL76bb7BEwv1v0 |
linkToPdf | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1bS8MwFD7MCaIP3sXp1CIKe-lo2iRt8Uk267xsDHWwB6G0SaOgzKHbg_56c3rZpiiITw00KU1yLt8JJ98BOPKVjHlMiSnwDhql0jc9L1EmUR7DgCR2Fd53bnd4q0cv-6xfgpPiLkzGDzE5cEPNSO01KvhQqhklFw-qThxteOdgnnLLQ5Fu3ky5o6jLWUHsjZQxOa0QpvFMhn51RlOEOYtTU0cTrMB98YtZfslTfTyK6-LjG3vjP-ewCss5ADVOM4lZg1IyWIelGVrCDTjGuPTdwNL0eA5idFG89PP2MRomRlsbbzy22oRecHbXaJl5OQVTONzFDDSNTbkj3IgIJrnU22cJO0GXrWxJoli3pEL-dukRJ1IelW7kcSt2NEaSIna2oDx4GSTbYLg6rPWZpZjrEyqJ61HFLEdo9Kb3lkesArViXUORc41jyYvnsIg59MzDdOYVOJx0HWYEGz91qhabE-Y69hYilNFwxCb6dS1d5d8_EDbOg7Sx8_euB7DQbQbh9UXnahcWbXTnaaJjFcqj13Gyp8HIKN5Phe4T-u_VtQ |
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=Fully+Spectral+Partial+Shape+Matching&rft.jtitle=Computer+graphics+forum&rft.au=Litany%2C+O&rft.au=Rodola%2C+E&rft.au=Bronstein%2C+A+M&rft.au=Bronstein%2C+M+M&rft.date=2017-05-01&rft.pub=Blackwell+Publishing+Ltd&rft.issn=0167-7055&rft.eissn=1467-8659&rft.volume=36&rft.issue=2&rft.spage=247&rft_id=info:doi/10.1111%2Fcgf.13123&rft.externalDBID=NO_FULL_TEXT |
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 |