Iterative closest spectral kernel maps

Alon Shtern, Ron Kimmel

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

An important operation in geometry processing is finding the correspondences between pairs of shapes. Measures of dissimilarity between surfaces, has been found to be highly useful for nonrigid shape comparison. Here, we analyze the applicability of the spectral kernel distance, for solving the shape matching problem. To align the spectral kernels, we introduce the iterative closest spectral kernel maps (ICSKM) algorithm. The ICSKM algorithm farther extends the iterative closest point algorithm to the class of deformable shapes. The proposed method achieves state-of-the-art results on the Princeton isometric shape matching protocol applied, as usual, to the TOSCA and SCAPE benchmarks.

Original languageEnglish
Title of host publicationProceedings - 2014 International Conference on 3D Vision, 3DV 2014
Pages499-505
Number of pages7
ISBN (Electronic)9781479970018
DOIs
StatePublished - 6 Feb 2015
Event2014 2nd International Conference on 3D Vision, 3DV 2014 - Tokyo, Japan
Duration: 8 Dec 201411 Dec 2014

Publication series

NameProceedings - 2014 International Conference on 3D Vision, 3DV 2014

Conference

Conference2014 2nd International Conference on 3D Vision, 3DV 2014
Country/TerritoryJapan
CityTokyo
Period8/12/1411/12/14

Keywords

  • Correspondence
  • Laplace-Beltrami operator
  • Shape matching

All Science Journal Classification (ASJC) codes

  • Computer Vision and Pattern Recognition
  • Computer Science Applications

Fingerprint

Dive into the research topics of 'Iterative closest spectral kernel maps'. Together they form a unique fingerprint.

Cite this