Low-Rank Tensor Learning with Discriminant Analysis for Action Classification and Image Recovery

Tensor completion is an important topic in the area of image processing and computer vision research, which is generally built on extraction of the intrinsic structure of the tensor data. Drawing on this fact, action classification, relying heavily on the extracted features of high-dimensional tensors, may indeed benefit from tensor completion techniques. In this paper, we propose a low-rank tensor completion method for action classification, as well as image recovery. Since there may exist distortion and corruption in the tensor representations of video sequences, we project the tensors into a subspace, which contains the invariant structure of the tensors. In order to integrate useful supervisory information for classification, we adopt a discriminant analysis criterion to learn the projection matrices. The resulting multi-variate optimization problem can be effectively solved using the augmented Lagrange multiplier (ALM) algorithm. Experiments demonstrate that our method results with better accuracy compared with some other state-of-the-art low-rank tensor representation learning approaches on the MSR Hand Gesture 3D database and the MSR Action 3D database. By denoising the Multi-PIE face database, our experimental setup testifies the proposed method can also be employed to recover images.

[1]  Deepu Rajan,et al.  Human action recognition using Pose-based discriminant embedding , 2012, Signal Process. Image Commun..

[2]  Othmar Koch,et al.  Dynamical Tensor Approximation , 2010, SIAM J. Matrix Anal. Appl..

[3]  Akshay Krishnamurthy,et al.  Low-Rank Matrix and Tensor Completion via Adaptive Sampling , 2013, NIPS.

[4]  Yi Ma,et al.  The Augmented Lagrange Multiplier Method for Exact Recovery of Corrupted Low-Rank Matrices , 2010, Journal of structural biology.

[5]  Zicheng Liu,et al.  HON4D: Histogram of Oriented 4D Normals for Activity Recognition from Depth Sequences , 2013, 2013 IEEE Conference on Computer Vision and Pattern Recognition.

[6]  Yong Yu,et al.  Robust Subspace Segmentation by Low-Rank Representation , 2010, ICML.

[7]  Andrzej Cichocki,et al.  Fast Alternating LS Algorithms for High Order CANDECOMP/PARAFAC Tensor Factorizations , 2013, IEEE Transactions on Signal Processing.

[8]  Haibin Ling,et al.  Multi-target Tracking by Rank-1 Tensor Approximation , 2013, 2013 IEEE Conference on Computer Vision and Pattern Recognition.

[9]  Reinhold Schneider,et al.  On manifolds of tensors of fixed TT-rank , 2012, Numerische Mathematik.

[10]  Xiaoqin Zhang,et al.  Simultaneous Rectification and Alignment via Robust Recovery of Low-rank Tensors , 2013, NIPS.

[11]  Bart Vandereycken,et al.  The geometry of algorithms using hierarchical tensors , 2013, Linear Algebra and its Applications.

[12]  Ying Wu,et al.  Mining actionlet ensemble for action recognition with depth cameras , 2012, 2012 IEEE Conference on Computer Vision and Pattern Recognition.

[13]  Rama Chellappa,et al.  Discriminant Analysis for Recognition of Human Face Images (Invited Paper) , 1997, AVBPA.

[14]  Andrzej Cichocki,et al.  On Fast Computation of Gradients for CANDECOMP/PARAFAC Algorithms , 2012, ArXiv.

[15]  Andrzej Cichocki,et al.  Low Complexity Damped Gauss-Newton Algorithms for CANDECOMP/PARAFAC , 2012, SIAM J. Matrix Anal. Appl..

[16]  Jianmin Zhao,et al.  Low-Rank Matrix Recovery with Discriminant Regularization , 2013, PAKDD.

[17]  Mohamed Cheriet,et al.  Large Margin Low Rank Tensor Analysis , 2013, Neural Computation.

[18]  Nasser Kehtarnavaz,et al.  Real-time human action recognition based on depth motion maps , 2016, Journal of Real-Time Image Processing.

[19]  F. Verstraete,et al.  Time-dependent variational principle for quantum lattices. , 2011, Physical review letters.

[20]  Tamara G. Kolda,et al.  Tensor Decompositions and Applications , 2009, SIAM Rev..

[21]  Bo Huang,et al.  Square Deal: Lower Bounds and Improved Relaxations for Tensor Recovery , 2013, ICML.

[22]  Yousef Saad,et al.  On the Tensor SVD and the Optimal Low Rank Orthogonal Approximation of Tensors , 2008, SIAM J. Matrix Anal. Appl..

[23]  Reinhold Schneider,et al.  Efficient time-stepping scheme for dynamics on TT-manifolds , 2012 .

[24]  Tobias Jahnke,et al.  On the approximation of high-dimensional differential equations in the hierarchical Tucker format , 2013, BIT Numerical Mathematics.

[25]  Eugene E. Tyrtyshnikov,et al.  Structure of the Hessian matrix and an economical implementation of Newton’s method in the problem of canonical approximation of tensors , 2010 .

[26]  C. Ding,et al.  On the equivalent of low-rank linear regressions and linear discriminant analysis based regressions , 2013, KDD.

[27]  Dit-Yan Yeung,et al.  Human action recognition using Local Spatio-Temporal Discriminant Embedding , 2008, 2008 IEEE Conference on Computer Vision and Pattern Recognition.

[28]  Reinhold Schneider,et al.  Dynamical Approximation by Hierarchical Tucker and Tensor-Train Tensors , 2013, SIAM J. Matrix Anal. Appl..

[29]  Daniel M. Dunlavy,et al.  A scalable optimization approach for fitting canonical tensor decompositions , 2011 .

[30]  Takeo Kanade,et al.  Multi-PIE , 2008, 2008 8th IEEE International Conference on Automatic Face & Gesture Recognition.

[31]  Wolfgang Hackbusch,et al.  A regularized Newton method for the efficient approximation of tensors represented in the canonical tensor format , 2012, Numerische Mathematik.

[32]  Massimiliano Pontil,et al.  A New Convex Relaxation for Tensor Completion , 2013, NIPS.

[33]  G. Sapiro,et al.  A collaborative framework for 3D alignment and classification of heterogeneous subvolumes in cryo-electron tomography. , 2013, Journal of structural biology.

[34]  Chris H. Q. Ding,et al.  Tensor reduction error analysis — Applications to video compression and classification , 2008, 2008 IEEE Conference on Computer Vision and Pattern Recognition.

[35]  Zenglin Xu,et al.  Exact and Stable Recovery of Pairwise Interaction Tensors , 2013, NIPS.