Hierarchical Normal Space Sampling to speed up point cloud coarse matching

Texto Completo
HierarchicalNormal .pdf embargoed access
Solicita copia
Al rellenar este formulario estáis solicitando una copia del artículo, depositado en el repositorio institucional (DUGiDocs), a su autor o al autor principal del artículo. Será el mismo autor quien decidirá enviar una copia del documento a quien lo solicite si lo considera oportuno. En todo caso, la Biblioteca de la UdG no interviene en este proceso ya que no está autorizada a facilitar artículos cuando éstos son de acceso restringido.
Point cloud matching is a central problem in Object Modeling with applications in Computer Vision and Computer Graphics. Although the problem is well studied in the case when an initial estimate of the relative pose is known (fine matching), the problem becomes much more difficult when this a priori knowledge is not available (coarse matching). In this paper we introduce a novel technique to speed up coarse matching algorithms for point clouds. This new technique, called Hierarchical Normal Space Sampling (HNSS), extends Normal Space Sampling by grouping points hierarchically according to the distribution of their normal vectors. This hierarchy guides the search for corresponding points while staying free of user intervention. This permits to navigate through the huge search space taking advantage of geometric information and to stop when a sufficiently good initial pose is found. This initial pose can then be used as the starting point for any fine matching algorithm. Hierarchical Normal Space Sampling is adaptable to different searching strategies and shape descriptors. To illustrate HNSS, we present experiments using both synthetic and real data that show the computational complexity of the problem, the computation time reduction obtained by HNSS and the application potentials in combination with ICP ​
​Tots els drets reservats