Skip to main content
Article
Highly scalable image compression based on SPIHT for network applications
Faculty of Informatics - Papers (Archive)
  • H. Danyali, University of Wollongong
  • Alfred Mertins, University of Wollongong
RIS ID
7961
Publication Date
1-9-2002
Publication Details
This article was originally published as: Danyali, H & Mertins, A, Highly scalable image compression based on SPIHT for network applications, Proceedings International Conference on Image Processing, 22-25 September 2002 , 1, 1-217 - 1-220. Copyright IEEE 2002.
Abstract

We propose a highly scalable image compression scheme based on the set partitioning in hierarchical trees (SPIHT) algorithm. Our algorithm, called highly scalable SPIHT (HS-SPIHT), supports spatial and SNR scalability and provides a bitstream that can be easily adapted (reordered) to given bandwidth and resolution requirements by a simple transcoder (parser). The HS-SPIHT algorithm adds the spatial scalability feature without sacrificing the SNR embeddedness property as found in the original SPIHT bitstream. HS-SPIHT finds applications in progressive Web browsing, flexible image storage and retrieval, and image transmission over heterogeneous networks.

Citation Information
H. Danyali and Alfred Mertins. "Highly scalable image compression based on SPIHT for network applications" (2002)
Available at: http://works.bepress.com/amertins/7/