Hybrid Image Compression Based on Set-Partitioning Embedded Block Coder and Residual Vector Quantization
|
|
- Edith Bailey
- 5 years ago
- Views:
Transcription
1 JOURNAL OF INFORMATION SCIENCE AND ENGINEERING 26, (2010) Hybrid Image Compression Based on Set-Partitioning Embedded Block Coder and Residual Vector Quantization SHENG-FUU LIN, HSI-CHIN HSIN * AND CHIEN-KUN SU + Department of Electrical and Control Engineering National Chiao Tung University Hsinchu, 300 Taiwan * Department of Computer Science and Information Engineering National United University Miaoli, 360 Taiwan + Department of Electrical Engineering Chung Hua University Hsinchu, 300 Taiwan A hybrid image coding scheme based on the set-partitioning embedded block coder (SPECK) and residual vector quantization (RVQ) is proposed for image compression. In which, the scaling and wavelet coefficients of an image are coded by using the original SPECK algorithm and the SPECK with RVQ, respectively. The use of hybrid coding strategy by combining SPECK with RVQ for high frequency wavelet coefficients is to take account of the energy clustering property of wavelet transform. Experimental results show that, for gray-level still images, the proposed hybrid RVQ-SPECK coder outperforms SPECK, e.g. the peak-signal-to-noise-ratio (PSNR) values can be improved by 1.67 db and 0.69 db at compression rate of 1 bit per pixel for the gray-level Lena and Barbra images, respectively. The application for chroma subsampling images is also presented in this paper, and the proposed method usually outperforms color SPECK method. The PSNR values can be improved by 1.11 db for the Y plane, 0.99 db for the U plane, and 2.31 db for the V plane at the bit budget of 81,920 bits for the test image Goldhill. In addition to high coding efficiency, the proposed method also preserves the features of embeddedness, low decoding complexity, and exact bit-rate control. Keywords: image compression, residual vector quantization (RVQ), set-partitioning embedded block coder (SPECK), chroma subsampling images, embeddedness 1. INTRODUCTION For the needs of high quality images, fast transmission, and less storage space, image compression is demanding increasingly. Differential pulse code modulation, transform coding, subband coding, and many other image compression techniques have been developed [1-3]. State-of-the-art techniques can compress typical images by a factor ranging from 10 to 50 with acceptable quality [4]. The Joint Photographic Experts Group (JPEG) image standard [5] known as the most widely used transform-coding based algorithm shows good performances at moderate compression ratios. Recently, the wavelet based multiresolution representation has received a lot of attention to the compression applications, as manifested in the JPEG2000 standard [6, 7]. Many wavelet based image coding algorithms such as the embedded zero-tree wavelets (EZW) [8], set partitioning in Received July 8, 2008; revised November 20, 2008; accepted February 12, Communicated by Liang-Gee Chen. 1011
2 1012 SHENG-FUU LIN, HSI-CHIN HSIN AND CHIEN-KUN SU hierarchical trees (SPIHT) [9], morphological representation of wavelet data (MRWD) [10], group testing for wavelets (GTW) [11], and the set-partitioning embedded block coder (SPECK) [12, 13] have been proposed with a great success. In wavelet domain, the higher detailed components of an image are projected onto the shorter basis functions with higher spatial resolutions, and the lower detailed components are projected onto the larger basis functions with narrower bandwidths; this matches the characteristics of a human visual system [14]. In SPECK, the well-defined hierarchical structure with energy clustering within high frequency subbands has been taken into account such that the significant wavelet transform coefficients of an image can be efficiently coded as early as possible. SPECK has been incorporated into the verification model of JPEG 2000, which is known as subband hierarchical block partitioning (SBHP) [15]. Another variant of SPECK called the embedded zero block coding (EZBC) [16] is much more complicated, which combines SPECK with a context-based adaptive arithmetic coder to improve the compression performance. According to Shannon s theory [17, 18], vector quantization (VQ) can significantly reduce the coding bits of signals, comparing to scalar quantization. Hence, VQ plays an important role in many applications, e.g. speech recognition, volume rendering, and image compression. Gupta et al. utilized VQ to compress multispectral satellite images [19]. Su et al. developed a hybrid coding system by using SPIHT and VQ for image compression in [20]. Abdel-Galil et al. applied VQ to power systems for classifying power quality disturbances [21]. When the code vector and code book sizes become large enough, the distortion of the vector quantizer approaches the lower bound of the distortion-rate relation. However, both the computation complexity and memory requirement, associated with the vector quantizer, increase exponentially. Hence, an unconstrained full search vector quantizer usually uses small vectors. For reducing the computation complexity and memory requirements of VQ, several variants of the original VQ had been proposed in literature, such as residual vector quantization (RVQ) [22, 23, 25], hierarchical VQ [24], and tree-structured VQ (TSVQ) [18]. Each VQ variant makes a compromise between the computation complexity and performance. RVQ or multistage VQ [25] is a VQ variant with less computation complexity. Because the decoder of a RVQ is constrained by a direct-sum codebook structure and the encoder typically uses a suboptimal stage-sequential search procedure, the RVQ results in performance degradation. For efficiently coding high-frequency wavelet coefficients with energy clustering and compromising the complexity and performance of an image coder, a hybrid coder using SPECK and residual VQ (RVQ) is thus proposed for image compression. Specifically, the significant high-frequency wavelet coefficients of an image are to be coded on the basis of coefficient vectors, which can be efficiently located by using the significance coding procedure of SPECK. Recently, Chao et al. proposed a vector SPECK algorithm for gray-level still image compression [27] which is a variation on SPECK using VQ to code the significant coefficients. They used very sophisticated VQ method to improve compression efficiency at the cost of added complexity. The proposed hybrid method in this paper and the vector SPECK method were developed independently and with many differences in implementation, although both methods involve SPECK and VQ and have good performance.
3 HYBRID IMAGE COMPRESSION BASED ON SPECK AND RVQ 1013 The remainder of this paper proceeds as follows. Section 2 describes the proposed hybrid image coder which combines SPECK and RVQ. Experimental results are given in section 3, and conclusions are given in section THE PROPOSED HYBRID IMAGE COMPRESSION METHOD The SPECK algorithm, which was proposed by Pearlman et al., is a simple, efficient image coder with coding scalability. By recursively partitioning a significant block of a transformed image, SPECK locates the significant coefficients in the block and performs scalar quantization on these significant coefficients to generate a coded bit-stream. Since vector quantization is more efficient than scalar quantization according to Shannon s rate-distortion theory, developing a hybrid image coder combining SPECK with VQ was motivated. For reducing the computational complexity, RVQ was selected to be combined with SPECK to constitute the proposed hybrid codec, and experimental results showed that the proposed hybrid method is efficient in image compression. In subsection 2.1, the application for still gray-level images will be discussed, and a chroma-subsamplingimage application of the proposed hybrid method will be presented in subsection 2.2. In subsection 2.3, we will discuss the computational complexity and required memory of the proposed hybrid method in gray-level image compression. 2.1 Application for Gray-Level Still Images A hybrid image coding system by combining SPECK with RVQ is therefore proposed to improve the compression performance, and Fig. 1 shows the block diagram which can be directly used for still gray-level image compression. In the first block, an input gray-level image is transformed by 2D discrete wavelet transform (DWT) to generate its transformed image for further processing. For example, Fig. 2 shows the result of a 4-decomposition-level 2D DWT. The coefficients of the transformed image are classified into two parts. One is the LL subband which contains the scaling coefficients, and the other is the high-frequency subbands which include all the coefficients of the transformed coefficients excluding those in LL subband. The scaling coefficients represent the lowest frequency component of an image, and they can be coded efficiently by using the original (scalar) SPECK algorithm. On the other hand, the wavelet coefficients in highfrequency subbands are coded by using the SPECK with RVQ. Finally, the coded bitstream can be obtained by the use of multiplex operation. Input image DWT LL subband H, D, V subbands Scalar SPECK SPECK with RVQ Mux Fig. 1. The proposed hybrid image coder. Coded bit-stream
4 1014 SHENG-FUU LIN, HSI-CHIN HSIN AND CHIEN-KUN SU Fig. 2. The partition and assignment of a 4-decomposition-level transformed image. For the quantization of the coefficients in LL subband, original SPECK starts from the most significant n max bit plane, where n max max log 2 ( cij ) c LL, = ij (1) and c ij represents a coefficient in LL subband. Those scaling coefficients, whose magnitudes are greater than or equal to 2 n max are located in the first pass. Then, the coefficients, whose magnitudes are in interval [2 n max -1, 2 n max ), are located in the second pass, and the procedure goes on until all the coefficients are located or the bit-budget is exhausted. In the proposed hybrid method, all the coefficients in LL subband are normalized, by the absolute value of the coefficient with the largest magnitude, before sorting. Hence, the normalized scaling coefficients with magnitudes in [2-1, 2 0 ) are located in the first pass. The coefficients with magnitudes in interval [2-2, 2-1 ) are located in the second pass, and the procedure goes on till all the coefficients are located or the bit-budget is exhausted. For the coefficients in high-frequency subbands, they are classified into three categories which are H (horizontal), D (diagonal), and V (vertical) types as shown in Fig. 2. All the coefficients in high-frequency subbands are partitioned into 2 2 blocks, and each 2 2 block forms a corresponding 4D vector (Fig. 3). The three types of vectors in H, D, and V are normalized by the maximum L 2 norms of three categories, respectively, such that the L 2 norm of each vector is less than or equal to one. If the L 2 norm of a vector is greater than or equal to the threshold, then the vector is significant and the block or subband containing this vector is also significant. Because the vectors are normalized, the thresholds for a 7-stage RVQ are: 2-1, 2-2, 2-3, 2-4, 2-5, 2-6, and 0. For a 4-decomposition-level transformed image, in the initialization step, the H, D and V blocks in the 4th decomposition level (i.e. on the left-top corner in Fig. 2) form the S set (significant set), and the other H, D and V subbands form the I set (insignificant set) in the RVQ-SPECK
5 HYBRID IMAGE COMPRESSION BASED ON SPECK AND RVQ 1015 c i,j c i,j+1 c i+1,j c i+1,j+1 [c i,j, c i,j+1, c i+1,j, c i+1,j+1 ] A 2 2 coefficient block A 4D vector Fig. 3. A 2 2 coefficient block and its corresponding 4D vector. Fig. 4. The signal flow diagram of a p-stage RVQ. block of the proposed hybrid method (Fig. 1). The sorting pass of the significant vectors of the high-frequency subbands and the definitions of S and I in the proposed hybrid method are identical to the scalar SPECK except that the significance path of the SPECK with RVQ ends when the block is 2 2. Generally speaking, full-search VQ has better performance than RVQ, but RVQ was selected to be used in the proposed hybrid method because of its low complexity and acceptable performance. The signal flow diagram of a p-stage RVQ is shown in Fig. 4, where x i (1 i p) is the input vector of the ith VQ stage in the p-stage RVQ, and x ˆi is the code vector which has the smallest distance to x i. The residual of x i x ˆi is x i+1 that is the input vector for the (i + 1)th VQ stage in the RVQ system. Because the characteristics of H, D, and V subbands are different, 3 RVQs are used for the H, D, and V subbands, respectively, of the RVQ-SPECK part in the proposed hybrid method. Since the information of the lowest frequency subband LL of an image is usually more important than that of the high-frequency subbands, the bit-plane resolution in the scalar SPECK is set to be higher than that of the RVQ-SPECK. Thus, the transmission rate of the scalar SPECK is usually faster than that of the RVQ-SPECK. Based on the simulation results, the transmission rate of the scalar SPECK is set empirically twice of the RVQ-SPECK transmission rate, i.e. one pass of the proposed hybrid method including two SPECK passes and one RVQ-SPECK pass. At last, the output coded bit-stream contains the overhead, binary output of SPECK, and binary output of RVQ-SPECK, and the relation is shown in Fig. 5. Fig. 5. The coded bit-stream of the proposed hybrid method.
6 1016 SHENG-FUU LIN, HSI-CHIN HSIN AND CHIEN-KUN SU The decoder of the proposed method can be implemented by simply reversing the processing steps of the encoder. Besides the overhead of the compression file, the bits in the compression file are ordered in importance, so the proposed method is embedded. The proposed encoder (decoder) can terminate the coding (decoding) process at any point, so it can achieve the exact bit-rate control which is an important requirement of modern codecs. The compression performance can be improved by the use of arithmetic coding after SPECK, however, at the cost of increasing computational complexity. As an example, the PSNR value of the decoded Lena image can be improved by 0.22 db at compression rate of 1 bpp by using SPECK with arithmetic coding [26]. For system simplicity, the operation of arithmetic coding is not performed in our experiments. 2.2 Application for Chroma Subsampling Images The chroma subsampling format is used for balancing efficiency and quality in sampling, and the similar method is used in picture format to save bandwith (memory) and maintain good quality. CIF (Common Intermediate Format) and QCIF (Quarter CIF) are two such formats in H.261. For CIF, the size of the luminance plane is , and the sizes of the two chrominance planes are Each of the two chrominance planes only contains one quarter data (pixels) of the luminance plane s, since the human eye is less sensitive to the chrominance information than to the luminance information. The image sequence format of MPEG-4 is CIF or 4:2:0, and we will discuss how to use the proposed hybrid method for the compression of the popular YUV 4:2:0 images. Fig. 6 shows the block diagram of the application of the proposed hybrid method for chroma subsampling images. First, Y, U, and V planes are transformed by using 2D discrete wavelet transform, respectively. Then, each transformed YUV plane is processed like the transformed image in the still gray-level image case. The transformed coefficients of each plane are partitioned into LL, H, D, and V subbands. The scaling coefficients of each LL subband, which will be processed by color SPECK (CSPECK) [12, 13], are normalized by the maximum-amplitude of the coefficients in this LL subband. Another three positive base values which are determined from the L 2 norms of the 4D vectors in H, V, and D subbands, respectively, are used to normalize the vectors in their corresponding subbands such that the L 2 norm of each normalized 4D vector is not greater than 1. Hence, 12 base values used in normalization have to be stored and transmitted for the decoder of the proposed method. After normalization and coefficient classification, the three LL subbands of the transformed Y, U, and V planes are processed by CSPECK, and the other coefficients (i.e. H, D, and V subbands) of the transformed Y, U, and V planes are coded by CSPECK with RVQ. Similar to the quantization of the monochrome application, since the scaling coefficients in LL subbands contain more important information than the coefficients in H, D, or V subbands do, one quantization cycle of the proposed hybrid method includes two CSPECK quantization passes of the LL subbands and one RVQ-CSPECK quantization pass of H, D, and V subbands (Fig. 7).
7 HYBRID IMAGE COMPRESSION BASED ON SPECK AND RVQ 1017 Fig. 6. The block diagram of the application of the proposed method for chroma subsampling images. Fig 7. One quantization cycle of the proposed hybrid method which includes two CSPECK quantization and one RVQ-CSPECK quantization.
8 1018 SHENG-FUU LIN, HSI-CHIN HSIN AND CHIEN-KUN SU 2.3 Memory Requirement and Computational Complexity of the Proposed Hybrid Method In this section, the memory requirement and computational complexity of the proposed hybrid codec will be discussed, assuming that the coefficients in H, D, and V subbands are much more than the scaling coefficients in LL subband. Therefore, the computation complexity of the proposed hybrid method can be approximated by that of the RVQ-SPECK part, or the RVQ-SPECK is the dominant part of the proposed hybrid method. For the memory issue, the proposed hybrid method needs extra memory for storing codebooks and parameters. Assume that three p-stage RVQs are used and the codebook sizes of H, D, and V subbands for the ith VQ stage are the same and equal to m i words. p Then, all the codebooks need 3 m words. The proposed hybrid method also needs i= 1 i memory to store the 12 base values for normalization and threshold information. The proposed hybrid method outperforms the scalar SPECK, for the memory issue, on the lengths of the list of significant vectors and the list of in-significant sets. Since each vector in RVQ-SPECK contains 4 coefficients, the length of a RVQ-SPECK list is about one fourth of the length of the corresponding list in SPECK (e.g. LSP and LIP). For the computational complexity in encoding, the proposed hybrid method use L 2 norms for significance test of the vectors for each stage, and SPECK uses 1-bit comparison to test significance for each bit-plane. Hence, the computational complexity of the proposed hybrid method for significant vector test is several times more complicated than the significance test in SPECK. Although the significance test complexity of the proposed method is more complicated than SPECK s, the proposed hybrid method has the advantage that its total significance test number is smaller than that of SPECK. If an N N gray-level test image with n max = 11 is coded by SPECK and the proposed hybrid method with p-stage RVQs. Then, the significance-test-number ratio of SPECK to the proposed hybrid method can be estimated by: N N nmax 4n = ( N/2) ( N/2) p p max. (2) For a gray-level test image with n max = 12 and p = 7, the significance-test ratio of Eq. (2) is 6.9. Hence, for this example, the SPECK encoder needs 6.9 times of the significance tests of the proposed hybrid encoder. Although SPECK can use a simple bitwise operation for significance test, it suffers from the growth of the number of significance tests for large images. Both SPECK and the proposed hybrid method use the same algorithm to locate significant coefficients, but the proposed method usually has shorter significant paths because of the use of a 4D vector instead of a single pixel (coefficient). When the proposed hybrid method locates a significant vector, SPECK needs one more quadtree partition and 4 significance test to complete the significant path. For the decoding part, no significance test needed for SPECK or the proposed hybrid method, and the computational complexity of both methods is greatly reduced. The proposed hybrid method is implemented as simple look-up tables and the total amounts of significant vectors are about one quarter of the amounts of the significant pixels in
9 HYBRID IMAGE COMPRESSION BASED ON SPECK AND RVQ 1019 SPECK. The actual computational complexity depends on the image characteristic, codebook size, bit-allocation of codewords and so on. From above discussion, the propose hybrid decoder is as efficient as SPECK, and this is consistent with our experiment results. To summarize, the proposed hybrid method is suitable for asymmetric complexity applications that we can encode images off line, but need to decode images fast. 3. EXPERIMENTAL RESULTS In this section, two applications of the proposed hybrid compression method are presented. The first application, in subsection 3.1, is the gray-level still image compression, and the other is the compression of chroma subsampling images in subsection 3.2. The platform for simulation is an IBM PC with Windows XP, and SPECK, SPIHT, and the proposed hybrid method are coded by Matlab. Linear phase biorthogonal wavelet filters with 9/7-coefficients are used in this paper. The number of wavelet decomposition levels in our experiments is 4. Fig. 2 shows the classification of a 4-level transformed image whose coefficients are classified into four types: LL, H, V, and D. The lowest frequency coefficients in subband LL are normalized such that their magnitudes are in the range of [0, 1), and these coefficients are coded by using the scalar SPECK. The wavelet coefficients in subbands of types H, V, and D are coded by using SPECK with RVQ. For the coefficient vectors of H, D, and V subbands, we empirically choose the stage number, in the RVQs, as 10 and 7 for and test images, respectively. Because the characteristics of H, V, and D subbands are different, each category has its own codebooks. Therefore, 30 and 21 codebooks are trained by using the K-means algorithm for and monochrome images, respectively. The codebook size of the first RVQ stage is 64 words, and that of the other RVQ stages is 32 words. Each codeword is a 4D vector in R Grey-level Still Image Compression In this subsection, we will compare the proposed hybrid method with SPECK and SPIHT image codecs by encoding and decoding some test images (Fig. 8). Both and test images are used for testing. The proposed hybrid method and SPECK are compared by using test images first, and then, three methods (including SPIHT) are compared for test images. The compression rate is measured in bits per pixel (bpp), and the peak signal to noise ratio (PSNR) measured in db is utilized to evaluate the decoded image quality. For the simulation of monochrome images, 41 images, which do not include the three test images, are used to train the codebooks of the RVQs of the proposed method. Table 1 shows the simulation results of the test images, and Figs show the PSNR-bpp curves for the 3 test images, where the horizontal and vertical axes are the compression rates in bpp and PSNR values in db, respectively. For the monochrome image Lena, the proposed hybrid coder outperforms the SPECK coder by 1.67 db at 1.0 bpp, and 0.48 db, on average, from 0.1 bpp to 1.5 bpp. For the monochrome image Barbra, the proposed hybrid coder outperforms the SPECK coder by 1.23 db at 1.1 bpp, and 0.49 db on average. For the third gray-level image
10 1020 SHENG-FUU LIN, HSI-CHIN HSIN AND CHIEN-KUN SU (a) Lena. (b) Babara. (c) Goldhill. Fig. 8. Three 8-bit gray-level test images. Table 1. Simulation results of test images. PSNR (db) Lena Barbara Goldhill bpp SPECK Proposed SPECK Proposed SPECK Proposed Proposed SPECK 35 PSNR (db) 30 Fig. 9. The experimental results of the gray-level image Lena bpp Fig. 10. The experimental results of the gray-level image Barbara.
11 HYBRID IMAGE COMPRESSION BASED ON SPECK AND RVQ 1021 Fig. 11. The experimental results of the gray-level image Goldhill. Fig. 12. The average improvements of the proposed hybrid coder compared with the original SPECK on more test images. Goldhill, the proposed hybrid coder outperforms the SPECK coder by 0.73 db at 1.5 bpp, and 0.43 db on average. The experimental results of more test images obtained from the USC (University of Southern California) image database are shown in Fig. 12. In Fig. 12 the curve denotes the average improvement by using the proposed hybrid coder compared with the pure SPECK coder. It is shown that the proposed hybrid coder is preferable to the SPECK coder in terms of the PSNR-bpp curves. For the experiments of gray-level still images, the proposed hybrid method, SPECK, and SPIHT (with arithmetic coding) are simulated and compared with each other. SPIHT is selected for comparison because it is a wavelet-based method with very good performance and used in JPEG2000. A set of codebooks were trained by using 8 training images, downloaded from USC image database, and the K-means method. The stages of a RVQ of the proposed hybrid method were empirically reduced to 7 stages, since using fewer stages in a RVQ usually obtains better performance (higher PSNR values) for low bit-rate cases. The vectors used for images are also 4D vectors (Fig. 3) in the vector space R 4. The 7 thresholds of the 3 RVQs in the proposed hybrid method are: 2-1, 2-2, 2-3, 2-4, 2-5, 2-6, and 0. Table 2 shows the simulation results of the proposed hybrid method, SPECK, and SPIHT (with arithmetic coding) on test images. SPECK and SPIHT are two state-of-the-art techniques, and which one has better performance usually depends on the image characteristic. According to the results in Table 2, although we can not guarantee that the proposed hybrid method can always has the best performance; it seems that the proposed hybrid method can improve the SPECK codec for most images, especially under low bit-rate conditions. Three 0.25-bpp decoded images of SPECK, the proposed method, and SPIHT are shown in Fig. 13, and it is difficult to find difference among these images by our eyes instantly. By carefully inspecting the reconstructed images in Fig. 13, we found that the image of SPECK codec is smoother than the others and the proposed hybrid codec preserves more small details of the original images. Chao et al. proposed a vector SPECK [27] for still gray-level image compression. Three types of VQs (full search VQ, tree-structured VQ, and entropy constrained VQ) were used in their method at the same time, and the vector dimension and vector entries depend on the subbands and quantization levels where the vector is located. A large
12 1022 SHENG-FUU LIN, HSI-CHIN HSIN AND CHIEN-KUN SU Table 2. Simulation results for test images. PSNR (db) Lena Barbara Goldhill bpp SPECK Proposed SPIHT SPECK Proposed SPIHT SPECK Proposed SPIHT Table 3. Experiment results of SPECK, JPEG2000, and vector SPECK from [27]. Lena Bit rate SPECK JPEG2000 Vector SPECK (a) (b) (c) Fig. 13. Decoded images of (a) SPECK, (b) the proposed hybrid method, and (c) SPIHT under bpp condition. amount (1,500) of training images and Lloyd splitting method are used for training codebooks. Vector SPECK can outperform the JPEG2000 codec under low bit-rate conditions at the cost of added complexity, but it does not handle the lower bit planes for n = 3, 2, 1, and 0. Compared with vector SPECK, the proposed hybrid method has the features of low complexity and a wide bit-rate range. Table 3 shows some experiment data form [27], and they used 5 decomposition levels, 9/7 DWT, and arithmetic coding in SPECK. Since the conditions of Tables 2 and 3 are different, the results of Tables 2 and 3 of the same method are not equal. Hence, we only compare the difference values of SPECK and the proposed hybrid method in Table 2 with the difference values of SPECK and JPEG2000 (or the vector SPECK) in Table 3. For the Lena image under 0.25-bpp case, the vector SPECK
13 HYBRID IMAGE COMPRESSION BASED ON SPECK AND RVQ 1023 outperforms SPECK 0.3 db, JPEG2000 outperforms SPECK 0.06 db (Table 3), and the proposed hybrid method outperforms SPECK 0.7 db (Table 2). Hence, it shows that the proposed hybrid method is very competitive and efficient. 3.2 Chroma Subsampling Image Compression The goal of the simulation is to compare the performance of the proposed hybrid coder with that of the CSPECK coder for YUV 4:2:0 images. Based on the simulation results, we can choose a proper coder for applications with such a format, e.g. MPEG-4, PAL DV, DVCAM, HDV, JPEG/JFIF, H.261, VC-1, and MJPEG. The test images, used in the simulation, have Y (luminance) plane and U and V (chrominance) planes. The 9/7-tap biorthogonal wavelet transform is performed on each plane separately, and the number of decomposition level is four. For a CSPECK codec, the decoder needs to know the maximum number of binary bit planes (n max ) that is used for coding the transformed image. Excluding the three LL subbands of Y, U, and V planes, the other coefficients (in H, V, and D subbands of each Y, U, or V plane) of the transformed image are coded by using the CSPECK with three 10-stage RVQs. In our experiments, 55 color images are used to generate 90 codebooks for the proposed codec, since the RVQs are 10-stage and there are three YUV planes that each has three types (H, V, and D) of 4D coefficient vectors. For the vectors in H subbands of Y plane, 128 vectors are selected to be the basis vectors for the vectors with L 2 norms in [0.5, 1), and each of the other 9 codebooks of the H subbands in Y plane has 64 codewords. The same basis vector arrangement as that used in the H subband is used in the D and V subbands in Y plane. Because the human eye is less sensitive to the chrominance information than to the luminance information, fewer basis vectors are used in U plane or V plane. For the vectors in H, D, or V subbands of plane U or plane V, 32 basis vectors are used in the highest (i.e. 10th) stage of the RVQs, and each of the other 9 stages has 16 basis vectors. All the codebooks are trained by using the simple K-means method. The equivalent bit-per-pixel (ebpp) value defined in Eq. (3) is used for representing the compression rate for decoding a coded YUV 4:2:0 image: number of bits used ebpp = (3) The color test image Goldhill is used for simulation, and the curves in Figs show the simulation results. The test image is originally size in the R, G, and B planes (true color space), so they had to be preprocessed before simulation. First, the test image was transformed to the YUV space. Then, the U and V planes were downsampled to pixels, where the downsampleing method was to calculate the arithmetic mean of the adjacent four-point values. We compare the PSNR values of the proposed hybrid method with those of the CSPECK coder in Y, U, and V planes, respectively. It can be seen that the PSNR values can be improved by 1.11 db for the Y plane, 0.99 db for the U plane, and 2.31 db for the V plane at the bit budget of 98,304 bits (1.0 ebpp). For the same image, the average PSNR values (from 0.1 ebpp to 1.5 ebpp) of the proposed method are higher than those of CSPECK by 0.66 db, 1.21 db, and 2.22 db in Y, U, and V planes, respectively.
14 1024 SHENG-FUU LIN, HSI-CHIN HSIN AND CHIEN-KUN SU Fig. 14. The Y-plane experimental results of the chroma subsampling image Goldhill. Fig. 15. The U-plane experimental results of the chroma subsampling image Goldhill. Fig. 16. The V-plane experimental results of the chroma subsampling image Goldhill. Based on the simulation results, it is obvious that the proposed method has superior improvement in the two chrominance planes (U and V), since the colors (chrominance information) of the four neighbors in a 2 2 block are usually similar. On the other hand, the luminance values are more probable to change abruptly than the chrominance values are, because of sharp edges and corners. Even though, the proposed method also achieves good results in the Y planes. The major added cost of the proposed method is the needs of training codebooks and determining parameters before encoding. Since the most time consuming codebook design can be done off-line and the codebook sizes of the RVQs are small, the proposed hybrid method is efficient in time and bit-budget. 4. CONCLUSIONS In this paper, we propose a hybrid image coder, which is based on SPECK and RVQ, for still gray-level and chroma subsampling images. Compared with SPIHT and SPECK (two state-of-the-art algorithms), the experimental results have shown that the proposed hybrid method is efficient for image compression. According to the applications that we are interested in, the flexible proposed hybrid codec can be designed to improve its low
15 HYBRID IMAGE COMPRESSION BASED ON SPECK AND RVQ 1025 bit-rate or high bit-rate performance by using a short RVQ or a long RVQ. We also have shown that the proposed hybrid method has superior performance for the chrominance planes (i.e. U and V planes in YUV color space) in chroma subsampling image compression. Because of the asymmetry property of VQ, the proposed hybrid method is suitable for those applications whose load is also asymmetric and is heavy on the decoding side (e.g. the image archiving of an image database). Although the proposed hybrid codec is asymmetric, using RVQ instead of full-search VQ makes the increased complexity affordable and worthy. ACKNOWLEDGEMENTS The authors would like to thank the anonymous reviewers for their comments that significantly helped improve this paper. REFERENCES 1. H. G. Musmann, P. Pirsch, and H. J. Grallert, Advances in picture coding, in Proceedings of IEEE, Vol. 73, 1985, pp R. J. Clarke, Transform Coding of Images, Academic Press, New York, O. J. Kwon and R. Chellappa, Region adaptive subband image coding, IEEE Transactions on Image Processing, Vol. 7, 1988, pp K. R. Rao and J. J. Hwang, Techniques and Standards for Image Video and Audio Coding, Prentice Hall, New Jersey, W. B. Pennebaker and J. L. Mitchell, JPEG Still Image Data Compression Standards, Van Nostrand, New York, JPEG2000 Core Coding System (Part 1), ISO/IEC , Dec B. E. Usevitch, A tutorial on modern lossy wavelet image compression: Foundations of JPEG2000, IEEE Signal Processing Magazine, Vol. 18, 2001, pp J. M. Shapiro, Embedded image coding using zerotrees of wavelet coefficients, IEEE Transactions on Signal Processing, Vol. 41, 1993, pp A. Said and W. A. Pearlman, A new, fast, and efficient image codec based on set partitioning in hierarchical trees, IEEE Transactions on Circuits Systems for Video Technology, Vol. 6, 1996, pp S. D. Servetto, K. Ramchandran, and M. T. Orchard, Image coding based on a morphological representation of wavelet data, IEEE Transactions on Image Processing, Vol. 8, 1999, pp E. S. Hong and R. E. Ladner, Group testing for image compression, IEEE Transactions on Image Processing, Vol. 11, 2002, pp A. Islam and W. A. Pearlman, An embedded and efficient low-complexity hierarchical image coder, in Proceedings of SPIE Visual Communications and Image Processing, Vol. 3653, 1999, pp W. A. Pearlman, A. Islam, N. Nagaraj, and A. Said, Efficient, low-complexity image coding with a set-partitioning embedded block coder, IEEE Transactions on Circuits Systems for Video Technology, Vol. 14, 2004, pp G. Strang and T. Nguyen, Wavelets and Filter Banks, Wellesley-Cambridge, MA,
16 1026 SHENG-FUU LIN, HSI-CHIN HSIN AND CHIEN-KUN SU C. Chrysafis, A. Said, A. Drukarev, and W. A. Pearlman, SBHP A low complexity wavelet coder, in Proceedings of IEEE International Conference on Acoustics, Speech, and Signal Processing, 2000, pp S. T. Hsiang and J. W. Woods, Embedded image coding using zero blocks of subband/wavelet coefficients and context modeling, in Proceedings of IEEE International Conference on Circuits and Systems, 2000, pp C. E. Shannon, A mathematical theory of communication, The Bell System Technical Journal, Vol. 27, 1948, pp , A. Gersho and R. M. Gray, Vector Quantization and Signal Compression, Kluwer Acdemic Publishers, MA, S. Gupta and A. Gersho, Feature predictive vector quantization of multispectral images, IEEE Transactions on Geoscience and Remote Sensing, Vol. 30, 1992, pp C. K. Su, H. C. Hsin, and S. F. Lin, Wavelet tree classification and hybrid coding for image compression, IEE Proceedings of Vision, Image, and Signal Processing, Vol. 152, 2005, pp T. K. Abdel-Galil, E. F. El-Saadany, A. M. Youssef, and M. M. Salama, Disturbance classification using hidden Markov models and vector quantization, IEEE Transactions on Power Delivery, Vol. 20, 2005, pp C. F. Barnes, Residual quantizers, Ph.D. Dissertation, Department of Electrical and Computer Engineering, BrigHam Young University, Provo, UT, F. Kossentini, M. J. T. Smith, and C. F. Barnes, Image coding using entropy-constrained residual vector quantization, IEEE Transactions on Image Processing, Vol. 4, 1995, pp Y. Shoham, Hierachical vector quantization with application to speech waveform coding, Ph.D. Dissertation, Department of Electrical and Computer Engineering, University of California at Santa Barbara, B. H. Juang and A. H. Gray, Multiple stage vector quantization for speech coding, in Proceedings of IEEE International Conference on Acoustics, Speech, Signal Processing, Vol. 1, 1982, pp G. Xie and H. Shen, Highly scalable, low-complexity image coding using zeroblocks of wavelet coefficients, IEEE Transactions on Circuits Systems for Video Technology, Vol. 15, 2005, pp C. C. Chao and R. M. Gray, Image compression with a vector SPECK algorithm, in Proceedings of IEEE International Conference on Acoustics, Speech, Signal Processing, Vol. 2, 2006, pp Sheng-Fuu Lin ( ) was born in Taiwan, R.O.C., in He received the B.S. and M.S. degrees in Mathematics from National Taiwan Normal University in 1976 and 1979, respectively, the second M.S. degree in Computer Science from the University of Maryland in 1985, and the Ph.D. degree in Electrical Engineering from the University of Illinois, Champaign, in Since 1988, he has been on the faculty of the Department
17 HYBRID IMAGE COMPRESSION BASED ON SPECK AND RVQ 1027 of Electrical and Control Engineering at National Chiao Tung University, Hsinchu, Taiwan. His research interests include fuzzy theory, automatic target recognition, scheduling, image processing, and image recognition. Professor Lin is a member of the IEEE Control Society, Chinese Fuzzy System Association, and Chinese Automatic Control Society. Hsi-Chin Hsin ( ) received the M.S. and Ph.D. degrees in Electrical Engineering from the University of Pittsburgh, Pittsburgh, PA, in 1992 and 1995, respectively. He is a Professor in the Department of Computer Science and Information Engineering at National United University, Taiwan. His research interests include wavelet transform, image processing, CORDIC, DSP architectures and system on chip. Chien-Kun Su ( ) was born in He received the B.S. degree from National Taiwan University, Taiwan, in 1989, M.S. degree from the University of Southern California, U.S.A., in 1992, and the Ph.D. degree from National Chiao Tung University, Taiwan, in He has been on the faculty of the Department of Electrical Engineering at Chung Hua University, Hsinchu, Taiwan since His research interests include image processing and computer vision.
Modified SPIHT Image Coder For Wireless Communication
Modified SPIHT Image Coder For Wireless Communication M. B. I. REAZ, M. AKTER, F. MOHD-YASIN Faculty of Engineering Multimedia University 63100 Cyberjaya, Selangor Malaysia Abstract: - The Set Partitioning
More informationSIGNAL COMPRESSION. 9. Lossy image compression: SPIHT and S+P
SIGNAL COMPRESSION 9. Lossy image compression: SPIHT and S+P 9.1 SPIHT embedded coder 9.2 The reversible multiresolution transform S+P 9.3 Error resilience in embedded coding 178 9.1 Embedded Tree-Based
More informationCSEP 521 Applied Algorithms Spring Lossy Image Compression
CSEP 521 Applied Algorithms Spring 2005 Lossy Image Compression Lossy Image Compression Methods Scalar quantization (SQ). Vector quantization (VQ). DCT Compression JPEG Wavelet Compression SPIHT UWIC (University
More informationEmbedded Rate Scalable Wavelet-Based Image Coding Algorithm with RPSWS
Embedded Rate Scalable Wavelet-Based Image Coding Algorithm with RPSWS Farag I. Y. Elnagahy Telecommunications Faculty of Electrical Engineering Czech Technical University in Prague 16627, Praha 6, Czech
More informationsignal-to-noise ratio (PSNR), 2
u m " The Integration in Optics, Mechanics, and Electronics of Digital Versatile Disc Systems (1/3) ---(IV) Digital Video and Audio Signal Processing ƒf NSC87-2218-E-009-036 86 8 1 --- 87 7 31 p m o This
More informationAn Optimum Approach for Image Compression: Tuned Degree-K Zerotree Wavelet Coding
An Optimum Approach for Image Compression: Tuned Degree-K Zerotree Wavelet Coding Li Wern Chew*, Wai Chong Chia, Li-minn Ang and Kah Phooi Seng Abstract - This paper presents an image compression technique
More informationANALYSIS OF SPIHT ALGORITHM FOR SATELLITE IMAGE COMPRESSION
ANALYSIS OF SPIHT ALGORITHM FOR SATELLITE IMAGE COMPRESSION K Nagamani (1) and AG Ananth (2) (1) Assistant Professor, R V College of Engineering, Bangalore-560059. knmsm_03@yahoo.com (2) Professor, R V
More informationAn embedded and efficient low-complexity hierarchical image coder
An embedded and efficient low-complexity hierarchical image coder Asad Islam and William A. Pearlman Electrical, Computer and Systems Engineering Dept. Rensselaer Polytechnic Institute, Troy, NY 12180,
More informationWavelet Transform (WT) & JPEG-2000
Chapter 8 Wavelet Transform (WT) & JPEG-2000 8.1 A Review of WT 8.1.1 Wave vs. Wavelet [castleman] 1 0-1 -2-3 -4-5 -6-7 -8 0 100 200 300 400 500 600 Figure 8.1 Sinusoidal waves (top two) and wavelets (bottom
More informationA 3-D Virtual SPIHT for Scalable Very Low Bit-Rate Embedded Video Compression
A 3-D Virtual SPIHT for Scalable Very Low Bit-Rate Embedded Video Compression Habibollah Danyali and Alfred Mertins University of Wollongong School of Electrical, Computer and Telecommunications Engineering
More informationOn the Selection of Image Compression Algorithms
On the Selection of Image Compression Algorithms Chaur- Chin Chen Department of Computer Science National Tsing Hua University Hsinchu 300, Taiwan Acknowledgments: The author thanks Professor Anil K. Jain,
More informationEfficient, Low-Complexity Image Coding with a Set-Partitioning Embedded Block Coder
Efficient, Low-Complexity Image Coding with a Set-Partitioning Embedded Block Coder 1 William A. Pearlman, Asad Islam, Nithin Nagaraj, and Amir Said Abstract We propose an embedded, block-based, image
More informationOptimized Progressive Coding of Stereo Images Using Discrete Wavelet Transform
Optimized Progressive Coding of Stereo Images Using Discrete Wavelet Transform Torsten Palfner, Alexander Mali and Erika Müller Institute of Telecommunications and Information Technology, University of
More informationWavelet Based Image Compression Using ROI SPIHT Coding
International Journal of Information & Computation Technology. ISSN 0974-2255 Volume 1, Number 2 (2011), pp. 69-76 International Research Publications House http://www.irphouse.com Wavelet Based Image
More informationFAST AND EFFICIENT SPATIAL SCALABLE IMAGE COMPRESSION USING WAVELET LOWER TREES
FAST AND EFFICIENT SPATIAL SCALABLE IMAGE COMPRESSION USING WAVELET LOWER TREES J. Oliver, Student Member, IEEE, M. P. Malumbres, Member, IEEE Department of Computer Engineering (DISCA) Technical University
More informationDCT-BASED IMAGE COMPRESSION USING WAVELET-BASED ALGORITHM WITH EFFICIENT DEBLOCKING FILTER
DCT-BASED IMAGE COMPRESSION USING WAVELET-BASED ALGORITHM WITH EFFICIENT DEBLOCKING FILTER Wen-Chien Yan and Yen-Yu Chen Department of Information Management, Chung Chou Institution of Technology 6, Line
More informationEmbedded Descendent-Only Zerotree Wavelet Coding for Image Compression
Embedded Descendent-Only Zerotree Wavelet Coding for Image Compression Wai Chong Chia, Li-Minn Ang, and Kah Phooi Seng Abstract The Embedded Zerotree Wavelet (EZW) coder which can be considered as a degree-0
More informationFingerprint Image Compression
Fingerprint Image Compression Ms.Mansi Kambli 1*,Ms.Shalini Bhatia 2 * Student 1*, Professor 2 * Thadomal Shahani Engineering College * 1,2 Abstract Modified Set Partitioning in Hierarchical Tree with
More informationReview and Implementation of DWT based Scalable Video Coding with Scalable Motion Coding.
Project Title: Review and Implementation of DWT based Scalable Video Coding with Scalable Motion Coding. Midterm Report CS 584 Multimedia Communications Submitted by: Syed Jawwad Bukhari 2004-03-0028 About
More informationEXPLORING ON STEGANOGRAPHY FOR LOW BIT RATE WAVELET BASED CODER IN IMAGE RETRIEVAL SYSTEM
TENCON 2000 explore2 Page:1/6 11/08/00 EXPLORING ON STEGANOGRAPHY FOR LOW BIT RATE WAVELET BASED CODER IN IMAGE RETRIEVAL SYSTEM S. Areepongsa, N. Kaewkamnerd, Y. F. Syed, and K. R. Rao The University
More informationImage Compression Algorithms using Wavelets: a review
Image Compression Algorithms using Wavelets: a review Sunny Arora Department of Computer Science Engineering Guru PremSukh Memorial college of engineering City, Delhi, India Kavita Rathi Department of
More informationBit-Plane Decomposition Steganography Using Wavelet Compressed Video
Bit-Plane Decomposition Steganography Using Wavelet Compressed Video Tomonori Furuta, Hideki Noda, Michiharu Niimi, Eiji Kawaguchi Kyushu Institute of Technology, Dept. of Electrical, Electronic and Computer
More informationMRT based Adaptive Transform Coder with Classified Vector Quantization (MATC-CVQ)
5 MRT based Adaptive Transform Coder with Classified Vector Quantization (MATC-CVQ) Contents 5.1 Introduction.128 5.2 Vector Quantization in MRT Domain Using Isometric Transformations and Scaling.130 5.2.1
More informationCompression of RADARSAT Data with Block Adaptive Wavelets Abstract: 1. Introduction
Compression of RADARSAT Data with Block Adaptive Wavelets Ian Cumming and Jing Wang Department of Electrical and Computer Engineering The University of British Columbia 2356 Main Mall, Vancouver, BC, Canada
More informationAn Embedded Wavelet Video Coder Using Three-Dimensional Set Partitioning in Hierarchical Trees (SPIHT)
An Embedded Wavelet Video Coder Using Three-Dimensional Set Partitioning in Hierarchical Trees (SPIHT) Beong-Jo Kim and William A. Pearlman Department of Electrical, Computer, and Systems Engineering Rensselaer
More informationA New Configuration of Adaptive Arithmetic Model for Video Coding with 3D SPIHT
A New Configuration of Adaptive Arithmetic Model for Video Coding with 3D SPIHT Wai Chong Chia, Li-Minn Ang, and Kah Phooi Seng Abstract The 3D Set Partitioning In Hierarchical Trees (SPIHT) is a video
More informationA Study of Image Compression Based Transmission Algorithm Using SPIHT for Low Bit Rate Application
Buletin Teknik Elektro dan Informatika (Bulletin of Electrical Engineering and Informatics) Vol. 2, No. 2, June 213, pp. 117~122 ISSN: 289-3191 117 A Study of Image Compression Based Transmission Algorithm
More informationOn the Selection of Image Compression Algorithms
On the Selection of Image Compression Algorithms Chaur-Chin Chen Department of Computer Science National Tsing Hua University Hsinchu 300, Taiwan e-mail: cchen@cs.nthu.edu.tw Abstract This paper attempts
More informationImage Compression for Mobile Devices using Prediction and Direct Coding Approach
Image Compression for Mobile Devices using Prediction and Direct Coding Approach Joshua Rajah Devadason M.E. scholar, CIT Coimbatore, India Mr. T. Ramraj Assistant Professor, CIT Coimbatore, India Abstract
More informationA Image Comparative Study using DCT, Fast Fourier, Wavelet Transforms and Huffman Algorithm
International Journal of Engineering Research and General Science Volume 3, Issue 4, July-August, 15 ISSN 91-2730 A Image Comparative Study using DCT, Fast Fourier, Wavelet Transforms and Huffman Algorithm
More informationA SCALABLE SPIHT-BASED MULTISPECTRAL IMAGE COMPRESSION TECHNIQUE. Fouad Khelifi, Ahmed Bouridane, and Fatih Kurugollu
A SCALABLE SPIHT-BASED MULTISPECTRAL IMAGE COMPRESSION TECHNIQUE Fouad Khelifi, Ahmed Bouridane, and Fatih Kurugollu School of Electronics, Electrical engineering and Computer Science Queen s University
More informationDIGITAL TELEVISION 1. DIGITAL VIDEO FUNDAMENTALS
DIGITAL TELEVISION 1. DIGITAL VIDEO FUNDAMENTALS Television services in Europe currently broadcast video at a frame rate of 25 Hz. Each frame consists of two interlaced fields, giving a field rate of 50
More informationLayered Self-Identifiable and Scalable Video Codec for Delivery to Heterogeneous Receivers
Layered Self-Identifiable and Scalable Video Codec for Delivery to Heterogeneous Receivers Wei Feng, Ashraf A. Kassim, Chen-Khong Tham Department of Electrical and Computer Engineering National University
More informationScalable Medical Data Compression and Transmission Using Wavelet Transform for Telemedicine Applications
54 IEEE TRANSACTIONS ON INFORMATION TECHNOLOGY IN BIOMEDICINE, VOL. 7, NO. 1, MARCH 2003 Scalable Medical Data Compression and Transmission Using Wavelet Transform for Telemedicine Applications Wen-Jyi
More informationA Very Low Bit Rate Image Compressor Using Transformed Classified Vector Quantization
Informatica 29 (2005) 335 341 335 A Very Low Bit Rate Image Compressor Using Transformed Classified Vector Quantization Hsien-Wen Tseng Department of Information Management Chaoyang University of Technology
More informationModule 8: Video Coding Basics Lecture 42: Sub-band coding, Second generation coding, 3D coding. The Lecture Contains: Performance Measures
The Lecture Contains: Performance Measures file:///d /...Ganesh%20Rana)/MY%20COURSE_Ganesh%20Rana/Prof.%20Sumana%20Gupta/FINAL%20DVSP/lecture%2042/42_1.htm[12/31/2015 11:57:52 AM] 3) Subband Coding It
More informationGroup Testing for Image Compression
Group Testing for Image Compression Edwin Hong and Richard Ladner. IEEE Transations on Image Processing. Aug. 2003 By Chih-Yu (Joey) Tang November 22, 2006 The Concept of Group Testing Identify Army recruits
More informationColor Image Compression Using EZW and SPIHT Algorithm
Color Image Compression Using EZW and SPIHT Algorithm Ms. Swati Pawar 1, Mrs. Adita Nimbalkar 2, Mr. Vivek Ugale 3 swati.pawar@sitrc.org 1, adita.nimbalkar@sitrc.org 2, vivek.ugale@sitrc.org 3 Department
More informationLow-Memory Packetized SPIHT Image Compression
Low-Memory Packetized SPIHT Image Compression Frederick W. Wheeler and William A. Pearlman Rensselaer Polytechnic Institute Electrical, Computer and Systems Engineering Dept. Troy, NY 12180, USA wheeler@cipr.rpi.edu,
More informationFully Scalable Wavelet-Based Image Coding for Transmission Over Heterogeneous Networks
Fully Scalable Wavelet-Based Image Coding for Transmission Over Heterogeneous Networks Habibollah Danyali and Alfred Mertins School of Electrical, Computer and Telecommunications Engineering University
More informationAn Embedded Wavelet Video Coder. Using Three-Dimensional Set. Partitioning in Hierarchical Trees. Beong-Jo Kim and William A.
An Embedded Wavelet Video Coder Using Three-Dimensional Set Partitioning in Hierarchical Trees (SPIHT) Beong-Jo Kim and William A. Pearlman Department of Electrical, Computer, and Systems Engineering Rensselaer
More informationWavelet Based Image Compression, Pattern Recognition And Data Hiding
IOSR Journal of Electronics and Communication Engineering (IOSR-JECE) e-issn: 2278-2834,p- ISSN: 2278-8735.Volume 9, Issue 2, Ver. V (Mar - Apr. 2014), PP 49-53 Wavelet Based Image Compression, Pattern
More informationCoding the Wavelet Spatial Orientation Tree with Low Computational Complexity
Coding the Wavelet Spatial Orientation Tree with Low Computational Complexity Yushin Cho 1, Amir Said 2, and William A. Pearlman 1 1 Center for Image Processing Research Department of Electrical, Computer,
More informationCMPT 365 Multimedia Systems. Media Compression - Image
CMPT 365 Multimedia Systems Media Compression - Image Spring 2017 Edited from slides by Dr. Jiangchuan Liu CMPT365 Multimedia Systems 1 Facts about JPEG JPEG - Joint Photographic Experts Group International
More informationVideo Compression An Introduction
Video Compression An Introduction The increasing demand to incorporate video data into telecommunications services, the corporate environment, the entertainment industry, and even at home has made digital
More informationError Protection of Wavelet Coded Images Using Residual Source Redundancy
Error Protection of Wavelet Coded Images Using Residual Source Redundancy P. Greg Sherwood and Kenneth Zeger University of California San Diego 95 Gilman Dr MC 47 La Jolla, CA 9293 sherwood,zeger @code.ucsd.edu
More informationVisually Improved Image Compression by using Embedded Zero-tree Wavelet Coding
593 Visually Improved Image Compression by using Embedded Zero-tree Wavelet Coding Janaki. R 1 Dr.Tamilarasi.A 2 1 Assistant Professor & Head, Department of Computer Science, N.K.R. Govt. Arts College
More informationJPEG IMAGE CODING WITH ADAPTIVE QUANTIZATION
JPEG IMAGE CODING WITH ADAPTIVE QUANTIZATION Julio Pons 1, Miguel Mateo 1, Josep Prades 2, Román Garcia 1 Universidad Politécnica de Valencia Spain 1 {jpons,mimateo,roman}@disca.upv.es 2 jprades@dcom.upv.es
More informationImage coding based on multiband wavelet and adaptive quad-tree partition
Journal of Computational and Applied Mathematics 195 (2006) 2 7 www.elsevier.com/locate/cam Image coding based on multiband wavelet and adaptive quad-tree partition Bi Ning a,,1, Dai Qinyun a,b, Huang
More informationAdaptive Quantization for Video Compression in Frequency Domain
Adaptive Quantization for Video Compression in Frequency Domain *Aree A. Mohammed and **Alan A. Abdulla * Computer Science Department ** Mathematic Department University of Sulaimani P.O.Box: 334 Sulaimani
More informationQUANTIZER DESIGN FOR EXPLOITING COMMON INFORMATION IN LAYERED CODING. Mehdi Salehifar, Tejaswi Nanjundaswamy, and Kenneth Rose
QUANTIZER DESIGN FOR EXPLOITING COMMON INFORMATION IN LAYERED CODING Mehdi Salehifar, Tejaswi Nanjundaswamy, and Kenneth Rose Department of Electrical and Computer Engineering University of California,
More informationPerformance Analysis of SPIHT algorithm in Image Compression
Performance Analysis of SPIHT algorithm in Image Compression P.Sunitha #1, J.L.Srinivas *2 Assoc. professor #1,M.Tech Student *2 # Department of Electronics & communications, Pragati Engineering College
More informationCompression of Stereo Images using a Huffman-Zip Scheme
Compression of Stereo Images using a Huffman-Zip Scheme John Hamann, Vickey Yeh Department of Electrical Engineering, Stanford University Stanford, CA 94304 jhamann@stanford.edu, vickey@stanford.edu Abstract
More informationDifferential Compression and Optimal Caching Methods for Content-Based Image Search Systems
Differential Compression and Optimal Caching Methods for Content-Based Image Search Systems Di Zhong a, Shih-Fu Chang a, John R. Smith b a Department of Electrical Engineering, Columbia University, NY,
More informationFast Progressive Image Coding without Wavelets
IEEE DATA COMPRESSION CONFERENCE SNOWBIRD, UTAH, MARCH 2000 Fast Progressive Image Coding without Wavelets Henrique S. Malvar Microsoft Research One Microsoft Way, Redmond, WA 98052 malvar@microsoft.com
More information642 IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY, VOL. 11, NO. 5, MAY 2001
642 IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY, VOL. 11, NO. 5, MAY 2001 Transactions Letters Design of Wavelet-Based Image Codec in Memory-Constrained Environment Yiliang Bao and C.-C.
More informationFully Spatial and SNR Scalable, SPIHT-Based Image Coding for Transmission Over Heterogenous Networks
Fully Spatial and SNR Scalable, SPIHT-Based Image Coding for Transmission Over Heterogenous Networks Habibollah Danyali and Alfred Mertins School of Electrical, Computer and Telecommunications Engineering
More informationA new predictive image compression scheme using histogram analysis and pattern matching
University of Wollongong Research Online University of Wollongong in Dubai - Papers University of Wollongong in Dubai 00 A new predictive image compression scheme using histogram analysis and pattern matching
More informationFPGA IMPLEMENTATION OF BIT PLANE ENTROPY ENCODER FOR 3 D DWT BASED VIDEO COMPRESSION
FPGA IMPLEMENTATION OF BIT PLANE ENTROPY ENCODER FOR 3 D DWT BASED VIDEO COMPRESSION 1 GOPIKA G NAIR, 2 SABI S. 1 M. Tech. Scholar (Embedded Systems), ECE department, SBCE, Pattoor, Kerala, India, Email:
More informationScalable Coding of Image Collections with Embedded Descriptors
Scalable Coding of Image Collections with Embedded Descriptors N. Adami, A. Boschetti, R. Leonardi, P. Migliorati Department of Electronic for Automation, University of Brescia Via Branze, 38, Brescia,
More informationStrip Based Embedded Coding of Wavelet Coefficients for Large Images
Strip Based Embedded Coding of Wavelet Coefficients for Large Images Raghunadh K Bhattar EE Department Indian Institute of Science Bangalore raghu@sac.ernet.in K.R.Ramakrishnan EE Department Indian Institute
More informationMRT based Fixed Block size Transform Coding
3 MRT based Fixed Block size Transform Coding Contents 3.1 Transform Coding..64 3.1.1 Transform Selection...65 3.1.2 Sub-image size selection... 66 3.1.3 Bit Allocation.....67 3.2 Transform coding using
More informationA LOW-COMPLEXITY AND LOSSLESS REFERENCE FRAME ENCODER ALGORITHM FOR VIDEO CODING
2014 IEEE International Conference on Acoustic, Speech and Signal Processing (ICASSP) A LOW-COMPLEXITY AND LOSSLESS REFERENCE FRAME ENCODER ALGORITHM FOR VIDEO CODING Dieison Silveira, Guilherme Povala,
More informationAnalysis and Comparison of EZW, SPIHT and EBCOT Coding Schemes with Reduced Execution Time
Analysis and Comparison of EZW, SPIHT and EBCOT Coding Schemes with Reduced Execution Time Pooja Rawat Scholars of M.Tech GRD-IMT, Dehradun Arti Rawat Scholars of M.Tech U.T.U., Dehradun Swati Chamoli
More informationA Reversible Data Hiding Scheme for BTC- Compressed Images
IJACSA International Journal of Advanced Computer Science and Applications, A Reversible Data Hiding Scheme for BTC- Compressed Images Ching-Chiuan Lin Shih-Chieh Chen Department of Multimedia and Game
More informationMesh Based Interpolative Coding (MBIC)
Mesh Based Interpolative Coding (MBIC) Eckhart Baum, Joachim Speidel Institut für Nachrichtenübertragung, University of Stuttgart An alternative method to H.6 encoding of moving images at bit rates below
More informationAn Embedded Wavelet Video. Set Partitioning in Hierarchical. Beong-Jo Kim and William A. Pearlman
An Embedded Wavelet Video Coder Using Three-Dimensional Set Partitioning in Hierarchical Trees (SPIHT) 1 Beong-Jo Kim and William A. Pearlman Department of Electrical, Computer, and Systems Engineering
More informationMulti-View Image Coding in 3-D Space Based on 3-D Reconstruction
Multi-View Image Coding in 3-D Space Based on 3-D Reconstruction Yongying Gao and Hayder Radha Department of Electrical and Computer Engineering, Michigan State University, East Lansing, MI 48823 email:
More informationImplication of variable code block size in JPEG 2000 and its VLSI implementation
Implication of variable code block size in JPEG 2000 and its VLSI implementation Ping-Sing Tsai a, Tinku Acharya b,c a Dept. of Computer Science, Univ. of Texas Pan American, 1201 W. Univ. Dr., Edinburg,
More informationDIGITAL IMAGE PROCESSING WRITTEN REPORT ADAPTIVE IMAGE COMPRESSION TECHNIQUES FOR WIRELESS MULTIMEDIA APPLICATIONS
DIGITAL IMAGE PROCESSING WRITTEN REPORT ADAPTIVE IMAGE COMPRESSION TECHNIQUES FOR WIRELESS MULTIMEDIA APPLICATIONS SUBMITTED BY: NAVEEN MATHEW FRANCIS #105249595 INTRODUCTION The advent of new technologies
More information2014 Summer School on MPEG/VCEG Video. Video Coding Concept
2014 Summer School on MPEG/VCEG Video 1 Video Coding Concept Outline 2 Introduction Capture and representation of digital video Fundamentals of video coding Summary Outline 3 Introduction Capture and representation
More informationA Low Memory Zerotree Coding for Arbitrarily Shaped Objects
IEEE TRANSACTIONS ON IMAGE PROCESSING, VOL. 12, NO. 3, MARCH 2003 271 A Low Memory Zerotree Coding for Arbitrarily Shaped Objects Chorng-Yann Su and Bing-Fei Wu, Senior Member, IEEE Abstract The Set Partitioning
More informationWireless Communication
Wireless Communication Systems @CS.NCTU Lecture 6: Image Instructor: Kate Ching-Ju Lin ( 林靖茹 ) Chap. 9 of Fundamentals of Multimedia Some reference from http://media.ee.ntu.edu.tw/courses/dvt/15f/ 1 Outline
More informationA COMPRESSION TECHNIQUES IN DIGITAL IMAGE PROCESSING - REVIEW
A COMPRESSION TECHNIQUES IN DIGITAL IMAGE PROCESSING - ABSTRACT: REVIEW M.JEYAPRATHA 1, B.POORNA VENNILA 2 Department of Computer Application, Nadar Saraswathi College of Arts and Science, Theni, Tamil
More informationIMAGE COMPRESSION ALGORITHM BASED ON HILBERT SCANNING OF EMBEDDED QUADTREES: AN INTRODUCTION OF THE Hi-SET CODER
IMAGE COMPRESSION ALGORITHM BASED ON HILBERT SCANNING OF EMBEDDED QUADTREES: AN INTRODUCTION OF THE Hi-SET CODER Jaime Moreno Superior School of Mechanical and Electrical Engineers, National Polytechnic
More informationCERIAS Tech Report An Evaluation of Color Embedded Wavelet Image Compression Techniques by M Saenz, P Salama, K Shen, E Delp Center for
CERIAS Tech Report 2001-112 An Evaluation of Color Embedded Wavelet Image Compression Techniques by M Saenz, P Salama, K Shen, E Delp Center for Education and Research Information Assurance and Security
More informationImproved Image Compression by Set Partitioning Block Coding by Modifying SPIHT
Improved Image Compression by Set Partitioning Block Coding by Modifying SPIHT Somya Tripathi 1,Anamika Ahirwar 2 1 Maharana Pratap College of Technology, Gwalior, Madhya Pradesh 474006 2 Department of
More informationComparison of EBCOT Technique Using HAAR Wavelet and Hadamard Transform
Comparison of EBCOT Technique Using HAAR Wavelet and Hadamard Transform S. Aruna Deepthi, Vibha D. Kulkarni, Dr.K. Jaya Sankar Department of Electronics and Communication Engineering, Vasavi College of
More informationImage Compression Algorithm for Different Wavelet Codes
Image Compression Algorithm for Different Wavelet Codes Tanveer Sultana Department of Information Technology Deccan college of Engineering and Technology, Hyderabad, Telangana, India. Abstract: - This
More informationOptimization of Bit Rate in Medical Image Compression
Optimization of Bit Rate in Medical Image Compression Dr.J.Subash Chandra Bose 1, Mrs.Yamini.J 2, P.Pushparaj 3, P.Naveenkumar 4, Arunkumar.M 5, J.Vinothkumar 6 Professor and Head, Department of CSE, Professional
More informationISSN: An Efficient Fully Exploiting Spatial Correlation of Compress Compound Images in Advanced Video Coding
An Efficient Fully Exploiting Spatial Correlation of Compress Compound Images in Advanced Video Coding Ali Mohsin Kaittan*1 President of the Association of scientific research and development in Iraq Abstract
More informationAn Spiht Algorithm With Huffman Encoder For Image Compression And Quality Improvement Using Retinex Algorithm
An Spiht Algorithm With Huffman Encoder For Image Compression And Quality Improvement Using Retinex Algorithm A. Mallaiah, S. K. Shabbir, T. Subhashini Abstract- Traditional image coding technology mainly
More informationJPEG 2000 vs. JPEG in MPEG Encoding
JPEG 2000 vs. JPEG in MPEG Encoding V.G. Ruiz, M.F. López, I. García and E.M.T. Hendrix Dept. Computer Architecture and Electronics University of Almería. 04120 Almería. Spain. E-mail: vruiz@ual.es, mflopez@ace.ual.es,
More informationInternational Journal of Emerging Technology and Advanced Engineering Website: (ISSN , Volume 2, Issue 4, April 2012)
A Technical Analysis Towards Digital Video Compression Rutika Joshi 1, Rajesh Rai 2, Rajesh Nema 3 1 Student, Electronics and Communication Department, NIIST College, Bhopal, 2,3 Prof., Electronics and
More informationReconstruction PSNR [db]
Proc. Vision, Modeling, and Visualization VMV-2000 Saarbrücken, Germany, pp. 199-203, November 2000 Progressive Compression and Rendering of Light Fields Marcus Magnor, Andreas Endmann Telecommunications
More informationInternational Journal of Scientific & Engineering Research, Volume 6, Issue 10, October-2015 ISSN
289 Image Compression Using ASWDR and 3D- SPIHT Algorithms for Satellite Data Dr.N.Muthumani Associate Professor Department of Computer Applications SNR Sons College Coimbatore K.Pavithradevi Assistant
More informationCHAPTER 6. 6 Huffman Coding Based Image Compression Using Complex Wavelet Transform. 6.3 Wavelet Transform based compression technique 106
CHAPTER 6 6 Huffman Coding Based Image Compression Using Complex Wavelet Transform Page No 6.1 Introduction 103 6.2 Compression Techniques 104 103 6.2.1 Lossless compression 105 6.2.2 Lossy compression
More informationFRACTAL IMAGE COMPRESSION OF GRAYSCALE AND RGB IMAGES USING DCT WITH QUADTREE DECOMPOSITION AND HUFFMAN CODING. Moheb R. Girgis and Mohammed M.
322 FRACTAL IMAGE COMPRESSION OF GRAYSCALE AND RGB IMAGES USING DCT WITH QUADTREE DECOMPOSITION AND HUFFMAN CODING Moheb R. Girgis and Mohammed M. Talaat Abstract: Fractal image compression (FIC) is a
More informationLine Based, Reduced Memory, Wavelet Image. Christos Chrysas and Antonio Ortega. Integrated Media Systems Center.
Line Based, Reduced Memory, Wavelet Image Compression Christos Chrysas and Antonio Ortega Integrated Media Systems Center University of Southern California Los Angeles, CA 90089-2564 chrysafi,ortega@sipi.usc.edu
More informationMEMORY EFFICIENT WDR (WAVELET DIFFERENCE REDUCTION) using INVERSE OF ECHELON FORM by EQUATION SOLVING
Available Online at www.ijcsmc.com International Journal of Computer Science and Mobile Computing A Monthly Journal of Computer Science and Information Technology IJCSMC Vol. 3 Issue. 7 July 2014 pg.512
More informationEnhancing the Image Compression Rate Using Steganography
The International Journal Of Engineering And Science (IJES) Volume 3 Issue 2 Pages 16-21 2014 ISSN(e): 2319 1813 ISSN(p): 2319 1805 Enhancing the Image Compression Rate Using Steganography 1, Archana Parkhe,
More informationREGION-BASED SPIHT CODING AND MULTIRESOLUTION DECODING OF IMAGE SEQUENCES
REGION-BASED SPIHT CODING AND MULTIRESOLUTION DECODING OF IMAGE SEQUENCES Sungdae Cho and William A. Pearlman Center for Next Generation Video Department of Electrical, Computer, and Systems Engineering
More informationReversible Wavelets for Embedded Image Compression. Sri Rama Prasanna Pavani Electrical and Computer Engineering, CU Boulder
Reversible Wavelets for Embedded Image Compression Sri Rama Prasanna Pavani Electrical and Computer Engineering, CU Boulder pavani@colorado.edu APPM 7400 - Wavelets and Imaging Prof. Gregory Beylkin -
More informationISSN (ONLINE): , VOLUME-3, ISSUE-1,
PERFORMANCE ANALYSIS OF LOSSLESS COMPRESSION TECHNIQUES TO INVESTIGATE THE OPTIMUM IMAGE COMPRESSION TECHNIQUE Dr. S. Swapna Rani Associate Professor, ECE Department M.V.S.R Engineering College, Nadergul,
More informationReduced 4x4 Block Intra Prediction Modes using Directional Similarity in H.264/AVC
Proceedings of the 7th WSEAS International Conference on Multimedia, Internet & Video Technologies, Beijing, China, September 15-17, 2007 198 Reduced 4x4 Block Intra Prediction Modes using Directional
More informationCHAPTER 4 REVERSIBLE IMAGE WATERMARKING USING BIT PLANE CODING AND LIFTING WAVELET TRANSFORM
74 CHAPTER 4 REVERSIBLE IMAGE WATERMARKING USING BIT PLANE CODING AND LIFTING WAVELET TRANSFORM Many data embedding methods use procedures that in which the original image is distorted by quite a small
More informationImage Error Concealment Based on Watermarking
Image Error Concealment Based on Watermarking Shinfeng D. Lin, Shih-Chieh Shie and Jie-Wei Chen Department of Computer Science and Information Engineering,National Dong Hwa Universuty, Hualien, Taiwan,
More informationHYBRID TRANSFORMATION TECHNIQUE FOR IMAGE COMPRESSION
31 st July 01. Vol. 41 No. 005-01 JATIT & LLS. All rights reserved. ISSN: 199-8645 www.jatit.org E-ISSN: 1817-3195 HYBRID TRANSFORMATION TECHNIQUE FOR IMAGE COMPRESSION 1 SRIRAM.B, THIYAGARAJAN.S 1, Student,
More informationOPTIMIZED QUANTIZATION OF WAVELET SUBBANDS FOR HIGH QUALITY REAL-TIME TEXTURE COMPRESSION. Bob Andries, Jan Lemeire, Adrian Munteanu
OPTIMIZED QUANTIZATION OF WAVELET SUBBANDS FOR HIGH QUALITY REAL-TIME TEXTURE COMPRESSION Bob Andries, Jan Lemeire, Adrian Munteanu Department of Electronics and Informatics, Vrije Universiteit Brussel
More informationImage Wavelet Coding Systems: Part II of Set Partition Coding and Image Wavelet Coding Systems
Foundations and Trends R in Signal Processing Vol. 2, No. 3 (2008) 181 246 c 2008 W. A. Pearlman and A. Said DOI: 10.1561/2000000014 Image Wavelet Coding Systems: Part II of Set Partition Coding and Image
More information