Aligning point cloud views using persistent feature histograms

@article{Rusu2008AligningPC,
  title={Aligning point cloud views using persistent feature histograms},
  author={Radu Bogdan Rusu and Nico Blodow and Zolt{\'a}n-Csaba M{\'a}rton and Michael Beetz},
  journal={2008 IEEE/RSJ International Conference on Intelligent Robots and Systems},
  year={2008},
  pages={3384-3391}
}
  • R. Rusu, Nico Blodow, +1 author M. Beetz
  • Published 14 October 2008
  • Computer Science
  • 2008 IEEE/RSJ International Conference on Intelligent Robots and Systems
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… 
Rigid 3D Point Cloud Registration Based on Point Feature Histograms
TLDR
A dynamic constraint of distance is applied to improve the traditional algorithm of point cloud classification based on point feature histogram to match feature points in different clouds with higher accuracy and efficiency.
Registration of 3D point clouds using a local descriptor based on grid point normal.
  • Jiang Wang, Bin Wu, Jiehu Kang
  • Medicine
    Applied optics
  • 2021
TLDR
Experimental comparisons on two public datasets demonstrate that the GNDAS descriptor has high descriptiveness and strong robustness to noise at low level and varying mesh resolution and the superiority of the registration approach over previous versions in accuracy and efficiency.
Registration of point clouds using sample-sphere and adaptive distance restriction
  • Yu Meng, Hui Zhang
  • Mathematics, Computer Science
    The Visual Computer
  • 2011
TLDR
A novel technique, the sample-sphere method, is proposed to register a pair of point clouds in arbitrary initial positions, which roughly aligns point clouds by matching pairs of triplets of points, which are approximately congruent under rigid transformation.
Point Clouds Registration with Probabilistic Data Association
TLDR
This work proposes an improvement over the standard ICP data association policy and it is called Probabilistic Data Association, derived applying statistical inference techniques on a fully probabilistic model to deal with the problem of dense-sparse registration.
Aligning Point Clouds with an Effective Local Feature Descriptor
TLDR
Validations and comparisons with other point cloud registration algorithms showed that LPFH is low-dimension, efficient, effective and easy to compute.
Automatic registration of unordered point clouds acquired by Kinect sensors using an overlap heuristic
TLDR
A pipeline to automatically register point clouds captured by depth sensors like the Microsoft Kinect is proposed and evaluated, which proves the generality of the proposed approach by applying it to data from a single but moving sensor, multiple Kinects that run simultaneously, as well as laser scanning data.
Automatic point cloud coarse registration using geometric keypoint descriptors for indoor scenes
TLDR
Geometric keypoints are demonstrated to be a suitable way to obtain automatic point cloud registration and open the way to future developments.
Robust Kernel-based Feature Representation for 3D Point Cloud Analysis via Circular Graph Convolutional Network
TLDR
A new local feature description method that is robust to rotation, density, and scale variations is presented and showed superior performances when compared to the state-of-the-art methods by reducing 70% of the rotation and translation errors in the registration task.
A Local Feature Descriptor Based on Rotational Volume for Pairwise Registration of Point Clouds
TLDR
A novel feature descriptor based on ratio of rotational volume to describe effectively keypoints and an improved coarse-to-fine registration pipeline of point clouds, in which it is proposed to use coarse registration to obtain a good initial transformation matrix and then fine registration based on a modified ICP algorithm to obtain an accurate transformation matrix.
Learning and Matching Multi-View Descriptors for Registration of Point Clouds
TLDR
This work first proposes a multi-view local descriptor, which is learned from the images of multiple views, for the description of 3D keypoints, and develops a robust matching approach, aiming at rejecting outlier matches based on the efficient inference via belief propagation on the defined graphical model.
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 32 REFERENCES
Persistent Point Feature Histograms for 3D Point Clouds
TLDR
This paper proposes a novel way of characterizing the local geometry of 3D points, using persistent feature histograms, and shows that geometric primitives have unique signatures in this feature space, preserved even in the presence of additive noise.
Automated Registration of Unorganised Point Clouds from Terrestrial Laser Scanners
Laser scanners provide a three-dimensional sampled representation of the surfaces of objects. The spatial resolution of the data is much higher than that of conventional surveying methods. The data
Fully Automatic Registration of 3D Point Clouds
We propose a novel technique for the registration of 3D point clouds which makes very few assumptions: we avoid any manual rough alignment or the use of landmarks, displacement can be arbitrarily
Efficient variants of the ICP algorithm
  • S. Rusinkiewicz, M. Levoy
  • Computer Science
    Proceedings Third International Conference on 3-D Digital Imaging and Modeling
  • 2001
TLDR
An implementation is demonstrated that is able to align two range images in a few tens of milliseconds, assuming a good initial guess, and has potential application to real-time 3D model acquisition and model-based tracking.
Estimating surface normals in noisy point cloud data
TLDR
A method based on local least square fitting for estimating the normals at all sample points of a point cloud data (PCD) set, in the presence of noise is described and analyzed.
Robust global registration
TLDR
This work presents an algorithm for the automatic alignment of two 3D shapes ( data and model), without any assumptions about their initial positions, and develops a fast branch-and-bound algorithm based on distance matrix comparisons to select the optimal correspondence set and bring the two shapes into a coarse alignment.
ICP Registration Using Invariant Features
TLDR
Experimental results suggest that using invariant features decreases the probability of being trapped in a local minimum and may be an effective solution for difficult range image registration problems where the scene is very small compared to the model.
Scale selection for classification of point-sampled 3D surfaces
TLDR
The problem of automatic data-driven scale selection to improve point cloud classification is investigated and the approach is validated with results using data from different sensors in various environments classified into different terrain types.
Registration and integration of textured 3D data
TLDR
This work addresses the problem of merging multiple textured 3D data sets, each of which corresponds to a different view of a scene, and shows that the use of color decreases registration error significantly when using omnidirectional stereo data sets.
Least squares 3D surface and curve matching
Abstract The automatic co-registration of point clouds, representing 3D surfaces, is a relevant problem in 3D modeling. This multiple registration problem can be defined as a surface matching task.
...
1
2
3
4
...