Finding a match between partially available deformable shapes is a challenging problem with numerous applications. The problem is usually approached by computing local descriptors on a pair of shapes and then establishing a point-wise correspondence between the two. In this paper, we introduce an alternative correspondence-less approach to matching fragments to an entire shape undergoing a non-rigid deformation. We use diffusion geometric descriptors and optimize over the integration domains on which the integral descriptors of the two parts match. The problem is regularized using the Mumford-Shah functional. We show an efficient discretization based on the Ambrosio-Tortorelli approximation generalized to triangular meshes. Experiments demonstrating the success of the proposed method are presented. © 2012 Springer-Verlag.
CITATION STYLE
Pokrass, J., Bronstein, A. M., & Bronstein, M. M. (2012). A correspondence-less approach to matching of deformable shapes. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6667 LNCS, pp. 592–603). https://doi.org/10.1007/978-3-642-24785-9_50
Mendeley helps you to discover research relevant for your work.