Sciweavers

266 search results - page 4 / 54
» High-Rank Matrix Completion
Sort
View
SIAMJO
2010
246views more  SIAMJO 2010»
13 years 5 months ago
A Singular Value Thresholding Algorithm for Matrix Completion
This paper introduces a novel algorithm to approximate the matrix with minimum nuclear norm among all matrices obeying a set of convex constraints. This problem may be understood a...
Jian-Feng Cai, Emmanuel J. Candès, Zuowei S...
FOCS
1990
IEEE
13 years 11 months ago
Matrix Decomposition Problem Is Complete for the Average Case
The first algebraic average-case complete problem is presented. It is arguably the simplest natural average-case complete problem to date.
Yuri Gurevich
ICASSP
2011
IEEE
12 years 11 months ago
SRF: Matrix completion based on smoothed rank function
In this paper, we address the matrix completion problem and propose a novel algorithm based on a smoothed rank function (SRF) approximation. Among available algorithms like FPCA a...
Hooshang Ghasemi, Mohmmadreza Malek-Mohammadi, Mas...
ACCV
2010
Springer
13 years 2 months ago
Robust Photometric Stereo via Low-Rank Matrix Completion and Recovery
We present a new approach to robustly solve photometric stereo problems. We cast the problem of recovering surface normals from multiple lighting conditions as a problem of recover...
Lun Wu, Arvind Ganesh, Boxin Shi, Yasuyuki Matsush...
SIGKDD
2010
151views more  SIGKDD 2010»
13 years 2 months ago
Limitations of matrix completion via trace norm minimization
In recent years, compressive sensing attracts intensive attentions in the field of statistics, automatic control, data mining and machine learning. It assumes the sparsity of the ...
Xiaoxiao Shi, Philip S. Yu