Hostname: page-component-6766d58669-6mz5d Total loading time: 0 Render date: 2026-05-23T10:04:10.791Z Has data issue: false hasContentIssue false

Partial Shape Matching Without Point-Wise Correspondence

Published online by Cambridge University Press:  28 May 2015

Jonathan Pokrass*
Affiliation:
School of Electrical Engineering, Tel Aviv University, Israel
Alexander M. Bronstein*
Affiliation:
School of Electrical Engineering, Tel Aviv University, Israel
Michael M. Bronstein*
Affiliation:
Institute of Computational Science, Faculty of Informatics, Università della Svizzera Italiana (USI), Lugano, Switzerland
*
Corresponding author.Email address:evgenyfo@post.tau.ac.il
Corresponding author.Email address:bron@eng.tau.ac.il
Corresponding author.Email address:michael.bronstein@usi.eh
Get access

Abstract

Partial similarity of shapes is a challenging problem arising in many important applications in computer vision, shape analysis, and graphics, e.g. When one has to deal with partial information and acquisition artifacts. The problem is especially hard when the underlying shapes are non-rigid and are given up to a deformation. Partial matching is usually approached by computing local descriptors on a pair of shapes and then establishing a point-wise non-bijective correspondence between the two, taking into account possibly different parts. In this paper, we introduce an alternative correspondence-less approach to matching fragments to an entire shape undergoing a non-rigid deformation. We use region-wise local 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 point clouds and meshes, and present experiments demonstrating the success of the proposed method.

Information

Type
Research Article
Copyright
Copyright © Global Science Press Limited 2013

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable