arrow
Return

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

delete2022-11-01
delete130
delete
OA
AI
J
Jize Xue
Y
Yongqiang Zhao *
S
Shaoguang Huang
W
Wenzhi Liao
J
Jonathan Cheung-Wai Chan
S
Seong G. Kong
DOI:10.1109/TNNLS.2021.3083931delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
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.
Keywords:
Tensors
Matrix decomposition
Correlation
Nonhomogeneous media
Minimization
Transmission line measurements
Biomedical measurement
CANDECOMP
PARAFAC (CP) decomposition
factor smooth prior
low-rank tensor completion (LRTC)
multilayer sparsity (MLS) constraints
subspace structured sparsity

Journal

IEEE Transactions on Neural Networks and Learning Systems cover
IEEE Transactions on Neural Networks and Learning Systems
IF:
8.9
Papers:
7.5K
Citations:
7.2W

Organization

G
Ghent University
Scholars:
5.2W
Papers: 4.5W
Citations: 5.5W
N
Northwestern Polytechnical University
Scholars:
4.6W
Papers: 3.7W
Citations: 5.3W
V
Vrije Universiteit Brussel
Scholars:
1.4W
Papers: 1.3W
Citations: 129
researcher View more organizations