Application level framing applied to image compression

Two well-known wavelet zerotree encoding algorithms, Embedded Zerotree Encoding (Ezw) and Set Partitioning in Hierarchical Trees (Spiht), provide excellent progressive display when images are transmitted over reliable networks. However, both algorithms are state-dependent and can perform poorly over unreliable networks. We apply the concept of network-conscious image compression to theSpiht wavelet zerotree encoding algorithm, to improve its performance over unreliable networks. Experimental results confirm the utility of network-conscious image compression concept.RésuméLe codage par ondelettes avec quantification hiérarchique de type «arbre nul» constitue une façon efficace de comprimer les images. Dans une perspective de transmission d’images, deux algorithmes de codage classiques,Ezw (Embedded Zerotree Encoding) etSpiht (Set Partitioning in Hierarchical Trees), permettent un affichage progressif de bonne qualité lorsque les images sont transmises sur un réseau fiable. Cependant, les deux algorithmes dépendent de l’état du réseau et une erreur introduite par le réseau peut altérer sérieusement le résultat. Nous appliquons le concept de compression d’image consciente du réseau à l’algorithme spiht pour l’amélioration de ses performances dans des environnement réseau non fiables. Nos résultats confirment l’avantage de cette technique dans certaines situations de qualités de service.

[1]  Kenneth Zeger,et al.  Macroscopic multistage image compression for robust transmission over noisy channels , 1998, Electronic Imaging.

[2]  William A. Pearlman,et al.  A new, fast, and efficient image codec based on set partitioning in hierarchical trees , 1996, IEEE Trans. Circuits Syst. Video Technol..

[3]  Paul D. Amer,et al.  SPIHT-NC: network-conscious zerotree encoding , 2000, Proceedings DCC 2000. Data Compression Conference.

[4]  Charles D. Creusere Image coding using parallel implementations of the embedded zerotree wavelet algorithm , 1996, Electronic Imaging.

[5]  A. Said,et al.  Manuscript Submitted to the Ieee Transactions on Circuits and Systems for Video Technology a New Fast and Eecient Image Codec Based on Set Partitioning in Hierarchical Trees , 2007 .

[6]  David D. Clark,et al.  Architectural considerations for a new generation of protocols , 1990, SIGCOMM '90.

[7]  Paul D. Amer,et al.  Testing environment for innovative transport protocols , 1998, IEEE Military Communications Conference. Proceedings. MILCOM 98 (Cat. No.98CH36201).

[8]  Charles D. Creusere Family of image compression algorithms which are robust to transmission errors , 1996, Optics & Photonics.

[9]  Thomas R. Fischer,et al.  Intraframe low bit rate video coding robust to packet erasure , 1997, Proceedings DCC '97. Data Compression Conference.

[10]  Paul D. Amer,et al.  Network-conscious image compression , 1999 .

[11]  Pamela C. Cosman,et al.  Robust wavelet zerotree image compression with fixed-length packetization , 1998, Proceedings DCC '98 Data Compression Conference (Cat. No.98TB100225).

[12]  Jerome M. Shapiro,et al.  Embedded image coding using zerotrees of wavelet coefficients , 1993, IEEE Trans. Signal Process..

[13]  I. Damgård,et al.  The protocols. , 1989, The New Zealand nursing journal. Kai tiaki.

[14]  Paul D. Amer,et al.  Network-Conscious Compressed Images over Wireless Networks , 1998, IDMS.

[15]  Paul D. Amer,et al.  Network-conscious GIF image transmission over the Internet , 1999, Comput. Networks.

[16]  F. Kossentini,et al.  Robust EZW image coding for noisy channels , 1997, IEEE Signal Processing Letters.

[17]  Paul D. Amer,et al.  NETCICATS: Network-Conscious Image Compression and Transmission System , 1998, Multimedia Information Systems.

[18]  Marten van Sinderen,et al.  Interactive Distributed Multimedia Systems and Telecommunication Services , 2002, Lecture Notes in Computer Science.