搜索结果: 1-15 共查到“matrix completion”相关记录19条 . 查询时间(0.059 秒)
Regularization for Matrix Completion
Noise low rank matrix computer vision signal processing
font style='font-size:12px;'>
2015/8/21
We consider the problem of reconstructing a low rank matrix from noisy observations of a subset of its entries. This task has applications in statistical learning, computer vision, and signal processi...
Matrix Completion from Noisy Entries
matrix completion low-rank matrices spectral methods manifold optimization
font style='font-size:12px;'>
2015/8/21
Given a matrix M of low-rank, we consider the problem of reconstructing it from noisy observations of a small, random subset of its entries. The problem arises in a variety of applications, from colla...
Matrix Completion from a Few Entries
Random matrix random matrix ge matrix rank lower
font style='font-size:12px;'>
2015/8/21
Let M be a random nα × n matrix of rank r ≪ n, and assume that a uniformly random subset E of its entries is observed. We describe an efficient algorithm that reconstructs M from |E| = O(r ...
Exact Matrix Completion via Convex Optimization
Matrix completion low-rank matrices convex optimization duality in optimization nuclear norm minimization random matrices noncommutative Khintchine inequality decoupling compressed sensing
font style='font-size:12px;'>
2015/6/17
We consider a problem of considerable practical interest: the recovery of a data matrix from a sampling of its entries. Suppose that we observe m entries selected uniformly at random from a matrix M. ...
A SINGULAR VALUE THRESHOLDING ALGORITHM FOR MATRIX COMPLETION
Nuclear norm minimization matrix completion singular value thresholding Lagrange dual function Uzawa’s algorithm and linearized Bregman iteration
font style='font-size:12px;'>
2015/6/17
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 as the convex relaxat...
The Power of Convex Relaxation:Near-Optimal Matrix Completion
Matrix completion low-rank matrices semidefinite programming duality in optimization nuclear norm minimization random matrices and techniques from random matrix theory free probability
font style='font-size:12px;'>
2015/6/17
This paper is concerned with the problem of recovering an unknown matrix from a small fraction of its entries. This is known as the matrix completion problem, and comes up in a great number of applica...
Matrix Completion with Noise
Matrix completion low-rank matrices semidefinite programming duality in optimization nuclear-norm minimization oracle inequalities compressed sensing
font style='font-size:12px;'>
2015/6/17
On the heels of compressed sensing, a remarkable new field has very recently emerged. This field addresses a broad range of problems of significant practical interest, namely, the recovery of a data m...
Phase Retrieval via Matrix Completion
Diffraction Fourier transform convex optimization trace-norm minimization
font style='font-size:12px;'>
2015/6/17
This paper develops a novel framework for phase retrieval, a problem which arises in X-ray crystallography, diffraction imaging, astronomical imaging and many other applications. Our approach, called ...
Robust Global Motion Estimation with Matrix Completion
Camera orientation Structure from motion Epipolar geometry Block adjustment
font style='font-size:12px;'>
2014/7/30
In this paper we address the problem of estimating the attitudes and positions of a set of cameras in an external coordinate system. Starting from a conventional global structure-from-motion pipeline,...
Matrix completion via max-norm constrained optimization
Compressed sensing low-rank matrix matrix completion max-norm con-strained minimization optimal rate of convergence sparsity
font style='font-size:12px;'>
2013/4/28
This paper studies matrix completion under a general sampling model using the max-norm as a convex relaxation for the rank of the matrix. The optimal rate of convergence is established for the Frobeni...
1-Bit Matrix Completion
1-Bit Matrix Completion
font style='font-size:12px;'>
2012/11/22
In this paper we develop a theory of matrix completion for the extreme case of noisy 1-bit observations. Instead of observing a subset of the real-valued entries of a matrix M, we obtain a small numbe...
Weighted algorithms for compressed sensing and matrix completion
Compressed Sensing Weighted Basis-Pursuit Matrix Completion
font style='font-size:12px;'>
2011/7/19
This paper is about iteratively reweighted basis-pursuit algorithms for compressed sensing and matrix completion problems. In a first part, we give a theoretical explanation of the fact that reweighte...
Robust Matrix Completion with Corrupted Columns
Robust Matrix Completion
font style='font-size:12px;'>
2011/3/21
This paper considers the problem of matrix completion, when some number of the columns are arbitrarily corrupted, potentially by a malicious adversary. It is well-known that standard algorithms for ma...
Realizability of Polytopes as a Low Rank Matrix Completion Problem
Realizability of Polytopes Low Rank Matrix Completion Problem
font style='font-size:12px;'>
2011/2/22
Here we show that the problem of realizing a polytope with specified combinatorics is equivalent to a low rank matrix completion problem.This is comparable to known results reducing realizability to s...
Calibration for Ultrasound Breast Tomography Using Matrix Completion
Calibration Ultrasound Breast Tomography Matrix Completion
font style='font-size:12px;'>
2011/3/3
We study the calibration problem in circular ultrasound tomography devices for breast imaging, where the sensor positions deviate from the circumference of a perfect circle.