Why Compress? To reduce the volume of data to be transmitted (text, fax, images) To reduce the bandwidth required for transmission and to reduce storage.

Slides:



Advertisements
Similar presentations
History of image processing History of image processing In the 1970s, digital image processing proliferated, when cheaper computers and dedicated hardware.
Advertisements

T.Sharon-A.Frank 1 Multimedia Compression Basics.
15 Data Compression Foundations of Computer Science ã Cengage Learning.
Data Compression CS 147 Minh Nguyen.
Data Compression Michael J. Watts
Compression & Huffman Codes
SWE 423: Multimedia Systems
Spatial and Temporal Data Mining
Compression & Huffman Codes Fawzi Emad Chau-Wen Tseng Department of Computer Science University of Maryland, College Park.
Fundamentals of Multimedia Chapter 7 Lossless Compression Algorithms Ze-Nian Li and Mark S. Drew 건국대학교 인터넷미디어공학부 임 창 훈.
Department of Computer Engineering University of California at Santa Cruz Data Compression (2) Hai Tao.
Why Compress? To reduce the volume of data to be transmitted (text, fax, images) To reduce the bandwidth required for transmission and to reduce storage.
1 Lossless Compression Multimedia Systems (Module 2) r Lesson 1: m Minimum Redundancy Coding based on Information Theory: Shannon-Fano Coding Huffman Coding.
©Brooks/Cole, 2003 Chapter 15 Data Compression. ©Brooks/Cole, 2003 Realize the need for data compression. Differentiate between lossless and lossy compression.
Spring 2015 Mathematics in Management Science Binary Linear Codes Two Examples.
Image Compression - JPEG. Video Compression MPEG –Audio compression Lossy / perceptually lossless / lossless 3 layers Models based on speech generation.
Software Research Image Compression Mohamed N. Ahmed, Ph.D.
Basics of Compression Goals: to understand how image/audio/video signals are compressed to save storage and increase transmission efficiency to understand.
Media File Formats Jon Ivins, DMU. Text Files n Two types n 1. Plain text (unformatted) u ASCII Character set is most common u 7 bits are used u This.
8. Compression. 2 Video and Audio Compression Video and Audio files are very large. Unless we develop and maintain very high bandwidth networks (Gigabytes.
Lecture 10 Data Compression.
Chapter 2 Source Coding (part 2)
Source Coding-Compression
Multimedia Specification Design and Production 2012 / Semester 1 / L3 Lecturer: Dr. Nikos Gazepidis
Image Processing and Computer Vision: 91. Image and Video Coding Compressing data to a smaller volume without losing (too much) information.
CIS679: Multimedia Basics r Multimedia data type r Basic compression techniques.
Image Compression (Chapter 8) CSC 446 Lecturer: Nada ALZaben.
Image Compression Supervised By: Mr.Nael Alian Student: Anwaar Ahmed Abu-AlQomboz ID: IT College “Multimedia”
1 Classification of Compression Methods. 2 Data Compression  A means of reducing the size of blocks of data by removing  Unused material: e.g.) silence.
Addressing Image Compression Techniques on current Internet Technologies By: Eduardo J. Moreira & Onyeka Ezenwoye CIS-6931 Term Paper.
Digital Image Processing Image Compression
Lossless Compression CIS 465 Multimedia. Compression Compression: the process of coding that will effectively reduce the total number of bits needed to.
Outline Kinds of Coding Need for Compression Basic Types Taxonomy Performance Metrics.
COMPRESSION. Compression in General: Why Compress? So Many Bits, So Little Time (Space) CD audio rate: 2 * 2 * 8 * = 1,411,200 bps CD audio storage:
An introduction to audio/video compression Dr. Malcolm Wilson.
Spring 2000CS 4611 Multimedia Outline Compression RTP Scheduling.
Advances in digital image compression techniques Guojun Lu, Computer Communications, Vol. 16, No. 4, Apr, 1993, pp
Lecture 4: Lossless Compression(1) Hongli Luo Fall 2011.
CS654: Digital Image Analysis
CS654: Digital Image Analysis Lecture 34: Different Coding Techniques.
Digital Image Processing Lecture 22: Image Compression
STATISTIC & INFORMATION THEORY (CSNB134) MODULE 11 COMPRESSION.
Multi-media Data compression
1 Data Compression Hae-sun Jung CS146 Dr. Sin-Min Lee Spring 2004.
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.
Submitted To-: Submitted By-: Mrs.Sushma Rani (HOD) Aashish Kr. Goyal (IT-7th) Deepak Soni (IT-8 th )
Introductions What Is Data Compression ? Data compression is the process of reduction in the amount of signal space that must be allocated to a given.
Data Compression Michael J. Watts
Textbook does not really deal with compression.
JPEG Compression What is JPEG? Motivation
IMAGE PROCESSING IMAGE COMPRESSION
Compression & Huffman Codes
Digital Image Processing Lecture 20: Image Compression May 16, 2005
IMAGE COMPRESSION.
Data Compression.
Multimedia Outline Compression RTP Scheduling Spring 2000 CS 461.
Lesson Objectives Aims You should know about: 1.3.1:
Algorithms in the Real World
Applied Algorithmics - week7
Image Compression The still image and motion images can be compressed by lossless coding or lossy coding. Principle of compression: - reduce the redundant.
Data Compression.
Data Compression CS 147 Minh Nguyen.
Chapter 11 Data Compression
UNIT IV.
CSE 589 Applied Algorithms Spring 1999
Image Transforms for Robust Coding
15 Data Compression Foundations of Computer Science ã Cengage Learning.
Data Compression.
Chapter 8 – Compression Aims: Outline the objectives of compression.
15 Data Compression Foundations of Computer Science ã Cengage Learning.
Presentation transcript:

