Hierarchical Normal Space Sampling to speed up point cloud coarse matching

Text Complet
HierarchicalNormal .pdf embargoed access
Sol·licita còpia a l'autor de l'article
En omplir aquest formulari esteu demanant una còpia de l'article dipositat al repositori institucional (DUGiDocs) al seu autor o a l'autor principal de l'article. Serà el mateix autor qui decideixi lliurar una còpia del document a qui ho sol•liciti si ho creu convenient. En tot cas, la Biblioteca de la UdG no intervé en aquest procés ja que no està autoritzada a facilitar articles quan aquests són d'accés restringit.
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