Cargando…
Multimodal Hierarchical Dirichlet Process-Based Active Perception by a Robot
In this paper, we propose an active perception method for recognizing object categories based on the multimodal hierarchical Dirichlet process (MHDP). The MHDP enables a robot to form object categories using multimodal information, e.g., visual, auditory, and haptic information, which can be observe...
Autores principales: | , , |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Frontiers Media S.A.
2018
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5972223/ https://www.ncbi.nlm.nih.gov/pubmed/29872389 http://dx.doi.org/10.3389/fnbot.2018.00022 |
_version_ | 1783326396822585344 |
---|---|
author | Taniguchi, Tadahiro Yoshino, Ryo Takano, Toshiaki |
author_facet | Taniguchi, Tadahiro Yoshino, Ryo Takano, Toshiaki |
author_sort | Taniguchi, Tadahiro |
collection | PubMed |
description | In this paper, we propose an active perception method for recognizing object categories based on the multimodal hierarchical Dirichlet process (MHDP). The MHDP enables a robot to form object categories using multimodal information, e.g., visual, auditory, and haptic information, which can be observed by performing actions on an object. However, performing many actions on a target object requires a long time. In a real-time scenario, i.e., when the time is limited, the robot has to determine the set of actions that is most effective for recognizing a target object. We propose an active perception for MHDP method that uses the information gain (IG) maximization criterion and lazy greedy algorithm. We show that the IG maximization criterion is optimal in the sense that the criterion is equivalent to a minimization of the expected Kullback–Leibler divergence between a final recognition state and the recognition state after the next set of actions. However, a straightforward calculation of IG is practically impossible. Therefore, we derive a Monte Carlo approximation method for IG by making use of a property of the MHDP. We also show that the IG has submodular and non-decreasing properties as a set function because of the structure of the graphical model of the MHDP. Therefore, the IG maximization problem is reduced to a submodular maximization problem. This means that greedy and lazy greedy algorithms are effective and have a theoretical justification for their performance. We conducted an experiment using an upper-torso humanoid robot and a second one using synthetic data. The experimental results show that the method enables the robot to select a set of actions that allow it to recognize target objects quickly and accurately. The numerical experiment using the synthetic data shows that the proposed method can work appropriately even when the number of actions is large and a set of target objects involves objects categorized into multiple classes. The results support our theoretical outcomes. |
format | Online Article Text |
id | pubmed-5972223 |
institution | National Center for Biotechnology Information |
language | English |
publishDate | 2018 |
publisher | Frontiers Media S.A. |
record_format | MEDLINE/PubMed |
spelling | pubmed-59722232018-06-05 Multimodal Hierarchical Dirichlet Process-Based Active Perception by a Robot Taniguchi, Tadahiro Yoshino, Ryo Takano, Toshiaki Front Neurorobot Neuroscience In this paper, we propose an active perception method for recognizing object categories based on the multimodal hierarchical Dirichlet process (MHDP). The MHDP enables a robot to form object categories using multimodal information, e.g., visual, auditory, and haptic information, which can be observed by performing actions on an object. However, performing many actions on a target object requires a long time. In a real-time scenario, i.e., when the time is limited, the robot has to determine the set of actions that is most effective for recognizing a target object. We propose an active perception for MHDP method that uses the information gain (IG) maximization criterion and lazy greedy algorithm. We show that the IG maximization criterion is optimal in the sense that the criterion is equivalent to a minimization of the expected Kullback–Leibler divergence between a final recognition state and the recognition state after the next set of actions. However, a straightforward calculation of IG is practically impossible. Therefore, we derive a Monte Carlo approximation method for IG by making use of a property of the MHDP. We also show that the IG has submodular and non-decreasing properties as a set function because of the structure of the graphical model of the MHDP. Therefore, the IG maximization problem is reduced to a submodular maximization problem. This means that greedy and lazy greedy algorithms are effective and have a theoretical justification for their performance. We conducted an experiment using an upper-torso humanoid robot and a second one using synthetic data. The experimental results show that the method enables the robot to select a set of actions that allow it to recognize target objects quickly and accurately. The numerical experiment using the synthetic data shows that the proposed method can work appropriately even when the number of actions is large and a set of target objects involves objects categorized into multiple classes. The results support our theoretical outcomes. Frontiers Media S.A. 2018-05-22 /pmc/articles/PMC5972223/ /pubmed/29872389 http://dx.doi.org/10.3389/fnbot.2018.00022 Text en Copyright © 2018 Taniguchi, Yoshino and Takano. http://creativecommons.org/licenses/by/4.0/ This is an open-access article distributed under the terms of the Creative Commons Attribution License (CC BY). The use, distribution or reproduction in other forums is permitted, provided the original author(s) and the copyright owner are credited and that the original publication in this journal is cited, in accordance with accepted academic practice. No use, distribution or reproduction is permitted which does not comply with these terms. |
spellingShingle | Neuroscience Taniguchi, Tadahiro Yoshino, Ryo Takano, Toshiaki Multimodal Hierarchical Dirichlet Process-Based Active Perception by a Robot |
title | Multimodal Hierarchical Dirichlet Process-Based Active Perception by a Robot |
title_full | Multimodal Hierarchical Dirichlet Process-Based Active Perception by a Robot |
title_fullStr | Multimodal Hierarchical Dirichlet Process-Based Active Perception by a Robot |
title_full_unstemmed | Multimodal Hierarchical Dirichlet Process-Based Active Perception by a Robot |
title_short | Multimodal Hierarchical Dirichlet Process-Based Active Perception by a Robot |
title_sort | multimodal hierarchical dirichlet process-based active perception by a robot |
topic | Neuroscience |
url | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5972223/ https://www.ncbi.nlm.nih.gov/pubmed/29872389 http://dx.doi.org/10.3389/fnbot.2018.00022 |
work_keys_str_mv | AT taniguchitadahiro multimodalhierarchicaldirichletprocessbasedactiveperceptionbyarobot AT yoshinoryo multimodalhierarchicaldirichletprocessbasedactiveperceptionbyarobot AT takanotoshiaki multimodalhierarchicaldirichletprocessbasedactiveperceptionbyarobot |