Abstract
In this chapter a highly scalable image coding algorithm for texture coding of arbitrarily shaped visual objects is proposed. The proposed algorithm is based on the Set Partitioning in Hierarchical Trees (SPIHT) algorithm and is called Object-Based Highly Scalable SPIHT (OBHS-SPIHT). It adds the spatial scalability feature to the SPIHT algorithm through the introduction of multiple resolution-dependent lists for the sorting stage of the algorithm, while retaining the important features of the original algorithm such as compression efficiency and full SNR (rate) scalability. The idea of bitstream transcoding to obtain different bitstreams for various spatial resolutions and bit rates, all from a single bitstream, is completely supported by the algorithm. The proposed algorithm efficiently facilitates the distribution of visual information especially over heterogeneous networks such as the Internet.
| Original language | English |
|---|---|
| Title of host publication | Signal Processing for Telecommunications and Multimedia |
| Editors | Tadeusz A. Wysocki, Bahram Honary, Beata J. Wysocki |
| Number of pages | 13 |
| Place of Publication | Boston, MA |
| Publisher | Springer US |
| Publication date | 2005 |
| Pages | 57-69 |
| ISBN (Print) | 978-0-387-22847-1 |
| ISBN (Electronic) | 978-0-387-22928-7 |
| DOIs | |
| Publication status | Published - 2005 |
