Name
Abstract | ||
|---|---|---|
Exploiting the latent low-rankness of tensors is crucial in tensor denoising. Classically, many methods use the Tucker model to find the low-rank structure of a tensor. Recently, the tensor train (TT) model has drawn wide attention owing to its powerful representation ability, and well-balanced matricization scheme for a tensor, and it has been successfully applied to various problems in signal processing, and machine learning applications. In this letter, we propose a tensor denoising method using the TT singular value decomposition, and information criteria, where we leverage the minimum description length to automatically estimate the TT rank. Furthermore, we establish the relationship between Tucker decomposition, and TT decomposition. In specific, the low Tucker rank of a tensor is the sufficient but unnecessary condition to the low TT rank. It unveils in theory the potential advantages of the TT model in characterizing the latent low-rankness of tensor. Denoising experiments on both synthetic data, and real HSI dataset demonstrate its superiority against Tucker-based methods. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1109/LSP.2020.3025038 | IEEE SIGNAL PROCESSING LETTERS |
Keywords | DocType | Volume |
Denoising, low rank, tensor decomposition | Journal | 27 |
ISSN | Citations | PageRank |
1070-9908 | 0 | 0.34 |
References | Authors | |
0 | 4 | |