TY - JOUR
T1 - Fast Descriptors and Correspondence Propagation for Robust Global Point Cloud Registration
AU - Lei, Huan
AU - Jiang, Guang
AU - Quan, Long
N1 - Publisher Copyright:
© 2017 IEEE.
PY - 2017/8
Y1 - 2017/8
N2 - In this paper, we present a robust global approach for point cloud registration from uniformly sampled points. Based on eigenvalues and normals computed from multiple scales, we design fast descriptors to extract local structures of these points. The eigenvalue-based descriptor is effective at finding seed matches with low precision using nearest neighbor search. Generally, recovering the transformation from matches with low precision is rather challenging. Therefore, we introduce a mechanism named correspondence propagation to aggregate each seed match into a set of numerous matches. With these sets of matches, multiple transformations between point clouds are computed. A quality function formulated from distance errors is used to identify the best transformation and fulfill a coarse alignment of the point clouds. Finally, we refine the alignment result with the trimmed iterative closest point algorithm. The proposed approach can be applied to register point clouds with significant or limited overlaps and small or large transformations. More encouragingly, it is rather efficient and very robust to noise. A comparison to traditional descriptor-based methods and other global algorithms demonstrates the fine performance of the proposed approach. We also show its promising application in large-scale reconstruction with the scans of two real scenes. In addition, the proposed approach can be used to register low-resolution point clouds captured by Kinect as well.
AB - In this paper, we present a robust global approach for point cloud registration from uniformly sampled points. Based on eigenvalues and normals computed from multiple scales, we design fast descriptors to extract local structures of these points. The eigenvalue-based descriptor is effective at finding seed matches with low precision using nearest neighbor search. Generally, recovering the transformation from matches with low precision is rather challenging. Therefore, we introduce a mechanism named correspondence propagation to aggregate each seed match into a set of numerous matches. With these sets of matches, multiple transformations between point clouds are computed. A quality function formulated from distance errors is used to identify the best transformation and fulfill a coarse alignment of the point clouds. Finally, we refine the alignment result with the trimmed iterative closest point algorithm. The proposed approach can be applied to register point clouds with significant or limited overlaps and small or large transformations. More encouragingly, it is rather efficient and very robust to noise. A comparison to traditional descriptor-based methods and other global algorithms demonstrates the fine performance of the proposed approach. We also show its promising application in large-scale reconstruction with the scans of two real scenes. In addition, the proposed approach can be used to register low-resolution point clouds captured by Kinect as well.
KW - Point cloud registration
KW - correspondence propagation
KW - match
UR - https://www.webofscience.com/wos/woscc/full-record/WOS:000402726000001
UR - https://openalex.org/W2610614679
UR - https://www.scopus.com/pages/publications/85028350568
U2 - 10.1109/TIP.2017.2700727
DO - 10.1109/TIP.2017.2700727
M3 - Journal Article
C2 - 28475056
SN - 1057-7149
VL - 26
SP - 3614
EP - 3623
JO - IEEE Transactions on Image Processing
JF - IEEE Transactions on Image Processing
IS - 8
M1 - 7918612
ER -