Quality-controlled registration of urban MLS point clouds reducing drift effects by adaptive fragmentation

• URL: http://arxiv.org/abs/2510.23416v1
• Date: Mon, 27 Oct 2025 15:21:39 GMT
• Title: Quality-controlled registration of urban MLS point clouds reducing drift effects by adaptive fragmentation
• Abstract summary: This study presents a novel workflow designed to efficiently and accurately register large-scale mobile laser scanning (MLS) point clouds to a target model point cloud in urban street scenarios.<n>This workflow specifically targets the complexities inherent in urban environments and adeptly addresses the challenges of integrating point clouds.<n> Experiments on real-world datasets from Munich's inner city demonstrate that our workflow achieves sub-0.01 m average registration accuracy while significantly shortening processing times.
• Score: 0.9964444449309532
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: This study presents a novel workflow designed to efficiently and accurately register large-scale mobile laser scanning (MLS) point clouds to a target model point cloud in urban street scenarios. This workflow specifically targets the complexities inherent in urban environments and adeptly addresses the challenges of integrating point clouds that vary in density, noise characteristics, and occlusion scenarios, which are common in bustling city centers. Two methodological advancements are introduced. First, the proposed Semi-sphere Check (SSC) preprocessing technique optimally fragments MLS trajectory data by identifying mutually orthogonal planar surfaces. This step reduces the impact of MLS drift on the accuracy of the entire point cloud registration, while ensuring sufficient geometric features within each fragment to avoid local minima. Second, we propose Planar Voxel-based Generalized Iterative Closest Point (PV-GICP), a fine registration method that selectively utilizes planar surfaces within voxel partitions. This pre-process strategy not only improves registration accuracy but also reduces computation time by more than 50% compared to conventional point-to-plane ICP methods. Experiments on real-world datasets from Munich's inner city demonstrate that our workflow achieves sub-0.01 m average registration accuracy while significantly shortening processing times. The results underscore the potential of the proposed methods to advance automated 3D urban modeling and updating, with direct applications in urban planning, infrastructure management, and dynamic city monitoring.

Related papers

• An Efficient and Effective Architecture for Large-Scale Traffic Prediction via Geometry-Adaptive Square Partitioning [21.25554012711633]
  Square Partition is a geometry algorithm that partitions massive traffic sensors into balanced, non-overlapping spatial regions.<n>HLI is a module that abandons the costly attention mechanisms commonly used in Transformer-based deployment,temporal-temporal models.
  arXiv  Detail & Related papers  (2026-06-19T03:41:12Z)
• Micro-Structures Graph-Based Point Cloud Registration for Balancing Efficiency and Accuracy [5.70403503863614]
  We propose a novel micro-structures graph-based global point cloud registration method. Our proposed method performs well on the 3DMatch and ETH datasets.
  arXiv  Detail & Related papers  (2024-10-29T08:36:23Z)
• OPUS: Occupancy Prediction Using a Sparse Set [64.60854562502523]
  We present a framework to simultaneously predict occupied locations and classes using a set of learnable queries. OPUS incorporates a suite of non-trivial strategies to enhance model performance. Our lightest model achieves superior RayIoU on the Occ3D-nuScenes dataset at near 2x FPS, while our heaviest model surpasses previous best results by 6.1 RayIoU.
  arXiv  Detail & Related papers  (2024-09-14T07:44:22Z)
• Improving Gaussian Splatting with Localized Points Management [52.009874685460694]
  Localized Point Management (LPM) is capable of identifying those error-contributing zones in greatest need for both point addition and geometry calibration.<n>LPM applies point densification in the identified zones and then reset the opacity of the points in front of these regions, creating a new opportunity to correct poorly conditioned points.<n> Notably, LPM improves both static 3DGS and dynamic SpaceTimeGS to achieve state-of-the-art rendering quality while retaining real-time speeds.
  arXiv  Detail & Related papers  (2024-06-06T16:55:07Z)
