Mobius Voting For Surface Correspondence

doi:10.1145/1531326.1531378

2009-07-27

193

Lipman, Yaron *

Funkhouser, Thomas

DOI：10.1145/1531326.1531378

原文链接

查看原文

摘要

En 中文

The goal of our work is to develop an efficient, automatic algorithm for discovering point correspondences between surfaces that are approximately and/or partially isometric. Our approach is based on three observations. First, isometries are a subset of the Mobius group, which has low-dimensionality-six degrees of freedom for topological spheres, and three for topological discs. Second, computing the Mobius transformation that interpolates any three points can be computed in closed-form after a mid-edge flattening to the complex plane. Third, deviations from isometry can be modeled by a transportation-type distance between corresponding points in that plane. Motivated by these observations, we have developed a Mobius Voting algorithm that iteratively: 1) samples a triplet of three random points from each of two point sets, 2) uses the Mobius transformations defined by those triplets to map both point sets into a canonical coordinate frame on the complex plane, and 3) produces votes for predicted correspondences between the mutually closest points with magnitude representing their estimated deviation from isometry. The result of this process is a fuzzy correspondence matrix, which is converted to a permutation matrix with simple matrix operations and output as a discrete set of point correspondences with confidence values. The main advantage of this algorithm is that it can find intrinsic point correspondences in cases of extreme deformation. During experiments with a variety of data sets, we find that it is able to find dozens of point correspondences between different object types in different poses fully automatically.

Keyword:

REGISTRATION

RECOGNITION

GEOMETRY