2013 Information Theory and Applications Workshop (ITA) 2013
DOI: 10.1109/ita.2013.6502995
|View full text |Cite
|
Sign up to set email alerts
|

Control recognition bounds for visual learning and exploration

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
15
0

Year Published

2013
2013
2019
2019

Publication Types

Select...
5
3

Relationship

0
8

Authors

Journals

citations
Cited by 12 publications
(15 citation statements)
references
References 23 publications
0
15
0
Order By: Relevance
“…Work addressing the multi-view case [16], [17] has shown that merging data from different views leads to improved results, but also highlights the importance of viewpoint selection. From a theoretical perspective, [18] provides a mathematical description of the tradeoff between recognition and planning, which serves as a justification for active viewpoint selection as we explore here.…”
Section: Related Workmentioning
confidence: 99%
“…Work addressing the multi-view case [16], [17] has shown that merging data from different views leads to improved results, but also highlights the importance of viewpoint selection. From a theoretical perspective, [18] provides a mathematical description of the tradeoff between recognition and planning, which serves as a justification for active viewpoint selection as we explore here.…”
Section: Related Workmentioning
confidence: 99%
“…The cost function is called the value of information [22, ch. 15] or the expected Bayesian risk [23]. Unfortunately, Krause [22,Prop.…”
Section: Related Workmentioning
confidence: 99%
“…Similar to our approach, the problem is encoded by a POMDP, but instead of an approximate nonmyopic policy, the authors resort to a myopic approach to reduce the differential entropy in the pose and class distributions. Karasev et al [23] plan the path of a mobile sensor for visual search of an object in an otherwise known and static scene. The authors hypothesize about the object's pose and apply greedy maximization of the conditional entropy of the next measurement.…”
Section: Related Workmentioning
confidence: 99%
“…Karasev et al [20] plan the path of a mobile sensor for visual search of an object in an otherwise known and static scene. The problem statement is different from ours but the optimization is surprisingly similar.…”
Section: Related Workmentioning
confidence: 99%