Multilayer Sparsity-Based Tensor Decomposition for Low-Rank Tensor Completion

Jize Xue, Yongqiang Zhao, Shaoguang Huang, Wenzhi Liao, Jonathan Cheung Wai Chan, Seong G. Kong

科研成果: 期刊稿件文章同行评审

151 引用 (Scopus)

摘要

Existing methods for tensor completion (TC) have limited ability for characterizing low-rank (LR) structures. To depict the complex hierarchical knowledge with implicit sparsity attributes hidden in a tensor, we propose a new multilayer sparsity-based tensor decomposition (MLSTD) for the low-rank tensor completion (LRTC). The method encodes the structured sparsity of a tensor by the multiple-layer representation. Specifically, we use the CANDECOMP/PARAFAC (CP) model to decompose a tensor into an ensemble of the sum of rank-1 tensors, and the number of rank-1 components is easily interpreted as the first-layer sparsity measure. Presumably, the factor matrices are smooth since local piecewise property exists in within-mode correlation. In subspace, the local smoothness can be regarded as the second-layer sparsity. To describe the refined structures of factor/subspace sparsity, we introduce a new sparsity insight of subspace smoothness: a self-adaptive low-rank matrix factorization (LRMF) scheme, called the third-layer sparsity. By the progressive description of the sparsity structure, we formulate an MLSTD model and embed it into the LRTC problem. Then, an effective alternating direction method of multipliers (ADMM) algorithm is designed for the MLSTD minimization problem. Various experiments in RGB images, hyperspectral images (HSIs), and videos substantiate that the proposed LRTC methods are superior to state-of-the-art methods.

源语言英语
页(从-至)6916-6930
页数15
期刊IEEE Transactions on Neural Networks and Learning Systems
33
11
DOI
出版状态已出版 - 1 11月 2022

指纹

探究 'Multilayer Sparsity-Based Tensor Decomposition for Low-Rank Tensor Completion' 的科研主题。它们共同构成独一无二的指纹。

引用此