Dynamic Differential Evolution Algorithm Applied in Point Cloud Registration

5Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Aiming at the problem of point cloud registration, a registration method based on dynamic differential evolution algorithm (DDE) is proposed. The voxel grid method is used to uniformly sample the point cloud to reduce the time complexity of DDE. The individuals of DDE are coded by rotation angle and the translation distance. The kd-tree is used to search for corresponding point pairs, and the root mean square error is defined as the objective function of DDE. Experiments show that the proposed method can register point clouds with a large difference in position, and has better registration accuracy than iterative closest point (ICP).

Cite

CITATION STYLE

APA

Li, C. L., & Dian, S. Y. (2018). Dynamic Differential Evolution Algorithm Applied in Point Cloud Registration. In IOP Conference Series: Materials Science and Engineering (Vol. 428). Institute of Physics Publishing. https://doi.org/10.1088/1757-899X/428/1/012032

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free