Publication | Closed Access
SC<sup>2</sup>-PCR: A Second Order Spatial Compatibility for Efficient and Robust Point Cloud Registration
150
Citations
52
References
2022
Year
EngineeringGeometryPoint Cloud ProcessingRegistration PipelinePoint CloudLocalizationImage AnalysisData ScienceImage RegistrationEarly StageGeometry ProcessingGeometric ModelingMachine VisionComputer EngineeringComputer ScienceDeep LearningComputer VisionSpatial VerificationRobust ModelingNatural Sciences
In this paper, we present a second order spatial compat-ibility (SC <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sup> ) measure based method for efficient and robust point cloud registration (PCR), called SC <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sup> -PCR 1. Firstly, we propose a second order spatial compatibility (SC <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sup> ) mea-sure to compute the similarity between correspondences. It considers the global compatibility instead of local consis-tency, allowing for more distinctive clustering between in-liers and outliers at early stage. Based on this measure, our registration pipeline employs a global spectral technique to find some reliable seeds from the initial correspondences. Then we design a two-stage strategy to expand each seed to a consensus set based on the SC <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sup> measure matrix. Finally, we feed each consensus set to a weighted SVD algorithm to generate a candidate rigid transformation and select the best model as the final result. Our method can guarantee to find a certain number of outlier-free consensus sets using fewer samplings, making the model estimation more ef-ficient and robust. In addition, the proposed SC <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sup> measure is general and can be easily plugged into deep learning based frameworks. Extensive experiments are carried out to in-vestigate the performance of our method.
| Year | Citations | |
|---|---|---|
Page 1
Page 1