PLoS ONE · 2017 · 29 citations · 21 references
ComputingComputer ScienceComputational GeometryComputer VisionMachine VisionFeature DescriptionImage RegistrationPose EstimationCoarse-to-fine MappingIterative Closest PointOptimization Methods For RegistrationPositionRigid RegistrationRobust RegistrationSingular Value DecompositionTransformation Estimation
The iterative closest point (ICP) algorithm is efficient and accurate for rigid registration but it needs the good initial parameters. It is easily failed when the rotation angle between two point sets is large. To deal with this problem, a new objective function is proposed by introducing a rotation invariant feature based on the Euclidean distance between each point and a global reference point, where the global reference point is a rotation invariant. After that, this optimization problem is solved by a variant of ICP algorithm, which is an iterative method. Firstly, the accurate correspondence is established by using the weighted rotation invariant feature distance and position distance together. Secondly, the rigid transformation is solved by the singular value decomposition method. Thirdly, the weight is adjusted to control the relative contribution of the positions and features. Finally this new algorithm accomplishes the registration by a coarse-to-fine way whatever the initial rotation angle is, which is demonstrated to converge monotonically. The experimental results validate that the proposed algorithm is more accurate and robust compared with the original ICP algorithm.
21
Efficient variants of the ICP algorithm
Szymon Rusinkiewicz, Marc Levoy · 2002 · 3.7K citations
Object modelling by registration of multiple range images
Yang Chen, Gérard Medioni · Image and Vision Computing · 1992 · 3.1K citations