Zero-tree packetization without additional memory using DFS


The KIPS Transactions:PartB , Vol. 10, No. 5, pp. 575-578, Aug. 2003
10.3745/KIPSTB.2003.10.5.575,   PDF Download:

Abstract

SPIHT algorithm is a wavelet based fast and effective technique for image compression. It uses a list structure to store status information which is generated during set-partitioning of zero-tree. Usually, this requires lots of additional memory depending on how high the bit-rate is. Therefore, in this paper, we propose a new technique called MZP-DFS, which needs no additional memory when running SPIHT algorithm. It traverses a spatial-tree according to DFS and eliminates additional memory as it uses test-functions for encoding and LSB bits of coefficients for decoding respectively. This method yields nearly the same performance as SPIHT. This may be desirable in hardware implementation because no additional memory is required. Moreover, it exploits parallelism to process each spatial-tree that it can be applied well in real-time image compression.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
K. C. Gil, L. J. Gyeong, J. G. Dong, "Zero-tree packetization without additional memory using DFS," The KIPS Transactions:PartB , vol. 10, no. 5, pp. 575-578, 2003. DOI: 10.3745/KIPSTB.2003.10.5.575.

[ACM Style]
Kim Chung Gil, Lee Ju Gyeong, and Jeong Gi Dong. 2003. Zero-tree packetization without additional memory using DFS. The KIPS Transactions:PartB , 10, 5, (2003), 575-578. DOI: 10.3745/KIPSTB.2003.10.5.575.