A novel sparse representation model for pedestrian abnormal trajectory understanding

被引:66
作者
Chen, Zhijun [1 ]
Cai, Hao [1 ]
Zhang, Yishi [2 ]
Wu, Chaozhong [1 ]
Mu, Mengchao [1 ]
Li, Zhixiong [3 ]
Sotelo, Miguel Angel [4 ]
机构
[1] Wuhan Univ Technol, Intelligent Transportat Syst Res Ctr, Wuhan 430063, Hubei, Peoples R China
[2] Wuhan Univ Technol, Sch Management, Wuhan 430070, Hubei, Peoples R China
[3] Univ Wollongong, Sch Mech Mat Mechatron & Biomed Engn, Wollongong, NSW 2522, Australia
[4] Univ Alcala, Comp Engn Dept, Madrid, Spain
基金
中国国家自然科学基金; 中国博士后科学基金;
关键词
Pedestrian behavior; Sparse representation; L-p-norm; Information entropy; Trajectory understanding; BEHAVIOR; RECONSTRUCTION; RECOGNITION; SELECTION;
D O I
10.1016/j.eswa.2019.06.041
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Pedestrian abnormal trajectory understanding based on video surveillance systems can improve public safety. However, manually identifying pedestrian abnormal trajectories is usually a prohibitive workload. The objective of this study is to propose an automatic method for understanding pedestrian abnormal trajectories. An improved sparse representation model, namely information entropy constrained trajectory representation method (IECTR), is developed for pedestrian trajectory classification. It aims to reduce the entropy for trajectory representation and to obtain superior analyzing results. In the proposed method, the orthogonal matching pursuit (OMP) is embedded in the expectation maximization (EM) method to iteratively obtain the selection probabilities and the sparse coefficients. In addition, the lower-bound sparser condition of L-p-minimization (0 < p < 1) is applied in the proposed method to guarantee salient solutions. In order to validate the performance and effectiveness of the proposed method, classification experiments are conducted using five pedestrian trajectory datasets. The results show that the identification accuracy of the proposed method is superior to the compared methods, including naive Bayes classifier (NBC), support vector machine (SVM), k-nearest neighbor (kNN), and typical sparse representationbased methods. (C) 2019 Elsevier Ltd. All rights reserved.
引用
收藏
页数:11
相关论文
共 31 条
[1]  
AHA DW, 1991, MACH LEARN, V6, P37, DOI 10.1007/BF00153759
[2]   On the approximability of minimizing nonzero variables or unsatisfied relations in linear systems [J].
Amaldi, E ;
Kann, V .
THEORETICAL COMPUTER SCIENCE, 1998, 209 (1-2) :237-260
[3]  
[Anonymous], SIAM J MULTISCALE MO
[4]  
[Anonymous], P IEEE INT C IM PROC
[5]  
[Anonymous], DETECTING PEDESTRIAN
[6]  
[Anonymous], 2012, TSINGHUA SCI TECHNOL
[7]  
[Anonymous], P 16 IEEE INT C PATT
[8]   Decoding by linear programming [J].
Candes, EJ ;
Tao, T .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2005, 51 (12) :4203-4215
[9]   Exact reconstruction of sparse signals via nonconvex minimization [J].
Chartrand, Rick .
IEEE SIGNAL PROCESSING LETTERS, 2007, 14 (10) :707-710
[10]   LOWER BOUND THEORY OF NONZERO ENTRIES IN SOLUTIONS OF l2-lp MINIMIZATION [J].
Chen, Xiaojun ;
Xu, Fengmin ;
Ye, Yinyu .
SIAM JOURNAL ON SCIENTIFIC COMPUTING, 2010, 32 (05) :2832-2852