SPIHT algorithms using Depth First Search algorithm with minimum memory usage

2006 IEEE Conference on Information Sciences and Systems, CISS 2006 - Proceedings

Volumn , Issue , 2006, Pages 1158-1163

  Sakalli, Mustafa ^a   Pearlman, William A ^a   Farshchian, Masoud ^b  

^a RENSSELAER POLYTECHNIC INSTITUTE   (United States)

^b NONE

Author keywords

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

Indexed keywords

BINARY SEQUENCES; DECODING; HIERARCHICAL SYSTEMS; IMAGE CODING; RANDOM ACCESS STORAGE; STORAGE ALLOCATION (COMPUTER);

BLOCK WISE SET PARTITIONING; BREADTH FIRST SEARCH ALGORITHM (BFS); DEPTH FIRST SEARCH ALGORITHM (DFS); HIERARCHICAL TREES; IMAGE CODING WITH SET PARTITIONING IN HIERARCHICAL TREES (SPIHT); MEMORY USAGE; TREE SEARCH;

DATA MINING;

EID: 44049097200     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CISS.2006.286640     Document Type: Conference Paper

References (4)

1. A. Said and W.A. Pearlman, "A New Fast and Efficient Image Codec Based on Set Partitioning in Hierarchical Trees, "IEEE Trans. On Circuits and Systems for Video Technology, vol. 6., pp. 243-250, June 1996.
2. F. W. Wheeler and W. A. Pearlman, "SPIHT Image Compression without Lists," ICASSP 2000, June.
3. A. Said, "Example of SPIHT Application for Image Compression" 1999, available at http://www.cipr.rpi.edu/~pearlman/papers/ex_spiht-ezw.pdf.
4. H. Arora, et al, "Memory Efficient Set Partitioning in Hierarchical Tree (MESH) for Wavelet Image Compression" ICASSP 2005, March.