.png){kind=icon}
返回
Minimum n-rank approximation via iterative hard thresholding
.png){kind=icon}
OA
AI
DOI：10.1016/j.amc.2015.01.099.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The problem of recovering a low n-rank tensor is an extension of sparse recovery problem from the low dimensional space (matrix space) to the high dimensional space (tensor space) and has many applications in computer vision and graphics such as image inpainting and video inpainting. In this paper, we consider a new tensor recovery model, named as minimum n-rank approximation (MnRA), and propose an appropriate iterative hard thresholding algorithm with giving the upper bound of the n-rank in advance. The convergence analysis of the proposed algorithm is also presented. Particularly, we show that for the noiseless case, the linear convergence with rate 12 can be obtained for the proposed algorithm under proper conditions. Additionally, combining an effective heuristic for determining n-rank, we can also apply the proposed algorithm to solve MnRA when n-rank is unknown in advance. Some preliminary numerical results on randomly generated and real low n-rank tensor completion problems are reported, which show the efficiency of the proposed algorithms. (C) 2015 Elsevier Inc. All rights reserved.
Keyword:
Iterative hard thresholding
Low-n-rank tensor recovery
Tensor completion
Compressed sensing
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.4
论文数:
2.3W
被引数:
3.3W
机构
引用论文
.png){kind=icon}
分享收藏Anticoagulant use in atrial fibrillation and risk of dementia: review of contemporary knowledge
PREAI
分享收藏
查看更多内容