{"doi":"10.1111/cgf.13123","extern":"1","date_created":"2024-10-15T11:20:55Z","type":"journal_article","scopus_import":"1","month":"05","date_updated":"2024-12-19T14:38:05Z","publication_identifier":{"eissn":["1467-8659"],"issn":["0167-7055"]},"year":"2017","page":"247-258","author":[{"last_name":"Litany","full_name":"Litany, O.","first_name":"O."},{"last_name":"Rodolà","first_name":"E.","full_name":"Rodolà, E."},{"full_name":"Bronstein, Alexander","orcid":"0000-0001-9699-8730","first_name":"Alexander","id":"58f3726e-7cba-11ef-ad8b-e6e8cb3904e6","last_name":"Bronstein"},{"first_name":"M. M.","full_name":"Bronstein, M. M.","last_name":"Bronstein"}],"volume":36,"title":"Fully spectral partial shape matching","oa_version":"None","date_published":"2017-05-01T00:00:00Z","publisher":"Wiley","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","publication":"Computer Graphics Forum","publication_status":"published","language":[{"iso":"eng"}],"status":"public","day":"01","_id":"18427","citation":{"short":"O. Litany, E. Rodolà, A.M. Bronstein, M.M. Bronstein, Computer Graphics Forum 36 (2017) 247–258.","ista":"Litany O, Rodolà E, Bronstein AM, Bronstein MM. 2017. Fully spectral partial shape matching. Computer Graphics Forum. 36(2), 247–258.","ieee":"O. Litany, E. Rodolà, A. M. Bronstein, and M. M. Bronstein, “Fully spectral partial shape matching,” Computer Graphics Forum, vol. 36, no. 2. Wiley, pp. 247–258, 2017.","ama":"Litany O, Rodolà E, Bronstein AM, Bronstein MM. Fully spectral partial shape matching. Computer Graphics Forum. 2017;36(2):247-258. doi:10.1111/cgf.13123","mla":"Litany, O., et al. “Fully Spectral Partial Shape Matching.” Computer Graphics Forum, vol. 36, no. 2, Wiley, 2017, pp. 247–58, doi:10.1111/cgf.13123.","apa":"Litany, O., Rodolà, E., Bronstein, A. M., & Bronstein, M. M. (2017). Fully spectral partial shape matching. Computer Graphics Forum. Wiley. https://doi.org/10.1111/cgf.13123","chicago":"Litany, O., E. Rodolà, Alex M. Bronstein, and M. M. Bronstein. “Fully Spectral Partial Shape Matching.” Computer Graphics Forum. Wiley, 2017. https://doi.org/10.1111/cgf.13123."},"issue":"2","abstract":[{"text":"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.","lang":"eng"}],"intvolume":" 36","article_processing_charge":"No","quality_controlled":"1"}