Probabilistic Primitive Refinement algorithm for colored point cloud data
2015 (English)In: 2015 European Conference on Mobile Robots (ECMR), Lincoln: IEEE conference proceedings, 2015Conference paper (Refereed)
In this work we present the Probabilistic Primitive Refinement (PPR) algorithm, an iterative method for accurately determining the inliers of an estimated primitive (such as planes and spheres) parametrization in an unorganized, noisy point cloud. The measurement noise of the points belonging to the proposed primitive surface are modelled using a Gaussian distribution and the measurements of extraneous points to the proposed surface are modelled as a histogram. Given these models, the probability that a measurement originated from the proposed surface model can be computed. Our novel technique to model the noisy surface from the measurement data does not require a priori given parameters for the sensor noise model. The absence of sensitive parameters selection is a strength of our method. Using the geometric information obtained from such an estimate the algorithm then builds a color-based model for the surface, further boosting the accuracy of the segmentation. If used iteratively the PPR algorithm can be seen as a variation of the popular mean-shift algorithm with an adaptive stochastic kernel function.
Place, publisher, year, edition, pages
Lincoln: IEEE conference proceedings, 2015.
Registration, poiint cloud, robotics
Research subject Computer Science
IdentifiersURN: urn:nbn:se:kth:diva-178942DOI: 10.1109/ECMR.2015.7324199ISI: 000380213600033ScopusID: 2-s2.0-84962333311OAI: oai:DiVA.org:kth-178942DiVA: diva2:878492
2015 European Conference on Mobile Robots (ECMR)
FunderEU, FP7, Seventh Framework Programme, 600623
QC 201601142015-12-092015-12-092016-09-05Bibliographically approved