Abstract
Registration of range scans is commonly required in many localization and mapping algorithms. In this paper, we introduce a novel approach called Polar-Cartesian Hybrid Transforms for pair-wise registration of range scans. The proposed algorithm iteratively establishes correspondences by searching the points with closest polar angles in the polar coordinate frame. An angular look-up table is constructed based on the properties of the laser range finder to accelerate the searching procedure. In order to speed up the convergence, we compute the difference of polar range of every matched point pair to select the most contributing correspondences. After the correspondences are determined, the transformation is computed in Cartesian coordinate frame using a point-to-line metric. Combining the advantages of the polar and Cartesian coordinate frames, both robustness and efficiency are greatly improved compared with an up-to-date ICP algorithm.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: International Journal of Control, Automation and Systems
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.