Goal-oriented optimal subset selection of correlated multimedia streams

被引:16
作者
Atrey, Pradeep K.
Kankanhalli, Mohan S.
Oommen, John B.
机构
[1] Natl Univ Singapore, Sch Comp, Singapore 117543, Singapore
[2] Carleton Univ, Sch Comp Sci, Ottawa, ON K1S 5B6, Canada
关键词
algorithms; security; agreement coefficient; confidence fusion; media fusion; optimal media selection;
D O I
10.1145/1198302.1198304
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
A multimedia analysis system utilizes a set of correlated media streams, each of which, we assume, has a confidence level and a cost associated with it, and each of which partially helps in achieving the system goal. However, the fact that at any instant, not all of the media streams contribute towards a system goal brings up the issue of finding the best subset from the available set of media streams. For example, a subset of two video cameras and two microphones could be better than any other subset of sensors at some time instance to achieve a surveillance goal (e.g. event detection). This article presents a novel framework that finds. the optimal subset of media streams so as to achieve the system goal under specified constraints. The proposed framework uses a dynamic programming approach to find the optimal subset of media streams based on three different criteria: first, by maximizing the probability of achieving the goal under the specified cost and confidence; second, by maximizing the confidence in the achieved goal under the specified cost and probability with which the goal is achieved; and third, by minimizing the cost to achieve the goal with a specified probability and confidence. Each of these problems is proven to be NP-Complete. From an AI point of view, the solution we propose is heuristic-based, and for each criterion, utilizes a heuristic function which for a given problem, combines optimal solutions of small-sized subproblems to yield a potential near-optimal solution to the original problem. The proposed framework allows for a tradeoff among the aforementioned three criteria, and offers the flexibility to compare whether any one set of media streams of low cost would be better than any other set of higher cost, or whether any one set of media streams of high confidence would be better than any other set of low confidence. To show the utility of our framework, we provide the experimental results for event detection in a surveillance scenario.
引用
收藏
页数:24
相关论文
共 13 条
[1]  
[Anonymous], 2006, PROC IEEE INT C ACOU
[2]  
[Anonymous], P IEEE WORKSH EV MIN
[3]  
Atrey P.K., 2005, P 3 ACM INT WORKSH V, DOI 10.1145/1099396.1099416.
[4]   Goal based optimal selection of media streams [J].
Atrey, PK ;
Kankanhalli, MS .
2005 IEEE International Conference on Multimedia and Expo (ICME), Vols 1 and 2, 2005, :305-308
[5]   On an optimization problem in sensor selection [J].
Debouk, R ;
Lafortune, S ;
Teneketzis, D .
DISCRETE EVENT DYNAMIC SYSTEMS-THEORY AND APPLICATIONS, 2002, 12 (04) :417-445
[6]  
Isler V, 2005, 2005 FOURTH INTERNATIONAL SYMPOSIUM ON INFORMATION PROCESSING IN SENSOR NETWORKS, P151
[7]  
JAIN R, 2004, UBIQUITY, V5, P29
[8]   Optimal sensor selection for discrete-event systems with partial observation [J].
Jiang, SB ;
Kumar, R ;
Garcia, HE .
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2003, 48 (03) :369-381
[9]  
LAM KY, 2004, P ACM WORKSH VID SUR, P63
[10]   A formal analysis of why heuristic functions work [J].
Oommen, BJ ;
Rueda, LG .
ARTIFICIAL INTELLIGENCE, 2005, 164 (1-2) :1-22