2014
DOI: 10.14257/ijsip.2014.7.1.01
|View full text |Cite
|
Sign up to set email alerts
|

A Weighted Nuclear Norm Method for Tensor Completion

Abstract: In recent years, tensor completion problem has received a significant amount of attention in computer vision, data mining and neuroscience. It is the higher order generalization of matrix completion. And these can be solved by the convex relaxation which minimizes the tensor nuclear norm instead of the n-rank of the tensor. In this paper, we introduce the weighted nuclear norm for tensor and develop majorization-minimization weighted soft thresholding algorithm to solve it. Focusing on the tensors generated ra… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
4
0

Year Published

2015
2015
2024
2024

Publication Types

Select...
3
1

Relationship

2
2

Authors

Journals

citations
Cited by 4 publications
(5 citation statements)
references
References 16 publications
0
4
0
Order By: Relevance
“…Similarly, the weighted nuclear norm has been applied to unfolded tensors for TC to recover lost data from remote sensing images [25,26]. The weighted tensor nuclear norm for TC uses reconstruction loss data as image data [27].…”
Section: Data Reconstruction With Missing Valuesmentioning
confidence: 99%
“…Similarly, the weighted nuclear norm has been applied to unfolded tensors for TC to recover lost data from remote sensing images [25,26]. The weighted tensor nuclear norm for TC uses reconstruction loss data as image data [27].…”
Section: Data Reconstruction With Missing Valuesmentioning
confidence: 99%
“…In previous work, the model ( 17) has successfully imputed missing tensor data. Recent studies suggest that the results can be significantly improved, using certain nonconvex functions [35][36][37].…”
Section: Low N-rank Tensor Completion Problemmentioning
confidence: 99%
“…where X * is the tensor trace norm (tensor nuclear norm) defined as: Geng et al [10] introduced the weighted nuclear norm minimization to tensor completion, and the main problem is to solve the following model:…”
Section: Low N-rank Tensor Completion Problemmentioning
confidence: 99%
“…Signoretto et al [9] introduced a proper extension of the concept of Shatten-q norm for matrices and studied a general class of non-smooth convex optimization problem. Geng et al [10] generalized the weighted nuclear norm of matrices to the tensors and develop a majorization-minimization weighted soft thresholding algorithm for solving the weighted nuclear norm model of the low-rank tensor completion problem. Rauhut et al [11] proposed an extension of the iterative hard thresholding algorithm which used for recovery of low-rank matrices [12] and introduced the iterative hard thresholding algorithm (TIHT) for the higher order singular value decomposition.…”
Section: Introductionmentioning
confidence: 99%