Abstract

Adaptive action selection is crucial for object recognition on robots with limited operating capabilities. It offers much desired flexibility in trading off between the costs of acquiring information and making robust and reliable inference under uncertainty. In this paper, we describe an information-theoretic framework that combines and unifies two common techniques: view planning for resolving ambiguities and occlusions and online feature selection for reducing computational costs. Concretely, our algorithm adaptively chooses two strategies: utilize simple-to-compute features that are the most informative for the recognition task or move to new viewpoints that optimally reduce the expected uncertainties on the identity of the object. Extensive empirical studies have validated the effectiveness of the proposed framework. On a large RGB-D dataset, dynamic feature selection alone reduces the computation time at runtime by five folds, and when combining it with viewpoint selection, we significantly increase the recognition accuracy on average by 8–15% absolute, compared to systems that do not use these two strategies. Lastly, we have also demonstrated successfully the effectiveness of the framework on a quadcopter platform with limited operating time.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.