Demo Data from EDBT 2026 / reviewers in the wild / expert
Kouichirou Ikeda
dblp:51/8370
· DBLP profile ↗
1ranked-venue papers
1as first author
0since 2021 · last 2010
—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 · 50% Robot navigation and mapping · 50% | |
| Databases, data mining, and information retrieval
1 paper |
Information retrieval · 100% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Robotics › Robot navigation and mapping › spatial representation
landmark representation |
0.1 | 1 | 2010 | Visual robot localization using compact binary landmarks · ICRA 2010 |
Computer vision › 3D vision
visual localization |
0.1 | 1 | 2010 | Visual robot localization using compact binary landmarks · ICRA 2010 |
Information retrieval
image retrieval |
0.0 | 1 | 2010 | Visual robot localization using compact binary landmarks · ICRA 2010 |
Information retrieval › similarity search
semantic hashing |
0.0 | 1 | 2010 | Visual robot localization using compact binary landmarks · ICRA 2010 |
Methods — techniques the papers use, named apart from their topics
semantic hashing · 0.2compact binary code · 0.2
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2010 | Visual robot localization using compact binary landmarksabstractThis paper is concerned with the problem of mobile robot localization using a novel compact representation of visual landmarks. With recent progress in lifelong map-learning as well as in information sharing networks, compact representation of a large-size landmark database has become crucial. In this paper, we propose a compact binary code (e.g. 32bit code) landmark representation by employing the semantic hashing technique from web-scale image retrieval. We show how well such a binary representation achieves compactness of a landmark database while maintaining efficiency of the localization system. In our contribution, we investigate the cost-performance, the semantic gap, the saliency evaluation using the presented techniques as well as challenge to further reduce the resources (#bits) per landmark. Experiments using a high-speed car-like robot show promising results. Kouichirou Ikeda, Kanji Tanaka 0003 |
ICRA | 1 |