Dissemin is shutting down on January 1st, 2025

Published in

2011 18th IEEE International Conference on Image Processing

DOI: 10.1109/icip.2011.6116701

Links

Tools

Export citation

Search in Google Scholar

A dynamic approach for approximate pairwise alignment based on 4-points congruence sets of 3D points

Proceedings article published in 2011 by Juarez Paulino da Silva, Dibio Leandro Borges, Flavio de Barros Vidal ORCID
This paper is available in a repository.
This paper is available in a repository.

Full text: Download

Green circle
Preprint: archiving allowed
Green circle
Postprint: archiving allowed
Red circle
Published version: archiving forbidden
Data provided by SHERPA/RoMEO

Abstract

We present a method for approximate 3D point sets alignment to register surfaces with varying degrees of overlap. The approach is based on a novel technique to extract dynamically the sets of coplanar 4-points from a 3D point set which are approximately congruent. The choice of bases from one 3D set to be matched to the others for possible registration is done automatically, and it is refined dynamically by controlling the width of the bases against the degree of overlap to be achieved at each iteration. Besides being an automatic way to perform the alignment, our method is a way to optimize the 4-points bases selection since it converges fast to appropriate bases as they are available. We show and compare reconstruction results using publicly available 3D scan data.