Abstract
This paper describes a method of automatically performing the registration of two range images that have significant overlap. We first find points of interest in the intensity data that comes with each range image. Then we perform a tetrahedrization of the 3D range points associated with these 2D interest points. The triangle pairs of these tetrahedrizations are then matched in order to compute the registration. The fact that we have 3D data available makes it possible to efficiently prune potential matches. The best match is the one that aligns the largest number of interest points between the two images. The algorithms are demonstrated experimentally on a number of different range image pairs.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
