Sciweavers

93 search results - page 8 / 19
» Reconstructing sparse signals from their zero crossings
Sort
View
ICIP
2009
IEEE
15 years 10 months ago
Modified Compressive Sensing For Real-time Dynamic Mr Imaging
In this work, we propose algorithms to recursively and causally reconstruct a sequence of natural images from a reduced number of linear projection measurements taken in a domain ...
ICASSP
2011
IEEE
14 years 1 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
CISS
2008
IEEE
15 years 4 months ago
Reconstruction of compressively sensed images via neurally plausible local competitive algorithms
Abstract—We develop neurally plausible local competitive algorithms (LCAs) for reconstructing compressively sensed images. Reconstruction requires solving a sparse approximation ...
Robert L. Ortman, Christopher J. Rozell, Don H. Jo...
ICIP
2009
IEEE
15 years 10 months ago
Image Restoration By Mixture Modelling Of An Overcomplete Linear Representation
We present a new image restoration method based on modelling the coefficients of an overcomplete wavelet response to natural images with a mixture of two Gaussian distributions, h...
ICIP
2008
IEEE
15 years 11 months ago
Kalman filtered Compressed Sensing
We consider the problem of reconstructing time sequences of spatially sparse signals (with unknown and time-varying sparsity patterns) from a limited number of linear "incohe...
Namrata Vaswani