Sciweavers

1176 search results - page 153 / 236
» Sparse reward processes
Sort
View
ICIP
2009
IEEE
16 years 5 months ago
Dequantizing Compressed Sensing With Non-gaussian Constraints
In this paper, following the Compressed Sensing (CS) paradigm, we study the problem of recovering sparse or compressible signals from uniformly quantized measurements. We present ...
ICASSP
2009
IEEE
15 years 11 months ago
Quadtree structured restoration algorithms for piecewise polynomial images
Iterative shrinkage of sparse and redundant representations are at the heart of many state of the art denoising and deconvolution algorithms. They assume the signal is well approx...
Adam Scholefield, Pier Luigi Dragotti
ICASSP
2009
IEEE
15 years 11 months ago
Joint reconstruction of compressed multi-view images
This paper proposes a distributed representation algorithm for multi-view images that are jointly reconstructed at the decoder. Compressed versions of each image are first obtain...
Xu Chen, Pascal Frossard
ICASSP
2009
IEEE
15 years 11 months ago
A simple, efficient and near optimal algorithm for compressed sensing
When sampling signals below the Nyquist rate, efficient and accurate reconstruction is nevertheless possible, whenever the sampling system is well behaved and the signal is well ...
Thomas Blumensath, Mike E. Davies
ICASSP
2009
IEEE
15 years 11 months ago
Color image feature extraction using color index local auto-correlations
In this paper, we propose a method for extracting color image features, called color index local auto-correlations. Pixel color is quantized and described sparsely in a manner sim...
Takumi Kobayashi, Nobuyuki Otsu