Sciweavers

411 search results - page 3 / 83
» Rank Estimation in Missing Data Matrix Problems
Sort
View
SIAMMAX
2010
164views more  SIAMMAX 2010»
12 years 11 months ago
Uniqueness of Low-Rank Matrix Completion by Rigidity Theory
The problem of completing a low-rank matrix from a subset of its entries is often encountered in the analysis of incomplete data sets exhibiting an underlying factor model with app...
Amit Singer, Mihai Cucuringu
TSP
2008
178views more  TSP 2008»
13 years 4 months ago
Heteroscedastic Low-Rank Matrix Approximation by the Wiberg Algorithm
Abstract--Low-rank matrix approximation has applications in many fields, such as 2D filter design and 3D reconstruction from an image sequence. In this paper, one issue with low-ra...
Pei Chen
SIAMSC
2011
219views more  SIAMSC 2011»
12 years 11 months ago
Fast Algorithms for Bayesian Uncertainty Quantification in Large-Scale Linear Inverse Problems Based on Low-Rank Partial Hessian
We consider the problem of estimating the uncertainty in large-scale linear statistical inverse problems with high-dimensional parameter spaces within the framework of Bayesian inf...
H. P. Flath, Lucas C. Wilcox, Volkan Akcelik, Judi...
CVPR
2010
IEEE
13 years 2 months ago
Efficient computation of robust low-rank matrix approximations in the presence of missing data using the L1 norm
The calculation of a low-rank approximation of a matrix is a fundamental operation in many computer vision applications. The workhorse of this class of problems has long been the ...
Anders Eriksson, Anton van den Hengel
CVPR
2005
IEEE
14 years 6 months ago
Damped Newton Algorithms for Matrix Factorization with Missing Data
The problem of low-rank matrix factorization in the presence of missing data has seen significant attention in recent computer vision research. The approach that dominates the lit...
A. M. Buchanan, Andrew W. Fitzgibbon