• MEDPNet: Achieving High-Precision Adaptive Registration for Complex Die Castings [10.504847830252254]
  This paper proposes a high-precision adaptive registration method called Multiscale Efficient Deep Closest Point (MEDPNet) The MEDPNet method performs coarse die-casting point cloud data registration using the Efficient-DCP method, followed by precision registration using the Multiscale feature fusion dual-channel registration (MDR) method. Our proposed method demonstrates excellent performance compared to state-of-the-art geometric and learning-based registration methods when applied to complex die-casting point cloud data.
  arXiv  Detail & Related papers  (2024-03-15T03:42:38Z)
• DIPR: Efficient Point Cloud Registration via Dynamic Iteration [4.491867613612359]
  We introduce a novel Efficient Point Cloud Registration via Dynamic It framework, DIPR, that makes the neural network interactively focus on overlapping points based on sparser input points. Our proposed approach achieves superior registration accuracy while significantly reducing computational time and GPU memory consumption compared to state-of-the-art methods.
  arXiv  Detail & Related papers  (2023-12-05T16:47:46Z)
• Quadric Representations for LiDAR Odometry, Mapping and Localization [93.24140840537912]
  Current LiDAR odometry, mapping and localization methods leverage point-wise representations of 3D scenes. We propose a novel method of describing scenes using quadric surfaces, which are far more compact representations of 3D objects. Our method maintains low latency and memory utility while achieving competitive, and even superior, accuracy.
  arXiv  Detail & Related papers  (2023-04-27T13:52:01Z)
• CloudAttention: Efficient Multi-Scale Attention Scheme For 3D Point Cloud Learning [81.85951026033787]
  We set transformers in this work and incorporate them into a hierarchical framework for shape classification and part and scene segmentation. We also compute efficient and dynamic global cross attentions by leveraging sampling and grouping at each iteration. The proposed hierarchical model achieves state-of-the-art shape classification in mean accuracy and yields results on par with the previous segmentation methods.
  arXiv  Detail & Related papers  (2022-07-31T21:39:15Z)
• RMS-FlowNet: Efficient and Robust Multi-Scale Scene Flow Estimation for Large-Scale Point Clouds [13.62166506575236]
  RMS-FlowNet is a novel end-to-end learning-based architecture for accurate and efficient scene flow estimation. We show that our model presents a competitive ability to generalize towards the real-world scenes of KITTI data set without fine-tuning.
  arXiv  Detail & Related papers  (2022-04-01T11:02:58Z)
• Learning Semantic Segmentation of Large-Scale Point Clouds with Random Sampling [52.464516118826765]
  We introduce RandLA-Net, an efficient and lightweight neural architecture to infer per-point semantics for large-scale point clouds. The key to our approach is to use random point sampling instead of more complex point selection approaches. Our RandLA-Net can process 1 million points in a single pass up to 200x faster than existing approaches.
  arXiv  Detail & Related papers  (2021-07-06T05:08:34Z)
• LSG-CPD: Coherent Point Drift with Local Surface Geometry for Point Cloud Registration [1.8876415010297891]
  We propose a novel method called CPD with Local Surface Geometry (LSG-CPD) for rigid point cloud registration. Our method adaptively adds different levels of point-to-plane penalization on top of the point-to-point penalization based on the flatness of the local surface. It is significantly faster than modern implementations of CPD.
  arXiv  Detail & Related papers  (2021-03-28T03:46:41Z)
• SoftPoolNet: Shape Descriptor for Point Cloud Completion and Classification [93.54286830844134]
  We propose a method for 3D object completion and classification based on point clouds. For the decoder stage, we propose regional convolutions, a novel operator aimed at maximizing the global activation entropy. We evaluate our approach on different 3D tasks such as object completion and classification, achieving state-of-the-art accuracy.
  arXiv  Detail & Related papers  (2020-08-17T14:32:35Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.