Copyright © 2003 Elsevier B.V. All rights reserved.
An accurate and fast point-to-plane registration technique
Received 29 January 2003;
References and further reading may be available for this article. To view references and further reading you must purchase this article.
Abstract
This paper addresses a registration refinement problem and presents an accurate and fast point-to-(tangent) plane technique. Point-to-plane approach is known to be very accurate for registration refinement of partial 3D surfaces. However, the computation complexity for finding the intersection point on a destination surface from a source control point is hindering the algorithm from real-time applications. We introduce a novel point-to-plane registration technique by combining the high-speed advantage of point-to-projection technique. In order to find the intersection point fast and accurately, we forward-project the source point to the destination surface and reproject the projection point to the normal vector of the source point. We show that iterative projections of the projected destination point to the normal vector converge to the intersection point. By assuming the destination surface to be a monotonic function in a new 2D coordinate system, we show contraction mapping properties of our iterative projection technique. Experimental results for several objects are presented for both pair-wise and multi-view registrations.
Author Keywords: Range registration; point-to-plane; Contractive projection point
Article Outline
- 1. Introduction
- 2. Description of registration techniques
- 3. Contractive projection point (CPP) technique
- 3.1. Combining point-to-plane and point-to-projection techniques
- 3.2. Contraction mapping property of CPP
- 3.3. Convergence condition
- 3.4. CPP algorithm
- 4. Experimental results
- 4.1. Test objects
- 4.2. Registration error with respect to projection numbers
- 4.3. Pair-wise registration
- 4.4. Number of convergence
- 4.5. Multi-view registration
- 5. Conclusions
- References






E-mail Article
Add to my Quick Links

Cited By in Scopus (3)






k<1), (b) divergence (k>1), (c) infinity loop (k=1). 