Demo Data from VLDB 2026 / reviewers in the wild / expert
Radouane Ait Jellal
dblp:154/7281
· DBLP profile ↗
1ranked-venue papers
1as first author
0since 2021 · last 2017
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1 · 1 first-authorSystems, architecture and hardware · 1 · 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 · 100% |
Topics — the 2 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Computer vision › 3D vision › stereo vision › stereo matching
dense stereo matching |
0.3 | 1 | 2017 | LS-ELAS: Line segment based efficient large scale stereo matching · ICRA 2017 |
Computer vision › 3D vision › stereo vision
stereo matching |
0.3 | 1 | 2017 | LS-ELAS: Line segment based efficient large scale stereo matching · ICRA 2017 |
Methods — techniques the papers use, named apart from their topics
line segments · 0.3constrained delaunay triangulation · 0.3bayesian inference · 0.3
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2017 | LS-ELAS: Line segment based efficient large scale stereo matchingabstractWe present LS-ELAS, a line segment extension to the ELAS algorithm, which increases the performance and robustness. LS-ELAS is a binocular dense stereo matching algorithm, which computes the disparities in constant time for most of the pixels in the image and in linear time for a small subset of the pixels (support points). Our approach is based on line segments to determine the support points instead of uniformly selecting them over the image range. This way we find very informative support points which preserve the depth discontinuity. The prior of our Bayesian stereo matching method is based on a set of line segments and a set of support points. Both sets are given to a constrained Delaunay triangulation to generate a triangulation mesh which is aware of possible depth discontinuities. We further increased the accuracy by using an adaptive method to sample candidate points along edge segments. We evaluated our algorithm on the Middlebury benchmark. Radouane Ait Jellal, Manuel Lange, Benjamin Wassermann, Andreas Schilling 0001, Andreas Zell |
ICRA | 1 |