The search functionality is under construction.
The search functionality is under construction.

Author Search Result

[Author] Kanji TANAKA(3hit)

1-3hit
  • LSH-RANSAC: Incremental Matching of Large-Size Maps

    Kanji TANAKA  Ken-ichi SAEKI  Mamoru MINAMI  Takeshi UEDA  

     
    PAPER-Artificial Intelligence and Cognitive Science

      Vol:
    E93-D No:2
      Page(s):
    326-334

    This paper presents a novel approach for robot localization using landmark maps. With recent progress in SLAM researches, it has become crucial for a robot to obtain and use large-size maps that are incrementally built by other mapper robots. Our localization approach successfully works with such incremental and large-size maps. In literature, RANSAC map-matching has been a promising approach for large-size maps. We extend the RANSAC map-matching so as to deal with incremental maps. We combine the incremental RANSAC with an incremental LSH database and develop a hybrid of the position-based and the appearance-based approaches. A series of experiments using radish dataset show promising results.

  • Dictionary-Based Map Compression for Sparse Feature Maps

    Kanji TANAKA  Tomomi NAGASAKA  

     
    PAPER-Pattern Recognition

      Vol:
    E95-D No:2
      Page(s):
    604-613

    Obtaining a compact representation of a large-size feature map built by mapper robots is a critical issue in recent mobile robotics. This “map compression” problem is explored from a novel perspective of dictionary-based data compression techniques in the paper. The primary contribution of the paper is the proposal of the dictionary-based map compression approach. A map compression system is presented by employing RANSAC map matching and sparse coding as building blocks. The effectiveness levels of the proposed techniques is investigated in terms of map compression ratio, compression speed, the retrieval performance of compressed/decompressed maps, as well as applications to the Kolmogorov complexity.

  • A Supervised Learning Approach to Robot Localization Using a Short-Range RFID Sensor

    Kanji TANAKA  Yoshihiko KIMURO  Kentaro YAMANO  Mitsuru HIRAYAMA  Eiji KONDO  Michihito MATSUMOTO  

     
    PAPER-Artificial Intelligence and Cognitive Science

      Vol:
    E90-D No:11
      Page(s):
    1762-1771

    This work is concerned with the problem of robot localization using standard RFID tags as landmarks and an RFID reader as a landmark sensor. A main advantage of such an RFID-based localization system is the availability of landmark ID measurement, which trivially solves the data association problem. While the main drawback of an RFID system is its low spatial accuracy. The result in this paper is an improvement of the localization accuracy for a standard short-range RFID sensor. One of the main contributions is a proposal of a machine learning approach in which multiple classifiers are trained to distinguish RFID-signal features of each location. Another contribution is a design tool for tag arrangement by which the tag configuration needs not be manually designed by the user, but can be automatically recommended by the system. The effectiveness of the proposed technique is evaluated experimentally with a real mobile robot and an RFID system.