Sciweavers

354 search results - page 4 / 71
» Estimating random variables from random sparse observations
Sort
View
TSP
2010
13 years 2 months ago
Coherence-based performance guarantees for estimating a sparse vector under random noise
We consider the problem of estimating a deterministic sparse vector x0 from underdetermined measurements Ax0 +w, where w represents white Gaussian noise and A is a given determinis...
Zvika Ben-Haim, Yonina C. Eldar, Michael Elad
STOC
2004
ACM
110views Algorithms» more  STOC 2004»
14 years 7 months ago
On sums of independent random variables with unbounded variance, and estimating the average degree in a graph
We prove the following inequality: for every positive integer n and every collection X1, . . . , Xn of nonnegative independent random variables that each has expectation 1, the pr...
Uriel Feige
SDM
2007
SIAM
98views Data Mining» more  SDM 2007»
13 years 8 months ago
An incremental data-stream sketch using sparse random projections
We propose the use of random projections with a sparse matrix to maintain a sketch of a collection of high-dimensional data-streams that are updated asynchronously. This sketch al...
Aditya Krishna Menon, Gia Vinh Anh Pham, Sanjay Ch...
ICASSP
2010
IEEE
13 years 7 months ago
Reconstruction of sparse signals from distorted randomized measurements
In this paper we show that, surprisingly, it is possible to recover sparse signals from nonlinearly distorted measurements, even if the nonlinearity is unknown. Assuming just that...
Petros Boufounos
PAMI
2010
207views more  PAMI 2010»
13 years 2 months ago
Document Ink Bleed-Through Removal with Two Hidden Markov Random Fields and a Single Observation Field
We present a new method for blind document bleed through removal based on separate Markov Random Field (MRF) regularization for the recto and for the verso side, where separate pri...
Christian Wolf