Data squashing for HSV subimages by an autonomous mobile robot

Einoshin Suzuki, Emi Matsumoto, Asuki Kouno

Research output: Chapter in Book/Report/Conference proceedingConference contribution

7 Citations (Scopus)


In this paper, we propose a data index structure which is constructed by a small autonomous mobile robot so that it manages millions of subimages it takes during a navigation of dozens of minutes. The subimages are managed according to a similarity measure between a pair of subimages, which is based on a method for quantizing HSV colors. The data index structure has been inspired by the CF tree of BIRCH, which is an early work in data squashing, though care and inventions were necessary as the bins of HSV colors are highly correlated. We also propose an application for peculiar subimage detection by the robot, which exploits the data index structures for the current image and another one for all images in its navigation. Experiments conducted in a private office of about 25m 2 proved the feasibility of the data index structure and the effectiveness of the peculiar subimage detection.

Original languageEnglish
Title of host publicationDiscovery Science - 15th International Conference, DS 2012, Proceedings
Number of pages15
Publication statusPublished - 2012
Event15th International Conference on Discovery Science, DS 2012 - Lyon, France
Duration: Oct 29 2012Oct 31 2012

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume7569 LNAI
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Other15th International Conference on Discovery Science, DS 2012

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Data squashing for HSV subimages by an autonomous mobile robot'. Together they form a unique fingerprint.

Cite this