Lossy Compression of Discrete Sources via the Viterbi Algorithm

We present a new lossy compressor for finite-alphabet sources. For coding a sequence x n , the encoder starts by assigning a certain cost to each possible reconstruction sequence. It then finds the one that minimizes this cost and describes it losslessly to the decoder via a universal lossless compr...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	IEEE transactions on information theory Ročník 58; číslo 4; s. 2475 - 2489
Hlavní autoři:	Jalali, S., Montanari, A., Weissman, T.
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York, NY IEEE 01.04.2012 Institute of Electrical and Electronics Engineers The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:	Algorithm design and analysis Algorithms Applied sciences Approximation Approximation algorithms Approximation methods Codes Coding, codes Compression algorithms Entropy Exact sciences and technology Information theory Information, signal and communications theory Rate-distortion coding Signal and communications theory Telecommunications and information theory universal compression Vectors Viterbi algorithm Alphabet Lossy compression Performance evaluation Cost minimization Lossless circuit Coding circuit Rate distortion theory Ergodicity Lossy medium Iterative method universal compression Decoding Algorithm Viterbi code Viterbi algorithm Linear combination Coding Rate-distortion coding Cost function
ISSN:	0018-9448, 1557-9654
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!