Demo Data from SIGIR 2026 / reviewers in the wild / expert
Alexander Narr
dblp:123/6717
· DBLP profile ↗
2ranked-venue papers
1as first author
0since 2021 · last 2016
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 2 · 1 first-authorSystems, architecture and hardware · 2 · 1 first-author
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Artificial intelligence
1 paper |
3D vision · 56% Efficient and distributed learning · 44% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Computer vision › 3D vision › 3d object recognition
3d object classification |
0.2 | 1 | 2016 | Stream-based Active Learning for efficient and adaptive classification of 3D objects · ICRA 2016 |
Machine learning › Efficient and distributed learning › active learning › active data collection
stream-based active learning |
0.2 | 1 | 2016 | Stream-based Active Learning for efficient and adaptive classification of 3D objects · ICRA 2016 |
Computer vision › 3D vision › point cloud analysis
point cloud classification |
0.1 | 1 | 2016 | Stream-based Active Learning for efficient and adaptive classification of 3D objects · ICRA 2016 |
Methods — techniques the papers use, named apart from their topics
random forest · 0.2mondrian forest · 0.2decision tree · 0.2
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2016 | Stream-based Active Learning for efficient and adaptive classification of 3D objectsabstractWe present a new Active Learning approach for classifying objects from streams of 3D point cloud data. The major problems here are the non-uniform occurrence of class instances and the unbalanced numbers of samples per class. We show that standard online learning methods based on decision trees perform comparably bad for such data streams, which are however particularly relevant for mobile robots that need to learn semantics persistently. To address this, we use Mondrian forests (MF), a recent online learning algorithm that is independent on the data order. We present an extension of that algorithm and show that MF are less overconfident than standard Random Forests. In experiments on the KITTI benchmark, we show that this leads to a substantially improved classification performance for data streams, rendering our approach very attractive for lifelong robot learning applications. Alexander Narr, Rudolph Triebel, Daniel Cremers |
ICRA | 1 |
| 2012 | Next-best-scan planning for autonomous 3D modelingabstractWe present a next-best-scan (NBS) planning approach for autonomous 3D modeling. The system successively completes a 3D model from complex shaped objects by iteratively selecting a NBS based on previously acquired data. For this purpose, new range data is accumulated in-the-loop into a 3D surface (streaming reconstruction) and new continuous scan paths along the estimated surface trend are generated. Further, the space around the object is explored using a probabilistic exploration approach that considers sensor uncertainty. This allows for collision free path planning in order to completely scan unknown objects. For each scan path, the expected information gain is determined and the best path is selected as NBS. The presented NBS approach is tested with a laser striper system, attached to an industrial robot. The results are compared to state-of-the-art next-best-view methods. Our results show promising performance with respect to completeness, quality and scan time. Simon Kriegel, Christian Rink, Tim Bodenmüller, Alexander Narr, Michael Suppa, Gerd Hirzinger |
IROS | 4 |