z-logo
open-access-imgOpen Access
Normal estimation for pointcloud using GPU based sparse tensor voting
Author(s) -
Ming Liu,
François Pomerleau,
Francis Colas,
Roland Siegwart
Publication year - 2012
Publication title -
2021 ieee international conference on robotics and biomimetics (robio)
Language(s) - English
Resource type - Book series
ISBN - 978-1-4673-2125-9
DOI - 10.1109/robio.2012.6490949
Subject(s) - computer science , voting , kernel (algebra) , tensor (intrinsic definition) , noise (video) , computational complexity theory , artificial intelligence , pattern recognition (psychology) , algorithm , segmentation , image (mathematics) , mathematics , combinatorics , politics , political science , pure mathematics , law
International audienceNormal estimation is the basis for most applications using pointcloud, such as segmentation. However, it is still a challenging problem regarding computational complexity and observation noise. In this paper, we propose a normal estimation method for pointcloud using results from tensor voting. Comparing with other approaches, we show it has smaller estimation error. Moreover, by varying the voting kernel size, we find it is a flexible approach for structure extraction as well. The results show that the proposed method is robust to noisy observation and missing data points as well. We use a GPU based implementation of Sparse Tensor Voting, which enables realtime calculation

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom