Imperial College London


Faculty of EngineeringDepartment of Computing

Chair in Machine Learning and Pattern Recognition



m.bronstein Website




569Huxley BuildingSouth Kensington Campus






BibTex format

author = {Litany, O and RodolĂ , E and Bronstein, AM and Bronstein, MM},
doi = {10.1111/cgf.13123},
journal = {Computer Graphics Forum},
pages = {247--258},
title = {Fully Spectral Partial Shape Matching},
url = {},
volume = {36},
year = {2017}

RIS format (EndNote, RefMan)

AB - © 2017 The Author(s) Computer Graphics Forum © 2017 The Eurographics Association and John Wiley & Sons Ltd. Published by John Wiley & Sons Ltd. 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.
AU - Litany,O
AU - RodolĂ ,E
AU - Bronstein,AM
AU - Bronstein,MM
DO - 10.1111/cgf.13123
EP - 258
PY - 2017///
SN - 0167-7055
SP - 247
TI - Fully Spectral Partial Shape Matching
T2 - Computer Graphics Forum
UR -
VL - 36
ER -