A Novel Image Compression Technique using Simple Arithmetic Addition
|
|
- Cory Parrish
- 5 years ago
- Views:
Transcription
1 Proc. of Int. Conf. on Recent Trends in Information, Telecommunication and Computing, ITC A Novel Image Compression Technique using Simple Arithmetic Addition Nadeem Akhtar, Gufran Siddiqui and Salman Khan Department of Computer engineering, Zakir Husain College of Engineering and Technology Aligarh Muslim University, Aligarh, India {nadeemalakhtar, m.gufran.sid}@gmail.com, salmanblues_23}@yahoo.com Abstract A novel lossless image-compression scheme is proposed in this paper. We show how a set of pixels can be compressed using simple arithmetic addition. We perform a series of addition operations on a set of pixels to get an array of sums. Additions are performed in such a way that we can reverse the whole process and recover the original set of pixels through that array. Experimental results presented in this paper prove that this new method of image compression gives promising results as compared with original LZW dictionary algorithm, Deflate algorithm, PNG and GIF. Index Terms Image Compression, LZW, Deflate, PNG, GIF I. INTRODUCTION The data compression [1-6] has always been important and it becomes even more popular and important nowadays. In many cases the data compression is necessary due to huge requirements of storage and time, especially in problems of information transmission. Images are very important form of data, to work with them in some applications they need to be compressed, more or less depending on the purpose of the application. There are some algorithms that perform this compression in a lossless way, such that no information is lost while compressing the images and when they are decompressed it is exactly the same as the original image. Some other algorithms perform the compression in a lossy way, such that some information is lost while compressing the images. Some of these compression methods are designed for specific kinds of images, so they will not be as good for other kinds of images. Moreover there are some algorithms that even let you change the parameters they use to adjust the amount of compression for an image. In this paper we deal with Lossless Image Compression [7-10]. This kind of compression is very important in many fields 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 two stage coding technique is embedded in these schemes. In the first stage, a linear predictor such as differential pulse code modulation (DPCM) [11, 12] or some linear predicting functions is used to de-correlate the raw image data. In the second stage, a standard coding technique, such as Huffman coding [13, 14], arithmetic coding [15] or Lempel-Ziv coding, is used to encode the residual magnitudes. Such a two-stage scheme is useful because the high correlation between neighboring pixels in most images can be decorrelated, which results in a significant entropy reduction. However the algorithm introduced in this paper is totally different. The idea is that, when you add two numbers it is like you are merging two numbers into one. For example DOI: 02.ITC Association of Computer Electronics and Electrical Engineers, 2014
2 adding 10 and 5 gives us 15. So we can imagine 15 as a representation of two numbers. Only thing is that we cannot recover 10 and 5 from can give us {10, 5} {9, 6} {8, 7} and so on. Let us assume that there is a way of recovering 10 and 5 from 15. We know that 10 takes 4 bits to be stored in memory and 5 takes 3 bits to be stored in memory. That makes a total of 7 bits. On the other hand 15 take only 4 bits to be stored in memory. Hence storing 15 gives us a saving of 3 bits. In this paper we will be exploiting this idea and use it to compress images. Comparison is done by using the standard images of Lena, Barbara, F16 and some other high resolution images. II. RELATED WORK The most popular Lossless Image Compression formats are GIF and PNG. GIF (Graphics Interchange Format) [16] is a bitmap image format. The format supports up to 8 bits per pixel thus allowing a single image to reference a palette of up to 256 distinct colors. The colors are chosen from the 24-bit RGB color space. It also supports animations and allows a separate palette of 256 colors for each frame. The color limitation makes the GIF format unsuitable for reproducing color photographs and other images with continuous color, but it is well-suited for simpler images such as graphics or logos with solid areas of color. GIF images are compressed using the Lempel-Ziv-Welch (LZW) [17] lossless data compression technique to reduce the file size without degrading the visual quality. PNG (Portable Network Graphics) [18], like Gif, is also a bitmap image format that employs lossless Image compression. PNG was created to both improve upon and replace the GIF format with an image file format that does not require a patent license to use. It uses the DEFLATE [17]compression algorithm, that uses a combination of the LZ77 [17] algorithm and Huffman coding. PNG supports palette based (with a palette defined in terms of the 24 bit RGB colors), greyscale and RGB images. PNG was designed for distribution of images on the internet not for professional graphics and as such other color spaces. III. PROPOSED METHOD The method of image compression which we present in this paper is based on simple addition. It is independent of all the currently available compression algorithms. It is simple yet effective. Firstly we split the image into 4*4 blocks and the then the same algorithm is applied to all the blocks of the image. Compression of the image is divided in three phases, while decompression is divided in two phases Compression: i. Initialization Phase ii. Iteration Phase iii. Storing Decompression: i. Reverse Iteration ii. Mapping A. Compression Consider a 4*4 block of an image given below: i. Initialization Phase The image contains 5 distinct numbers 181, 182, 180, 184 & 187. Let us arrange them in ascending order. 320
3 Assume them to be as array indexes. We initialize each cell with the number of integers between itself and the previous integer. The number 180 has no previous number to be compared with, so we initialize it with 0. Between 181 and 180 there are no integers, so we initialize cell number 181 with 0 as well. Similarly there are no integers between 182 and 181, so cell number 182 is also initialized with 0. Next is cell number 184. There is 1 integer in between 184 and 182 (i.e. 183), so we initialize cell number 184 with 1. Between 187 and 184 there are 2 numbers (i.e. 185 and 186), so we initialize cell number 187 with 2. This completes our initialization phase. ii. Iteration Phase In this section we will iterate through the block sequentially from start to the finish. At each step our aim is to make the value stored in the cell (The Highest), corresponding to the current number. We do it by adding [current highest value (excluding the value stored in the current cell) + 1] to the value stored in the current cell. We will proceed as follows: Step 1: First number = 181 The current highest value is 2. So we add 1 to it and add the resulting value to the value initially stored in cell number 181. So the value of cell number 181 now becomes 3 (0 + [2+1]) which is now the highest number in the updated array. Old Updated While finding the highest number we are not considering the value already stored in the current cell (i.e. cell number 181). In the above case it does not make any difference because cell number 181 contains 0, but if suppose the stored number in cell number 181 was greater than or equal to 3, the highest number still would have been 2 in the above case. Step 2: Next number = 182 The highest value in the new updated array is 3 (excluding the value already present in cell number 182). We add 1 to it and add the resulting value to the value initially stored in cell number 182. So the value of cell number 182 now becomes 4 (0 + [3+1]) Old Updated Step 3: Next number =
4 The highest value in the new updated array is 4. So we add 1 to it and add the resulting value to the value initially stored in cell number 180. So the value of cell number 180 now becomes 5 (0 + [4+1]) Old Updated Step 4: Next number = 180 The highest value in the new array is 4. Note that we have excluded the value stored in the current cell number 180 i.e. 5 in order to find the highest value. So we add 1 to 4 and add the resulting value to the value initially stored in cell number 180 (i.e. 5). So the value of cell number 180 now becomes 10 (5 + [4+1]) Old Updated Similarly for all the remaining numbers in the block (i.e. 180, 184, 181, 181, 180, 184, 182, 187, 181, 187, 187, and 180), we proceed as above to get the following Final array. Final Array iii. Storing Now we will store this final array according to the following format: Our starting number (index) in the above array is 180. Total distinct numbers are 5. Maximum value is 381. It takes 9 bits to represent this value in binary. So we allocate 9 bits to all the values in the array and store it as follows: Start Dn Bm Dn * Bm Total bits occupied: (9 * 5) =
5 Total bits occupied by raw data: 8 * 16 = 128 (i.e. 8 bits per pixel and there are 16 pixels in one 4*4 block.) Total bits saved: = 67 B. Decompression Decompression is simple. We do just the reverse of what we did in the compression phase. Let us consider the previously stored binary data: Start Dn Bm Dn * Bm From this data we can retrieve the following information: Start = 180 Array = Once we have this information we can now proceed with the reverse iteration phase and mapping phase. i. Reverse Iteration In this phase at each step we will proceed as follows: 1. Find the highest value and write its associated index in the 4*4 block in reverse order. 2. Subtract the [second highest value + 1] from the highest value and replace the highest value with it. Let us now proceed as above. The current highest value is 381 which is store in cell number 1. So we save 1 in the 4*4 block as shown below: Next we subtract the [second highest value + 1] (i.e ) from the highest value (i.e. 381). We get 55. Then we will replace 381 with 55. The updated array will look follows: Now the highest value in the updated array is 325 which store in cell number 5. So we will save 5 in the 4*4 block as shown below: 323
6 We again subtract the [second highest value +1] (i.e ) from the highest value (i.e. 325). We get 203. Then we will replace 323 with 203. The updated array will look as follows: We repeat the above procedure until we have filled the 4*4 block. The final block will look as follows: The final array will look as follows: ii. Mapping The recovered final array above gives us the gapping information between adjacent numbers. We also know that the starting number is 180 as mentioned earlier so we can now retrieve the original pixel array which will look as follows: We replace the numbers (1, 2, 3, 4 & 5) in the 4*4 block with the above recovered pixel values to get the following block: 324
7 This block is same as the block we initially compressed. Hence we have recovered our original data without any loss of information. IV. RESULTS AND DISCUSSION Tables I and II show comparison results among the proposed method and other Lossless Compression algorithms. Table I shows the size of various images (24 bit RGB) in bytes after compression and Table II shows their respective compression ratios, where compression ratio is defined as: Compression Ratio (CR) = (Compressed Image Size) / (Original Image Size) The compression ratio is an important criterion in choosing a compression scheme for lossless image compression. From the above results, we can see that our newly proposed method is better than GIF, LZW and Deflate on average case. However, it is not better than PNG which is the most commonly used scheme for lossless image compression. Now, we analyze our method for performance analysis. The proposed addition-based algorithm gives very good results if the pixels values are close to each other no matter how randomly they are arranged. The performance of the algorithm increases as the number of distinct pixel values in the 4*4 block decreases. Let us consider the following 4*4 block having all 16 pixel values equal: On applying the addition-based algorithm to the above block we obtain the following final array: Total bits = 16(header) + 1*5(bits occupied by maximum value 16) Total bits = 21 Bits saved = 107 Now let us consider the following 4*4 block having all 16 pixel values different but closely related: On applying the addition-based algorithm to the above block we obtain the following final array: 325
8 Total bits = 16(header) + 16*5(bits occupied by maximum value 16) Total bits = 96 Bits saved = 32 V. CONCLUSION In this work, we have proposed a novel image compression algorithm that works in spatial domain. The proposed compression method is much better than GIF, TIFF (LZW). It is comparable to TIFF (DEFLATE) and for most of the images, it gives slightly better results. The proposed method exploits the relativity of adjacent pixels in an image. As the number of repeated pixels in the image increases, the amount of compression that we get also increases. Hence for images with lower color space, the performance of the algorithm will increase because with lower color space the range of pixel values decrease. Hence the pixel values will be closer to each other and there will be even more redundancy in the images, as a result the compression will be better. TABLE I. SIZE IN BYTES Size in Byte PGM GIF TIFF (LZW) TIFF (DEFLATE) PNG PROPOSED METHOD LENA BARBARA F KID TOWN BRANCH FLOWER
9 TABLE II. COMPRESSION RATIO Size in Byte PGM GIF TIFF (LZW) TIFF (DEFLATE) PNG PROPOSED METHOD LENA BARBARA F KID TOWN BRANCH FLOWER REFERENCES [1] D. Hankerson, G.A.Harris, P.D. Johnson Jr., Introduction to Information Theory and Data Compression, CRC Press, Boca Raton, FL, [2] O. Egger, P. Fleury, T. Ebrahimi, M. Kunt, High performance compression of visual information a tutorial review part I: still pictures, Proc. IEEE 87 (1999). [3] V.P. Baligar, L.M. Patnaik, G.R. Nagabhushana, High compression and low order linear predictor for lossless coding of grayscale images, Image Vis. Comput. 21 (6) (2003). [4] D. Salomon, Data Compression: The Complete Reference, third ed., Springer, New York, [5] D. Salomon, A Guide to Data Compression Methods, Springer, New York, [6] K. Sayood, Introduction to Data Compression, second ed., Academic Press, San Diego, CA, [7] M. Rabbani, P.W. Jones, Digital image compression techniques, Tutorial Texts in Optical Engineering, Vol. TT7, SPIE Optical Eng. Press. [8] K. Sayood, K. Anderson, A differential lossless image compression scheme, IEEE Trans. Signal Process. 40 (1) (1992). [9] S.D. Stearns, L. Tan, N. Magotra, Lossless compression of waveform data for efficient storage and transmission, IEEE Trans. Geosci. Remote Sensing 31 (3) (1993). [10] G.K. Wallace, The JPEG still picture compression standard, Comm. ACM 34 (4) (1991). [11] C.C. Cutler, Differential quantization of communication signals, U.S. Patent 2,605,361, [12] J.B. O'Neil, Entropy coding in speech and television differential PCM systems, IEEE Trans. Inform. Theory IT (1971). [13] R.G. Gallager, Variations on a theme by Huffman, IEEE Trans. Inform. Theory (1978). [14] D.A. Huffman, A method for the construction of minimum redundancy codes, Proc. IRE (1952). [15] G.G. Langdon, An introduction to arithmetic coding, IBM J. Res. Develop (1984). [16] Information Providers Guide, The EU Internet Handbook, [17] David Salomon, Data Compression The complete reference, 4th ed. Springer (Dec 2006) ISBN [18] Portable Network Graphics (PNG) Specification (Second Edition), 327
A new lossless compression scheme based on Hu!man coding scheme for image compression
Signal Processing: Image Communication 16 (2000) 367}372 A new lossless compression scheme based on Hu!man coding scheme for image compression Yu-Chen Hu, Chin-Chen Chang* Department of Computer Science
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 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 Still-image
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 informationCS 335 Graphics and Multimedia. Image Compression
CS 335 Graphics and Multimedia Image Compression CCITT Image Storage and Compression Group 3: Huffman-type encoding for binary (bilevel) data: FAX Group 4: Entropy encoding without error checks of group
More information7: Image Compression
7: Image Compression Mark Handley Image Compression GIF (Graphics Interchange Format) PNG (Portable Network Graphics) MNG (Multiple-image Network Graphics) JPEG (Join Picture Expert Group) 1 GIF (Graphics
More informationIMAGE COMPRESSION TECHNIQUES
IMAGE COMPRESSION TECHNIQUES A.VASANTHAKUMARI, M.Sc., M.Phil., ASSISTANT PROFESSOR OF COMPUTER SCIENCE, JOSEPH ARTS AND SCIENCE COLLEGE, TIRUNAVALUR, VILLUPURAM (DT), TAMIL NADU, INDIA ABSTRACT A picture
More informationIMAGE PROCESSING (RRY025) LECTURE 13 IMAGE COMPRESSION - I
IMAGE PROCESSING (RRY025) LECTURE 13 IMAGE COMPRESSION - I 1 Need For Compression 2D data sets are much larger than 1D. TV and movie data sets are effectively 3D (2-space, 1-time). Need Compression for
More informationDigital Image Representation Image Compression
Digital Image Representation Image Compression 1 Image Representation Standards Need for compression Compression types Lossless compression Lossy compression Image Compression Basics Redundancy/redundancy
More informationA QUAD-TREE DECOMPOSITION APPROACH TO CARTOON IMAGE COMPRESSION. Yi-Chen Tsai, Ming-Sui Lee, Meiyin Shen and C.-C. Jay Kuo
A QUAD-TREE DECOMPOSITION APPROACH TO CARTOON IMAGE COMPRESSION Yi-Chen Tsai, Ming-Sui Lee, Meiyin Shen and C.-C. Jay Kuo Integrated Media Systems Center and Department of Electrical Engineering University
More informationVC 12/13 T16 Video Compression
VC 12/13 T16 Video Compression Mestrado em Ciência de Computadores Mestrado Integrado em Engenharia de Redes e Sistemas Informáticos Miguel Tavares Coimbra Outline The need for compression Types of redundancy
More informationImage 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 Algorithm and JPEG Standard
International Journal of Scientific and Research Publications, Volume 7, Issue 12, December 2017 150 Image Compression Algorithm and JPEG Standard Suman Kunwar sumn2u@gmail.com Summary. The interest in
More informationG64PMM - Lecture 3.2. Analogue vs Digital. Analogue Media. Graphics & Still Image Representation
G64PMM - Lecture 3.2 Graphics & Still Image Representation Analogue vs Digital Analogue information Continuously variable signal Physical phenomena Sound/light/temperature/position/pressure Waveform Electromagnetic
More informationSo, what is data compression, and why do we need it?
In the last decade we have been witnessing a revolution in the way we communicate 2 The major contributors in this revolution are: Internet; The explosive development of mobile communications; and The
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 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 informationIMAGE COMPRESSION- I. Week VIII Feb /25/2003 Image Compression-I 1
IMAGE COMPRESSION- I Week VIII Feb 25 02/25/2003 Image Compression-I 1 Reading.. Chapter 8 Sections 8.1, 8.2 8.3 (selected topics) 8.4 (Huffman, run-length, loss-less predictive) 8.5 (lossy predictive,
More informationAN ANALYTICAL STUDY OF LOSSY COMPRESSION TECHINIQUES ON CONTINUOUS TONE GRAPHICAL IMAGES
AN ANALYTICAL STUDY OF LOSSY COMPRESSION TECHINIQUES ON CONTINUOUS TONE GRAPHICAL IMAGES Dr.S.Narayanan Computer Centre, Alagappa University, Karaikudi-South (India) ABSTRACT The programs using complex
More informationLecture 5: Compression I. This Week s Schedule
Lecture 5: Compression I Reading: book chapter 6, section 3 &5 chapter 7, section 1, 2, 3, 4, 8 Today: This Week s Schedule The concept behind compression Rate distortion theory Image compression via DCT
More information7.5 Dictionary-based Coding
7.5 Dictionary-based Coding LZW uses fixed-length code words to represent variable-length strings of symbols/characters that commonly occur together, e.g., words in English text LZW encoder and decoder
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 informationFeatures. Sequential encoding. Progressive encoding. Hierarchical encoding. Lossless encoding using a different strategy
JPEG JPEG Joint Photographic Expert Group Voted as international standard in 1992 Works with color and grayscale images, e.g., satellite, medical,... Motivation: The compression ratio of lossless methods
More informationFundamentals of Multimedia. Lecture 5 Lossless Data Compression Variable Length Coding
Fundamentals of Multimedia Lecture 5 Lossless Data Compression Variable Length Coding Mahmoud El-Gayyar elgayyar@ci.suez.edu.eg Mahmoud El-Gayyar / Fundamentals of Multimedia 1 Data Compression Compression
More informationLecture Coding Theory. Source Coding. Image and Video Compression. Images: Wikipedia
Lecture Coding Theory Source Coding Image and Video Compression Images: Wikipedia Entropy Coding: Unary Coding Golomb Coding Static Huffman Coding Adaptive Huffman Coding Arithmetic Coding Run Length Encoding
More informationImage Coding and Compression
Lecture 17, Image Coding and Compression GW Chapter 8.1 8.3.1, 8.4 8.4.3, 8.5.1 8.5.2, 8.6 Suggested problem: Own problem Calculate the Huffman code of this image > Show all steps in the coding procedure,
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, Bar-Ilan University, Ramat-Gan 52900, Israel Email: wiseman@cs.huji.ac.il, http://www.cs.biu.ac.il/~wiseman
More informationChapter 7 Lossless Compression Algorithms
Chapter 7 Lossless Compression Algorithms 7.1 Introduction 7.2 Basics of Information Theory 7.3 Run-Length Coding 7.4 Variable-Length Coding (VLC) 7.5 Dictionary-based Coding 7.6 Arithmetic Coding 7.7
More informationDIFFERENTIAL IMAGE COMPRESSION BASED ON ADAPTIVE PREDICTION
DIFFERENTIAL IMAGE COMPRESSION BASED ON ADAPTIVE PREDICTION M.V. Gashnikov Samara National Research University, Samara, Russia Abstract. The paper describes the adaptive prediction algorithm for differential
More informationEngineering Mathematics II Lecture 16 Compression
010.141 Engineering Mathematics II Lecture 16 Compression Bob McKay School of Computer Science and Engineering College of Engineering Seoul National University 1 Lossless Compression Outline Huffman &
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 informationRepetition 1st lecture
Repetition 1st lecture Human Senses in Relation to Technical Parameters Multimedia - what is it? Human senses (overview) Historical remarks Color models RGB Y, Cr, Cb Data rates Text, Graphic Picture,
More informationMedical Image Compression using DCT and DWT Techniques
Medical Image Compression using DCT and DWT Techniques Gullanar M. Hadi College of Engineering-Software Engineering Dept. Salahaddin University-Erbil, Iraq gullanarm@yahoo.com ABSTRACT In this paper we
More informationGraphics File Formats
1 Graphics File Formats Why have graphics file formats? What to look for when choosing a file format A sample tour of different file formats, including bitmap-based formats vector-based formats metafiles
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 informationSimple variant of coding with a variable number of symbols and fixlength codewords.
Dictionary coding Simple variant of coding with a variable number of symbols and fixlength codewords. Create a dictionary containing 2 b different symbol sequences and code them with codewords of length
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 informationPARALLEL LOSSLESS IMAGE COMPRESSION USING MPI
VAWKUM Transactions on Computer Sciences http://vfast.org/index.php/vtcs@ 2014 ISSN: 2308-8168 Volume 4, Number 2, July-August 2014 pp-11-19 PARALLEL LOSSLESS IMAGE COMPRESSION USING MPI HANIF DURAD 1,
More informationDigiPoints Volume 1. Student Workbook. Module 8 Digital Compression
Digital Compression Page 8.1 DigiPoints Volume 1 Module 8 Digital Compression Summary This module describes the techniques by which digital signals are compressed in order to make it possible to carry
More informationCompression II: Images (JPEG)
Compression II: Images (JPEG) What is JPEG? JPEG: Joint Photographic Expert Group an international standard in 1992. Works with colour and greyscale images Up 24 bit colour images (Unlike GIF) Target Photographic
More informationDepartment of electronics and telecommunication, J.D.I.E.T.Yavatmal, India 2
IJESRT INTERNATIONAL JOURNAL OF ENGINEERING SCIENCES & RESEARCH TECHNOLOGY LOSSLESS METHOD OF IMAGE COMPRESSION USING HUFFMAN CODING TECHNIQUES Trupti S Bobade *, Anushri S. sastikar 1 Department of electronics
More informationImage Compression - An Overview Jagroop Singh 1
www.ijecs.in International Journal Of Engineering And Computer Science ISSN: 2319-7242 Volume 5 Issues 8 Aug 2016, Page No. 17535-17539 Image Compression - An Overview Jagroop Singh 1 1 Faculty DAV Institute
More informationJPEG: An Image Compression System. Nimrod Peleg update: Nov. 2003
JPEG: An Image Compression System Nimrod Peleg update: Nov. 2003 Basic Structure Source Image Data Reconstructed Image Data Encoder Compressed Data Decoder Encoder Structure Source Image Data Compressed
More informationPERFORMANCE ANALYSIS OF INTEGER DCT OF DIFFERENT BLOCK SIZES USED IN H.264, AVS CHINA AND WMV9.
EE 5359: MULTIMEDIA PROCESSING PROJECT PERFORMANCE ANALYSIS OF INTEGER DCT OF DIFFERENT BLOCK SIZES USED IN H.264, AVS CHINA AND WMV9. Guided by Dr. K.R. Rao Presented by: Suvinda Mudigere Srikantaiah
More informationcolor bit depth dithered
EPS The EPS (Encapsulated PostScript) format is widely accepted by the graphic arts industry for saving images that will be placed into programs such as Adobe Illustrator and QuarkXPress. It is used on
More informationEE67I Multimedia Communication Systems Lecture 4
EE67I Multimedia Communication Systems Lecture 4 Lossless Compression Basics of Information Theory Compression is either lossless, in which no information is lost, or lossy in which information is lost.
More informationWelcome Back to Fundamentals of Multimedia (MR412) Fall, 2012 Lecture 10 (Chapter 7) ZHU Yongxin, Winson
Welcome Back to Fundamentals of Multimedia (MR412) Fall, 2012 Lecture 10 (Chapter 7) ZHU Yongxin, Winson zhuyongxin@sjtu.edu.cn 2 Lossless Compression Algorithms 7.1 Introduction 7.2 Basics of Information
More informationImage Compression. cs2: Computational Thinking for Scientists.
Image Compression cs2: Computational Thinking for Scientists Çetin Kaya Koç http://cs.ucsb.edu/~koc/cs2 koc@cs.ucsb.edu The course was developed with input from: Ömer Eǧecioǧlu (Computer Science), Maribel
More information15 Data Compression 2014/9/21. Objectives After studying this chapter, the student should be able to: 15-1 LOSSLESS COMPRESSION
15 Data Compression Data compression implies sending or storing a smaller number of bits. Although many methods are used for this purpose, in general these methods can be divided into two broad categories:
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): 2349-6010 A Research Paper on Lossless Data Compression Techniques Prof. Dipti Mathpal
More informationA Methodology to Detect Most Effective Compression Technique Based on Time Complexity Cloud Migration for High Image Data Load
AUSTRALIAN JOURNAL OF BASIC AND APPLIED SCIENCES ISSN:1991-8178 EISSN: 2309-8414 Journal home page: www.ajbasweb.com A Methodology to Detect Most Effective Compression Technique Based on Time Complexity
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 informationAn On-line Variable Length Binary. Institute for Systems Research and. Institute for Advanced Computer Studies. University of Maryland
An On-line Variable Length inary Encoding Tinku Acharya Joseph F. Ja Ja Institute for Systems Research and Institute for Advanced Computer Studies University of Maryland College Park, MD 242 facharya,
More informationDigital Image Processing
Lecture 9+10 Image Compression Lecturer: Ha Dai Duong Faculty of Information Technology 1. Introduction Image compression To Solve the problem of reduncing the amount of data required to represent a digital
More informationData Compression. An overview of Compression. Multimedia Systems and Applications. Binary Image Compression. Binary Image Compression
An overview of Compression Multimedia Systems and Applications Data Compression Compression becomes necessary in multimedia because it requires large amounts of storage space and bandwidth Types of Compression
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 informationCh. 2: Compression Basics Multimedia Systems
Ch. 2: Compression Basics Multimedia Systems Prof. Ben Lee School of Electrical Engineering and Computer Science Oregon State University Outline Why compression? Classification Entropy and Information
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 informationAnalysis of Parallelization Effects on Textual Data Compression
Analysis of Parallelization Effects on Textual Data GORAN MARTINOVIC, CASLAV LIVADA, DRAGO ZAGAR Faculty of Electrical Engineering Josip Juraj Strossmayer University of Osijek Kneza Trpimira 2b, 31000
More informationAn Image Lossless Compression Patent
An Image Lossless Compression Patent Wenyan Wang College of Electronic Engineering, Guangxi Normal University, Guilin 541004, China Tel: 86-773-582-6559 E-mail: wwy@mailbox.gxnu.edu.cn The research is
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 informationChapter 1. Digital Data Representation and Communication. Part 2
Chapter 1. Digital Data Representation and Communication Part 2 Compression Digital media files are usually very large, and they need to be made smaller compressed Without compression Won t have storage
More informationImage Formats. Ioannis Rekleitis
Image Formats Ioannis Rekleitis JPEG/JFIF JPEG 2000 GIF PNG TIFF PPM, PGM, PBM, and PNM Exif BMP WebP HDR raster formats HEIF BAT BPG CSCE 590: Introduction to Image Processing https://en.wikipedia.org/wiki/image_file_formats
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 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 informationJPEG: An Image Compression System
JPEG: An Image Compression System ISO/IEC DIS 10918-1 ITU-T Recommendation T.81 http://www.jpeg.org/ Nimrod Peleg update: April 2007 Basic Structure Source Image Data Reconstructed Image Data Encoder Compressed
More informationImage Compression Using BPD with De Based Multi- Level Thresholding
International Journal of Innovative Research in Electronics and Communications (IJIREC) Volume 1, Issue 3, June 2014, PP 38-42 ISSN 2349-4042 (Print) & ISSN 2349-4050 (Online) www.arcjournals.org Image
More informationDictionary Based Compression for Images
Dictionary Based Compression for Images Bruno Carpentieri Abstract Lempel-Ziv methods were original introduced to compress one-dimensional data (text, object codes, etc.) but recently they have been successfully
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 informationData and information. Image Codning and Compression. Image compression and decompression. Definitions. Images can contain three types of redundancy
Image Codning and Compression data redundancy, Huffman coding, image formats Lecture 7 Gonzalez-Woods: 8.-8.3., 8.4-8.4.3, 8.5.-8.5.2, 8.6 Carolina Wählby carolina@cb.uu.se 08-47 3469 Data and information
More information1.6 Graphics Packages
1.6 Graphics Packages Graphics Graphics refers to any computer device or program that makes a computer capable of displaying and manipulating pictures. The term also refers to the images themselves. A
More informationStereo Image Compression
Stereo Image Compression Deepa P. Sundar, Debabrata Sengupta, Divya Elayakumar {deepaps, dsgupta, divyae}@stanford.edu Electrical Engineering, Stanford University, CA. Abstract In this report we describe
More informationData Compression. Media Signal Processing, Presentation 2. Presented By: Jahanzeb Farooq Michael Osadebey
Data Compression Media Signal Processing, Presentation 2 Presented By: Jahanzeb Farooq Michael Osadebey What is Data Compression? Definition -Reducing the amount of data required to represent a source
More informationInternational Journal of Advancements in Research & Technology, Volume 2, Issue 9, September ISSN
International Journal of Advancements in Research & Technology, Volume 2, Issue 9, September-2013 132 Dynamic Efficient Prediction Approach for Lossless Image Compression Arpita C. Raut 1, Dr. R. R. Sedamkar
More informationInformation Technology Department, PCCOE-Pimpri Chinchwad, College of Engineering, Pune, Maharashtra, India 2
Volume 5, Issue 5, May 2015 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com Adaptive Huffman
More informationVIDEO SIGNALS. Lossless coding
VIDEO SIGNALS Lossless coding LOSSLESS CODING The goal of lossless image compression is to represent an image signal with the smallest possible number of bits without loss of any information, thereby speeding
More informationLossless Compression Algorithms
Multimedia Data Compression Part I Chapter 7 Lossless Compression Algorithms 1 Chapter 7 Lossless Compression Algorithms 1. Introduction 2. Basics of Information Theory 3. Lossless Compression Algorithms
More informationIntroduction to Data Compression
Introduction to Data Compression Guillaume Tochon guillaume.tochon@lrde.epita.fr LRDE, EPITA Guillaume Tochon (LRDE) CODO - Introduction 1 / 9 Data compression: whatizit? Guillaume Tochon (LRDE) CODO -
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 informationECE 499/599 Data Compression & Information Theory. Thinh Nguyen Oregon State University
ECE 499/599 Data Compression & Information Theory Thinh Nguyen Oregon State University Adminstrivia Office Hours TTh: 2-3 PM Kelley Engineering Center 3115 Class homepage http://www.eecs.orst.edu/~thinhq/teaching/ece499/spring06/spring06.html
More informationA Comparative Study of Entropy Encoding Techniques for Lossless Text Data Compression
A Comparative Study of Entropy Encoding Techniques for Lossless Text Data Compression P. RATNA TEJASWI 1 P. DEEPTHI 2 V.PALLAVI 3 D. GOLDIE VAL DIVYA 4 Abstract: Data compression is the art of reducing
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 low-latency data for Early
More informationREVIEW ON IMAGE COMPRESSION TECHNIQUES AND ADVANTAGES OF IMAGE COMPRESSION
REVIEW ON IMAGE COMPRESSION TECHNIQUES AND ABSTRACT ADVANTAGES OF IMAGE COMPRESSION Amanpreet Kaur 1, Dr. Jagroop Singh 2 1 Ph. D Scholar, Deptt. of Computer Applications, IK Gujral Punjab Technical University,
More informationData compression with Huffman and LZW
Data compression with Huffman and LZW André R. Brodtkorb, Andre.Brodtkorb@sintef.no Outline Data storage and compression Huffman: how it works and where it's used LZW: how it works and where it's used
More informationJournal of Computer Engineering and Technology (IJCET), ISSN (Print), International Journal of Computer Engineering
Journal of Computer Engineering and Technology (IJCET), ISSN 0976 6367(Print), International Journal of Computer Engineering and Technology (IJCET), ISSN 0976 6367(Print) ISSN 0976 6375(Online) Volume
More informationWIRE/WIRELESS SENSOR NETWORKS USING K-RLE ALGORITHM FOR A LOW POWER DATA COMPRESSION
WIRE/WIRELESS SENSOR NETWORKS USING K-RLE ALGORITHM FOR A LOW POWER DATA COMPRESSION V.KRISHNAN1, MR. R.TRINADH 2 1 M. Tech Student, 2 M. Tech., Assistant Professor, Dept. Of E.C.E, SIR C.R. Reddy college
More informationLecture 6: Compression II. This Week s Schedule
Lecture 6: Compression II Reading: book chapter 8, Section 1, 2, 3, 4 Monday This Week s Schedule The concept behind compression Rate distortion theory Image compression via DCT Today Speech compression
More informationOptimized Compression and Decompression Software
2015 IJSRSET Volume 1 Issue 3 Print ISSN : 2395-1990 Online ISSN : 2394-4099 Themed Section: Engineering and Technology Optimized Compression and Decompression Software Mohd Shafaat Hussain, Manoj Yadav
More informationA Hybrid Image Compression Technique using Quadtree Decomposition and Parametric Line Fitting for Synthetic Images
A Hybrid Image Compression Technique using Quadtree Decomposition and Parametric Line Fitting for Synthetic Images Murtaza Khan and Yoshio Ohno Graduate School of Science and Technology, Keio University
More informationINTERNATIONAL JOURNAL OF PURE AND APPLIED RESEARCH IN ENGINEERING AND TECHNOLOGY
Rashmi Gadbail,, 2013; Volume 1(8): 783-791 INTERNATIONAL JOURNAL OF PURE AND APPLIED RESEARCH IN ENGINEERING AND TECHNOLOGY A PATH FOR HORIZING YOUR INNOVATIVE WORK EFFECTIVE XML DATABASE COMPRESSION
More informationLossless compression II
Lossless II D 44 R 52 B 81 C 84 D 86 R 82 A 85 A 87 A 83 R 88 A 8A B 89 A 8B Symbol Probability Range a 0.2 [0.0, 0.2) e 0.3 [0.2, 0.5) i 0.1 [0.5, 0.6) o 0.2 [0.6, 0.8) u 0.1 [0.8, 0.9)! 0.1 [0.9, 1.0)
More informationA HYBRID DPCM-DCT AND RLE CODING FOR SATELLITE IMAGE COMPRESSION
A HYBRID DPCM-DCT AND RLE CODING FOR SATELLITE IMAGE COMPRESSION Khaled SAHNOUN and Noureddine BENABADJI Laboratory of Analysis and Application of Radiation (LAAR) Department of Physics, University of
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 informationA Comprehensive Review of Data Compression Techniques
Volume-6, Issue-2, March-April 2016 International Journal of Engineering and Management Research Page Number: 684-688 A Comprehensive Review of Data Compression Techniques Palwinder Singh 1, Amarbir Singh
More informationBytes are read Right to Left, so = 0x3412, = 0x
Practice - Quiz #5 CIST 2612 Computer Forensics Bitmap File Information Bytes are read Right to Left, so 12 34 = 0x3412, 12 34 56 70 = 0x70563412 Figure 1 - Bitmap File Header Figure 2 - Device Independent
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 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 informationEntropy Coding. - to shorten the average code length by assigning shorter codes to more probable symbols => Morse-, Huffman-, Arithmetic Code
Entropy Coding } different probabilities for the appearing of single symbols are used - to shorten the average code length by assigning shorter codes to more probable symbols => Morse-, Huffman-, Arithmetic
More informationEE-575 INFORMATION THEORY - SEM 092
EE-575 INFORMATION THEORY - SEM 092 Project Report on Lempel Ziv compression technique. Department of Electrical Engineering Prepared By: Mohammed Akber Ali Student ID # g200806120. ------------------------------------------------------------------------------------------------------------------------------------------
More informationIMAGE COMPRESSION USING FOURIER TRANSFORMS
IMAGE COMPRESSION USING FOURIER TRANSFORMS Kevin Cherry May 2, 2008 Math 4325 Compression is a technique for storing files in less space than would normally be required. This in general, has two major
More information