Sparse Modeling of Intrinsic Correspondences. (6th May 2013)

• Record Type: Journal Article
• Authors: Pokrass, J.; Bronstein, A. M.; Bronstein, M. M.; Sprechmann, P.; Sapiro, G.
• Is Part Of: Computer graphics forum. Volume 32:Number 2(2013)Part 4
• Page Start: 459
• Page End: 468
• Publication Date: 2013-05-06
• Subjects: I.4.8 [Image Processing And Computer Vision]: Scene Analysis—Shape; Computer graphics -- Periodicals; 006.605
• DOI: 10.1111/cgf.12066
• Languages: English
• ISSNs: 0167-7055

Abstract

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.