SPIHT algorithms using Depth First Search Algorithm with minimum memory usage
Mustafa Sakalli, William A. Pearlman, Masoud Farshchian · 2006
This paper presents SPIHT and block-wise SPIHT algorithms where full depth first search algorithm is used to agglomerate significant bits at each bitplane. Search strategies used for SPIHT to date are more or less based on a breadth first search algorithm. The aim of this work is to minimize the final memory usage without paying additional overhead cost. DFS also brings benefits such as resolution scalability and a random access decodable bitstream.