Sciweavers

336 search results - page 4 / 68
» Compression of Samplable Sources
Sort
View
ICA
2007
Springer
14 years 1 months ago
Compressed Sensing and Source Separation
Abstract. Separation of underdetermined mixtures is an important problem in signal processing that has attracted a great deal of attention over the years. Prior knowledge is requir...
Thomas Blumensath, Mike E. Davies
TIT
1998
77views more  TIT 1998»
13 years 7 months ago
A Rate-Distortion Theorem for Arbitrary Discrete Sources
— A rate-distortion theorem for arbitrary (not necessarily stationary or ergodic) discrete-time finite-alphabet sources is given. This result, which provides the expression of t...
Po-Ning Chen, Fady Alajaji
ENC
2003
IEEE
14 years 22 days ago
Efficient Compression from Non-ergodic Sources with Genetic Algorithms
Several lossless data compression schemes have been proposed over the past years. Since Shannon developed information theory in his seminal paper, however, the problem of data com...
Angel Fernando Kuri Morales
TIT
2010
300views Education» more  TIT 2010»
13 years 2 months ago
Polar codes are optimal for lossy source coding
We consider lossy source compression of a binary symmetric source using polar codes and the low-complexity successive encoding algorithm. It was recently shown by Arikan that polar...
Satish Babu Korada, Rüdiger L. Urbanke
TIT
2010
144views Education» more  TIT 2010»
13 years 2 months ago
Lossy source compression using low-density generator matrix codes: analysis and algorithms
We study the use of low-density generator matrix (LDGM) codes for lossy compression of the Bernoulli symmetric source. First, we establish rigorous upper bounds on the average dist...
Martin J. Wainwright, Elitza N. Maneva, Emin Marti...