Modified SPIHT algorithm for wavelet packet image coding
Introduction
Discrete Wavelet Transform (DWT) provides a multiresolution image representation and has become one of the most important tools in image analysis and coding over the last two decades. Image compression algorithms based on DWT [1], [2], [3], [4], [5], [6], [7], [8] provide high coding efficiency for natural (smooth) images. As dyadic DWT does not adapt to the various space-frequency properties of images, the energy compaction it achieves is generally not optimal. However, the performance can be improved by selecting the transform basis adaptively to the image. Wavelet Packets (WP) represent a generalization of wavelet decomposition scheme. WP image decomposition adaptively selects a transform basis that will be best suited to the particular image. To achieve that, the criterion for best basis selection is needed.
Coifman and Wickerhauser proposed entropy based algorithm for best basis selection [9]. In their work, the best basis is a basis that describes the particular image with the smallest number of basis functions. It is a one-sided metric, which is therefore not optimal in a joint rate-distortion sense. A more practical metric considers the number of bits (rate) needed to approximate an image with a given error (distortion) [10] but this approach and its variation presented in [11] can be computationally too intensive. In [12] a fast numerical implementation of the best wavelet packet algorithm is provided. Coding results show that fast wavelet packet coder can significantly outperform a sophisticated wavelet coder constrained to using only a dyadic decomposition, with a negligible increase in computational load.
The goal of this paper is to demonstrate advantages and disadvantages of using WP decomposition in SPIHT-based codec. SPIHT algorithm was introduced by Said and Pearlman [13], and is improved and extended version of Embedded Zerotree Wavelet (EZW) coding algorithm introduced by Shapiro [14]. Both algorithms work with tree structure, called Spatial Orientation Tree (SOT), that defines the spatial relationships among wavelet coefficients in different decomposition subbands. In this way, an efficient prediction of significance of coefficients based on significance of their “parent” coefficients is enabled. The main contribution of Shapiro's work is zerotree quantization of wavelet coefficients and introduction of special zerotree symbol indicating that all coefficients in a SOT are found to be insignificant with respect to a particular quantization threshold. An embedded zerotree quantizer refines each input coefficient sequentially using a bitplane coding scheme, and it stops when the size of the encoded bitstream reaches the target bit-rate. SPIHT coder provides gain in PSNR over EZW due to introduction of a special symbol that indicates significance of child nodes of a significant parent and separation of child nodes (direct descendants) from second-generation descendants. To date, there have been numerous variants and extensions to SPIHT algorithm, for example: 3-D SPIHT for video coding [15], [16], [17], [18], [19], SPIHT for color image coding [20], [21], and scalable SPIHT for network applications [22], [23], [24], [25].
Since the SPIHT algorithm relies on Spatial Orientation Trees (SOT) defined on dyadic subband structure, there are a few problems that arise from their adaptation to WP decomposition. First is the so-called parental conflict [26], that happens when in the wavelet packet tree one or more of the child nodes are at the coarser scale than the parent node. It must be resolved in order that SOT structure with well-defined parent–child relationships for an arbitrary wavelet decomposition can be created. Xiong et al. [11] avoided the parental conflict by restricting the choice of the basis. In their work the Space-Frequency Quantization (SFQ) algorithm is used. SFQ algorithm employs a rate-distortion (R-D) optimization framework for selecting the best basis and to assign an optimal quantiser to each of the wavelet packet subbands. Rajpoot et al. [26] defined a set of rules to construct the zerotree structure for a given wavelet packet geometry and offered a general structure for an arbitrary WP decomposition. In their work a Compatible Zerotree Quantisation (CZQ) is utilized, and it does not impose restriction on the selection of WP basis. A comparison of PSNR obtained with CZQ-WP and SPIHT shows that SPIHT provides gain in PSNR over CZQ-WP for the standard test images, while CZQ-WP offers better visual quality than SPIHT [26]. This observation motivated us to use SPIHT with WP in order to exploit strengths of both methods. This extension of SPIHT we call Wavelet Packet SPIHT (WP-SPIHT).
This paper is organized as follows: In Section 2 wavelet analysis in the context of WP-SPIHT is described. In Section 3 we explain WP-SPIHT algorithm. Coding results are presented in Section 4, followed by conclusion in Section 5.
Section snippets
Wavelet analysis
Wavelet analysis of an image can be viewed in the frequency domain as partitioning into a set of subbands, where each partitioning step is obtained by applying the 2D wavelet transform. One level of 2D wavelet transform results in four sets of data (wavelet coefficients), that correspond to four 2D frequency subbands. For these four subbands, if the original image data is on the zero decomposition level (scale), we use the following notation on kth decomposition level: (high–high or
Definition of SOTs in WP-SPIHT
SPIHT algorithm exploits the statistical properties of pyramid wavelet transformed image, which are energy compaction, cross-subband similarity and decaying of coefficient magnitudes across subbands. Fig. 2 indicates the SOTs and corresponding parent–children relationships across the subbands in the case of the dyadic decomposition. In the text that follows, a wavelet transform coefficient is also referred to as a “pixel”. Let denote the wavelet transform coefficient (pixel) at
Experimental results
WP-SPIHT algorithm has been tested on eight images: “Goldhill”, “Lena”, “Barbara”, “Fingerprints”, “Zone” and three textures from the “Brodatz” album [28]—“D49”, “D76” and “D106”. Biorthogonal 9/7 transform is used for wavelet packets decomposition. Fig. 4 shows examples of best basis geometry from the experiments. The software used in experiments is available at [29].
We present WP-SPIHT and SPIHT coding results both visually and in the terms of PSNR. For natural images “Lena”,
Conclusion
Efficient set of rules for establishing zerotree structures when used with WP decomposition is presented. The proposed solution enables the modification of popular SPIHT scheme, called WP-SPIHT—a combination of WP as a decomposition method with SPIHT as an image compression scheme. The compression performance of WP-SPIHT has been compared to SPIHT both visually and in terms of PSNR. WP-SPIHT significantly outperforms SPIHT for textures. For natural images, which consist of both smooth and
References (29)
- et al.
Efficient encryption of wavelet-based coded color images
Pattern Recognition
(2005) - et al.
Image coding using the wavelet transform
IEEE Transactions on Image Processing
(1992) - et al.
Performance analysis of image compression using wavelets
IEEE Transactions on Industrial Electronics
(2002) - Grgic S, Kers K, Grgic M. Image compression using wavelets. Proceedings of the IEEE international symposium on...
- et al.
Compressing still and moving images with wavelets
Multimedia Systems
(1994) - et al.
Image compression using the 2-D wavelet transform
IEEE Transactions on Image Processing
(1992) - et al.
JPEG2000 image compression: fundamentals, standards and practice
(2002) - Martin K, Lukac R, Plataniotis KN, Binary shape mask representation for zerotree-based visual object coding....
- et al.
Entropy based algorithms for best basis selection
IEEE Transactions on Information Theory
(1992) - et al.
Best wavelet packet bases in a rate distortion sense
IEEE Transactions on Image Processing
(1993)
Wavelet packet image coding using space-frequency quantization
IEEE Transactions on Image Processing
Fast adaptive wavelet packet image compression
IEEE Transactions on Image Processing
A new fast and efficient image codec based on set partitioning in hierarchical trees
IEEE Transactions on Circuits and Systems for Video Technology
Embedded image coding using zerotrees of wavelets coefficients
IEEE Transactions on Signal Processing
Cited by (41)
Hierarchical quantization indexing for wavelet and wavelet packet image coding
2010, Signal Processing: Image CommunicationCitation Excerpt :Among such tools, hierarchical zero-trees in EZW [1] and SFQ [2], set partitioning in hierarchical trees, i.e. SPIHT [3], and its modified versions [4,5], and block partitioning of wavelet subbands in EZBC [6] are especially worth mentioning. The same partitioning tools could be easily adapted to be used in wavelet packets, resulting in coders such as WP&SFQ [7], WP-SPIHT [8,7] and WP-BPO [9]. All of these successful wavelet and wavelet packet coders share a similar approach in how they handle the wavelet domain information during coding.
Non-redundant Tunable-Q Contourlet Transform and Its Application to Image Coding
2021, Research SquareEmpirical performance analysis of wavelet transform coding-based image compression techniques
2019, Examining Fractal Image Processing and AnalysisOptimum Space-Frequency Partition in Subband Image Coding Based on Rate-Distortion Sense
2019, Journal of the Institute of Image Electronics Engineers of JapanAn Efficient Source–Channel Coding for Wireless Image Transmission Over Underwater Acoustic Channel
2017, Wireless Personal CommunicationsThe optimum space-frequency partition for subband image coding in a rate-distortion sense
2017, 2016 Picture Coding Symposium, PCS 2016