Discrete minimum distortion correspondence problems for non-rigid shape matching

Authors:
Chaohui Wang;Michael M. Bronstein;Alexander M. Bronstein;Nikos Paragios
Affiliations:
Laboratoire MAS, Ecole Centrale de Paris, Châtenay-Malabry, France;Institute of Computational Science, Faculty of Informatics, Università della Svizzera Italiana, Lugano, Switzerland;Department of Electrical Engineering, Tel Aviv University, Israel;Laboratoire MAS, Ecole Centrale de Paris, Châtenay-Malabry, France
Venue:
SSVM'11 Proceedings of the Third international conference on Scale Space and Variational Methods in Computer Vision
Year:
2011

Citing 15
Cited 2

A Graduated Assignment Algorithm for Graph Matching

IEEE Transactions on Pattern Analysis and Machine Intelligence
The Princeton Shape Benchmark

SMI '04 Proceedings of the Shape Modeling International 2004
Shape Matching and Object Recognition Using Low Distortion Correspondences

CVPR '05 Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 1 - Volume 01
A Theoretical and Computational Framework for Isometry Invariant Recognition of Point Cloud Data

Foundations of Computational Mathematics
Laplace-Beltrami eigenfunctions for deformation invariant shape representation

SGP '07 Proceedings of the fifth Eurographics symposium on Geometry processing
Clustering and Embedding Using Commute Times

IEEE Transactions on Pattern Analysis and Machine Intelligence
Numerical Geometry of Non-Rigid Shapes

Numerical Geometry of Non-Rigid Shapes
Feature Correspondence Via Graph Matching: Models and Global Optimization

ECCV '08 Proceedings of the 10th European Conference on Computer Vision: Part II
Möbius voting for surface correspondence

ACM SIGGRAPH 2009 papers
Salient spectral geometric features for shape matching and retrieval

The Visual Computer: International Journal of Computer Graphics
Global intrinsic symmetries of shapes

SGP '08 Proceedings of the Symposium on Geometry Processing
Deformation-driven shape correspondence

SGP '08 Proceedings of the Symposium on Geometry Processing
A concise and provably informative multi-scale signature based on heat diffusion

SGP '09 Proceedings of the Symposium on Geometry Processing
A Gromov-Hausdorff Framework with Diffusion Geometry for Topologically-Robust Non-rigid Shape Matching

International Journal of Computer Vision
Calculus of Nonrigid Surfaces for Geometry and Texture Manipulation

IEEE Transactions on Visualization and Computer Graphics

Scale Normalization for Isometric Shape Matching

Computer Graphics Forum
Densifying Distance Spaces for Shape and Image Retrieval

Journal of Mathematical Imaging and Vision

Quantified Score

Hi-index	0.00

Visualization

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, formulate the invariant correspondence problem as binary graph labeling, and show how different choice of structure results in invariance under various classes of deformations.