Why Compress? To reduce the volume of data to be transmitted (text, fax, images) To reduce the bandwidth required for transmission and to reduce storage requirements (speech, audio, video)

Compression How is compression possible? Redundancy in digital audio, image, and video data Properties of human perception Digital audio is a series of sample values; image is a rectangular array of pixel values; video is a sequence of images played out at a certain rate Neighboring sample values are correlated

Redundancy Adjacent audio samples are similar (predictive encoding); samples corresponding to silence (silence removal) In digital image, neighboring samples on a scanning line are normally similar (spatial redundancy) In digital video, in addition to spatial redundancy, neighboring images Ina video sequence may be similar (temporal redundancy)

Human Perception Factors Compressed version of digital audio, image, video need not represent the original information exactly Perception sensitivities are different for different signal patterns Human eye is less sensitive to the higher spatial frequency components than the lower frequencies (transform coding)

Classification Lossless compression lossless compression for legal and medical documents, computer programs exploit only data redundancy Lossy compression digital audio, image, video where some errors or loss can be tolerated exploit both data redundancy and human perception properties Constant bit rate versus variable bit rate coding

Entropy Amount of information I in a symbol of occurring probability p : I = log2(1/p) Symbols that occur rarely convey a large amount of information Average information per symbol is called entropy H H = pix log2(1/pi) bits per codeword Average number of bits per codeword = Nipi where Ni is the number of bits for the symbol generated by the encoding algorithm

Huffman Coding Assigns fewer bits to symbols that appear more often and more bits to the symbols that appear less often Efficient when occurrence probabilities vary widely Huffman codebook from the set of symbols and their occurring probabilities Two properties: generate compact codes prefix property

Run-length Coding Repeated occurrence of the same character is called a run Number of repetition is called the length of the run Run of any length is represented by three characters eeeeeee7tnnnnnnnn @e7t@n8

Lempel-Ziv-Welch (LZW) Coding Works by building a dictionary of phrases from the input stream A token or an index is used to identify each distinct phrase Number of entries in the dictionary determines the number of bits required for the index -- a dictionary with 25,000 words requires 15 bits to encode the index

Arithmetic Coding String of characters with occurrence probabilities make up a message A complete message may be fragmented into multiple smaller strings A codeword corresponding to each string is found separately