Block and Sliding-Block Lossy Compression via MCMC

We propose an approach to lossy compression of finite-alphabet sources that utilizes Markov chain Monte Carlo (MCMC) and simulated annealing methods. The idea is to define an energy function over the space of reconstruction sequences. The energy of a candidate reconstruction sequence is defined such...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	IEEE transactions on communications Ročník 60; číslo 8; s. 2187 - 2198
Hlavní autori:	Jalali, Shirin, Weissman, Tsachy
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York, NY IEEE 01.08.2012 Institute of Electrical and Electronics Engineers
Predmet:	Applied sciences Coding, codes Compression algorithms Encoding Entropy Exact sciences and technology Gibbs sampler Information, signal and communications theory Markov chain Monte Carlo Markov processes Rate-distortion Rate-distortion coding Signal and communications theory Simulated annealing Telecommunications and information theory universal lossy compression Vectors Alphabet Lossy compression Performance evaluation Block code Energy function Rate distortion theory Ergodicity Iterative method Gibbs sampling Gibbs sampler MCMC algorithm Coding universal lossy compression Markov chain Monte Carlo Simulated annealing Rate-distortion coding
ISSN:	0090-6778
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!