 |
    |
Order-Preserving Sparse Coding for Sequence Classification
Bingbing Ni1, Pierre Moulin2, and Shuicheng Yan3
1Advanced Digital Sciences Center, Singapore
bingbing.ni@adsc.com.sg
2University of Illinois at Urbana-Champaign, US
moulin@ifp.uiuc.edu
3National University of Singapore, Singapore
eleyans@nus.edu.sg
Abstract. In this paper, we investigate order-preserving sparse coding for classifying multi-dimensional sequence data. Such a problem is often tackled by first decomposing the input sequence into individual frames and extracting features, then performing sparse coding or other processing for each frame based feature vector independently, and finally aggregating individual responses to classify the input sequence. However, this heuristic approach ignores the underlying temporal order of the input sequence frames, which in turn results in suboptimal discriminative capability. In this work, we introduce a temporal-order-preserving regularizer which aims to preserve the temporal order of the reconstruction coefficients. An efficient Nesterov-type smooth approximation method is developed for optimization of the new regularization criterion, with guaranteed error bounds. Extensive experiments for time series classification on a synthetic dataset, several machine learning benchmarks, and a challenging real-world RGB-D human activity dataset, show that the proposed coding scheme is discriminative and robust, and it outperforms previous art for sequence classification.
LNCS 7573, p. 173 ff.
lncs@springer.com
© Springer-Verlag Berlin Heidelberg 2012