Data Compression. Lossless And Lossy Compression



Similar documents
APPLICATION NOTE Revision 3.0 MTD/PS-0534 August 13, 2008 KODAK IMAGE SENDORS COLOR CORRECTION FOR IMAGE SENSORS

Homework 3 Solutions

Two hours UNIVERSITY OF MANCHESTER SCHOOL OF COMPUTER SCIENCE. Date: Friday 16 th May Time: 14:00 16:00

Binary Representation of Numbers Autar Kaw

flex Regular Expressions and Lexical Scanning Regular Expressions and flex Examples on Alphabet A = {a,b} (Standard) Regular Expressions on Alphabet A

5 a LAN 6 a gateway 7 a modem

Example 27.1 Draw a Venn diagram to show the relationship between counting numbers, whole numbers, integers, and rational numbers.

EQUATIONS OF LINES AND PLANES

One Minute To Learn Programming: Finite Automata

A.7.1 Trigonometric interpretation of dot product A.7.2 Geometric interpretation of dot product

Multiplication and Division - Left to Right. Addition and Subtraction - Left to Right.

LINEAR TRANSFORMATIONS AND THEIR REPRESENTING MATRICES

Reasoning to Solve Equations and Inequalities

Section 5-4 Trigonometric Functions

P.3 Polynomials and Factoring. P.3 an 1. Polynomial STUDY TIP. Example 1 Writing Polynomials in Standard Form. What you should learn

Small Business Networking

Small Business Networking

Section 5.2, Commands for Configuring ISDN Protocols. Section 5.3, Configuring ISDN Signaling. Section 5.4, Configuring ISDN LAPD and Call Control

Small Business Cloud Services

Lossless Data Compression Standard Applications and the MapReduce Web Computing Framework

Health insurance exchanges What to expect in 2014

How fast can we sort? Sorting. Decision-tree model. Decision-tree for insertion sort Sort a 1, a 2, a 3. CS Spring 2009

1. Definition, Basic concepts, Types 2. Addition and Subtraction of Matrices 3. Scalar Multiplication 4. Assignment and answer key 5.

Compression techniques

How To Network A Smll Business

Babylonian Method of Computing the Square Root: Justifications Based on Fuzzy Techniques and on Computational Complexity

Learning Outcomes. Computer Systems - Architecture Lecture 4 - Boolean Logic. What is Logic? Boolean Logic 10/28/2010

1.00/1.001 Introduction to Computers and Engineering Problem Solving Fall Final Exam

Engineer-to-Engineer Note

PROF. BOYAN KOSTADINOV NEW YORK CITY COLLEGE OF TECHNOLOGY, CUNY

VMware Horizon Mirage Web Manager Guide

Human Pedigrees. Independent Assortment. Mendel s Second Law. Independent Assortment Test Cross. 4 phenotypes. Pedigree analysis:

Health insurance marketplace What to expect in 2014

COMPLEX FRACTIONS. section. Simplifying Complex Fractions

Image Compression through DCT and Huffman Coding Technique

How To Set Up A Network For Your Business

Regular Sets and Expressions

FORMAL LANGUAGES, AUTOMATA AND THEORY OF COMPUTATION EXERCISES ON REGULAR LANGUAGES

Distributions. (corresponding to the cumulative distribution function for the discrete case).

, and the number of electrons is -19. e e C. The negatively charged electrons move in the direction opposite to the conventional current flow.

Small Business Networking

Words Symbols Diagram. abcde. a + b + c + d + e

On the Use of Compression Algorithms for Network Traffic Classification

and thus, they are similar. If k = 3 then the Jordan form of both matrices is

Unit 6: Exponents and Radicals

Small Business Networking

Concept Formation Using Graph Grammars

COMPONENTS: COMBINED LOADING

Small Businesses Decisions to Offer Health Insurance to Employees

FAULT TREES AND RELIABILITY BLOCK DIAGRAMS. Harry G. Kwatny. Department of Mechanical Engineering & Mechanics Drexel University

Bayesian Updating with Continuous Priors Class 13, 18.05, Spring 2014 Jeremy Orloff and Jonathan Bloom

