Aligning point cloud views using persistent feature histograms

  • Rusu R
  • Blodow N
  • Marton Z
 et al. 
  • 247


    Mendeley users who have this article in their library.
  • 223


    Citations of this article.


In this paper we investigate the usage of persistent point feature histograms for the problem of aligning point cloud data views into a consistent global model. Given a collection of noisy point clouds, our algorithm estimates a set of robust 16D features which describe the geometry of each point locally. By analyzing the persistence of the features at different scales, we extract an optimal set which best characterizes a given point cloud. The resulted persistent features are used in an initial alignment algorithm to estimate a rigid transformation that approximately registers the input datasets. The algorithm provides good starting points for iterative registration algorithms such as ICP (Iterative Closest Point), by transforming the datasets to its convergence basin. We show that our approach is invariant to pose and sampling density, and can cope well with noisy data coming from both indoor and outdoor laser scans.

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document


  • Michael BeetzUniversitat Bremen Fachbereich 03 Mathematik Informatik

  • Radu Bogdan Rusu

  • Nico Blodow

  • Zoltan Csaba Marton

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free