Use este identificador para citar ou linkar para este item: http://repositorio.ufc.br/handle/riufc/66516
Tipo: Artigo de Periódico
Título: Uniaxial partitioning strategy for efficient point cloud registration
Autor(es): Souza Neto, Polycarpo
Soares, José Marques
Thé, George André Pereira
Palavras-chave: 3D point cloud registration;Partitioning;Rigid body registration;Iterative closest point;3D surface matching;Point matching algorithm
Data do documento: 2022
Instituição/Editor/Publicador: Sensors
Citação: NETO, P. S. et al. Uniaxial partitioning strategy for efficient point cloud registration. Sensors. Vol. 22, n. 8, p. 2887, 2022.
Abstract: In 3D reconstruction applications, an important issue is the matching of point clouds corresponding to different perspectives of a particular object or scene, which is addressed by the use of variants of the Iterative Closest Point (ICP) algorithm. In this work, we introduce a cloud-partitioning strategy for improved registration and compare it to other relevant approaches by using both time and quality of pose correction. Quality is assessed from a rotation metric and also by the root mean square error (RMSE) computed over the points of the source cloud and the corresponding closest ones in the corrected target point cloud. A wide and plural set of experimentation scenarios was used to test the algorithm and assess its generalization, revealing that our cloud-partitioning approach can provide a very good match in both indoor and outdoor scenes, even when the data suffer from noisy measurements or when the data size of the source and target models differ significantly. Furthermore, in most of the scenarios analyzed, registration with the proposed technique was achieved in shorter time than those from the literature.
URI: http://www.repositorio.ufc.br/handle/riufc/66516
ISSN: 1424-8220
Aparece nas coleções:DETE - Artigos publicados em revista científica

Arquivos associados a este item:
Arquivo Descrição TamanhoFormato 
2022_art_jmsoares.pdf2,61 MBAdobe PDFVisualizar/Abrir


Os itens no repositório estão protegidos por copyright, com todos os direitos reservados, salvo quando é indicado o contrário.