Vote based correspondence for 3D point-set registration (original) (raw)
Related papers
Plane Pair Matching for Efficient 3D View Registration
ArXiv, 2020
We present a novel method to estimate the motion matrix between overlapping pairs of 3D views in the context of indoor scenes. We use the Manhattan world assumption to introduce lightweight geometric constraints under the form of planes into the problem, which reduces complexity by taking into account the structure of the scene. In particular, we define a stochastic framework to categorize planes as vertical or horizontal and parallel or non-parallel. We leverage this classification to match pairs of planes in overlapping views with point-of-view agnostic structural metrics. We propose to split the motion computation using the classification and estimate separately the rotation and translation of the sensor, using a quadric minimizer. We validate our approach on a toy example and present quantitative experiments on a public RGB-D dataset, comparing against recent state-of-the-art methods. Our evaluation shows that planar constraints only add low computational overhead while improvin...
Optimal registration of object views using range data
IEEE Transactions on Pattern Analysis and Machine Intelligence, 1997
This paper deals with robust registration of object views in the presence of uncertainties and noise in depth data. Errors in registration of multiple views of a 3D object severely a ect view integration during automatic construction of object models. We derive a minimum variance estimator (MVE) for computing the view transformation parameters accurately from range data of two views of a 3D object. The results of our experiments show that view transformation estimates obtained using MVE are signi cantly more accurate than those computed with an unweighted error criterion for registration.
2005
We present an algorithm for the automatic alignment of two 3D shapes (data and model), without any assumptions about their initial positions. The algorithm computes for each surface point a descriptor based on local geometry that is robust to noise. A small number of feature points are automatically picked from the data shape according to the uniqueness of the descriptor value at the point. For each feature point on the data, we use the descriptor values of the model to find potential corresponding points. We then develop 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. The result of our alignment algorithm is used as the initialization to ICP (iterative closest point) and its variants for fine registration of the data to the model. Our algorithm can be used for matching shapes that overlap only over parts of their extent, for building models from partial range scans, as ...
3D Point Set Registration based on Hierarchical Descriptors
Journal of WSCG
Registering partial point clouds is crucial in numerous applications in the field of robotics, vision, and graphics. For arbitrary configurations, the registration problem requires an initial global alignment, which is computationally expensive and often still requires refinement. In this paper, we propose a pair-wise global registration method that combines the fast convergence made possible by global hierarchical surface descriptors with the arbitrarily fine sampling enabled by continuous surface representations. Registration is performed by matching descriptors of increasing resolution – which the continuous surfaces allow us to choose arbitrarily high – while restricting the search space according to the hierarchy. We evaluated our method on a large set of pair-wise registration problems, demonstrating very competitive registration accuracy that often makes subsequent refinement with a local method unnecessary.
2021
Registering partial shapes plays an important role in numerous applications in the fields of robotics, vision, and graphics. An essential problem of registration algorithms is the determination of correspondences between surfaces. In this paper, we provide a in-depth evaluation of an approach that computes high-quality correspondences for pair-wise closest point-based iterative registration and compare the results with state-of-the-art registration algorithms. Instead of using a discrete point set for correspondence search, the approach is based on a locally reconstructed continuous moving least squares surface to overcome sampling mismatches in the input shapes. Furthermore, MLS-based correspondences are highly robust to noise. We demonstrate that this strategy outperforms existing approaches in terms of registration accuracy by combining it with the SparseICP local registration algorithm. Our extensive evaluation over several thousand scans from different sources verify that MLS-based approach results in a significant increase in alignment accuracy, surpassing state-of-theart feature-based and probabilistic methods. At the same time, it allows an efficient implementation that introduces only a modest computational overhead.
A Game-Theoretic Approach to Robust Selection of Multi-view Point Correspondence
2010
In this paper we introduce a robust matching technique that allows to operate a very accurate selection of corresponding feature points from multiple views. Robustness is achieved by enforcing global geometric consistency at an early stage of the matching process, without without the need of ex-post verification through reprojection. The global consistency is reduced to a pairwise compatibility making use of the size and orientation information provided by common feature descriptors, thus projecting what is a high-order compatibility problem into a pairwise setting. Then a game-theoretic approach is used to select a maximally consistent set of candidate matches, where highly compatible matches are enforced while incompatible correspondences are driven to extinction.
A method for the registration of attributed range images
Proceedings Third International Conference on 3-D Digital Imaging and Modeling, 2001
Registration of range images requires the identification of common portions of surfaces between which a distance minimization is performed. This paper proposes a framework for the use of dense attributes of range image elements as a matching constraint in the registration. These attributes are chosen to be invariant to rigid transformations, so that their value is similar in different views of the same surface portion. Attributes can be derived from the geometry information in the range image, such as surface curvature, or be obtained from associated intensity measurements. The method is based on the Iterative Closest Compatible Point algorithm augmented with a random sampling scheme that uses the distribution of attributes as a guide for point selection. Distance minimization is performed only between pairs of points considered compatible on the basis of their attributes. The performance of the method is illustrated on a rotationally symmetric object with color patterns.
Generation and weighting of 3D point correspondences for improved registration of RGB-D data
ISPRS Annals of Photogrammetry, Remote Sensing and Spatial Information Sciences, 2013
Registration of RGB-D data using visual features is often influenced by errors in the transformation of visual features to 3D space as well as the random error of individual 3D points. In a long sequence, these errors accumulate and lead to inaccurate and deformed point clouds, particularly in situations where loop closing is not feasible. We present an epipolar search method for accurate transformation of the keypoints from 2D to 3D space, and define weights for the 3D points based on the theoretical random error of depth measurements. Our results show that the epipolar search method results in more accurate 3D correspondences. We also demonstrate that weighting the 3D points improves the accuracy of sensor pose estimates along the trajectory.