Distributed visual attention on a humanoid robot

Aleš Ude, Valentin Wyart, Li Heng Lin, Gordon Cheng

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

38 Scopus citations

Abstract

Complex visual processes such as visual attention are often computationally too expensive to allow real-time Implementation on a single computer. To solve this problem we study distributed computer architectures that enable us to divide complex tasks Into several smaller problems. In this paper we demonstrate how to Implement distributed visual attention system on a humanoid robot to achieve real-time operation at relatively high resolutions and frame rates. We start from a popular theory of bottom-up visual attention that assumes that Information across various modalities Is used for the early encoding of visual Information. Our system uses five different modalities Including color, Intensity, edges, stereo, and motion. We show how to distribute the attention processing on a computer cluster and study the Issues arising on such systems. The system was fully Implemented on a workstation cluster comprised of eight PCs. It was used to drive the gaze of a humanoid head towards potential regions of Interest.

Original languageEnglish
Title of host publicationProceedings of 2005 5th IEEE-RAS International Conference on Humanoid Robots
Pages381-386
Number of pages6
DOIs
StatePublished - 2005
Externally publishedYes
Event2005 5th IEEE-RAS International Conference on Humanoid Robots - Tsukuba, Japan
Duration: 5 Dec 20057 Dec 2005

Publication series

NameProceedings of 2005 5th IEEE-RAS International Conference on Humanoid Robots
Volume2005

Conference

Conference2005 5th IEEE-RAS International Conference on Humanoid Robots
Country/TerritoryJapan
CityTsukuba
Period5/12/057/12/05

Keywords

  • Distributed computing
  • Humanoid heads
  • Visual attention

Fingerprint

Dive into the research topics of 'Distributed visual attention on a humanoid robot'. Together they form a unique fingerprint.

Cite this