Abstract
In this paper, we propose a procedure that enhances the very low bit-rate coding performance of Set Partitioning in Hierarchical Trees (SPIHT)-based image coders. In SPIHT-based algorithms, all nodes with descendants in the LL band are initially added to the list of insignificant sets as type-A entries. Our experiments indicate that type-A nodes are highly likely to be insignificant during the sorting passes of the high bit planes. Our new procedure exploits this characteristic so that all these type-A nodes can be encapsulated into a single virtual node.