Limiting distortion of a wavelet image codec

A new image compression algorithm. Distortion Limited Wavelet Image Codec (DLWIC), is introduced. The codec is designed to be simple to implement, fast and have modest requirements for the working storage. It is shown, how the distortion of the result can be calculated while progressively coding a t...

Teljes leírás

Elmentve itt :
Bibliográfiai részletek
Szerző: Lehtinen Joonas
Testületi szerző: Conference for PhD Students in Computer Science (1.) (1998) (Szeged)
Dokumentumtípus: Cikk
Megjelent: 1999
Sorozat:Acta cybernetica 14 No. 2
Kulcsszavak:Számítástechnika, Kibernetika
Tárgyszavak:
Online Access:http://acta.bibl.u-szeged.hu/12631
LEADER 02081nab a2200229 i 4500
001 acta12631
005 20220614094350.0
008 161015s1999 hu o 0|| eng d
022 |a 0324-721X 
040 |a SZTE Egyetemi Kiadványok Repozitórium  |b hun 
041 |a eng 
100 1 |a Lehtinen Joonas 
245 1 0 |a Limiting distortion of a wavelet image codec  |h [elektronikus dokumentum] /  |c  Lehtinen Joonas 
260 |c 1999 
300 |a 341-356 
490 0 |a Acta cybernetica  |v 14 No. 2 
520 3 |a A new image compression algorithm. Distortion Limited Wavelet Image Codec (DLWIC), is introduced. The codec is designed to be simple to implement, fast and have modest requirements for the working storage. It is shown, how the distortion of the result can be calculated while progressively coding a transformed image and thus how the mean square error of the result can be limited to a predefined value. The DLWI C uses zerotrees for efficient coding of the wavelet coefficients. Correlations between different orientation components axe also taken into account by binding together the coefficients on the three different orientation components in the same spatial location. The maximum numbers of significant bits in the coefficients of all subtrees are stored in two-dimensional heap structure that allows the coder to test the zerotree property of a subtree with only one comparison. The compression performance of the DLWI C is compared to the industry standard JPEG compression and to an advanced wavelet image compression algorithm, vqSPIHT. An estimation of execution speed and memory requirements for the algorithm is given. The compression performance of the algorithm seems to exceed the performance of the JPEG and to be comparable with the vqSPIHT. 
650 4 |a Természettudományok 
650 4 |a Számítás- és információtudomány 
695 |a Számítástechnika, Kibernetika 
710 |a Conference for PhD Students in Computer Science (1.) (1998) (Szeged) 
856 4 0 |u http://acta.bibl.u-szeged.hu/12631/1/cybernetica_014_numb_002_341-356.pdf  |z Dokumentum-elérés