Title :
SPIHT algorithms using Depth First Search Algorithm with minimum memory usage
Author :
Sakalli, Mustafa ; Pearlman, William A. ; Farshchian, Masoud
Author_Institution :
Center for Image Process. Res., Rensselaer Polytech. Inst., Troy, NY
Abstract :
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.
Keywords :
image coding; tree searching; DFS; block-wise SPIHT algorithm; breadth first search algorithm; depth first search algorithm; image coding; minimum memory usage; Bit rate; Costs; Decoding; Encoding; Frequency; Multimedia communication; Partitioning algorithms; Scalability; Wavelet coefficients; Block-wise Set Partitioning in Hierarchical Trees; Breadth First Search Algorithm (BFS); Depth First Search Algorithm (DFS); Image Coding with Set Partitioning in Hierarchical Trees (SPIHT); Memory Usage; Tree Search;
Conference_Titel :
Information Sciences and Systems, 2006 40th Annual Conference on
Conference_Location :
Princeton, NJ
Print_ISBN :
1-4244-0349-9
Electronic_ISBN :
1-4244-0350-2
DOI :
10.1109/CISS.2006.286640
