CSDL Home IEEE Transactions on Pattern Analysis & Machine Intelligence 2011 vol.33 Issue No.08 - August

Subscribe

Issue No.08 - August (2011 vol.33)

pp: 1633-1645

Bing Jian , Siemens Healthcare, Malvern

Baba C. Vemuri , University of Florida, Gainesville

ABSTRACT

In this paper, we present a unified framework for the rigid and nonrigid point set registration problem in the presence of significant amounts of noise and outliers. The key idea of this registration framework is to represent the input point sets using Gaussian mixture models. Then, the problem of point set registration is reformulated as the problem of aligning two Gaussian mixtures such that a statistical discrepancy measure between the two corresponding mixtures is minimized. We show that the popular iterative closest point (ICP) method [1] and several existing point set registration methods [2], [3], [4], [5], [6], [7] in the field are closely related and can be reinterpreted meaningfully in our general framework. Our instantiation of this general framework is based on the the L2 distance between two Gaussian mixtures, which has the closed-form expression and in turn leads to a computationally efficient registration algorithm. The resulting registration algorithm exhibits inherent statistical robustness, has an intuitive interpretation, and is simple to implement. We also provide theoretical and experimental comparisons with other robust methods for point set registration.

INDEX TERMS

Point set registration, nonrigid registration, Gaussian mixtures, robust matching.

CITATION

Bing Jian, Baba C. Vemuri, "Robust Point Set Registration Using Gaussian Mixture Models",

*IEEE Transactions on Pattern Analysis & Machine Intelligence*, vol.33, no. 8, pp. 1633-1645, August 2011, doi:10.1109/TPAMI.2010.223REFERENCES