TY - GEN
T1 - Improving Point Cloud Registration with Spatial Regularization
AU - Ringdahl, Ola
AU - Kurtser, Polina
N1 - Publisher Copyright:
© 2025 IEEE.
PY - 2025/1/1
Y1 - 2025/1/1
N2 - This paper proposes a Total Variation (TV)-based spatial regularization term aimed at enhancing point-to-point iterative rigid pairwise point cloud registration through match weighing. Incorporating a TV-based penalty into the registration cost function promotes spatial smoothness and penalizes poor matches during each iteration. We evaluate the performance of our method on the Stanford Bunny dataset for qualitative analysis and the TUM RGB-D SLAM dataset for quantitative analysis. Our results demonstrate improved registration accuracy and faster convergence rates compared to conventional ICP-based methods. Specifically, our method achieves an average rotation error er = 0.69° and a translation error et = 0.022m, without using any color information. Furthermore, we show that the proposed spatial regularization term can be combined with a variety of fidelity terms when determining the transformation, suggesting that this method can be extended to enhance a wide range of state-of-the-art registration algorithms.
AB - This paper proposes a Total Variation (TV)-based spatial regularization term aimed at enhancing point-to-point iterative rigid pairwise point cloud registration through match weighing. Incorporating a TV-based penalty into the registration cost function promotes spatial smoothness and penalizes poor matches during each iteration. We evaluate the performance of our method on the Stanford Bunny dataset for qualitative analysis and the TUM RGB-D SLAM dataset for quantitative analysis. Our results demonstrate improved registration accuracy and faster convergence rates compared to conventional ICP-based methods. Specifically, our method achieves an average rotation error er = 0.69° and a translation error et = 0.022m, without using any color information. Furthermore, we show that the proposed spatial regularization term can be combined with a variety of fidelity terms when determining the transformation, suggesting that this method can be extended to enhance a wide range of state-of-the-art registration algorithms.
UR - https://www.scopus.com/pages/publications/105018204435
U2 - 10.1109/ECMR65884.2025.11163250
DO - 10.1109/ECMR65884.2025.11163250
M3 - Conference contribution
AN - SCOPUS:105018204435
T3 - 2025 European Conference on Mobile Robots, ECMR 2025 - Proceedings
BT - 2025 European Conference on Mobile Robots, ECMR 2025 - Proceedings
A2 - Gasteratos, Antonios
A2 - Bellotto, Nicola
A2 - Tortora, Stefano
PB - Institute of Electrical and Electronics Engineers
T2 - 12th European Conference on Mobile Robots, ECMR 2025
Y2 - 2 September 2025 through 5 September 2025
ER -