.png){kind=icon}
返回
Dictionary Learning With Low-Rank Coding Coefficients for Tensor Completion
.png){kind=icon}
OA
AI
DOI：10.1109/TNNLS.2021.3104837.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this article, we propose a novel tensor learning and coding model for third-order data completion. The aim of our model is to learn a data-adaptive dictionary from given observations and determine the coding coefficients of third-order tensor tubes. In the completion process, we minimize the low-rankness of each tensor slice containing the coding coefficients. By comparison with the traditional predefined transform basis, the advantages of the proposed model are that: 1) the dictionary can be learned based on the given data observations so that the basis can be more adaptively and accurately constructed and 2) the low-rankness of the coding coefficients can allow the linear combination of dictionary features more effectively. Also we develop a multiblock proximal alternating minimization algorithm for solving such tensor learning and coding model and show that the sequence generated by the algorithm can globally converge to a critical point. Extensive experimental results for real datasets such as videos, hyperspectral images, and traffic data are reported to demonstrate these advantages and show that the performance of the proposed tensor learning and coding method is significantly better than the other tensor completion methods in terms of several evaluation metrics.
Keyword:
Tensors
Encoding
Transforms
Dictionaries
Discrete Fourier transforms
Machine learning
Electron tubes
Dictionary learning
low-rank coding
tensor completion
tensor singular value decomposition (t-SVD)
期刊
IF:
8.9
论文数:
7.5K
被引数:
7.2W
机构
引用论文
DC Offset Error Compensation Algorithm for PR Current Control of a Single-Phase Grid-Tied Inverter.png)
EnergiesOAAI
EnergiesIF0
OAAI分享收藏分享收藏
查看更多内容