Paper Info
Title
Memory Efficient Set Partitionning in Hierarchical Tree (MESH) for Wavelet Image Compression
Abstract
This paper presents a memory efficient version of set partitioning in hierarchical tree (SPIHT). The proposed coder termed as Memory Efficient SPIHT (MESH), uses a single re-usable list instead of three continuously growing linked lists as in conventional SPIHT. The list is re-initialized at the beginning of each bit-plane (coding pass) and is exhausted within that bit-plane itself. Another feature of the proposed coder is that it uses a single pass for each bit-plane by merging the sorting and refinement passes of conventional SPIHT together. The reinitialization of list in each bit-plane makes the proposed coder inherently error resilient. The performance of the proposed coder is measured in terms of coding efficiency and the worst case memory requirements for list entries in each bit-plane. The performance comparison with SPIHT shows that the proposed algorithm results in 50-70% memory saving while retaining the coding efficiency comparable to SPIHT.
Year
DOI
Venue
2005
10.1109/ICASSP.2005.1415422
ICASSP '05). IEEE International Conference
Keywords
Field
DocType
image coding,trees (mathematics),wavelet transforms,MESH,SPIHT,bit-plane coding pass list reinitialization,coding efficiency,hierarchical tree set partitioning,memory efficient set partitioning,reusable list,single bit-plane coding pass,wavelet image compression
Algorithmic efficiency,Linked list,Pattern recognition,Set partitioning in hierarchical trees,Computer science,Wavelet image compression,Parallel computing,Block code,Sorting,Coding (social sciences),Artificial intelligence,Wavelet transform
Conference
Volume
ISSN
ISBN
2
1520-6149
0-7803-8874-7
Citations 
PageRank 
References 
1
0.37
4
Authors
4
Name
Order
Citations
PageRank
Harish Arora110.37
Pramit Singh210.37
E. Khan35612.71
Farid Ghani483.31