Geometrical analysis of two sets of 3D correspondence data patterns for the registration of free-form shapes
The iterative closest point (ICP) algorithm represents an efficient method to establish an initial set of possible correspondences between two overlapping range images. An inherent limitation of the algorithm is the introduction of false matches, a problem that has been tackled by a variety of schemes mainly based on local invariants described in a single coordinate frame. In this paper we propose using global rigid motion constraints to deal with false matches. Such constraints are derived from geometric properties of correspondence vectors bridging the points described in different coordinate frames before and after a rigid motion. In order to accurately and efficiently estimate the parameters of interest, the Monte Carlo resampling technique is used and motion parameter candidates are then synthesised by a median filter. The proposed algorithm is validated based on both synthetic data and real range images. Experimental results show that the proposed algorithm has advantages over existing registration methods concerning robustness, accuracy, and efficiency.
global rigid motion constraints correspondence vector range image registration sphere ambiguity motion estimation icp algorithm