Journal of Systems Engineering and Electronics ›› 2014, Vol. 25 ›› Issue (3): 523-530.doi: 10.1109/JSEE.2014.00060


Higher-order principal component pursuit via tensor approximation and convex optimization

Sijia Cai1, Ping Wang1,2,*, Linhao Li1, and Chuhan Zhang1   

  1. 1. School of Science, Tianjin University, Tianjin 300072, China;
    2. Center for Applied Mathematics, Tianjin University, Tianjin 300072, China
  • Online:2014-07-01 Published:2010-01-03


Recovering the low-rank structure of data matrix from sparse errors arises in the principal component pursuit (PCP). This paper exploits the higher-order generalization of matrix recovery, named higher-order principal component pursuit (HOPCP), since it is critical in multi-way data analysis. Unlike the convexification
(nuclear norm) for matrix rank function, the tensorial nuclear norm is still an open problem. While existing preliminary works on the tensor completion field provide a viable way to indicate the low complexity estimate of tensor, therefore, the paper focuses on the low multi-linear rank tensor and adopt its convex relaxation to formulate the convex optimization model of HOPCP. The paper further propose two algorithms for HOPCP based on alternative minimization scheme: the augmented Lagrangian alternating direction method (ALADM) and its truncated higher-order singular value decomposition (ALADM-THOSVD) version. The former can obtain a high accuracy solution while the latter is more efficient to handle the computationally intractable problems. Experimental results on both synthetic data and real magnetic resonance imaging data show the applicability of our algorithms in high-dimensional tensor data processing.