Instant Domain Augmentation for LiDAR Semantic Segmentation

Kwonyoung Ryu, Soonmin Hwang, Jaesik Park
2/14/2026

No confident code implementation found for this paper. 2 possible matches can be shown below.

Abstract

Despite the increasing popularity of LiDAR sensors, perception algorithms using 3D LiDAR data struggle with the sensor-bias problem. Specifically, the performance of perception algorithms significantly drops when an unseen specification of the LiDAR sensor is applied at test time due to the domain discrepancy. This paper presents a fast and flexible LiDAR augmentation method for the semantic segmentation task called LiDomAug. It aggregates raw LiDAR scans and creates a LiDAR scan of any configurations with the consideration of dynamic distortion and occlusion, resulting in instant domain augmentation. Our on-demand augmentation module runs at 330 FPS, so it can be seamlessly integrated into the data loader in the learning framework. In our experiments, learning-based approaches aided with the proposed LiDomAug are less affected by the sensor-bias issue and achieve new state-of-the-art domain adaptation performances on SemanticKITTI and nuScenes dataset without the use of the target domain data. We also present a sensor-agnostic model that faithfully works on the various LiDAR configurations.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 2 weaker matches are hidden by default — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{ryu2026instant,
  title  = {Instant Domain Augmentation for LiDAR Semantic Segmentation},
  author = {Kwonyoung Ryu and Soonmin Hwang and Jaesik Park},
  year   = {2026},
  eprint = {2303.14378},
  archivePrefix = {arXiv},
  url    = {https://arxiv.org/pdf/2303.14378},
  journal = {CVPR 2023 2023}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2303.14378.svg)](https://codeofpaper.com/paper/2303.14378)

Discussion