Towards a general multi-view registration technique

We present an algorithm that reduces significantly the level of the registration errors between all pairs in a set of range views. This algorithm refines initial estimates of the transformation matrices obtained from either the calibrated acquisition setup or a crude manual alignment. It is an instance of a category of registration algorithms known as iterated closest-point (ICP) algorithms. The algorithm considers the network of views as a whole and minimizes the registration errors of all views simultaneously. This leads to a well-balanced network of views in which the registration errors are equally distributed, an objective not met by previously published ICP algorithms which all process the views sequentially. Experimental results show that this refinement technique improves the calibrated registrations and the quality of the integrated model for complex multi-part objects. In the case of scenes comprising man-made objects of very simple shapes, the basic algorithm faces problems common to all ICP algorithms and so must be extended