Least-squares registration of point sets over SE (d) using closed-form projections

by   Sk. Miraj Ahmed, et al.

Consider the problem of registering multiple point sets in some d-dimensional space using rotations and translations. Assume that there are sets with common points, and moreover the pairwise correspondences are known for such sets. We consider a least-squares formulation of this problem, where the variables are the transforms associated with the point sets. The present novelty is that we reduce this nonconvex problem to an optimization over the positive semidefinite cone, where the objective is linear but the constraints are nevertheless nonconvex. We propose to solve this using variable splitting and the alternating directions method of multipliers (ADMM). Due to the linearity of the objective and the structure of constraints, the ADMM subproblems are given by projections with closed-form solutions. In particular, for m point sets, the dominant cost per iteration is the partial eigendecomposition of an md × md matrix, and m-1 singular value decompositions of d × d matrices. We empirically show that for appropriate parameter settings, the proposed solver has a large convergence basin and is stable under perturbations. As applications, we use our method for 2D shape matching and 3D multiview registration. In either application, we model the shapes/scans as point sets and determine the pairwise correspondences using ICP. In particular, our algorithm compares favorably with existing methods for multiview reconstruction in terms of timing and accuracy.


page 15

page 18

page 21

page 22


Non-iterative One-step Solution for Point Set Registration Problem on Pose Estimation without Correspondence

In this work, we propose to directly find the one-step solution for the ...

Global registration of multiple point clouds using semidefinite programming

Consider N points in R^d and M local coordinate systems that are related...

Anderson Acceleration for Nonconvex ADMM Based on Douglas-Rachford Splitting

The alternating direction multiplier method (ADMM) is widely used in com...

Multi-Group Multicast Beamforming by Superiorized Projections onto Convex Sets

In this paper, we propose an iterative algorithm to address the nonconve...

A Practical Maximum Clique Algorithm for Matching with Pairwise Constraints

A popular paradigm for 3D point cloud registration is by extracting 3D k...

A new ADMM algorithm for the Euclidean median and its application to robust patch regression

The Euclidean Median (EM) of a set of points Ω in an Euclidean space is ...

Fast and Accurate Intrinsic Symmetry Detection

In computer vision and graphics, various types of symmetries are extensi...

Please sign up or login with your details

Forgot password? Click here to reset