- Title:
- Highly Scalable Image Compression Based
- Presenter:
- Habibollah Danyali
- Date:
- September 06, 2002
- Abstract:
- Traditional image coding systems have only focused on efficient compression of
image data. The main objective of such systems is optimizing image quality at
given bit rate. Due to the explosive growth of the Internet and networking
technology, nowadays a huge number of users with different capabilities of
processing and network access bandwidth can transfer and access data easily.
For transmission of visual data on such a heterogenous network,efficient
compression itself is not sufficient. There is an increasing demand for
scalability to optimally service each user according to his bandwidth and
computing capabilities.
In this presentation 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.
Back to:
|
