Please use this identifier to cite or link to this item:
http://hdl.handle.net/10397/80429
DC Field | Value | Language |
---|---|---|
dc.contributor | Department of Building and Real Estate | - |
dc.creator | Zhan, X | - |
dc.creator | Cai, Y | - |
dc.creator | He, P | - |
dc.date.accessioned | 2019-03-26T09:17:08Z | - |
dc.date.available | 2019-03-26T09:17:08Z | - |
dc.identifier.issn | 1687-8132 | - |
dc.identifier.uri | http://hdl.handle.net/10397/80429 | - |
dc.language.iso | en | en_US |
dc.publisher | SAGE Publications | en_US |
dc.rights | © The Authors(s) 2018 | en_US |
dc.rights | Creative Commons CC BY: This article is distributed under the terms of the Creative Commons Attribution 4.0 License(http://www.creativecommons.org/licenses/by/4.0/) which permits any use, reproduction and distribution of the work withoutfurther permission provided the original work is attributed as specified on the SAGE and Open Access pages (https://us.sagepub.com/en-us/nam/open-access-at-sage). | en_US |
dc.rights | The following publication Zhan, X., Cai, Y., & He, P. (2018). A three-dimensional point cloud registration based on entropy and particle swarm optimization. Advances in Mechanical Engineering, 10(12), 1-13 is published by Sage and is available at https://dx.doi.org/10.1177/1687814018814330 | en_US |
dc.subject | K-d tree | en_US |
dc.subject | Entropy | en_US |
dc.subject | Robust | en_US |
dc.title | A three-dimensional point cloud registration based on entropy and particle swarm optimization | en_US |
dc.type | Journal/Magazine Article | en_US |
dc.identifier.spage | 1 | - |
dc.identifier.epage | 13 | - |
dc.identifier.volume | 10 | - |
dc.identifier.issue | 12 | - |
dc.identifier.doi | 10.1177/1687814018814330 | - |
dcterms.abstract | A three-dimensional (3D) point cloud registration based on entropy and particle swarm algorithm (EPSA) is proposed in the paper. The algorithm can effectively suppress noise and improve registration accuracy. Firstly, in order to find the k-nearest neighbor of point, the relationship of points is established by k-d tree. The noise is suppressed by the mean of neighbor points. Secondly, the gravity center of two point clouds is calculated to find the translation matrix T. Thirdly, the rotation matrix R is gotten through particle swarm optimization (PSO). While performing the PSO, the entropy information is selected as the fitness function. Lastly, the experiment results are presented. They demonstrate that the algorithm is valuable and robust. It can effectively improve the accuracy of rigid registration. | - |
dcterms.accessRights | open access | en_US |
dcterms.bibliographicCitation | Advances in mechanical engineering, 3 Dec. 2018, v. 10, no. 12, p. 1-13, https://doi.org/10.1177/1687814018814330 | - |
dcterms.isPartOf | Advances in mechanical engineering | - |
dcterms.issued | 2018 | - |
dc.identifier.isi | WOS:000452876700001 | - |
dc.identifier.scopus | 2-s2.0-85058522935 | - |
dc.identifier.eissn | 1687-8140 | - |
dc.description.validate | 201903 bcrc | - |
dc.description.oa | Version of Record | en_US |
dc.identifier.FolderNumber | OA_IR/PIRA | en_US |
dc.description.pubStatus | Published | en_US |
Appears in Collections: | Journal/Magazine Article |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Zhan_Three-dimensional_Cloud_Base.pdf | 8.23 MB | Adobe PDF | View/Open |
Page views
131
Last Week
2
2
Last month
Citations as of Mar 24, 2024
Downloads
234
Citations as of Mar 24, 2024
SCOPUSTM
Citations
20
Citations as of Mar 28, 2024
WEB OF SCIENCETM
Citations
16
Citations as of Mar 28, 2024
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.