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

Takeshi Ueda

dblp:23/5127 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 2009
—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 · 1Graphics, computer vision, multimedia, augmented reality and games · 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
Robot navigation and mapping · 100%

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

TopicWeightPapersLastEvidence papers
Robotics › Robot navigation and mapping › localization
appearance-based localization
0.112009
LSH-RANSAC: An incremental scheme for scalable localization · ICRA 2009
Robotics › Robot navigation and mapping
localization
0.112009
LSH-RANSAC: An incremental scheme for scalable localization · ICRA 2009
Robotics › Robot navigation and mapping
SLAM
0.112009
LSH-RANSAC: An incremental scheme for scalable localization · ICRA 2009

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

locality-sensitive hashing · 0.1RANSAC · 0.1
YearPublicationVenuePosition
2009 LSH-RANSAC: An incremental scheme for scalable localization
abstract
This paper addresses the problem of feature-based robot localization in large-size environments. With recent progress in SLAM techniques, it has become crucial for a robot to estimate the self-position in real-time with respect to a large-size map that can be incrementally build by other mapper robots. Self-localization using large-size maps have been studied in literature, but most of them assume that a complete map is given prior to the self-localization task. In this paper, we present a novel scheme for robot localization as well as map representation that can successfully work with large-size and incremental maps. This work combines our two previous works on incremental methods, iLSH and iRANSAC, for appearance-based and position-based localization.
Kenichi Saeki, Kanji Tanaka 0003, Takeshi Ueda
ICRA3
2008 On the scalability of robot localization using high-dimensional features
abstract
This study provides an investigation of scalability of mobile robot localization. In recent years, inference algorithms based on map-matching have proved their superior performance in large-scale environments. In this paper, the scalability is augmented by an ANN retrieval of high-dimensional descriptive features. The proposed algorithm is then exhaustively evaluated using large-size real maps, including over 100K feature maps.
Takeshi Ueda, Kanji Tanaka 0003
ICPR1