AICVAug 13, 2017

Belief Tree Search for Active Object Recognition

arXiv:1708.03901v11 citations
Originality Incremental advance
AI Analysis

This work addresses active object recognition for robotics or vision systems, offering a method with guarantees and improved accuracy, though it is incremental as it builds on existing POMDP and supervised learning techniques.

The paper tackles active object recognition by formulating it as a POMDP and using belief tree search to find near-optimal policies on training data, then transferring knowledge via an LSTM network, achieving higher recognition accuracy compared to guided policy search and improving test performance by optimizing the observation function.

Active Object Recognition (AOR) has been approached as an unsupervised learning problem, in which optimal trajectories for object inspection are not known and are to be discovered by reducing label uncertainty measures or training with reinforcement learning. Such approaches have no guarantees of the quality of their solution. In this paper, we treat AOR as a Partially Observable Markov Decision Process (POMDP) and find near-optimal policies on training data using Belief Tree Search (BTS) on the corresponding belief Markov Decision Process (MDP). AOR then reduces to the problem of knowledge transfer from near-optimal policies on training set to the test set. We train a Long Short Term Memory (LSTM) network to predict the best next action on the training set rollouts. We sho that the proposed AOR method generalizes well to novel views of familiar objects and also to novel objects. We compare this supervised scheme against guided policy search, and find that the LSTM network reaches higher recognition accuracy compared to the guided policy method. We further look into optimizing the observation function to increase the total collected reward of optimal policy. In AOR, the observation function is known only approximately. We propose a gradient-based method update to this approximate observation function to increase the total reward of any policy. We show that by optimizing the observation function and retraining the supervised LSTM network, the AOR performance on the test set improves significantly.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes