Wang, LarryGehre, AnneBronstein, Michael M.Solomon, JustinJu, Tao and Vaxman, Amir2018-07-272018-07-2720181467-8659https://doi.org/10.1111/cgf.13488https://diglib.eg.org:443/handle/10.1111/cgf13488Functional maps provide a means of extracting correspondences between surfaces using linear-algebraic machinery. While the functional framework suggests efficient algorithms for map computation, the basic technique does not incorporate the intuition that pointwise modifications of a descriptor function (e.g. composition of a descriptor and a nonlinearity) should be preserved under the mapping; the end result is that the basic functional maps problem can be underdetermined without regularization or additional assumptions on the map. In this paper, we show how this problem can be addressed through kernelization, in which descriptors are lifted to higher-dimensional vectors or even infinite-length sequences of values. The key observation is that optimization problems for functional maps only depend on inner products between descriptors rather than descriptor values themselves. These inner products can be evaluated efficiently through use of kernel functions. In addition to deriving a kernelized version of functional maps including a recent extension in terms of pointwise multiplication operators, we provide an efficient conjugate gradient algorithm for optimizing our generalized problem as well as a strategy for low-rank estimation of kernel matrices through the Nyström approximation.I.3.5 [Computer Graphics]Computer graphicsComputational Geometry and Object Modeling10.1111/cgf.1348827-36