IEEE Trans Pattern Anal Mach Intell. 2011 Aug;33(8):1633-45. doi: 10.1109/TPAMI.2010.223. Epub 2010 Dec 23.
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.
在本文中,我们提出了一个在存在大量噪声和离群点的情况下处理刚体和非刚体点集配准问题的统一框架。该注册框架的关键思想是使用高斯混合模型来表示输入点集。然后,点集注册问题被重新表述为对齐两个高斯混合的问题,使得两个对应混合之间的统计差异度量最小化。我们表明,流行的迭代最近点(ICP)方法[1]和领域中现有的几种点集注册方法[2]、[3]、[4]、[5]、[6]、[7]在我们的通用框架中密切相关,可以有意义地重新解释。我们的这个通用框架的实例化基于两个高斯混合之间的 L2 距离,它具有封闭形式的表达式,进而导致计算效率高的注册算法。所得到的注册算法具有固有的统计鲁棒性,具有直观的解释,并且易于实现。我们还提供了与其他用于点集注册的鲁棒方法的理论和实验比较。