Operations with Polynomials

CS99S Laboratory 2 Preparation Copyright W. J. Dally 2001 October 1, 2001

Chapter. Contents: A Constructing decimal numbers

Exponential and Logarithmic Functions

0.1 Basic Set Theory and Interval Notation

License Manager Installation and Setup

DEVELOPMENT. Introduction to Virtualization E-book. anow is the time to realize all of the benefits of virtualizing your test and development lab.

9.3. The Scalar Product. Introduction. Prerequisites. Learning Outcomes

Pentominoes. Pentominoes. Bruce Baguley Cascade Math Systems, LLC. The pentominoes are a simple-looking set of objects through which some powerful

JaERM Software-as-a-Solution Package

Lempel-Ziv Coding Adaptive Dictionary Compression Algorithm

South East of Process Main Building / 1F. North East of Process Main Building / 1F. At 14:05 April 16, Sample not collected

g(y(a), y(b)) = o, B a y(a)+b b y(b)=c, Boundary Value Problems Lecture Notes to Accompany

. At first sight a! b seems an unwieldy formula but use of the following mnemonic will possibly help. a 1 a 2 a 3 a 1 a 2

MODULE 3. 0, y = 0 for all y

Techniques for Requirements Gathering and Definition. Kristian Persson Principal Product Specialist

Scalable Mining of Large Disk-based Graph Databases

CHAPTER 2 LITERATURE REVIEW

1. In the Bohr model, compare the magnitudes of the electron s kinetic and potential energies in orbit. What does this imply?

Polynomial Functions. Polynomial functions in one variable can be written in expanded form as ( )

The Velocity Factor of an Insulated Two-Wire Transmission Line

Hybrid Lossless Compression Method For Binary Images

Basic Research in Computer Science BRICS RS Brodal et al.: Solving the String Statistics Problem in Time O(n log n)

LECTURE #05. Learning Objective. To describe the geometry in and around a unit cell in terms of directions and planes.

UNLOCKING TECHNOLOGY IVECO

encoding compression encryption

Review guide for the final exam in Math 233

c b N/m 2 (0.120 m m 3 ), = J. W total = W a b + W b c 2.00

Unleashing the Power of Cloud

Math 135 Circles and Completing the Square Examples

Overview of International Roaming (WORLD WING)

ANALYSIS OF THE EFFECTIVENESS IN IMAGE COMPRESSION FOR CLOUD STORAGE FOR VARIOUS IMAGE FORMATS

Network Configuration Independence Mechanism

PROTOCOL No. 11 TO THE CONVENTION FOR THE PROTECTION OF HUMAN RIGHTS AND FUNDAMENTAL FREEDOMS, RESTRUCTURING THE CONTROL MACHINERY ESTABLISHED THEREBY

Space Vector Pulse Width Modulation Based Induction Motor with V/F Control

Vectors Recap of vectors

HP Smart Document Scan Software compression schemes and file sizes

Appendix D: Completing the Square and the Quadratic Formula. In Appendix A, two special cases of expanding brackets were considered:

NQF Level: 2 US No: 7480

Or more simply put, when adding or subtracting quantities, their uncertainties add.

t 3 t 4 Part A: Multiple Choice Canadian Association of Physicists 1999 Prize Exam

Antibody Screening. Antibody Screening in Pre-transfusion Testing and Antenatal Screening

Comparison of different image compression formats. ECE 533 Project Report Paula Aguilera

Transcription:

Dt Compression Reduce the size of dt. ƒ Reduces storge spce nd hence storge cost. Compression rtio = originl dt size/compressed dt size ƒ Reduces time to retrieve nd trnsmit dt. Lossless And Lossy Compression compresseddt = compress(originldt) decompresseddt = decompress(compresseddt) When originldt = decompresseddt, the compression is lossless. When originldt!= decompresseddt, the compression is lossy.

