Sparse models for intrinsic shape correspondence

DOI10.1007/978-3-319-24726-7_10zbMATH Open1380.68404arXiv1209.6560OpenAlexW2527220157MaRDI QIDQ4603064FDOQ4603064

Authors: Jonathan Pokrass, Alexander M. Bronstein, Michael M. Bronstein, Pablo Sprechmann, Guillermo Sapiro 

Publication date: 14 February 2018

Published in: Mathematics and Visualization (Search for Journal in Brave)

Abstract: We present a novel sparse modeling approach to non-rigid shape matching using only the ability to detect repeatable regions. As the input to our algorithm, we are given only two sets of regions in two shapes; no descriptors are provided so the correspondence between the regions is not know, nor we know how many regions correspond in the two shapes. We show that even with such scarce information, it is possible to establish very accurate correspondence between the shapes by using methods from the field of sparse modeling, being this, the first non-trivial use of sparse models in shape correspondence. We formulate the problem of permuted sparse coding, in which we solve simultaneously for an unknown permutation ordering the regions on two shapes and for an unknown correspondence in functional representation. We also propose a robust variant capable of handling incomplete matches. Numerically, the problem is solved efficiently by alternating the solution of a linear assignment and a sparse coding problem. The proposed methods are evaluated qualitatively and quantitatively on standard benchmarks containing both synthetic and scanned objects.

Full work available at URL: https://arxiv.org/abs/1209.6560

Recommendations

• Partial shape matching without point-wise correspondence
• Hierarchical framework for shape correspondence
• Non-rigid shape correspondence using pointwise surface descriptors and metric structures
• APPROXIMATELY ISOMETRIC SHAPE CORRESPONDENCE BY MATCHING POINTWISE SPECTRAL FEATURES AND GLOBAL GEODESIC STRUCTURES
• Non-rigid Shape Correspondence Using Surface Descriptors and Metric Structures in the Spectral Domain

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites Work

• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• Title not available (Why is that?)
• Generalized multidimensional scaling: A framework for isometry-invariant partial surface matching
• Title not available (Why is that?)
• Sparse and redundant representations. From theory to applications in signal and image processing.
• Geometric and photometric data fusion in non-rigid shape analysis
• A theoretical and computational framework for isometry invariant recognition of point cloud data
• Numerical Geometry of Non-Rigid Shapes
• A Gromov-Hausdorff framework with diffusion geometry for topologically-robust non-rigid shape matching
• On convex relaxation of graph isomorphism

Cited In (6)

• Partial shape matching without point-wise correspondence
• Image matching from handcrafted to deep features: a survey
• Hierarchical framework for shape correspondence
• Diffusion pruning for rapidly and robustly selecting global correspondences using local isometry
• Non-rigid Shape Correspondence Using Surface Descriptors and Metric Structures in the Spectral Domain
• On the optimality of shape and data representation in the spectral domain

Uses Software

• SCAPE

This page was built for publication: Sparse models for intrinsic shape correspondence

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4603064)