Discrete Optimization for Shape Matching

Jing Ren, Simone Melzi, Peter Wonka, Maks Ovsjanikov

Research output: Contribution to journalArticlepeer-review

Abstract

We propose a novel discrete solver for optimizing functional map-based energies, including descriptor preservation and pro-moting structural properties such as area-preservation, bijectivity and Laplacian commutativity among others. Unlike thecommonly-used continuous optimization methods, our approach enforces the functional map to be associated with a pointwisecorrespondence as a hard constraint, which provides a stronger link between optimized properties of functional and point-to-point maps. Under this hard constraint, our solver obtains functional maps with lower energy values compared to the standardcontinuous strategies. Perhaps more importantly, the recovered pointwise maps from our discrete solver preserve the optimizedfor functional properties and are thus of higher overall quality. We demonstrate the advantages of our discrete solver on arange of energies and shape categories, compared to existing techniques for promoting pointwise maps within the functionalmap framework. Finally, with this solver in hand, we introduce a novel Effective Functional Map Refinement (EFMR) methodwhich achieves the state-of-the-art accuracy on the SHREC’19 benchmark.
Original languageEnglish (US)
Pages (from-to)81-96
Number of pages16
JournalComputer Graphics Forum
Volume40
Issue number5
DOIs
StatePublished - Aug 23 2021

ASJC Scopus subject areas

  • Computer Networks and Communications

Fingerprint

Dive into the research topics of 'Discrete Optimization for Shape Matching'. Together they form a unique fingerprint.

Cite this