Lossless And Lossy Compression Lossy compressors generlly otin much higher compression rtios thn do lossless compressors. ƒ Sy vs.. Lossless compression is essentil in pplictions such s text file compression. Lossy compression is cceptle in mny imging pplictions. ƒ In video trnsmission, slight loss in the trnsmitted video is not noticed y the humn eye. Text Compression Lossless compression is essentil. Populr text compressors such s zip nd Unix s compress re sed on the LZW (Lempel-Ziv-Welch) method.

Chrcter sequences in the originl text re replced y s tht re dynmiclly determined. The tle is not end into the compressed text, ecuse it my e reconstructed from the compressed text during decompression. Assume the letters in the text re limited to {, }. ƒ In prctice, the lphet my e the chrcter ASCII set. The chrcters in the lphet re ssigned numers eginning t. The initil tle is:

Originl text = Compression is done y scnning the originl text from left to right. Find longest prefix p for which there is in the tle. Represent p y its pcode nd ssign the next ville numer to pc, where c is the next chrcter in the text tht is to e compressed. p = pcode = c = Originl text = Represent y nd enter into the tle. Compressed text =

Originl text = Compressed text = p = pcode = c = Represent y nd enter into the tle. Compressed text = Originl text = Compressed text = p = pcode = c = Represent y nd enter into the tle. Compressed text =

Originl text = Compressed text = p = pcode = c = Represent y nd enter into the tle. Compressed text = Originl text = Compressed text = p = pcode = c = Represent y nd enter into the tle. Compressed text =

Originl text = Compressed text = p = pcode = c = Represent y nd enter into the tle. Compressed text = Originl text = Compressed text = p = pcode = c = Represent y nd enter into the tle. Compressed text =

Originl text = Compressed text = p = pcode = c = Represent y nd enter into the tle. Compressed text = 9 Originl text = Compressed text = p = pcode = c = null Represent y. Compressed text = 9

Code Tle Representtion 9 Dictionry. ƒ Pirs re (, element) = (,). ƒ Opertions re : get() nd put(, ) Limit numer of s to. Use hsh tle. ƒ Convert vrile length s into fixed length s. ƒ Ech hs the form pc, where the string p is tht is lredy in the tle. ƒ Replce pc with (pcode)c. Code Tle Representtion 9 9

LZW Decompression Originl text = Compressed text = Convert s to text from left to right. represents. Decompressed text = pcode = nd p =. p = followed y next text chrcter (c) is entered into the tle. LZW Decompression Originl text = Compressed text = represents. Decompressed text = pcode = nd p =. lstp = followed y first chrcter of p is entered into the tle.

LZW Decompression Originl text = Compressed text = represents. Decompressed text = pcode = nd p =. lstp = followed y first chrcter of p is entered into the tle. LZW Decompression Originl text = Compressed text = represents Decompressed text =. pcode = nd p =. lstp = followed y first chrcter of p is entered into the tle.

LZW Decompression Originl text = Compressed text = represents Decompressed text =. pcode = nd p =. lstp = followed y first chrcter of p is entered into the tle. LZW Decompression Originl text = Compressed text = represents Decompressed text =. pcode = nd p =. lstp = followed y first chrcter of p is entered into the tle.

LZW Decompression Originl text = Compressed text = represents Decompressed text =. pcode = nd p =. lstp = followed y first chrcter of p is entered into the tle. LZW Decompression Originl text = Compressed text = represents??? When is not in the tle, its is lstp followed y first chrcter of lstp. lstp = So represents.

LZW Decompression Originl text = Compressed text = represents Decompressed text =. pcode = nd p =. lstp = followed y first chrcter of p is entered into the tle. 9 Code Tle Representtion 9 Dictionry. ƒ Pirs re (, element) = (, wht the represents) = (, Key). ƒ Opertions re : get() nd put(, ) Keys re integers,,, Use D rry Tle. ƒ Tle[] = Key. ƒ Ech hs the form pc, where the string p is tht is lredy in the tle. ƒ Replce pc with (pcode)c.

Time Complexity Compression. ƒ O(n) expected time, where n is the length of the text tht is eing compressed. Decompression. ƒ O(n) time, where n is the length of the decompressed text.