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.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Wright, J., Yang, A., Ganesh, A., Sastry, S., Ma, Y.: Robust face recognition via sparse representation. IEEE Transactions on Pattern Analysis and Machine Intelligence 31, 210–227 (2009)
Elad, M., Aharon, M.: Image denoising via sparse and redundant representations over learned dictionaries. IEEE Transactions on Image Processing 15, 3736–3745 (2006)
Rao, S., Tron, R., Vidal, R., Ma, Y.: Motion segmentation via robust subspace separation in the presence of outlying, incomplete, or corrupted trajectories. In: CVPR (2008)
Zou, H., Hastie, T.: Regularization and variable selection via the elastic net. Journal of the Royal Statistical Society B 67, 301–320 (2005)
Yuan, M., Lin, Y.: Model selection and estimation in regression with grouped variables. Journal of the Royal Statistical Society B 68, 49–67 (2006)
Zhang, J.: A probabilistic framework for multi-task learning. Technical report, CMU-LTI-06-006 (2006)
Yuan, X., Yan, S.: Visual classification with multi-task joint sparse representation. In: CVPR (2010)
Raina, R., Battle, A., Lee, H., Packer, B., Ng, A.Y.: Self-taught learning: Transfer learning from unlabeled data. In: ICML (2007)
Nesterov, Y.: Smooth minimization of non-smooth functions. Mathematical Programming, 127–152 (2005)
Rabiner, L.R., Juang, B.H.: An introduction to hidden markov models. IEEE Magazine on Accoustics, Speech and Signal Processing 3, 4–16 (1986)
Kim, S., Smyth, P.: Segmental hidden markov models with random effects for waveform modeling. Journal of Machine Learning Research 7, 945–969 (2006)
Myers, C.S., Rabiner, L.R.: A comparative study of several dynamic time-warping algorithms for connected word recognition. The Bell System Technical Journal (60)
Rodríguez, J.J., Alonso, C.J.: Interval and dynamic time warping-based decision trees. In: ACM Symposium on Applied Computing, pp. 548–552 (2004)
Hayashi, A., Mizuhara, Y., Suematsu, N.: Embedding time series data for classification. Machine Learning and Data Mining in Pattern Recognition, 356–365 (2005)
Xi, X., Keogh, E., Shelton, C., Wei, L., Ratanamahatana, C.A.: Fast time series classification using numerosity reduction. In: ICML, pp. 1033–1040 (2006)
Nanopoulos, A., Alcock, R., Manolopoulos, Y.: Feature-based classification of time series data. Information Processing and Technology, 49–61 (2001)
Megalooikonomou, V., Wang, Q., Li, G., Faloutsos, C.: A multiresolution symbolic representation of time series. In: ICDE, pp. 668–679 (2005)
Manning, C.D., Schütze, H.: Foundations of statistical natural language processing. MIT press (1999)
Cadieu, C., Olshausen, B.: Learning transformational invariants from natural movies. In: NIPS, pp. 209–216 (2008)
Kim, T., Shakhnarovich, G., Urtasun, R.: Sparse coding for learning interpretable spatio-temporal primitives. In: NIPS, pp. 1117–1125 (2010)
Zhao, B., Fei-Fei, L., Xing, E.P.: Online detection of unusual events in videos via dynamic sparse coding. In: CVPR (2011)
Tseng, P.: On accelerated proximal gradient methods for convex-concave optimization. Submitted to SIAM Journal on Optimization (2008)
Kadous, M.W.: Temporal classification: Extending the classification paradigm to multivariate time series. PhD Thesis, School of Computer Science and Engineering, University of New South Wales (2002)
Hammami, N., Bedda, M.: Improved tree model for arabic speech recognition. In: Internationl Conference on Computer Science and Information Technology, pp. 521–526 (2010)
Shen, Y., Ashraf, N., Foroosh, H.: Action recognition based on homography constraints. In: ICPR (2008)
Sung, J., Ponce, C., Selman, B., Saxena, A.: Human activity detection from rgbd images. CoRR abs/1107.0169 (2011)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ni, B., Moulin, P., Yan, S. (2012). Order-Preserving Sparse Coding for Sequence Classification. In: Fitzgibbon, A., Lazebnik, S., Perona, P., Sato, Y., Schmid, C. (eds) Computer Vision – ECCV 2012. ECCV 2012. Lecture Notes in Computer Science, vol 7573. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33709-3_13
Download citation
DOI: https://doi.org/10.1007/978-3-642-33709-3_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-33708-6
Online ISBN: 978-3-642-33709-3
eBook Packages: Computer ScienceComputer Science (R0)