Abstract

Registration for tree point cloud presents a high registration error due to the complex structure of trees and serious self-shielding. The paper proposes a registration algorithm based on pseudo feature point. This algorithm includes two steps. In initial registration, we use pseudo feature points to adjust the position of two original point clouds quickly and roughly at first. However, pseudo feature points sometimes can't fully represent the feature of original point cloud owing to the noise, it leads to a high registration error obtained in initial registration, and then need to use the improved sparse iterative closest point algorithm to adjust two original point clouds again. Experiments show that the proposed algorithm can register both non-leafy tree and leafy tree. Compared with iterative closest point registration and sparse iterative closest point registration, the method significantly reduces the registration error by 41.1% and 16.8% respectively under the same number of iterations. The method can also register nonplant point cloud.

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 call

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.