Analysis of Parallelization Effects on Textual Data Compression
|
|
- Toby Campbell
- 5 years ago
- Views:
Transcription
1 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, Osijek CROATIA Abstract: - This article deals with the problem of textual data compression speed up by dividing a bigger file into smaller ones which are simultaneously compressed. This procedure is called parallel computing and this experiment uses a processor with four cores. Parallel processing is applied on five different algorithms, two of these are entropy coders and others are dictionary coders. Algorithms are mutually compared by speed and performance depending on the number of cores used. Key-Words: - data compression, dictionary coder, entropy coder, multiple cores, parallel computing. 1 Introduction According to [1], compression is used to reduce needed physical space for storing data using certain methods of data writing. The main unit for data storage is a file and depending on the data type within the file, some repetition is noticed. The data is stored once and after that only the position of repeated data is stored. In this way, it is possible to decrease needed space for data storage, which depends on data type and structure. There are two kinds of compression: lossless and lossy compression (compression without and with certain data loss). Lossless compression is carried out by data compression algorithms which ensure that reconstructed data from compressed files corresponds to starting data. Lossless compression is used when it is needed to save the original data and typical examples by which lossless compression must be used are executable files, source codes, textual data, etc. [2], [4]. The majority of programs performing lossless compression practice two steps on the data that will be compressed and these steps are: Input data statistical model generation Input data can be transformed into sequences of bits by using the statistical model so that less frequently occurring data give longer output sequences [5]. By using lossy compression, reconstructed data differs from input data, but these differences are so small and reconstructed data is still usable. According to [1] and [2], lossy compression methods are used for multimedia compression (audio, video and pictures). Two main lossy compression schemes are: Lossy transformation codecs (coder-decoder) Picture or audio samples are taken, divided into smaller parts, quantized and compressed using entropy coding [1]. Predictive lossy codecs preceding and/or following decoded data is used to assume a current picture or audio sample. The difference between the assumed and the real sample with additional data is quantized and coded. 2 Analyzed Methods Since we deal with textual data, only the lossless compression methods will be shown and analyzed. These methods are: Huffman coding, Arithmetic coding, LZ78 and LZW [3]. 2.1 Huffman Coding As in [2], Huffman coding codes symbols with variable length code words, depending on their probability of incidence. Huffman coding is based on two simple facts: 1. In optimal code, symbols with greater probabilities of incidence have smaller code words than symbols with lesser probabilities of incidence. 2. In optimal code, two symbols with smallest probabilities have code words of same length. Huffman coding algorithm is shown in Fig. 1, similarly to [2]: 1. Sort symbols by falling probabilities. 2. Link two symbols with least probabilities into one new symbol, on branching assign 0 to one branch and 1 to the second branch. 3. Sort the obtained symbols by probabilities. 4. Repeat until there is only one symbol. 5. Going back through tree read codes. Fig. 1 - Huffman coding algorithm ISSN: ISBN:
2 Algorithm data structure is binary tree. Decoding algorithm uses the same procedure as the coder for building a tree and before sending data, coder must first send the probabilities of symbol incidence. 2.2 Arithmetic Coding The algorithm takes queues of symbols as input data (message) and transforms them into a floating point number, depending on a known statistical model. The arithmetic coding is shown in Fig. 2, as in [2]: 1. Divide interval [0, 1] into M intervals that correspond to symbols, symbol length is proportional to symbols probability. 2. Select the interval of the first symbol in queue. 3. Subdivide the current symbol interval into new M subintervals, proportional to their probabilities. 4. From these subintervals, select one that matches the next symbol in queue. 5. Repeat steps 3 and 4 until all symbols are coded. 6. Output the interval value in binary form. Fig. 2 - Arithmetic coding algorithm 2.3 LZ78 Algorithm LZ78 uses a code word dictionary and tries to replace a stream of symbols with the reference to the stream dictionary location. The main assumption is that the reference to the stream in the dictionary is shorter than the stream itself. The stream is coded using an arranged pair length-distance which can be described as follows: every length symbol equals the symbol that is exactly distance symbols after uncompressed stream. The structure in which this data is held is called a sliding window; hence, LZ78 is sometimes called sliding window compression. Coder needs this data to discover if there is any correspondence and decoder needs this data for reference interpretation [6] and [7]. The coding algorithm is shown in Fig. 3, according to [1]: 1. Initialize the dictionary to a known value. 2. Read an uncoded string that is the length of the maximum allowable match. 3. Search for the longest matching string in the dictionary. 4. If a match is found to be greater than or equal to the minimum allowable match length: a. Write the encoded flag, then the offset and length to the encoded output. b. Otherwise, write the uncoded flag and the first uncoded symbol to the encoded output. 5. Shift a copy of the symbols written to the encoded output from the unencoded string to the dictionary. 6. Read a number of symbols from the uncoded input equal to the number of symbols written in Step Repeat from Step 3, until all the entire input has been encoded. Fig. 3 - LZ78 coding algorithm LZ78 reads the input stream in advance and compares it with the dictionary which is constantly updated. The input stream will be read until the corresponding data in the dictionary is found and in that moment, the position and length of data are written into dictionary. 2.4 LZW Coding LZW is a refined version of the LZ78 algorithm; hence it is faster but usually not optimal because of the constrained data analysis. The LZW coding algorithm is shown in Fig. 4, as in [8]: 1. Set w to zero. 2. For every c (character from an uncompressed file) a. If (w + c) exists in the dictionary, then w = w + c. b. Else add a dictionary code for w to output, add (w + c) in the dictionary and set w = c. 3. Add the dictionary code for w to output. Fig. 4 - LZW coding algorithm 3 Parallel Processing Parallel processing implies simultaneous execution of multiple instructions. It is based on the principle that bigger tasks can always be divided into smaller ones which are simultaneously executed. Communication and synchronization between various subtasks are the biggest restrictions for achieving good parallel processing performance. Parallel processing program execution speed-up is described by Amdahl s law [9]. Theoretically, by doubling processing elements, execution time should halve, and with the second doubling, execution time should halve again. However, a few parallel algorithms achieve this optimal speed-up. The majority of parallel algorithms have this optimal (linear) speed-up for a small number of processing ISSN: ISBN:
3 elements but with a further increase of processing elements execution time becomes constant [10]. Not every parallelization will result in execution time speed-up. As the tasks are divided in more and more threads, these threads need more time for mutual communication. It is possible that this additional communication dominates the time needed to solve problems; therefore further parallelization increases the program execution time, instead of decreasing it. This phenomenon is called parallel slowdown [11]. In this research we used a multi-core processor which consists of several processing units (cores) that can execute more instructions per cycle from different instruction streams. 4 Parallel Processing Data Data compression program will be executed on a multicore processor computer, i.e. on a computer with four cores. Computer configuration is as follows: CPU: Intel Core i GHz, RAM: 4 GB, Windows 7 OS. The coding algorithm on a multi-core system can be divided into several steps [10]: read input data stream separate input data stream in N equal parts where the number of processor cores, compress disjointed data using one of mentioned compression methods, join compressed parts into one file. program was written in C++ for command prompt. Executable file needs additional parameters, like compression type, input file and output file. was repeated ten times, so that we could obtain the best results because various processes were running in the background of the computer. After that, statistical data about compression was written in a file, from where we did our analysis. Fig. 5 shows data compression using four cores. 5 Results and Analysis Data compression algorithm analysis will be tested on a textual file showed in Table 1. The number of compression iterations is ten. Results are analyzed and minimum, maximum and mean values are shown in tables. Table 1. Source file Document name Size [in bytes] Description text.txt 5,910,599 Text 5.1 and Average of File Using Arithmetic Coding Table 2 shows mean and minimum values of the time needed for compression, compressed file size and the achieved compression. The values were acquired by analyzing results shown in Fig. 6. Table 2. times by using arithmetic coding min avg Compressed file size [byte] 3,530, ratio for the implemented compression method was calculated by using expression (1). Compressed file size ratio[ %] = *100% (1) Original file size From Table 2, but also from Fig. 6 we can conclude that compression time decreases with an increase in a utilized core number. By doubling the number of cores, compression time halves. Compressed data is stored in the file bible_arit.txt. Fig. 5 - Multi-core data compression algorithm Fig. 6 - time comparison depending on the number of cores used in arithmetic coding ISSN: ISBN:
4 5.2 File s Using Huffman Coding Table 3 shows compression times and Fig. 7 enables a comparison of compression times when using Huffman coding. Table 3. times by using Huffman coding Compressed file size [byte] min ,671, avg As well as in arithmetic coding, in Huffman coding compression time decreases proportionally with an increase in the number of cores. The compressed file size created by Huffman coding is larger than the compressed file size generated by arithmetic coding. time is longer in Huffman coding than in arithmetic coding. Fig. 7 - time comparison depending on the number of cores used in Huffman coding Fig. 8 - time comparison depending on the number of cores used in LZ78 coding 5.4 Results of LZW Coding Depending on the umber of Cores Used Table 5 shows average and minimum values of file compression times, compressed file size and a compression ratio. The values were acquired by analyzing results shown in Fig. 9. Table 5. times by using Huffman coding min avg Compressed file size [byte] Compressio n 2,434, LZW coding achieves the best compression ratio but compression time only increases with first core doubling and with further core number increase compression time doesn`t change much. 5.3 Results of LZ78 Coding Depending on the umber of Cores Used Table 4 shows compression time when using LZ78 coding and Fig. 8 shows the comparison of compression times depending on the number of cores. Table 4. s by Using LZ78 Coding min avg Compressed file size [byte] 3,140, Data compression time reduces when the number of cores is increased. time difference is very small for cases when three and four cores are used. Fig. 9 - time comparison depending on the number of cores used in LZW coding 5.5 Comparative analysis of minimal data compression times Table 6 shows compression time (minimum values in ms) and the compression ratio of the file text.txt for all coding methods. ISSN: ISBN:
5 Table 6. times for various coding methods depending on the number of cores used method Arithmetic Huffman LZ LZW Fig. 11 shows file sizes (in bytes) after compressing with a certain coding method. which was demonstrated in this paper. From the results of this paper, it can be concluded that compression time halved with doubling the number of cores. We used two types of coders: entropy coders and dictionary coders. time decreased by increasing the number of cores in all of the methods used. Entropy coders can compress a textual file faster, but they cannot compress as well as dictionary coders do. According to what we have seen so far, we can safely conclude that the parallelization procedure has the best effect on entropy coders, especially on arithmetic coding. Acknowledgment This work was supported by research project grant No from the Ministry of Science, Education and Sports of the Republic of Croatia. Fig ratio of all used coding methods Fig Compressed file size comparison depending on the coding method used 6 Conclusion The goal of this paper was to see the effects of parallelization on textual file compression. The parallelization procedure consists of splitting up the task in several smaller subtasks and their simultaneous execution for shortening the procedure execution time, i.e. shortening textual file compression time using multiple cores. It was logical to assume that compression time will decrease by increasing the number of cores, References: [1] M. Pu, Fundamental Data, Butterworth-Heinemann, [2] K.P. Subbalakshmi, Lossless Image, Lossless Handbook, Academic Press, Chapter 9, 2003, pp [3] T. Moffat, C. Bell, I. H. Witten, Lossless for Text and Images, Int. J. of High Speed Electronics and Systems, Vol. 8, No. 1, 1997, pp [4] J. Platoš, V. Snášel, of small text files, Advanced Engineering Informatics, Vol. 22, Issue 3, 2008, pp [5] J. Ziv, A. Lempel, A Universal Algorithm for Sequential Data, IEEE Trans. Information Th.., Vol. 23, No. 3, 1977, pp [6] S. C. Sahinalp, N. M. Rajpoot, Dictionary-Based Data : An Algorithmic Perspective, Lossless Handbook, Academic Press, Ch. 6, 2003, pp [7] F. Rizzo, J. A. Storer, B. Carpentieri, LZ-based image compression, Information Sciences, Vol. 135, Issues 1-2, 2001, pp [8] M. R. Nelson, LZW Data, Dr. Dobb`s Journal, Vol. 14, Issue 10, 1989, pp [9] A. Grama, G. Karypis, V. Kumar, A. Gupta, Introduction to Parallel Computing, Addison Wesley, 2 nd Ed., [10] J. A. Storer, J. H. Reif, A parallel architecture for high speed data compression, J. Parallel & Distributed Computing, Vol. 13. Issue 2, 1991, pp [11] H. P. Flatt, K. Kennedy, Performance of parallel processors, Parallel Computing, Vol. 12, Issue 1, 1989, pp ISSN: ISBN:
Textual Data Compression Speedup by Parallelization
Textual Data Compression Speedup by Parallelization GORAN MARTINOVIC, CASLAV LIVADA, DRAGO ZAGAR Faculty of Electrical Engineering Josip Juraj Strossmayer University of Osijek Kneza Trpimira 2b, 31000
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 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 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 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 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 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 informationMultimedia Systems. Part 20. Mahdi Vasighi
Multimedia Systems Part 2 Mahdi Vasighi www.iasbs.ac.ir/~vasighi Department of Computer Science and Information Technology, Institute for dvanced Studies in asic Sciences, Zanjan, Iran rithmetic Coding
More informationHARDWARE IMPLEMENTATION OF LOSSLESS LZMA DATA COMPRESSION ALGORITHM
HARDWARE IMPLEMENTATION OF LOSSLESS LZMA DATA COMPRESSION ALGORITHM Parekar P. M. 1, Thakare S. S. 2 1,2 Department of Electronics and Telecommunication Engineering, Amravati University Government College
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 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 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 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 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 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 informationKeywords Data compression, Lossless data compression technique, Huffman Coding, Arithmetic coding etc.
Volume 6, Issue 2, February 2016 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com A Comparative
More informationAn Asymmetric, Semi-adaptive Text Compression Algorithm
An Asymmetric, Semi-adaptive Text Compression Algorithm Harry Plantinga Department of Computer Science University of Pittsburgh Pittsburgh, PA 15260 planting@cs.pitt.edu Abstract A new heuristic for text
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 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 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 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 informationOPTIMIZATION OF LZW (LEMPEL-ZIV-WELCH) ALGORITHM TO REDUCE TIME COMPLEXITY FOR DICTIONARY CREATION IN ENCODING AND DECODING
Asian Journal Of Computer Science And Information Technology 2: 5 (2012) 114 118. Contents lists available at www.innovativejournal.in Asian Journal of Computer Science and Information Technology Journal
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 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 informationData Compression Fundamentals
1 Data Compression Fundamentals Touradj Ebrahimi Touradj.Ebrahimi@epfl.ch 2 Several classifications of compression methods are possible Based on data type :» Generic data compression» Audio compression»
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 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 informationUsing Arithmetic Coding for Reduction of Resulting Simulation Data Size on Massively Parallel GPGPUs
Using Arithmetic Coding for Reduction of Resulting Simulation Data Size on Massively Parallel GPGPUs Ana Balevic, Lars Rockstroh, Marek Wroblewski, and Sven Simon Institute for Parallel and Distributed
More informationFPGA based Data Compression using Dictionary based LZW Algorithm
FPGA based Data Compression using Dictionary based LZW Algorithm Samish Kamble PG Student, E & TC Department, D.Y. Patil College of Engineering, Kolhapur, India Prof. S B Patil Asso.Professor, E & TC Department,
More informationNoise Reduction in Data Communication Using Compression Technique
Digital Technologies, 2016, Vol. 2, No. 1, 9-13 Available online at http://pubs.sciepub.com/dt/2/1/2 Science and Education Publishing DOI:10.12691/dt-2-1-2 Noise Reduction in Data Communication Using Compression
More informationInternational Journal of Advanced Research in Computer Science and Software Engineering
ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: Enhanced LZW (Lempel-Ziv-Welch) Algorithm by Binary Search with
More informationCode Compression for RISC Processors with Variable Length Instruction Encoding
Code Compression for RISC Processors with Variable Length Instruction Encoding S. S. Gupta, D. Das, S.K. Panda, R. Kumar and P. P. Chakrabarty Department of Computer Science & Engineering Indian Institute
More informationResearch Article Does an Arithmetic Coding Followed by Run-length Coding Enhance the Compression Ratio?
Research Journal of Applied Sciences, Engineering and Technology 10(7): 736-741, 2015 DOI:10.19026/rjaset.10.2425 ISSN: 2040-7459; e-issn: 2040-7467 2015 Maxwell Scientific Publication Corp. Submitted:
More informationIntro. To Multimedia Engineering Lossless Compression
Intro. To Multimedia Engineering Lossless Compression Kyoungro Yoon yoonk@konkuk.ac.kr 1/43 Contents Introduction Basics of Information Theory Run-Length Coding Variable-Length Coding (VLC) Dictionary-based
More informationComparative Study of Dictionary based Compression Algorithms on Text Data
88 Comparative Study of Dictionary based Compression Algorithms on Text Data Amit Jain Kamaljit I. Lakhtaria Sir Padampat Singhania University, Udaipur (Raj.) 323601 India Abstract: With increasing amount
More informationEncoding. A thesis submitted to the Graduate School of University of Cincinnati in
Lossless Data Compression for Security Purposes Using Huffman Encoding A thesis submitted to the Graduate School of University of Cincinnati in a partial fulfillment of requirements for the degree of Master
More informationStudy of LZ77 and LZ78 Data Compression Techniques
Study of LZ77 and LZ78 Data Compression Techniques Suman M. Choudhary, Anjali S. Patel, Sonal J. Parmar Abstract Data Compression is defined as the science and art of the representation of information
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 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 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 Technique Based On Optimality Of LZW Code (OLZW)
2012 Third International Conference on Computer and Communication Technology A Compression Technique Based On Optimality Of LZW (OLZW) Utpal Nandi Dept. of Comp. Sc. & Engg. Academy Of Technology Hooghly-712121,West
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 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 informationBasic Compression Library
Basic Compression Library Manual API version 1.2 July 22, 2006 c 2003-2006 Marcus Geelnard Summary This document describes the algorithms used in the Basic Compression Library, and how to use the library
More informationFundamentals of Video Compression. Video Compression
Fundamentals of Video Compression Introduction to Digital Video Basic Compression Techniques Still Image Compression Techniques - JPEG Video Compression Introduction to Digital Video Video is a stream
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 informationIJSRD - International Journal for Scientific Research & Development Vol. 3, Issue 10, 2015 ISSN (online):
IJSRD - International Journal for Scientific Research & Development Vol., Issue, ISSN (online): - Modified Golomb Code for Integer Representation Nelson Raja Joseph Jaganathan P Domnic Sandanam Department
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 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 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 informationAn Advanced Text Encryption & Compression System Based on ASCII Values & Arithmetic Encoding to Improve Data Security
Available Online at www.ijcsmc.com International Journal of Computer Science and Mobile Computing A Monthly Journal of Computer Science and Information Technology IJCSMC, Vol. 3, Issue. 10, October 2014,
More informationDigital Communication Prof. Bikash Kumar Dey Department of Electrical Engineering Indian Institute of Technology, Bombay
Digital Communication Prof. Bikash Kumar Dey Department of Electrical Engineering Indian Institute of Technology, Bombay Lecture - 29 Source Coding (Part-4) We have already had 3 classes on source coding
More informationA Novel Image Compression Technique using Simple Arithmetic Addition
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
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- 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 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 informationData Compression. Guest lecture, SGDS Fall 2011
Data Compression Guest lecture, SGDS Fall 2011 1 Basics Lossy/lossless Alphabet compaction Compression is impossible Compression is possible RLE Variable-length codes Undecidable Pigeon-holes Patterns
More informationLempel-Ziv-Welch (LZW) Compression Algorithm
Lempel-Ziv-Welch (LZW) Compression lgorithm Introduction to the LZW lgorithm Example 1: Encoding using LZW Example 2: Decoding using LZW LZW: Concluding Notes Introduction to LZW s mentioned earlier, static
More informationMultimedia Networking ECE 599
Multimedia Networking ECE 599 Prof. Thinh Nguyen School of Electrical Engineering and Computer Science Based on B. Lee s lecture notes. 1 Outline Compression basics Entropy and information theory basics
More informationOptimizing run-length algorithm using octonary repetition tree
Optimizing run-length algorithm using octonary repetition tree Kaveh Geyratmand Haghighi 1, Mir Kamal Mirnia* 2, Ahmad Habibizad Navin 3 1 Department of Computer,East Azarbaijan Science and Research Branch,
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 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 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 informationCS/COE 1501
CS/COE 1501 www.cs.pitt.edu/~lipschultz/cs1501/ Compression What is compression? Represent the same data using less storage space Can get more use out a disk of a given size Can get more use out of memory
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 informationDictionary techniques
Dictionary techniques The final concept that we will mention in this chapter is about dictionary techniques. Many modern compression algorithms rely on the modified versions of various dictionary techniques.
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 informationImage Compression Technique
Volume 2 Issue 2 June 2014 ISSN: 2320-9984 (Online) International Journal of Modern Engineering & Management Research Shabbir Ahmad Department of Computer Science and Engineering Bhagwant University, Ajmer
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 informationAn Effective Approach to Improve Storage Efficiency Using Variable bit Representation
Volume 114 No. 12 2017, 145-154 ISSN: 1311-8080 (printed version); ISSN: 1314-3395 (on-line version) url: http://www.ijpam.eu ijpam.eu An Effective Approach to Improve Storage Efficiency Using Variable
More informationECE 533 Digital Image Processing- Fall Group Project Embedded Image coding using zero-trees of Wavelet Transform
ECE 533 Digital Image Processing- Fall 2003 Group Project Embedded Image coding using zero-trees of Wavelet Transform Harish Rajagopal Brett Buehl 12/11/03 Contributions Tasks Harish Rajagopal (%) Brett
More informationTEXT COMPRESSION ALGORITHMS - A COMPARATIVE STUDY
S SENTHIL AND L ROBERT: TEXT COMPRESSION ALGORITHMS A COMPARATIVE STUDY DOI: 10.21917/ijct.2011.0062 TEXT COMPRESSION ALGORITHMS - A COMPARATIVE STUDY S. Senthil 1 and L. Robert 2 1 Department of Computer
More informationParallel Implementation of the NIST Statistical Test Suite
Parallel Implementation of the NIST Statistical Test Suite Alin Suciu, Iszabela Nagy, Kinga Marton, Ioana Pinca Computer Science Department Technical University of Cluj-Napoca Cluj-Napoca, Romania Alin.Suciu@cs.utcluj.ro,
More information2014 Summer School on MPEG/VCEG Video. Video Coding Concept
2014 Summer School on MPEG/VCEG Video 1 Video Coding Concept Outline 2 Introduction Capture and representation of digital video Fundamentals of video coding Summary Outline 3 Introduction Capture and representation
More informationCS 493: Algorithms for Massive Data Sets Dictionary-based compression February 14, 2002 Scribe: Tony Wirth LZ77
CS 493: Algorithms for Massive Data Sets February 14, 2002 Dictionary-based compression Scribe: Tony Wirth This lecture will explore two adaptive dictionary compression schemes: LZ77 and LZ78. We use the
More informationA New Compression Method Strictly for English Textual Data
A New Compression Method Strictly for English Textual Data Sabina Priyadarshini Department of Computer Science and Engineering Birla Institute of Technology Abstract - Data compression is a requirement
More informationComparison of Text Data Compression Using Run Length Encoding, Arithmetic Encoding, Punctured Elias Code and Goldbach Code
Comparison of Text Data Compression Using Run Length Encoding, Arithmetic Encoding, Punctured Elias Code and Goldbach Code Kenang Eko Prasetyo 1, Tito Waluyo Purboyo 2, Randy Erfa Saputra 3 Computer Engineering,
More informationDesign and Implementation of Lossless Data Compression Coprocessor using FPGA
Design and Implementation of Lossless Data Compression Coprocessor using FPGA Udaya Kumar H PG Student(VLSI Design and Embedded Systems) SIET, Tumkur Karnataka, India Madhu B C Assistant Prof., Dept. of
More informationCS/COE 1501
CS/COE 1501 www.cs.pitt.edu/~nlf4/cs1501/ Compression What is compression? Represent the same data using less storage space Can get more use out a disk of a given size Can get more use out of memory E.g.,
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 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 informationENSC Multimedia Communications Engineering Topic 4: Huffman Coding 2
ENSC 424 - Multimedia Communications Engineering Topic 4: Huffman Coding 2 Jie Liang Engineering Science Simon Fraser University JieL@sfu.ca J. Liang: SFU ENSC 424 1 Outline Canonical Huffman code Huffman
More informationCompression of Concatenated Web Pages Using XBW
Compression of Concatenated Web Pages Using XBW Radovan Šesták and Jan Lánský Charles University, Faculty of Mathematics and Physics, Department of Software Engineering Malostranské nám. 25, 118 00 Praha
More informationTracking and compression techniques
Tracking and compression techniques for ALICE HLT Anders Strand Vestbø The ALICE experiment at LHC The ALICE High Level Trigger (HLT) Estimated data rate (Central Pb-Pb, TPC only) 200 Hz * 75 MB = ~15
More informationCompression. storage medium/ communications network. For the purpose of this lecture, we observe the following constraints:
CS231 Algorithms Handout # 31 Prof. Lyn Turbak November 20, 2001 Wellesley College Compression The Big Picture We want to be able to store and retrieve data, as well as communicate it with others. In general,
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 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 informationDistributed source coding
Distributed source coding Suppose that we want to encode two sources (X, Y ) with joint probability mass function p(x, y). If the encoder has access to both X and Y, it is sufficient to use a rate R >
More informationSINCE arithmetic coding [1] [12] can approach the entropy
1278 IEEE TRANSACTIONS ON COMMUNICATIONS, VOL. 47, NO. 9, SEPTEMBER 1999 A Fast and Efficient Lossless Data-Compression Method Jer Min Jou and Pei-Yin Chen, Member, IEEE Abstract This paper describes an
More informationText Compression. General remarks and Huffman coding Adobe pages Arithmetic coding Adobe pages 15 25
Text Compression General remarks and Huffman coding Adobe pages 2 14 Arithmetic coding Adobe pages 15 25 Dictionary coding and the LZW family Adobe pages 26 46 Performance considerations Adobe pages 47
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 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 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 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 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 informationAn Implementation on Pattern Creation and Fixed Length Huffman s Compression Techniques for Medical Images
An Implementation on Pattern Creation and Fixed Length Huffman s Compression Techniques for Medical s Trupti Baraskar S.G.B.A. University Amravati, India Vijay R. Mankar S.G.B.A. University Amravati, India
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 informationFast Two-Stage Lempel-Ziv Lossless Numeric Telemetry Data Compression Using a Neural Network Predictor
Journal of Universal Computer Science, vol. 10, no. 9 (2004), 1199-1211 submitted: 9/11/03, accepted: 9/6/04, appeared: 28/9/04 J.UCS Fast Two-Stage Lempel-Ziv Lossless Numeric Telemetry Data Compression
More informationText Data Compression and Decompression Using Modified Deflate Algorithm
Text Data Compression and Decompression Using Modified Deflate Algorithm R. Karthik, V. Ramesh, M. Siva B.E. Department of Computer Science and Engineering, SBM COLLEGE OF ENGINEERING AND TECHNOLOGY, Dindigul-624005.
More informationModule 6 STILL IMAGE COMPRESSION STANDARDS
Module 6 STILL IMAGE COMPRESSION STANDARDS Lesson 19 JPEG-2000 Error Resiliency Instructional Objectives At the end of this lesson, the students should be able to: 1. Name two different types of lossy
More information