Adaptive Learning for Target Tracking and True Linking Discovering Across Multiple Non-Overlapping Cameras

被引:49
作者
Chen, Kuan-Wen [1 ]
Lai, Chih-Chuan [2 ]
Lee, Pei-Jyun [2 ]
Chen, Chu-Song [2 ,3 ,4 ,5 ]
Hung, Yi-Ping [1 ,2 ,3 ,5 ]
机构
[1] Natl Taiwan Univ, Dept Comp Sci & Informat Engn, Taipei 10764, Taiwan
[2] Natl Taiwan Univ, Inst Networking & Multimedia, Taipei 10764, Taiwan
[3] Acad Sinica, Inst Informat Sci, Taipei, Taiwan
[4] Acad Sinica, Res Ctr Informat Technol Innovat, Taipei 115, Taiwan
[5] Natl Taiwan Univ, Grad Inst Networking & Multimedia, Taipei 10764, Taiwan
关键词
Brightness transfer function; camera network; non-overlapping cameras; spatio-temporal relationship; visual surveillance; visual tracking; OBJECTS; TIME;
D O I
10.1109/TMM.2011.2131639
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
To track targets across networked cameras with disjoint views, one of the major problems is to learn the spatio-temporal relationship and the appearance relationship, where the appearance relationship is usually modeled as a brightness transfer function. Traditional methods learning the relationships by using either hand-labeled correspondence or batch-learning procedure are applicable when the environment remains unchanged. However, in many situations such as lighting changes, the environment varies seriously and hence traditional methods fail to work. In this paper, we propose an unsupervised method which learns adaptively and can be applied to long-term monitoring. Furthermore, we propose a method that can avoid weak links and discover the true valid links among the entry/exit zones of cameras from the correspondence. Experimental results demonstrate that our method outperforms existing methods in learning both the spatio-temporal and the appearance relationship, and can achieve high tracking accuracy in both indoor and outdoor environment.
引用
收藏
页码:625 / 638
页数:14
相关论文
共 38 条
[1]  
[Anonymous], 2008, P BRIT MACH VIS C
[2]   Tracking human motion in structured environments using a distributed-camera system [J].
Cai, Q ;
Aggarwal, JK .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 1999, 21 (11) :1241-1247
[3]  
Chen K. W., 2008, P IEEE C COMP VIS PA, P1
[4]   Algorithms for cooperative multisensor surveillance [J].
Collins, RT ;
Lipton, AJ ;
Fujiyoshi, H ;
Kanade, T .
PROCEEDINGS OF THE IEEE, 2001, 89 (10) :1456-1477
[5]  
Comaniciu D, 2000, PROC CVPR IEEE, P142, DOI 10.1109/CVPR.2000.854761
[6]  
Cormen TH, 1999, INTRO ALGORITHMS
[7]  
Dellaert F., 2000, Addressing the correspondence problem: A Markov chain Monte Carlo approach
[8]   MAXIMUM LIKELIHOOD FROM INCOMPLETE DATA VIA EM ALGORITHM [J].
DEMPSTER, AP ;
LAIRD, NM ;
RUBIN, DB .
JOURNAL OF THE ROYAL STATISTICAL SOCIETY SERIES B-METHODOLOGICAL, 1977, 39 (01) :1-38
[9]  
DETMOLD H, 2007, P ACM IEEE INT C DIS, P195
[10]  
DICK AR, 2004, P AUSTR JOINT C ART, P160