期刊
INFORMATION SCIENCES
卷 503, 期 -, 页码 109-128出版社
ELSEVIER SCIENCE INC
DOI: 10.1016/j.ins.2019.06.061
关键词
Nonconvex tensor rank estimation; Low-rank tensor recovery; Tensor completion (TC); Tensor robust PCA (TRPCA)
资金
- National Natural Science Foundation of China [61371152, 61771391]
- Science, Technology and Innovation Commission of Shenzhen Manicipality [JCYJ20170815162956949]
- innovation Foundation for Doctor Dissertation of Northwestern Polytechnical University [CX201917]
- Fund for Scientific Research in Flanders (FWO) [G037115N]
- Research Foundation Flanders (FWO-Vlaanderen)
Low-rank tensor recovery (LRTR) has recently emerged as the potent tools for representing multidimensional data. One of the most popular LRTR is tensor rank minimization that acts as the estimating tensor rank for a given tensor. However, the existing convex tensor rank approximation methods suffer from the serious rank estimation bias due to neglecting the physical meanings of singular values along each mode. In this paper, we propose a new method to approximate the tensor rank by using the nonconvex logarithmic surrogate function of the singular values, and the redefined rank approximation can further reduce to a convex weighted nuclear norm minimization (WNNM) problem. By embedding the tensor rank function into the tensor completion (TC) and tensor robust PCA (TRPCA) frameworks, new models are formulated to enhance tensor processing. Additionally, by introducing relaxation forms of the proposed tensor rank function, the alternating direction method of multipliers (ADMM) can be adopted for the models. The proposed nonconvex tensor rank minimization method can achieve state-of-the-art performance in tensor recovery, including tensor completion and background subtraction. (C) 2019 Elsevier Inc. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据