A new lossless compression scheme based on Hu!man coding scheme for image compression


 Samantha Wells
 1 years ago
 Views:
Transcription
1 Signal Processing: Image Communication 16 (2000) 367}372 A new lossless compression scheme based on Hu!man coding scheme for image compression YuChen Hu, ChinChen Chang* Department of Computer Science and Information Engineering, National Chung Cheng University, Chiayi 621, Taiwan, ROC Received 25 August 1998 Abstract A novel lossless imagecompression scheme is proposed in this paper. A twostage structure is embedded in this scheme. A linear predictor is used to decorrelate the raw image data in the "rst stage. Then in the second stage, an e!ective scheme based on the Hu!man coding method is developed to encode the residual image. This newly proposed scheme could reduce the cost for the Hu!man coding table while achieving high compression ratio. With this algorithm, a compression ratio higher than that of the Lossless JPEG method for images can be obtained. In other words, the newly proposed algorithm provides a good means for lossless image compression Elsevier Science B.V. All rights reserved. Keywords: Lossless image compression; Hu!man coding; JPEG 1. Introduction * Corresponding author. Tel.: /6011; fax: address: (C.C. Chang). Lossless image compression [9}12] is very important in many "elds such as biomedical image analysis, medical images, art images, security and defense, remote sensing, and so on. During the past few years, several schemes have been developed for lossless image compression. Usually, a twostage coding technique is embedded in these schemes. In the "rst stage, a linear predictor such as di!erential pulse code modulation (DPCM) [2,8] or some linear predicting functions, is used to decorrelate the raw image data. In the second stage, a standard coding technique, such as Hu!man coding [3,5], arithmetic coding [6,14] or Lempel Ziv coding, is used to encode the residual magnitudes. Such a twostage scheme is useful because the high correlation between neighboring pixels in most images can be decorrelated, which results in a signi" cant entropy reduction. To date, the Lossless JPEG [12] is one of the most e!ective compression schemes for gray scale images. The Lossless JPEG has two basic versions: DPCM with arithmetic coding and DPCM with Hu!man coding. The DPCM with arithmetic coding version typically provides slightly better compression results than the DPCM with Hu!man coding version, but it requires a higher computation cost. Some modi"ed methods [1,4,7] have been proposed to improve the linear predictor in the "rst stage. Besides, the Hu!man coding of mostlikely magnitude (MLM) [13] had been developed to improve the coding performance in the /00/$  see front matter 2000 Elsevier Science B.V. All rights reserved. PII: S ( 9 9 )
2 368 Y.C. Hu, C.C. Chang / Signal Processing: Image Communication 16 (2000) 367}372 second stage. However, achieving a better compression ratio for lossless image compression is still an important issue. In this paper, we shall propose a new coding technique based on the MLM scheme for lossless image compression. The rest of this paper is organized as follows. In Section 2, we shall review the Hu!man coding scheme and the MLM coding scheme. In Section 3, the newly proposed method shall be proposed. In Section 4, some experimental results shall show that our newly proposed algorithm indeed produces good image quality. The discussion and conclusion shall be given in Section Previous works The Hu!man coding technique is a commonly used scheme for data compression because it is very simple and e!ective. It requires the statistical information about the distribution of the data to be encoded. Besides, an identical coding table is used in both the encoder and the decoder. The details of the Hu!man coding technique are described in the following. Hu4man Coding Algorithm Step 1. Build a Hu!man tree by sorting the histogram and successively combine the two bins of the lowest value until only one bin remains. Step 2. Encode the Hu!man tree and save the Hu!man tree with the coded value. Step 3. Encode the residual image. In Step 1, the Hu!man tree of the given data is built by successively combining the two bins with the lowest value. The Hu!man coding table is then constructed to record the mapping of the data of each bin and the corresponding encoding bit pattern. The performance of the Hu!man coding technique relies on the distribution of the input data. If the input data has a large dynamic range, the Hu!man coding technique requires a higher computation cost. The Hu!man coding of the mostlikely magnitude (MLM) is thus proposed to solve this problem since the fundamental goal of MLM is to encode the residual image generated for the linear predictor. It exploits two properties of image residual distribution: 1. The distribution of these residual magnitudes is symmetrical to the origin. 2. The number of the small residual magnitudes is much larger than that of the large residual magnitudes. By exploiting Property 1, the MLM scheme cuts down the number of code calculations by half by creating Hu!man codes only for the residual magnitudes and then adds a sign bit. By exploiting Property 2, the MLM scheme uses the Hu!man coding technique only for the mostlikely (or small) residual magnitudes and employs another special pre"x code to identify the leastlikely (or large) residual values. The details of the MLM scheme are described in the following. The MLM Method Step 1. Compute the residual histogram H, such that H(x)"the number of pixels having residual magnitudes. Step 2. Compute the symmetry histogram S such that S(y)"H(y)#H(!y), where y*0. Step 3. Find the range threshold R such that S(j))P N( S(j), where N is the total number of the pixels in the input residual image and P is the desired proportion of the mostlikely magnitudes. Note that 0)P)1 and 0)R. Step 4. Construct the modi"ed symmetry histogram S with R#1 entries, where S (y)" if0)y)r!1, S(y) N! S(j) ify"r. Note that S (R) stores the total number of the leastlikely occurrences. Step 5. Construct the Hu!man tree and generate the Hu!man table C for histogram S using the traditional Hu!man coding tech nique. Step 6. Encode each residual magnitude x by the following three rules. Rule 1. If 0)x)R!1 then output conc(c(x), 0).
3 Y.C. Hu, C.C. Chang / Signal Processing: Image Communication 16 (2000) 367} Rule 2. If!(R!1))x(0 then output conc(c( x ), 1). Rule 3. If x*r or x)!r then output conc(c(r), x). Here the function conc(x, z) concatenates the bit representations of x and z. Here C(x) denotes the encoded bit pattern for input x stored in the Hu!man coding table. In Step 1, the residual histogram H is computed and to be transformed into the symmetry histogram S in Step 2. The range of symmetry histogram S is about half of the original residual histogram H. However, the information about the sign value should be kept for residual reproduction in the decoder. That is, to record the sign value of each residual, one sign bit should be added in the encoding step. Given a prede"ned proportion threshold P, where 0)P)1, the range threshold R to classify the mostlikely magnitude and the leastlikely magnitude is decided in Step 3. If P is set to 0.9, it means that we want to encode 90% of the residual magnitudes using the Hu!man coding technique with slight modi"cation. Thus, a switch value should be added in front of these leastlikely magnitudes to accommodate the encoding technique. So, these leastlikely magnitudes are collected together in Step 4. At present, there are R#1 entries in the modi"ed symmetry histogram. After completing the computation of histogram, the standard Hu!man coding technique is applied to the construction of the Hu!man tree and the Hu!man coding table for in Step 5. The actual encoding process for input residual x is done in Step 6. If x is a mostlikely magnitude, the coding output is composed of the encoded bit pattern for C( x ) followed by a sign bit. Otherwise, if x is a leastlikely magnitude, the coding output is composed of the encoded bit pattern for C(R) followed by the binary representation of x. The parameter P provides a means of trading o! speed for compression performance. The authors claim that P"0.99 is a good compromise for a wide variety of images. A large value of P generally leads to more computation cost though a Hu! man table with more entries can be stored. On the other hand, if the parameter P is small, the MLM scheme has some loss in encoding these leastlikely magnitudes. 3. The newly proposed scheme In this section, we shall propose an enhanced Hu!man coding algorithm based on the MLM method. We call it the enhanced MLM method (EMLM). In the MLM method described in Section 2, the output of the mostlikely magnitude x is composed of the bit pattern of C( x ) followed by a sign bit. In such an arrangement, there is one unused entry for the residual magnitude x when x equals zero. In other words, this entry is not used in the MLM scheme. To make use of this entry, two solutions are found. First, we can omit the sign bit when x equals zero because Hu!man code is a pre "x code, or alternatively we can utilize this entry by storing the switch value of these leastlikely magnitudes and thus lower the required bit length for the switch value. Therefore, the required bit length of these leastlikely magnitudes can be reduced and the range of modi"ed symmetry histogram can be decreased by one. From the description of the MLM method in Section 2, we know that the output of each leastlikely residual magnitude x is composed of the switch value, namely C(R), followed by the binary representation of x. The output length of the leastlikely magnitude may be longer than that when the standard Hu!man coding scheme is used instead. To reduce the required bit length and the size of Hu!man table, we integrate the folding technique into the EMLM method. The details of the EMLM method are described in the following. Our EMLM Method Step 1. Compute the residual histogram H, such that H(x)"the number of the pixels having residual magnitude x. Step 2. Compute the symmetry histogram S such that S(y)"H(y)#H(!y), where y*0. Step 3. Given the prede"ned range threshold R. The symmetry histogram with the folding technique is constructed according to the following substeps.
4 370 Y.C. Hu, C.C. Chang / Signal Processing: Image Communication 16 (2000) 367}372 Step 3.1. If 0)y)R!1, then (y)" S(y). Step 3.2. If R)y and y"q R#r, then the following three substeps are executed sequentially to build the histogram. Step (R)" (R)#S(y). Step (q)" (q)#s(y). Step (r)" (r)#s(y). Now, there are R#1 entries in the modi "ed symmetry histogram. Step 4. Rearrange the modi"ed symmetry histogram with the unused zero entry by computing S " (0)# (R) S (y) if y"0, if 1)y)R!1. At present, the modi"ed symmetry histogram has only R entries. Step 5. Construct the Hu!man tree and generate the Hu!man table C for histogram using the traditional Hu!man coding technique. Step 6. Encode each residual magnitude x by the following four rules. Rule 1. If 0)x)R!1, then output conc(c(x), 0). Rule 2. If!(R!1))x, then output conc(c( x ), 1). Rule 3. If x*r and x"q R#r, where q and r are among the integers, then output conc(conc(conc(c(0), 1),0), conc(c(q), C(r))). Rule 4. If x)!r and x "q R#r, where q and r are among the integers, then output conc(conc(conc(c(0),1),1), conc(c(q), C(r))). Here, C(x) denotes the encoded bit pattern for x in the Hu!man table, and the function conc(x, z) concatenates the bits of x and z together. In this method, the residual histogram H and the symmetry histogram S are computed in Steps 1 and 2, respectively. Given a prede"ned range threshold R, the whole magnitudes can be divided into a group of the mostlikely magnitudes and of the leastlikely magnitudes. Then the modi"ed symmetry histogram can be constructed using the folding technique in Step 3. Now, the modi"ed symmetry histogram has R#1entries.InStep4, the modi"ed symmetry histogram is rearranged by making use of the unused entry for magnitude zero. Now, the modi"ed symmetry histogram has R entries. The Hu!man tree and the Hu!man coding table for are constructed in Step 5. In Step 6, the actual encoding process for input residual x is described. If x is a mostlikely magnitude, the coding output is composed of the encoded bit pattern for C( x ) followed by a sign bit. If x is a leastlikely magnitude, the coding output is composed of the encoded bit pattern for the switch element followed the sign bit and the encoded bit pattern for the quotient and the remainder of x. Here the encoded bit pattern of the switch element makes use of the unused zero entry to reduce the required bit length. In our EMLM, we use the wasted entry in MLM originally meant for the zero magnitude. The required bit length of the switch element to justify the mostlikely magnitudes and leastlikely magnitudes is much smaller that that in MLM. Besides, a folding technique for histogram rearrangement is developed. The goal of the folding technique is to reduce the bit length for each leastlikely magnitude. By rearranging the histogram, the entropy of these residual magnitudes can be further lowered down. A better compression ratio and a smaller Hu!man table can thus be obtained. 4. Experimental results All our experiments are done upon SUN SPARC10. In these simulations, we apply the DPCM method to compute the residual image in the "rst stage and then use the EMLM scheme to encode the residuals in the second stage. In this section, we shall compare the performances of the DPCM/Hu!man, DPCM/MLM scheme and our DPCM/EMLM scheme using still images with 256 gray levels. The criterion used to compare them is compression ratio (with respect to the number of bits), which is de"ned as follows: original file size Compression Ratio (CR)" compressed file size.
5 Y.C. Hu, C.C. Chang / Signal Processing: Image Communication 16 (2000) 367} Table 1 The performance comparison of the compression ratios using images Images Methods Hu!man Compress Gzip DPCM/ Hu!man DPCM/ MLM DPCM/ EMLM Airplane Boat Family Lenna Ti!any Toys Table 2 The total number of nonzero entries needed to be processed in di!erent methods Methods Hu!man DPCM/ DPCM/ DPCM/ Images Hu!man MLM EMLM Airplane Boat amily Lenna Ti!any Toys The experimental results of six images are listed in Table 1. The Hu!man method shown in Table 1 uses the Hu!man coding technique to encode each image without decorating the raw image data. Compress and Gzip, on the other hand, are two popular compression tools. Also, the DPCM/Hu!man method is one of the two basic versions of the JPEG standard. Furthermore, the proportion threshold P of the MLM method is set to This indicates that we want to encode 99% of the mostlikely magnitudes using the traditional Hu!man coding technique and encode 1% of the leastlikely magnitudes by transmitting the switch value along with the binary representation of the residual to the decoder. It is shown that the best compression ratios for these images are obtained using the DPCM/ EMLM method. Note that the storage cost of the Hu!man table is included when computing the compression ratios. The total number of nonzero entries from these four di!erent methods using six images are shown in Table 2. Here, the proportion threshold P of the MLM method is set to 0.99, and the range threshold R of the EMLM method is set to 12. The nonzero entries of the Hu!man method show the raw distribution of the input raw image. The nonzero entries of the DPCM/Hu!man method include the positive and the negative residual magnitudes after the DPCM scheme is used to decorate the raw image. The DPCM/MLM method uses the concept of symmetry origin to reduce the nonzero entries. Thus, the number of nonzero entries from DPCM/MLM is about half of that in DPCM/Hu!man. The DPCM/EMLM employs the folding technique to lower the nonzero entries further. The DPCM/EMLM method has the fewest nonzero entries as shown in Table 2. In general, large numbers of nonzero entries imply bigger storage spaces and higher computation complexities are demanded. The problem can be very serious if the images to be encoded are with high residual dynamic ranges. For example, if each pixel in the image is stored using 12 bits, the dynamic range of the residual image will be bigger than when 8 bits are used to represent each pixel. The issue about the selection of a good range threshold for the EMLM method is very important. Since these leastlikely magnitudes are encoded by the folding technique instead of being encoded by the switch value along with their residual magnitudes, the bit patterns for the quotient and the remainder should be as small as possible. Thus, the selection of the range threshold tends to be a small value. However, the range threshold should be larger than the square root of the nonzero entries of
6 372 Y.C. Hu, C.C. Chang / Signal Processing: Image Communication 16 (2000) 367}372 the symmetry histogram. Therefore, the range threshold is set to 12 in our EMLM method to meet the two conditions halfway. 5. Discussion and conclusion The compression ratio is an important criterion in choosing a compression scheme for lossless image compression. Currently, the Lossless JPEG is the most common scheme for lossless image compression. It has two basic versions: the DPCM/ arithmetic coding and the DPCM/Hu!man coding. The DPCM/Hu!man coding scheme is more popular than the DPCM/Arithmetic scheme because it needs less computation cost. The Hu! man coding technique is simple and e!ective, but it needs a lot of computation time if the dynamic range is very large. Therefore, the MLM scheme is proposed to resolve this problem. The DPCM/MLM scheme reduces computation time by reducing code computation while reaching high compression performance. This is because it saves a much smaller code tree with the encoded value. The DPCM/MLM scheme turns out to be an algorithm with signi"cant improvements in computation time and compression performance compared with the DPCM/Hu!man method of Lossless JPEG. These advantages of the DPCM/ MLM scheme become most apparent for images with high residual dynamic ranges. In this paper, an EMLM scheme based on the MLM scheme has been proposed to further improve the compression ratio in lossless image compression. By employing the folding technique and making use of the originally unused entry for zero magnitude in the MLM scheme, our EMLM scheme can achieve a higher compression ratio while keeping all the advantages of the MLM scheme. In other words, our method inherits the advantages when encoding images for high residual dynamic ranges. From the experimental results, it is shown that our newly proposed method outperforms the DPCM/Hu!man method and the DPCM/MLM method in compression ratio. Moreover, this DPCM/EMLM method reduces the number of generated codes because the number of the nonzero entries used is smaller than those of the DPCM/ Hu!man method and of the DPCM/MLM scheme. In other words, the newly proposed method indeed serves well as an e$cient and e!ective scheme for lossless image compression. References [1] M.F. CarretoCastro, J.M. Ramirez, J.L. Ballesteros, D. BaezLopez, Comparsion of lossless compression techniques, in: IEEE Proceedings of the 36th Midwest Symposium on Circuits and System, Vol. 2, 1993, pp. 1268}1270. [2] C.C. Cutler, Di!erential quantization of communication signals, U.S. Patent 2,605,361, [3] R.G. Gallager, Variations on a theme by Hu!man, IEEE Trans. Inform. Theory 24 (1978) 668}674. [4] M. Giridhar, A. Nasir, D.S. Samuel, A twostage scheme for lossless compression of images, in: IEEE Symposium on Circuits and System, Vol. 2, 1995, pp. 1102}1105. [5] D.A. Hu!man, A method for the construction of minimum redundancy codes, Proc. IRE 40 (1952) 1098}1101. [6] G.G. Langdon, An introduction to arithmetic coding, IBM J. Res. Develop. 28 (1984) 135}149. [7] Y.W. Nijim, S.D. Stearns, Di!erentiation applied to lossless compression of medical images, IEEE Trans. Med. Imaging 15 (4) (1996) 555}559. [8] J.B. O'Neil, Entropy coding in speech and television di!erential PCM systems, IEEE Trans. Inform. Theory IT17 (1971) 758}761. [9] M. Rabbani, P.W. Jones, Digital image compression techniques, Tutorial Texts in Optical Engineering, Vol. TT7, SPIE Optical Eng. Press. [10] K. Sayood, K. Anderson, A di!erential lossless image compression scheme, IEEE Trans. Signal Process. 40 (1) (1992) 236}241. [11] S.D. Stearns, L. Tan, N. Magotra, Lossless compression of waveform data for e$cient storage and transmission, IEEE Trans. Geosci. Remote Sensing 31 (3) (1993) 645}654. [12] G.K. Wallace, The JPEG still picture compression standard, Comm. ACM 34 (4) (1991) 30}40. [13] J.C. Wehnes, H.T. Pai, A.C. Bovik, Fast lossless image compression, in: Proceedings of the IEEE Southwest Symposium on Image Analysis and Interpretation, 1996, pp. 145}148. [14] I.H. Witten, R.M. Neal, J.G. Cleary, Arithmetic coding for data compression, Comm. ACM 30 (1987) 520}540.
Image compression. Stefano Ferrari. Università degli Studi di Milano Methods for Image Processing. academic year
Image compression Stefano Ferrari Università degli Studi di Milano stefano.ferrari@unimi.it Methods for Image Processing academic year 2017 2018 Data and information The representation of images in a raw
More informationIMAGE COMPRESSION. Image Compression. Why? Reducing transportation times Reducing file size. A two way event  compression and decompression
IMAGE COMPRESSION Image Compression Why? Reducing transportation times Reducing file size A two way event  compression and decompression 1 Compression categories Compression = Image coding Stillimage
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 informationTopic 5 Image Compression
Topic 5 Image Compression Introduction Data Compression: The process of reducing the amount of data required to represent a given quantity of information. Purpose of Image Compression: the reduction of
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 informationTHE RELATIVE EFFICIENCY OF DATA COMPRESSION BY LZW AND LZSS
THE RELATIVE EFFICIENCY OF DATA COMPRESSION BY LZW AND LZSS Yair Wiseman 1* * 1 Computer Science Department, BarIlan University, RamatGan 52900, Israel Email: wiseman@cs.huji.ac.il, http://www.cs.biu.ac.il/~wiseman
More informationCS 335 Graphics and Multimedia. Image Compression
CS 335 Graphics and Multimedia Image Compression CCITT Image Storage and Compression Group 3: Huffmantype encoding for binary (bilevel) data: FAX Group 4: Entropy encoding without error checks of group
More informationHybrid image coding based on partial fractal mapping
Signal Processing: Image Communication 15 (2000) 767}779 Hybrid image coding based on partial fractal mapping Zhou Wang, David Zhang*, Yinglin Yu Department of Electrical and Computer Engineering, University
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 informationImplementation and Analysis of Efficient Lossless Image Compression Algorithm
Implementation and Analysis of Efficient Lossless Image Compression Algorithm Megha S. Chaudhari 1, S.S.Shirgan 2 Department of Electronics & Telecommunication, N.B.Navale college of engineering, Solapur,
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, JulyAugust, 15 ISSN 912730 A Image Comparative Study using DCT, Fast Fourier, Wavelet Transforms and Huffman Algorithm
More information7.5 Dictionarybased Coding
7.5 Dictionarybased Coding LZW uses fixedlength code words to represent variablelength strings of symbols/characters that commonly occur together, e.g., words in English text LZW encoder and decoder
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 informationContext based optimal shape coding
IEEE Signal Processing Society 1999 Workshop on Multimedia Signal Processing September 1315, 1999, Copenhagen, Denmark Electronic Proceedings 1999 IEEE Context based optimal shape coding Gerry Melnikov,
More informationOn Data Latency and Compression
On Data Latency and Compression Joseph M. Steim, Edelvays N. Spassov, Kinemetrics, Inc. Abstract Because of interest in the capability of digital seismic data systems to provide lowlatency data for Early
More informationAn Optimum Approach for Image Compression: Tuned DegreeK Zerotree Wavelet Coding
An Optimum Approach for Image Compression: Tuned DegreeK Zerotree Wavelet Coding Li Wern Chew*, Wai Chong Chia, Liminn Ang and Kah Phooi Seng Abstract  This paper presents an image compression technique
More informationPerformance analysis of Integer DCT of different block sizes.
Performance analysis of Integer DCT of different block sizes. Aim: To investigate performance analysis of integer DCT of different block sizes. Abstract: Discrete cosine transform (DCT) has been serving
More information1.Define image compression. Explain about the redundancies in a digital image.
1.Define image compression. Explain about the redundancies in a digital image. The term data compression refers to the process of reducing the amount of data required to represent a given quantity of information.
More informationUserFriendly Sharing System using Polynomials with Different Primes in Two Images
UserFriendly Sharing System using Polynomials with Different Primes in Two Images Hung P. Vo Department of Engineering and Technology, Tra Vinh University, No. 16 National Road 53, Tra Vinh City, Tra
More informationUse of Local Minimization for Lossless Gray Image Compression
Narendra Kumar et al. / (IJCSIT) International Journal of Computer Science and Information Technologies, Vol. 1 Use of Local Minimization for Lossless Gray Image Compression Narendra Kumar 1, Dr. Sachin
More informationStatistical Image Compression using Fast Fourier Coefficients
Statistical Image Compression using Fast Fourier Coefficients M. Kanaka Reddy Research Scholar Dept.of Statistics Osmania University Hyderabad500007 V. V. Haragopal Professor Dept.of Statistics Osmania
More informationDCT Based, Lossy Still Image Compression
DCT Based, Lossy Still Image Compression NOT a JPEG artifact! Lenna, Playboy Nov. 1972 Lena Soderberg, Boston, 1997 Nimrod Peleg Update: April. 2009 http://www.lenna.org/ Image Compression: List of Topics
More informationEnhancing the Image Compression Rate Using Steganography
The International Journal Of Engineering And Science (IJES) Volume 3 Issue 2 Pages 1621 2014 ISSN(e): 2319 1813 ISSN(p): 2319 1805 Enhancing the Image Compression Rate Using Steganography 1, Archana Parkhe,
More informationSource Coding Basics and Speech Coding. Yao Wang Polytechnic University, Brooklyn, NY11201
Source Coding Basics and Speech Coding Yao Wang Polytechnic University, Brooklyn, NY1121 http://eeweb.poly.edu/~yao Outline Why do we need to compress speech signals Basic components in a source coding
More informationCode Transformation of DFExpression between Bintree and Quadtree
Code Transformation of DFExpression between Bintree and Quadtree ChinChen Chang*, ChienFa Li*, and YuChen Hu** *Department of Computer Science and Information Engineering, National Chung Cheng University
More informationA QUADTREE DECOMPOSITION APPROACH TO CARTOON IMAGE COMPRESSION. YiChen Tsai, MingSui Lee, Meiyin Shen and C.C. Jay Kuo
A QUADTREE DECOMPOSITION APPROACH TO CARTOON IMAGE COMPRESSION YiChen Tsai, MingSui Lee, Meiyin Shen and C.C. Jay Kuo Integrated Media Systems Center and Department of Electrical Engineering University
More informationIMAGE COMPRESSION. Chapter  5 : (Basic)
Chapter  5 : IMAGE COMPRESSION (Basic) Q() Explain the different types of redundncies that exists in image.? (8M May6 Comp) [8M, MAY 7, ETRX] A common characteristic of most images is that the neighboring
More informationAn Information Hiding Scheme Based on Pixel ValueOrdering and PredictionError Expansion with Reversibility
An Information Hiding Scheme Based on Pixel ValueOrdering PredictionError Expansion with Reversibility ChingChiuan Lin Department of Information Management Overseas Chinese University Taichung, Taiwan
More informationCoding of Coefficients of twodimensional nonseparable Adaptive Wiener Interpolation Filter
Coding of Coefficients of twodimensional nonseparable Adaptive Wiener Interpolation Filter Y. Vatis, B. Edler, I. Wassermann, D. T. Nguyen and J. Ostermann ABSTRACT Standard video compression techniques
More informationA MiniatureBased Image Retrieval System
A MiniatureBased Image Retrieval System Md. Saiful Islam 1 and Md. Haider Ali 2 Institute of Information Technology 1, Dept. of Computer Science and Engineering 2, University of Dhaka 1, 2, Dhaka1000,
More informationA New Fast Motion Estimation Algorithm.  Literature Survey. Instructor: Brian L. Evans. Authors: Yue Chen, Yu Wang, Ying Lu.
A New Fast Motion Estimation Algorithm  Literature Survey Instructor: Brian L. Evans Authors: Yue Chen, Yu Wang, Ying Lu Date: 10/19/1998 A New Fast Motion Estimation Algorithm 1. Abstract Video compression
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 informationIMAGE CODING USING WAVELET TRANSFORM, VECTOR QUANTIZATION, AND ZEROTREES
IMAGE CODING USING WAVELET TRANSFORM, VECTOR QUANTIZATION, AND ZEROTREES Juan Claudio Regidor Barrientos *, Maria Angeles Losada Binue **, Antonio Artes Rodriguez **, Francisco D Alvano *, Luis Urbano
More informationDepth Estimation for View Synthesis in Multiview Video Coding
MITSUBISHI ELECTRIC RESEARCH LABORATORIES http://www.merl.com Depth Estimation for View Synthesis in Multiview Video Coding Serdar Ince, Emin Martinian, Sehoon Yea, Anthony Vetro TR2007025 June 2007 Abstract
More informationA High Quality/Low Computational Cost Technique for Block Matching Motion Estimation
A High Quality/Low Computational Cost Technique for Block Matching Motion Estimation S. López, G.M. Callicó, J.F. López and R. Sarmiento Research Institute for Applied Microelectronics (IUMA) Department
More informationChapter 7 Lossless Compression Algorithms
Chapter 7 Lossless Compression Algorithms 7.1 Introduction 7.2 Basics of Information Theory 7.3 RunLength Coding 7.4 VariableLength Coding (VLC) 7.5 Dictionarybased Coding 7.6 Arithmetic Coding 7.7
More informationData Encryption on FPGA using Huffman Coding
Data Encryption on FPGA using Huffman Coding Sourav Singh 1, Kirti Gupta 2 12 Electronics and Communication Department, Bharati Vidyapeeth s College of Engineering, New Delhi, (India) ABSTRACT The ultimate
More informationARTIFICIAL INTELLIGENCE LABORATORY. A.I. Memo No November, K.P. Horn
MASSACHUSETTS INSTITUTE OF TECHNOLOGY ARTIFICIAL INTELLIGENCE LABORATORY A.I. Memo No. 1584 November, 1996 Edge and Mean Based Image Compression Ujjaval Y. Desai, Marcelo M. Mizuki, Ichiro Masaki, and
More informationIMPROVED CONTEXTADAPTIVE ARITHMETIC CODING IN H.264/AVC
17th European Signal Processing Conference (EUSIPCO 2009) Glasgow, Scotland, August 2428, 2009 IMPROVED CONTEXTADAPTIVE ARITHMETIC CODING IN H.264/AVC Damian Karwowski, Marek Domański Poznań University
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, Bangalore560059. knmsm_03@yahoo.com (2) Professor, R V
More informationResearch on Distributed Video Compression Coding Algorithm for Wireless Sensor Networks
Sensors & Transducers 203 by IFSA http://www.sensorsportal.com Research on Distributed Video Compression Coding Algorithm for Wireless Sensor Networks, 2 HU Linna, 2 CAO Ning, 3 SUN Yu Department of Dianguang,
More informationLossless Image Compression having Compression Ratio Higher than JPEG
Cloud Computing & Big Data 35 Lossless Image Compression having Compression Ratio Higher than JPEG Madan Singh madan.phdce@gmail.com, Vishal Chaudhary Computer Science and Engineering, Jaipur National
More informationVery Low Bit Rate Color Video
1 Very Low Bit Rate Color Video Coding Using Adaptive Subband Vector Quantization with Dynamic Bit Allocation Stathis P. Voukelatos and John J. Soraghan This work was supported by the GECMarconi Hirst
More informationLossless Frame Memory Compression with Low Complexity using PCT and AGR for Efficient High Resolution Video Processing
Lossless Frame Memory Compression with Low Complexity using PCT and AGR for Efficient High Resolution Video Processing Jongho Kim Department of Multimedia Engineering, Sunchon National University, 255
More informationStatistical Modeling of Huffman Tables Coding
Statistical Modeling of Huffman Tables Coding S. Battiato 1, C. Bosco 1, A. Bruna 2, G. Di Blasi 1, and G.Gallo 1 1 D.M.I. University of Catania  Viale A. Doria 6, 95125, Catania, Italy {battiato, bosco,
More informationA Research Paper on Lossless Data Compression Techniques
IJIRST International Journal for Innovative Research in Science & Technology Volume 4 Issue 1 June 2017 ISSN (online): 23496010 A Research Paper on Lossless Data Compression Techniques Prof. Dipti Mathpal
More informationDIGITAL IMAGE WATERMARKING BASED ON A RELATION BETWEEN SPATIAL AND FREQUENCY DOMAINS
DIGITAL IMAGE WATERMARKING BASED ON A RELATION BETWEEN SPATIAL AND FREQUENCY DOMAINS Murat Furat Mustafa Oral email: mfurat@cu.edu.tr email: moral@mku.edu.tr Cukurova University, Faculty of Engineering,
More informationImage Coding and Data Compression
Image Coding and Data Compression Biomedical Images are of high spatial resolution and fine grayscale quantisiation Digital mammograms: 4,096x4,096 pixels with 12bit/pixel 32MB per image Volume data (CT
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 informationImproved ContextBased Adaptive Binary Arithmetic Coding in MPEG4 AVC/H.264 Video Codec
Improved ContextBased Adaptive Binary Arithmetic Coding in MPEG4 AVC/H.264 Video Codec Abstract. An improved Contextbased Adaptive Binary Arithmetic Coding (CABAC) is presented for application in compression
More informationLossless Image Coding via Adaptive Linear Prediction and Classification
Lossless Image Coding via Adaptive Linear Prediction and Classification GIOVANNI MOTTA, STUDENT MEMBER, IEEE, JAMES A. STORER, MEMBER, IEEE, AND BRUNO CARPENTIERI, MEMBER, IEEE In the past years, there
More informationA BTCCOMPRESSED DOMAIN INFORMATION HIDING METHOD BASED ON HISTOGRAM MODIFICATION AND VISUAL CRYPTOGRAPHY. HangYu Fan and ZheMing Lu
International Journal of Innovative Computing, Information and Control ICIC International c 2016 ISSN 13494198 Volume 12, Number 2, April 2016 pp. 395 405 A BTCCOMPRESSED DOMAIN INFORMATION HIDING METHOD
More informationA Fast Block sorting Algorithm for lossless Data Compression
A Fast Block sorting Algorithm for lossless Data Compression DI Michael Schindler Vienna University of Technology Karlsplatz 13/1861, A 1040 Wien, Austria, Europe michael@eiunix.tuwien.ac.at if.at is transformed
More informationarxiv: v2 [cs.it] 15 Jan 2011
Improving PPM Algorithm Using Dictionaries Yichuan Hu Department of Electrical and Systems Engineering University of Pennsylvania Email: yichuan@seas.upenn.edu Jianzhong (Charlie) Zhang, Farooq Khan and
More informationHYBRID TRANSFORMATION TECHNIQUE FOR IMAGE COMPRESSION
31 st July 01. Vol. 41 No. 00501 JATIT & LLS. All rights reserved. ISSN: 1998645 www.jatit.org EISSN: 18173195 HYBRID TRANSFORMATION TECHNIQUE FOR IMAGE COMPRESSION 1 SRIRAM.B, THIYAGARAJAN.S 1, Student,
More informationPROBABILISTIC MEASURE OF COLOUR IMAGE PROCESSING FIDELITY
Journal of ELECTRICAL ENGINEERING, VOL. 59, NO. 1, 8, 9 33 PROBABILISTIC MEASURE OF COLOUR IMAGE PROCESSING FIDELITY Eugeniusz Kornatowski Krzysztof Okarma In the paper a probabilistic approach to quality
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 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 WenJyi
More informationA New Technique of Lossless Image Compression using PPMTree
A New Technique of Lossless Image Compression PPTree Shams ahmood Imam, S.. Rezaul Hoque, ohammad Kabir Hossain, William Perrizo Department of Computer Science and Engineering, North South University,
More informationAn Optimized Template Matching Approach to Intra Coding in Video/Image Compression
An Optimized Template Matching Approach to Intra Coding in Video/Image Compression Hui Su, Jingning Han, and Yaowu Xu Chrome Media, Google Inc., 1950 Charleston Road, Mountain View, CA 94043 ABSTRACT The
More informationDictionary Based Compression for Images
Dictionary Based Compression for Images Bruno Carpentieri Abstract LempelZiv methods were original introduced to compress onedimensional data (text, object codes, etc.) but recently they have been successfully
More informationOptimum Global Thresholding Based Variable Block Size DCT Coding For Efficient Image Compression
Biomedical & Pharmacology Journal Vol. 8(1), 453461 (2015) Optimum Global Thresholding Based Variable Block Size DCT Coding For Efficient Image Compression VIKRANT SINGH THAKUR 1, SHUBHRATA GUPTA 2 and
More informationA Lossy Image Codec Based on Adaptively Scanned Wavelet Difference Reduction
A Lossy Image Codec Based on Adaptively Scanned Wavelet Difference Reduction James S. Walker Department of Mathematics University of Wisconsin Eau Claire Eau Claire, WI 54702 4004 Phone: 715 836 3301 Fax:
More informationInterframe coding of video signals
Interframe coding of video signals Adaptive intrainterframe prediction Conditional replenishment Ratedistortion optimized mode selection Motioncompensated prediction Hybrid coding: combining interframe
More informationAn Optimum Novel Technique Based on GolombRice Coding for Lossless Image Compression of Digital Images
, pp.1326 http://dx.doi.org/10.14257/ijsip.2013.6.6.02 An Optimum Novel Technique Based on GolombRice Coding for Lossless Image Compression of Digital Images Shaik Mahaboob Basha 1 and B. C. Jinaga 2
More informationGolomb Coding Implementation in FPGA
Faculty of Electrical Engineering Universiti Teknologi Malaysia VOL., NO. 2, 28, 364 ELEKTRIKA http://fke.utm.my/elektrika Golomb Coding Implementation in FPGA G. H. H ng, M. F. M. Salleh and Z. A. Halim
More informationA Comparative Study of Lossless Compression Algorithm on Text Data
Proc. of Int. Conf. on Advances in Computer Science, AETACS A Comparative Study of Lossless Compression Algorithm on Text Data Amit Jain a * Kamaljit I. Lakhtaria b, Prateek Srivastava c a, b, c Department
More informationJPEG Syntax and Data Organization
JPEG Syntax and Data Organization Compressed image data SOI Frame EOI Frame [ Tables/ misc. [ Frame header Scan 1 [ DNL segment [ [ Scan 2 [ [Scan last [ Scan [ Tables/ misc. [ Scan header [ECS 0 RST 0
More informationMultimedia Communications. Transform Coding
Multimedia Communications Transform Coding Transform coding Transform coding: source output is transformed into components that are coded according to their characteristics If a sequence of inputs is transformed
More informationImproving LZW Image Compression
European Journal of Scientific Research ISSN 1450216X Vol.44 No.3 (2010), pp.502509 EuroJournals Publishing, Inc. 2010 http://www.eurojournals.com/ejsr.htm Improving LZW Image Compression Sawsan A. Abu
More informationVideo compression with 1D directional transforms in H.264/AVC
Video compression with 1D directional transforms in H.264/AVC The MIT Faculty has made this article openly available. Please share how this access benefits you. Your story matters. Citation Kamisli, Fatih,
More informationImage coding and compression
Chapter 2 Image coding and compression 2. Lossless and lossy compression We have seen that image files can be very large. It is thus important for reasons both of storage and file transfer to make these
More informationIMAGE COMPRESSION USING HYBRID TRANSFORM TECHNIQUE
Volume 4, No. 1, January 2013 Journal of Global Research in Computer Science RESEARCH PAPER Available Online at www.jgrcs.info IMAGE COMPRESSION USING HYBRID TRANSFORM TECHNIQUE Nikita Bansal *1, Sanjay
More informationFast Motion Estimation for Shape Coding in MPEG4
358 IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY, VOL. 13, NO. 4, APRIL 2003 Fast Motion Estimation for Shape Coding in MPEG4 Donghoon Yu, Sung Kyu Jang, and Jong Beom Ra Abstract Effective
More informationWavelet Based Image Compression Using ROI SPIHT Coding
International Journal of Information & Computation Technology. ISSN 09742255 Volume 1, Number 2 (2011), pp. 6976 International Research Publications House http://www.irphouse.com Wavelet Based Image
More informationCompression; Error detection & correction
Compression; Error detection & correction compression: squeeze out redundancy to use less memory or use less network bandwidth encode the same information in fewer bits some bits carry no information some
More informationDEFLATE COMPRESSION ALGORITHM
DEFLATE COMPRESSION ALGORITHM Savan Oswal 1, Anjali Singh 2, Kirthi Kumari 3 B.E Student, Department of Information Technology, KJ'S Trinity College Of Engineering and Research, Pune, India 1,2.3 Abstract
More informationAN EFFICIENT VIDEO WATERMARKING USING COLOR HISTOGRAM ANALYSIS AND BITPLANE IMAGE ARRAYS
AN EFFICIENT VIDEO WATERMARKING USING COLOR HISTOGRAM ANALYSIS AND BITPLANE IMAGE ARRAYS G Prakash 1,TVS Gowtham Prasad 2, T.Ravi Kumar Naidu 3 1MTech(DECS) student, Department of ECE, sree vidyanikethan
More informationA SIMPLE LOSSLESS COMPRESSION ALGORITHM IN WIRELESS SENSOR NETWORKS: AN APPLICATION OF SEISMIC DATA
ISSN: 09763104 ARTICLE A SIMPLE LOSSLESS COMPRESSION ALGORITHM IN WIRELESS SENSOR NETWORKS: AN APPLICATION OF SEISMIC DATA J. Uthayakumar 1*, T. Vengattaraman 1, J. Amudhavel 2 1 Department of Computer
More informationA MemoryEfficient Adaptive Huffman Coding Algorithm for Very Large Sets of Symbols Revisited
A MemoryEfficient Adaptive Huffman Coding Algorithm for Very Large Sets of Symbols Revisited Steven Pigeon Yoshua Bengio pigeon,bengioy}@iro.umontreal.ca Département d Informatique et de Recherche opérationelle
More informationHuffman Coding Author: Latha Pillai
Application Note: Virtex Series XAPP616 (v1.0) April 22, 2003 R Huffman Coding Author: Latha Pillai Summary Huffman coding is used to code values statistically according to their probability of occurence.
More informationAudio and video compression
Audio and video compression 4.1 introduction Unlike text and images, both audio and most video signals are continuously varying analog signals. Compression algorithms associated with digitized audio and
More informationCoding for the Network: Scalable and Multiple description coding Marco Cagnazzo
Coding for the Network: Scalable and Multiple description coding Marco Cagnazzo Overview Examples and motivations Scalable coding for network transmission Techniques for multiple description coding 2 27/05/2013
More informationImage coding and compression
Image coding and compression Robin Strand Centre for Image Analysis Swedish University of Agricultural Sciences Uppsala University Today Information and Data Redundancy Image Quality Compression Coding
More informationBasic Compression Library
Basic Compression Library Manual API version 1.2 July 22, 2006 c 20032006 Marcus Geelnard Summary This document describes the algorithms used in the Basic Compression Library, and how to use the library
More informationA Comparative Study Of Text Compression Algorithms
International Journal of Wisdom Based Computing, Vol. 1 (3), December 2011 68 A Comparative Study Of Text Compression Algorithms Senthil Shanmugasundaram Department of Computer Science, Vidyasagar College
More informationModified Huffman Algorithm for Image Encoding and Decoding
2016 IJSRSET Volume 2 Issue 3 Print ISSN : 23951990 Online ISSN : 23944099 Themed Section: Engineering and Technology Modified Huffman Algorithm for Image Encoding and Decoding Sona Khanna, Suman Kumari,
More informationIMAGE COMPRESSION I. Week VIII Feb /25/2003 Image CompressionI 1
IMAGE COMPRESSION I Week VIII Feb 25 02/25/2003 Image CompressionI 1 Reading.. Chapter 8 Sections 8.1, 8.2 8.3 (selected topics) 8.4 (Huffman, runlength, lossless predictive) 8.5 (lossy predictive,
More informationADAPTIVE PICTURE SLICING FOR DISTORTIONBASED CLASSIFICATION OF VIDEO PACKETS
ADAPTIVE PICTURE SLICING FOR DISTORTIONBASED CLASSIFICATION OF VIDEO PACKETS E. Masala, D. Quaglia, J.C. De Martin Λ Dipartimento di Automatica e Informatica/ Λ IRITICNR Politecnico di Torino, Italy
More informationRate Distortion Optimization in Video Compression
Rate Distortion Optimization in Video Compression Xue Tu Dept. of Electrical and Computer Engineering State University of New York at Stony Brook 1. Introduction From Shannon s classic rate distortion
More informationVERY large scale integration (VLSI) design for power
IEEE TRANSACTIONS ON VERY LARGE SCALE INTEGRATION (VLSI) SYSTEMS, VOL. 7, NO. 1, MARCH 1999 25 Short Papers Segmented Bus Design for LowPower Systems J. Y. Chen, W. B. Jone, Member, IEEE, J. S. Wang,
More informationTime Stamp Detection and Recognition in Video Frames
Time Stamp Detection and Recognition in Video Frames Nongluk Covavisaruch and Chetsada Saengpanit Department of Computer Engineering, Chulalongkorn University, Bangkok 10330, Thailand Email: nongluk.c@chula.ac.th
More informationIMAGE COMPRESSION TECHNIQUES
International Journal of Information Technology and Knowledge Management JulyDecember 2010, Volume 2, No. 2, pp. 265269 Uchale Bhagwat Shankar The use of digital images has increased at a rapid pace
More informationTechnical lossless / near lossless data compression
Technical lossless / near lossless data compression Nigel Atkinson (Met Office, UK) ECMWF/EUMETSAT NWP SAF Workshop 57 Nov 2013 Contents Survey of file compression tools Studies for AVIRIS imager Study
More informationLossless Compression of Breast Tomosynthesis Objects Maximize DICOM Transmission Speed and Review Performance and Minimize Storage Space
Lossless Compression of Breast Tomosynthesis Objects Maximize DICOM Transmission Speed and Review Performance and Minimize Storage Space David A. Clunie PixelMed Publishing What is Breast Tomosynthesis?
More informationCluster based Mixed Coding Schemes for Inverted File Index Compression
Cluster based Mixed Coding Schemes for Inverted File Index Compression Jinlin Chen 1, Ping Zhong 2, Terry Cook 3 1 Computer Science Department Queen College, City University of New York USA jchen@cs.qc.edu
More informationFRAMELEVEL QUALITY AND MEMORY TRAFFIC ALLOCATION FOR LOSSY EMBEDDED COMPRESSION IN VIDEO CODEC SYSTEMS
FRAMELEVEL QUALITY AD MEMORY TRAFFIC ALLOCATIO FOR LOSSY EMBEDDED COMPRESSIO I VIDEO CODEC SYSTEMS Li Guo, Dajiang Zhou, Shinji Kimura, and Satoshi Goto Graduate School of Information, Production and
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 information06/12/2017. Image compression. Image compression. Image compression. Image compression. Coding redundancy: image 1 has four gray levels
Theoretical size of a file representing a 5k x 4k colour photograph: 5000 x 4000 x 3 = 60 MB 1 min of UHD tv movie: 3840 x 2160 x 3 x 24 x 60 = 36 GB 1. Exploit coding redundancy 2. Exploit spatial and
More information