Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Gerhard Mentges

dblp:119/5980 · DBLP profile ↗
← Back
3ranked-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-authorSecurity and privacy · 1

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
2 papers
3D vision · 83% Robot navigation and mapping · 17%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Computer vision › 3D vision › 3d reconstruction
surface reconstruction
0.422016
Surface reconstruction from image space adjacency of lines using breadth-first plane search · ICRA 2016
Maximally informative surface reconstruction from lines · ICRA 2014
Computer vision › 3D vision
image-based rendering
0.212016
Surface reconstruction from image space adjacency of lines using breadth-first plane search · ICRA 2016
Robotics › Robot navigation and mapping
environment mapping
0.212014
Maximally informative surface reconstruction from lines · ICRA 2014
Computer vision › 3D vision › 3d reconstruction
reconstruction
0.212014
Maximally informative surface reconstruction from lines · ICRA 2014
Computer vision › 3D vision › 3d reconstruction
multi-view reconstruction
0.112014
Maximally informative surface reconstruction from lines · ICRA 2014

Methods — techniques the papers use, named apart from their topics

breadth-first plane search · 0.2Line-SLAM · 0.2visibility constraints · 0.2plane hypothesis merging · 0.2occlusion check · 0.2
YearPublicationVenuePosition
2016 Surface reconstruction from image space adjacency of lines using breadth-first plane search
abstract
In this paper, we propose a novel multi-view method for surface reconstruction from matched line segments with applications to robotic mapping and image-based rendering. Starting from 3D line segments and poses obtained via Line-SLAM, we project segments from multiple frames into keyframes for image-space analysis. For each keyframe, a grid of image faces is created by optimized intersection of the segment projection lines. These faces define a segment adjacency graph, wherein we perform our Breadth-First Plane Search (BFPS). The found plane hypotheses are merged maximally with respect to a structure-preserving criterion by growing coplanar regions across the graph. Hypotheses violating the visibility constraint are discarded based on fast per-face and mostly nongeometrical evaluation of the scene and image graph. Finally, each image face gets back-projected onto an optimal plane to obtain a 3D surface model. The presented system is a complete and automatic solution suitable for mapping an environment in real-time scenarios like robotic exploration. We demonstrate the performance of our algorithm on several indoor scenes of varying complexity. Compared to a pure 3D analysis of segments, we see a speed-up by one to almost two orders of magnitude, while still improving on reconstruction accuracy.
Gerhard Mentges, Rolf-Rainer Grigat
ICRA1
2014 Maximally informative surface reconstruction from lines
abstract
In this paper, we propose a novel multi-view method for surface reconstruction from matched line segments with applications to robotic mapping and image-based rendering. Starting from 3D line segments, plane hypotheses are formed for all non-collinear and sufficiently coplanar segment pairs. The surface that is spanned by two segments is used to immediately prune hypotheses that do not pass a sight line occlusion check to keep the initial plane number tractable. After further merging, exhaustive intersections are computed in an efficient way to yield a maximally informative surface representation. Finally, robustified visibility constraints are used to recover a dense surface mesh that is a pessimistic representation of the free space, which is desirable for path planning applications. The presented system is a complete and automatic solution suitable for mapping an environment in realtime scenarios like robotic exploration. We demonstrate the performance of our algorithm on several indoor scenes with varying complexity.
Jonas Witt, Gerhard Mentges
ICRA2
2012 Self-stabilizing Local k-Placement of Replicas with Minimal Variance
Sven Köhler 0001, Volker Turau, Gerhard Mentges
SSS3