Please use this identifier to cite or link to this item:
http://hdl.handle.net/10397/81620
DC Field | Value | Language |
---|---|---|
dc.contributor | Department of Building and Real Estate | - |
dc.contributor | Department of Industrial and Systems Engineering | - |
dc.creator | Zhan, X | en_US |
dc.creator | Cai, Y | en_US |
dc.creator | Li, H | en_US |
dc.creator | Li, Y | en_US |
dc.creator | He, P | en_US |
dc.date.accessioned | 2020-01-21T08:49:13Z | - |
dc.date.available | 2020-01-21T08:49:13Z | - |
dc.identifier.issn | 0020-2940 | en_US |
dc.identifier.uri | http://hdl.handle.net/10397/81620 | - |
dc.language.iso | en | en_US |
dc.publisher | Sage Publications Ltd. | en_US |
dc.rights | © The Author(s) 2019. 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 without further 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., Li, H., Li, Y., & He, P. (2019). A point cloud registration algorithm based on normal vector and particle swarm optimization. Measurement and Control, is available at https://doi.org/10.1177/0020294019858217 | en_US |
dc.subject | K-d tree | en_US |
dc.subject | Normal vector | en_US |
dc.subject | Quaternion method | en_US |
dc.title | A point cloud registration algorithm based on normal vector and particle swarm optimization | en_US |
dc.type | Journal/Magazine Article | en_US |
dc.identifier.doi | 10.1177/0020294019858217 | en_US |
dcterms.abstract | Based on normal vector and particle swarm optimization (NVP), a point cloud registration algorithm is proposed by searching the corresponding points. It provides a new method for point cloud registration using feature point registration. First, in order to find the nearest eight neighbor nodes, the k-d tree is employed to build the relationship between points. Then, the normal vector and the distance between the point and the center gravity of eight neighbor points can be calculated. Second, the particle swarm optimization is used to search the corresponding points. There are two conditions to terminate the search in particle swarm optimization: one is that the normal vector of node in the original point cloud is the most similar to that in the target point cloud, and the other is that the distance between the point and the center gravity of eight neighbor points of node is the most similar to that in the target point cloud. Third, after obtaining the corresponding points, they are tested by random sample consensus in order to obtain the right corresponding points. Fourth, the right corresponding points are registered by the quaternion method. The experiments demonstrate that this algorithm is effective. Even in the case of point cloud data lost, it also has high registration accuracy. | - |
dcterms.accessRights | open access | en_US |
dcterms.bibliographicCitation | Measurement and control, 2019 | en_US |
dcterms.isPartOf | Engineering applications of computational fluid mechanics | en_US |
dcterms.issued | 2019 | - |
dc.identifier.isi | WOS:000537193300001 | - |
dc.identifier.scopus | 2-s2.0-85071524432 | - |
dc.identifier.eissn | 2051-8730 | en_US |
dc.description.validate | 202001 bcma | - |
dc.description.oa | Version of Record | en_US |
dc.identifier.FolderNumber | OA_Scopus/WOS | en_US |
dc.description.pubStatus | Published | en_US |
Appears in Collections: | Journal/Magazine Article |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Zhan_point_cloud_registration.pdf | 2.87 MB | Adobe PDF | View/Open |
Page views
160
Last Week
0
0
Last month
Citations as of Apr 14, 2024
Downloads
99
Citations as of Apr 14, 2024
SCOPUSTM
Citations
20
Citations as of Apr 12, 2024
WEB OF SCIENCETM
Citations
16
Citations as of Apr 18, 2024
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.