Robust Multiview Point Cloud Registration Using Algebraic Connectivity and Spatial Compatibility

In this article, a spectral method for multiview point cloud registration is presented. The primary challenge of existing multiview registration methods is to accurately estimate the weights of the pose graph. Previous multiview registration methods rely on predicting the overlap between pairs of point clouds to assign weights for pairwise transformation matrices. This global way may result in higher weights being assigned to pairs of point clouds that are structurally similar but actually have no or low overlap. In addition, the learning-based approach is biased for training scenarios. However, we obtain the weights by measuring the confidence of each correspondence used for the estimation of the pairwise transformation matrix. Specifically, we construct spatial compatibility matrices for the correspondences and compute the edge weights of the pose graphs using spectral decomposition (SD). Considering the compatibility between correspondences, the proposed method is robust to outliers. Simultaneously, to mitigate the disruption of outliers to the global pose estimation and enhance the computational efficiency, we propose an overlap score estimation method based on the algebraic connectivity of the graph for pruning of fully connected pose graphs. For the initial sparse pose graph, we apply iteratively reweighted least-squares (IRLS) to refine the global transformation and design a new reweighting function based on the historical weighted average (HWA). The nonlearning framework empowers the proposed method to have better generalization to unknown scenarios. The experimental results further validate the performance of our method which achieves about 12.9% and 21.4% lower rotation and translation errors on the ScanNet dataset compared to the state-of-the-art method. The source code is available at <uri xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">https://github.com/swccj/SMVR</uri>.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Geoscience and Remote Sensing
Published
2024-12-11
DOI
https://doi.org/10.1109/tgrs.2024.3515203
Citations
2
Primary Topic
Remote Sensing and LiDAR Applications
Type
article
Field-Weighted Citation Impact
0.41

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Robust Multiview Point Cloud Registration Using Algebraic Connectivity and Spatial Compatibility

Yanghong Lin, Tianyu Li, Shudong Zhou, Li Fang
2 citations
IEEE Transactions on Geoscience and Remote Sensing
Remote Sensing and LiDAR Applications
0.41
article

Robust Multiview Point Cloud Registration Using Algebraic Connectivity and Spatial Compatibility

Yanghong Lin, Tianyu Li, Shudong Zhou, Li Fang
article en
2 citations

Abstract

In this article, a spectral method for multiview point cloud registration is presented. The primary challenge of existing multiview registration methods is to accurately estimate the weights of the pose graph. Previous multiview registration methods rely on predicting the overlap between pairs of point clouds to assign weights for pairwise transformation matrices. This global way may result in higher weights being assigned to pairs of point clouds that are structurally similar but actually have no or low overlap. In addition, the learning-based approach is biased for training scenarios. However, we obtain the weights by measuring the confidence of each correspondence used for the estimation of the pairwise transformation matrix. Specifically, we construct spatial compatibility matrices for the correspondences and compute the edge weights of the pose graphs using spectral decomposition (SD). Considering the compatibility between correspondences, the proposed method is robust to outliers. Simultaneously, to mitigate the disruption of outliers to the global pose estimation and enhance the computational efficiency, we propose an overlap score estimation method based on the algebraic connectivity of the graph for pruning of fully connected pose graphs. For the initial sparse pose graph, we apply iteratively reweighted least-squares (IRLS) to refine the global transformation and design a new reweighting function based on the historical weighted average (HWA). The nonlearning framework empowers the proposed method to have better generalization to unknown scenarios. The experimental results further validate the performance of our method which achieves about 12.9% and 21.4% lower rotation and translation errors on the ScanNet dataset compared to the state-of-the-art method. The source code is available at <uri xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">https://github.com/swccj/SMVR</uri>.

IEEE Transactions on Geoscience and Remote SensingVol. 63
Chinese Academy of Sciences (CN), Quanzhou Institute of Equipment Manufacturing Haixi Institute (CN)
National Natural Science Foundation of China
Openalex Percentile: Top 40%
Remote Sensing and LiDAR Applications
0.41
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.