Pith. sign in

SARNet: Semantic Augmented Registration of Large-Scale Urban Point Clouds

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it
abstract

Registering urban point clouds is a quite challenging task due to the large-scale, noise and data incompleteness of LiDAR scanning data. In this paper, we propose SARNet, a novel semantic augmented registration network aimed at achieving efficient registration of urban point clouds at city scale. Different from previous methods that construct correspondences only in the point-level space, our approach fully exploits semantic features as assistance to improve registration accuracy. Specifically, we extract per-point semantic labels with advanced semantic segmentation networks and build a prior semantic part-to-part correspondence. Then we incorporate the semantic information into a learning-based registration pipeline, consisting of three core modules: a semantic-based farthest point sampling module to efficiently filter out outliers and dynamic objects; a semantic-augmented feature extraction module for learning more discriminative point descriptors; a semantic-refined transformation estimation module that utilizes prior semantic matching as a mask to refine point correspondences by reducing false matching for better convergence. We evaluate the proposed SARNet extensively by using real-world data from large regions of urban scenes and comparing it with alternative methods. The code is available at https://github.com/WinterCodeForEverything/SARNet.

citation-role summary

background 1

citation-polarity summary

fields

cs.CV 1

years

2025 1

verdicts

CONDITIONAL 1

roles

background 1

polarities

unclear 1

representative citing papers

citing papers explorer

Showing 1 of 1 citing paper.

  • TurboReg: TurboClique for Robust and Efficient Point Cloud Registration cs.CV · 2025-07-02 · conditional · none · ref 28 · internal anchor

    TurboReg estimates 3D transformations from fixed-size three-match cliques in a tightly constrained compatibility graph, found by a linear-time pivot-guided search, matching or beating maximal clique methods at far higher speed.