ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
Pattern Recognition Letters
Volume 24, Issue 16, December 2003, Pages 2967-2976
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Article
Purchase PDF (247 K)

 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
View Record in Scopus
 
doi:10.1016/S0167-8655(03)00157-0    How to Cite or Link Using DOI (Opens New Window)
Copyright © 2003 Elsevier B.V. All rights reserved.

An accurate and fast point-to-plane registration technique

Soon-Yong ParkCorresponding Author Contact Information, E-mail The Corresponding Author and Murali SubbaraoE-mail The Corresponding Author

Department of Electrical and Computer Engineering, College of Engineering and Applied Science, State University of New York at Stony Brook, Stony Brook, NY 11794-2350, USA

Received 29 January 2003; 
revised 1 July 2003. 
Available online 30 July 2003.

Purchase the full-text article



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










Pattern Recognition Letters
Volume 24, Issue 16, December 2003, Pages 2967-2976
 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2008 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.