Pose-based human action recognition via sparse representation in dissimilarity space

被引:72
作者
Theodorakopoulos, Ilias [1 ]
Kastaniotis, Dimitris [1 ]
Economou, George [1 ]
Fotopoulos, Spiros [1 ]
机构
[1] Univ Patras, Dept Phys, Elect Lab, Patras 26500, Greece
关键词
Action recognition; Sparse representation; Dissimilarity representation; Pose representation; Articulated human motion; RGB-D sensors; Angular features; Pose encoding;
D O I
10.1016/j.jvcir.2013.03.008
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Human actions can be considered as a sequence of body poses over time, usually represented by coordinates corresponding to human skeleton models. Recently, a variety of low-cost devices have been released, able to produce markerless real time pose estimation. Nevertheless, limitations of the incorporated RGB-D sensors can produce inaccuracies, necessitating the utilization of alternative representation and classification schemes in order to boost performance. In this context, we propose a method for action recognition where skeletal data are initially processed in order to obtain robust and invariant pose representations and then vectors of dissimilarities to a set of prototype actions are computed. The task of recognition is performed in the dissimilarity space using sparse representation. A new publicly available dataset is introduced in this paper, created for evaluation purposes. The proposed method was also evaluated on other public datasets, and the results are compared to those of similar methods. (C) 2013 Elsevier Inc. All rights reserved.
引用
收藏
页码:12 / 23
页数:12
相关论文
共 34 条
[1]   Human Activity Analysis: A Review [J].
Aggarwal, J. K. ;
Ryoo, M. S. .
ACM COMPUTING SURVEYS, 2011, 43 (03)
[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], 2005, The Dissimilarity Representation for Pattern Recognition
[4]  
[Anonymous], 2012, P ACM INT C MULT NAR, DOI DOI 10.1145/2393347.2396382
[5]  
[Anonymous], DYNAMIC PROGRAMMING
[6]   On a relation between graph edit distance and maximum common subgraph [J].
Bunke, H .
PATTERN RECOGNITION LETTERS, 1997, 18 (08) :689-694
[7]  
Chen S.S., 1998, SIAM J SCI COMPUT, V20, P2845
[8]   For most large underdetermined systems of linear equations the minimal l1-norm solution is also the sparsest solution [J].
Donoho, DL .
COMMUNICATIONS ON PURE AND APPLIED MATHEMATICS, 2006, 59 (06) :797-829
[9]   Uncertainty principles and ideal atomic decomposition [J].
Donoho, DL ;
Huo, XM .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2001, 47 (07) :2845-2862
[10]  
Duin RPW, 2010, LECT NOTES COMPUT SC, V6218, P324, DOI 10.1007/978-3-642-14980-1_31