Sciweavers

266 search results - page 5 / 54
» High-Rank Matrix Completion
Sort
View
ICASSP
2011
IEEE
12 years 11 months ago
Low-rank matrix completion by variational sparse Bayesian learning
There has been a significant interest in the recovery of low-rank matrices from an incomplete of measurements, due to both theoretical and practical developments demonstrating th...
S. Derin Babacan, Martin Luessi, Rafael Molina, Ag...
CVPR
2010
IEEE
14 years 3 months ago
Robust video denoising using low rank matrix completion
Most existing video denoising algorithms assume a single statistical model of image noise, e.g. additive Gaussian white noise, which often is violated in practice. In this paper, ...
Hui Ji, Chaoqiang Liu, Zuowei Shen, Yuhong Xu
CORR
2010
Springer
111views Education» more  CORR 2010»
13 years 4 months ago
Calibration for Ultrasound Breast Tomography Using Matrix Completion
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. We in...
Reza Parhizkar, Amin Karbasi, Sewoong Oh, Martin V...
JMLR
2010
109views more  JMLR 2010»
13 years 2 months ago
Matrix Completion from Noisy Entries
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 app...
Raghunandan H. Keshavan, Andrea Montanari, Sewoong...
STACS
2010
Springer
14 years 2 months ago
Weakening Assumptions for Deterministic Subexponential Time Non-Singular Matrix Completion
Kabanets and Impagliazzo [KI04] show how to decide the circuit polynomial identity testing problem (CPIT) in deterministic subexponential time, assuming hardness of some explicit ...
Maurice Jansen