Work

Bi-level image compression with tree coding

Year: 2002
Type: conference-paper
Abstract: Presently, tree coders are the best bi-level image coders. The current ISO standard, JBIG, is a good example. By organising code length calculations properly a vast number of possible models (trees) can be investigated within reasonable time prior to generating code. Three general-purpose coders are constructed by this principle. A multi-pass free tree coding scheme produces superior compression results for all test images. A multi-pass fast free template coding scheme produces much better results than JBIG for difficult images, such as halftonings. Rissanen's algorithm 'Context' is presented in a new version that without sacrificing speed brings it close to the multi-pass coders in compression performance.
Source: DCC
Language: English
Open Access status: green
OpenAlex ID: W2129182828
FWCI: 1.849
Cites: 10
Cited by: 22
Related to: 10