Fast implementation of two-level compression method using QM-coder

We deal with bi-level image compression. Modern methods consider the bi-level image as a high order Markovian source, and by exploiting this characteristic, can attain better performance. At a first glance, the increasing of the order of the Markovian model in the modelling process should yield a hi...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:DCC (Los Alamitos, Calif.) s. 459
Hlavní autoři: Nguyen-Phi, K., Weinrichter, H.
Médium: Konferenční příspěvek Journal Article
Jazyk:angličtina
Vydáno: IEEE 1997
Témata:
Arithmetic
Context modeling
Hydrogen
Image coding
Testing
ISBN:9780818677618, 0818677619
ISSN:1068-0314
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!
Popis
Shrnutí:We deal with bi-level image compression. Modern methods consider the bi-level image as a high order Markovian source, and by exploiting this characteristic, can attain better performance. At a first glance, the increasing of the order of the Markovian model in the modelling process should yield a higher compression ratio, but in fact, it is not true. A higher order model needs a longer time to learn (adaptively) the statistical characteristic of the source. If the source sequence, or the bi-level image in this case, is not long enough, then we do not have a stable model. One simple way to solve this problem is the two-level method. We consider the implementation aspects of this method. Instead of using the general arithmetic coder, an obvious alternative is using the QM-coder, thus reducing the memory used and increasing the execution speed. We discuss some possible heuristics to increase the performance. Experimental results obtained with the ITU-T test images are given.
Bibliografie:SourceType-Scholarly Journals-2
ObjectType-Feature-2
ObjectType-Conference Paper-1
content type line 23
SourceType-Conference Papers & Proceedings-1
ObjectType-Article-3
ISBN:9780818677618
0818677619
ISSN:1068-0314
DOI:10.1109/DCC.1997.582123