Skip to Main content Skip to Navigation

Discrete minimum distortion correspondence problems for non-rigid shape matching

Abstract : Similarity and correspondence are two fundamental archetype problems in shape analysis, encountered in numerous application in computer vision and pattern recognition. Many methods for shape similarity and correspondence boil down to the minimum-distortion correspondence problem, in which two shapes are endowed with certain structure, and one attempts to find the matching with smallest structure distortion between them. Defining structures invariant to some class of shape transformations results in an invariant minimum-distortion correspondence or similarity. In this paper, we model shapes using local and global structures and formulate the invariant correspondence problem as binary graph labeling. We perform challenging non-rigid shape matching experiments, and show how different choice of structure results in invariance under various classes of deformations.
Complete list of metadata

Cited literature [50 references]  Display  Hide  Download
Contributor : Chaohui Wang <>
Submitted on : Wednesday, July 7, 2010 - 7:58:45 PM
Last modification on : Wednesday, April 8, 2020 - 3:35:32 PM
Long-term archiving on: : Friday, October 8, 2010 - 9:47:03 AM


Files produced by the author(s)


  • HAL Id : inria-00498591, version 1



Chaohui Wang, Michael M. Bronstein, Nikolaos Paragios. Discrete minimum distortion correspondence problems for non-rigid shape matching. [Research Report] RR-7333, INRIA. 2010. ⟨inria-00498591⟩



Record views


Files downloads