Sciweavers

9 search results - page 1 / 2
» Lossy compression of discrete sources via Viterbi algorithm
Sort
View
6
Voted
CORR
2010
Springer
73views Education» more  CORR 2010»
13 years 5 months ago
Lossy compression of discrete sources via Viterbi algorithm
Shirin Jalali, Andrea Montanari, Tsachy Weissman
DCC
2009
IEEE
14 years 6 months ago
An Implementable Scheme for Universal Lossy Compression of Discrete Markov Sources
We present a new lossy compressor for discrete sources. For coding a source sequence xn , the encoder starts by assigning a certain cost to each reconstruction sequence. It then f...
Shirin Jalali, Andrea Montanari, Tsachy Weissman
TIT
2010
300views Education» more  TIT 2010»
13 years 1 days 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
154views Education» more  TIT 2010»
13 years 1 days ago
A universal scheme for Wyner-Ziv coding of discrete sources
We consider the Wyner-Ziv (WZ) problem of lossy compression where the decompressor observes a noisy version of the source, whose statistics are unknown. A new family of WZ coding a...
Shirin Jalali, Sergio Verdú, Tsachy Weissma...
CORR
2008
Springer
121views Education» more  CORR 2008»
13 years 5 months ago
Rate-Distortion via Markov Chain Monte Carlo
We propose an approach to lossy source coding, utilizing ideas from Gibbs sampling, simulated annealing, and Markov Chain Monte Carlo (MCMC). The idea is to sample a reconstructio...
Shirin Jalali, Tsachy Weissman