Discwise Active Learning for LiDAR Semantic Segmentation
- URL: http://arxiv.org/abs/2309.13276v1
- Date: Sat, 23 Sep 2023 06:08:22 GMT
- Title: Discwise Active Learning for LiDAR Semantic Segmentation
- Authors: Ozan Unal and Dengxin Dai and Ali Tamer Unal and Luc Van Gool
- Abstract summary: Active learning (AL) provides a solution that can iteratively and intelligently label a dataset.
We propose a discwise approach (DiAL) where in each iteration, we query the region a single frame covers on global coordinates, labeling all frames simultaneously.
- Score: 92.92714645987083
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: While LiDAR data acquisition is easy, labeling for semantic segmentation
remains highly time consuming and must therefore be done selectively. Active
learning (AL) provides a solution that can iteratively and intelligently label
a dataset while retaining high performance and a low budget. In this work we
explore AL for LiDAR semantic segmentation. As a human expert is a component of
the pipeline, a practical framework must consider common labeling techniques
such as sequential labeling that drastically improve annotation times. We
therefore propose a discwise approach (DiAL), where in each iteration, we query
the region a single frame covers on global coordinates, labeling all frames
simultaneously. We then tackle the two major challenges that emerge with
discwise AL. Firstly we devise a new acquisition function that takes 3D point
density changes into consideration which arise due to location changes or
ego-vehicle motion. Next we solve a mixed-integer linear program that provides
a general solution to the selection of multiple frames while taking into
consideration the possibilities of disc intersections. Finally we propose a
semi-supervised learning approach to utilize all frames within our dataset and
improve performance.
Related papers
- A Data-efficient Framework for Robotics Large-scale LiDAR Scene Parsing [10.497309421830671]
Existing state-of-the-art 3D point clouds understanding methods only perform well in a fully supervised manner.
This work presents a general and simple framework to tackle point clouds understanding when labels are limited.
arXiv Detail & Related papers (2023-12-03T02:38:51Z) - ElC-OIS: Ellipsoidal Clustering for Open-World Instance Segmentation on
LiDAR Data [13.978966783993146]
Open-world Instance (OIS) is a challenging task that aims to accurately segment every object instance appearing in the current observation.
This is important for safety-critical applications such as robust autonomous navigation.
We present a flexible and effective OIS framework for LiDAR point cloud that can accurately segment both known and unknown instances.
arXiv Detail & Related papers (2023-03-08T03:22:11Z) - LESS: Label-Efficient Semantic Segmentation for LiDAR Point Clouds [62.49198183539889]
We propose a label-efficient semantic segmentation pipeline for outdoor scenes with LiDAR point clouds.
Our method co-designs an efficient labeling process with semi/weakly supervised learning.
Our proposed method is even highly competitive compared to the fully supervised counterpart with 100% labels.
arXiv Detail & Related papers (2022-10-14T19:13:36Z) - Image Understands Point Cloud: Weakly Supervised 3D Semantic
Segmentation via Association Learning [59.64695628433855]
We propose a novel cross-modality weakly supervised method for 3D segmentation, incorporating complementary information from unlabeled images.
Basically, we design a dual-branch network equipped with an active labeling strategy, to maximize the power of tiny parts of labels.
Our method even outperforms the state-of-the-art fully supervised competitors with less than 1% actively selected annotations.
arXiv Detail & Related papers (2022-09-16T07:59:04Z) - Warm Start Active Learning with Proxy Labels \& Selection via
Semi-Supervised Fine-Tuning [10.086685855244664]
We propose two novel strategies for active learning (AL) specifically for 3D image segmentation.
First, we tackle the cold start problem by proposing a proxy task and then utilizing uncertainty generated from the proxy task to rank the unlabeled data to be annotated.
Second, we craft a two-stage learning framework for each active iteration where the unlabeled data is also used in the second stage as a semi-supervised fine-tuning strategy.
arXiv Detail & Related papers (2022-09-13T20:21:40Z) - Collaborative Propagation on Multiple Instance Graphs for 3D Instance
Segmentation with Single-point Supervision [63.429704654271475]
We propose a novel weakly supervised method RWSeg that only requires labeling one object with one point.
With these sparse weak labels, we introduce a unified framework with two branches to propagate semantic and instance information.
Specifically, we propose a Cross-graph Competing Random Walks (CRW) algorithm that encourages competition among different instance graphs.
arXiv Detail & Related papers (2022-08-10T02:14:39Z) - Dual-Refinement: Joint Label and Feature Refinement for Unsupervised
Domain Adaptive Person Re-Identification [51.98150752331922]
Unsupervised domain adaptive (UDA) person re-identification (re-ID) is a challenging task due to the missing of labels for the target domain data.
We propose a novel approach, called Dual-Refinement, that jointly refines pseudo labels at the off-line clustering phase and features at the on-line training phase.
Our method outperforms the state-of-the-art methods by a large margin.
arXiv Detail & Related papers (2020-12-26T07:35:35Z) - Few-shot 3D Point Cloud Semantic Segmentation [138.80825169240302]
We propose a novel attention-aware multi-prototype transductive few-shot point cloud semantic segmentation method.
Our proposed method shows significant and consistent improvements compared to baselines in different few-shot point cloud semantic segmentation settings.
arXiv Detail & Related papers (2020-06-22T08:05:25Z)
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.