Abstract
In this paper, we present a 3D automatic registration method based on Gaussian Fields and energy minimization. A continuously differentiable energy function is defined, which is convex in a large neighborhood of the alignment parameters. We show that the size of the region of convergence can be significantly extended reducing the need for close initialization and overcoming local convergence problems of the standard Iterative Closest Point (ICP) algorithms. Moreover, the Gaussian criterion can be applied with linear computational complexity using Fast Gauss Transform methods. Experimental evaluation of the technique using synthetic and real datasets demonstrates the usefulness as well as the limits of the approach.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.