Sciweavers

14 search results - page 1 / 3
» Online performance guarantees for sparse recovery
Sort
View
ICASSP
2011
IEEE
12 years 8 months ago
Online performance guarantees for sparse recovery
A K∗ -sparse vector x∗ ∈ RN produces measurements via linear dimensionality reduction as u = Φx∗ + n, where Φ ∈ RM×N (M < N), and n ∈ RM consists of independent ...
Raja Giryes, Volkan Cevher
FOCS
2008
IEEE
13 years 10 months ago
Near-Optimal Sparse Recovery in the L1 Norm
Abstract— We consider the approximate sparse recovery problem, where the goal is to (approximately) recover a highdimensional vector x ∈ Rn from its lower-dimensional sketch Ax...
Piotr Indyk, Milan Ruzic
ICASSP
2011
IEEE
12 years 8 months ago
Compressive sensing meets game theory
We introduce the Multiplicative Update Selector and Estimator (MUSE) algorithm for sparse approximation in underdetermined linear regression problems. Given f = Φα∗ + µ, the ...
Sina Jafarpour, Robert E. Schapire, Volkan Cevher
ICA
2010
Springer
13 years 5 months ago
Recovering Spikes from Noisy Neuronal Calcium Signals via Structured Sparse Approximation
Two-photon calcium imaging is an emerging experimental technique that enables the study of information processing within neural circuits in vivo. While the spatial resolution of th...
Eva L. Dyer, Marco F. Duarte, Don H. Johnson, Rich...
ICASSP
2011
IEEE
12 years 8 months ago
Additive character sequences with small alphabets for compressed sensing matrices
Compressed sensing is a novel technique where one can recover sparse signals from the undersampled measurements. In this paper, a K × N measurement matrix for compressed sensing ...
Nam Yul Yu