ECE242 L30: Compression ECE 242 Data Structures Lecture 30 Data Compression.

Slides:



Advertisements
Similar presentations
15 Data Compression Foundations of Computer Science ã Cengage Learning.
Advertisements

Data Compression CS 147 Minh Nguyen.
Web Design Vocab 3 PNG, JPG, GIF, MP3, MPEG.
Information Representation
Multimedia Communications EG 371 and EG 348
Michael Alves, Patrick Dugan, Robert Daniels, Carlos Vicuna
Lecture 10 : Huffman Encoding Bong-Soo Sohn Assistant Professor School of Computer Science and Engineering Chung-Ang University Lecture notes : courtesy.
Motivation Application driven -- VoD, Information on Demand (WWW), education, telemedicine, videoconference, videophone Storage capacity Large capacity.
Dale & Lewis Chapter 3 Data Representation. Representing color Similarly to how color is perceived in the human eye, color information is encoded in combinations.
Chapter 7 End-to-End Data
Compression & Huffman Codes
Computer Organization Computer Architecture, Data Representation, Information Theory i206 Fall 2010 John Chuang Some slides adapted from Marti Hearst,
Spatial and Temporal Data Mining
Compression JPG compression, Source: Original 10:1 Compression 45:1 Compression.
1 Data Compression Engineering Math Physics (EMP) Steve Lyon Electrical Engineering.
Compression & Huffman Codes Fawzi Emad Chau-Wen Tseng Department of Computer Science University of Maryland, College Park.
Department of Information Engineering1 What is a bit? –the basic unit in computer –represent a binary number : 0 and 1 a group of bits can represent any.
CSc 461/561 CSc 461/561 Multimedia Systems 0. Introduction.
Audio & Video Representation CS105. Data Representation Types of data: – Numbers – Text – Images – Audio & Video.
1 A Balanced Introduction to Computer Science, 2/E David Reed, Creighton University ©2008 Pearson Prentice Hall ISBN Chapter 12 Data.
I Power Multimedia Technology Video Data. Video data Video is a sequence of individual pictures or frames, taken one after another. These are played back.
Lecture 10 Data Compression.
Cosc 2150: Computer Organization Chapter 2a Data compression.
CS 1308 Computer Literacy and the Internet. Creating Digital Pictures  A traditional photograph is an analog representation of an image.  Digitizing.
CPS120 Introduction to Computer Science Lecture 4
Department of Physics and Astronomy DIGITAL IMAGE PROCESSING
CSCI-235 Micro-Computers in Science Hardware Part II.
Computers and Scientific Thinking David Reed, Creighton University Data Representation 1.
Lab #5-6 Follow-Up: More Python; Images Images ● A signal (e.g. sound, temperature infrared sensor reading) is a single (one- dimensional) quantity that.
1 Perception, Illusion and VR HNRS 299, Spring 2008 Lecture 14 Introduction to Computer Graphics.
Streaming Stored Audio and Video (1) and Video (1) Advanced Multimedia University of Palestine University of Palestine Eng. Wisam Zaqoot Eng. Wisam Zaqoot.
1 Analysis of Algorithms Chapter - 08 Data Compression.
Data Representation and Storage Lecture 5. Representations A number value can be represented in many ways: 5 Five V IIIII Cinq Hold up my hand.
3-1 Data and Computers Computers are multimedia devices, dealing with a vast array of information categories. Computers store, present, and help us modify.
Lecture Objectives  To learn how to use a Huffman tree to encode characters using fewer bytes than ASCII or Unicode, resulting in smaller files and reduced.
 The amount of data we deal with is getting larger  Not only do larger files require more disk space, they take longer to transmit  Many times files.
1 Lecture 17 – March 21, 2002 Content-delivery services. Multimedia services Reminder  next week individual meetings and project status report are due.
1 i206: Lecture 2: Computer Architecture, Binary Encodings, and Data Representation Marti Hearst Spring 2012.
Common file formats  Lesson Objective: Understanding common file formats and their differences.  Learning Outcome:  Describe the type of files which.
Chapter 2 : Business Information Business Data Communications, 6e.
Data Compression. Compression? Compression refers to the ways in which the amount of data needed to store an image or other file can be reduced. This.
1 Introduction to Information Technology LECTURE 5 COMPRESSION.
CMSC 100 Storing Data: Huffman Codes and Image Representation Professor Marie desJardins Tuesday, September 18, 2012 Tue 9/18/12 1CMSC Data Compression.
Image Compression Supervised By: Mr.Nael Alian Student: Anwaar Ahmed Abu-AlQomboz ID: IT College “Multimedia”
Chapter 2 : Imaging and Image Representation Computer Vision Lab. Chonbuk National University.
Addressing Image Compression Techniques on current Internet Technologies By: Eduardo J. Moreira & Onyeka Ezenwoye CIS-6931 Term Paper.
Image Representation. Digital Cameras Scanned Film & Photographs Digitized TV Signals Computer Graphics Radar & Sonar Medical Imaging Devices (X-Ray,
Multimedia Streaming Jennifer Rexford COS 461: Computer Networks Lectures: MW 10-10:50am in Architecture N101
Compression  Data files compression  Music compression  Image and video compression.
Class 9 LBSC 690 Information Technology Multimedia.
Chap 14 Presentation Layer Andres, Wen-Yuan Liao Department of Computer Science and Engineering De Lin Institute of Technology
CSCI-100 Introduction to Computing Hardware Part II.
Chapter 1 Background 1. In this lecture, you will find answers to these questions Computers store and transmit information using digital data. What exactly.
Multimedia in Web Introduction. Multimedia Elements in Web Page Images Voice Music Animation Video Text & Numbers.
Audio Streaming © Nanda Ganesan, Ph.D.. Audio File Features Audio file is a record of captured sound that can be played back –The WAV File is an example.
Multimedia Communications Introduction ECE 591 Pro. Honggang Wang Notes: Some slides including figures are referred from textbooks and relevant materials.
HONR101 Analytics in a Big Data World Monday, January 18,
Multimedia Networking. Goals of Today’s Lecture r Digital audio and video m Sampling, quantizing, and compressing r Multimedia applications m Streaming.
Modul 2 Sifat Dasar Informasi Digital Mata Kuliah Preservasi Informasi Digital.
Submitted To-: Submitted By-: Mrs.Sushma Rani (HOD) Aashish Kr. Goyal (IT-7th) Deepak Soni (IT-8 th )
Data Compression: Huffman Coding in Weiss (p.389)
Compression & Huffman Codes
Binary Representation in Audio and Images
Data Compression.
Data Compression.
Data Compression CS 147 Minh Nguyen.
Web Design and Development
Merge Sort 11/28/2018 2:21 AM The Greedy Method The Greedy Method.
Data Compression Section 4.8 of [KT].
Huffman Encoding.
Presentation transcript:

ECE242 L30: Compression ECE 242 Data Structures Lecture 30 Data Compression

ECE242 L30: Compression Motivation for Data Compression °Big data Google and Yahoo processes 10s of Petabyte data per day °Text files and images Everywhere °Audios and videos Each sample is a sound or an image Many samples per second

ECE242 L30: Compression Digital Audio °Sampling the analog signal Sample at some fixed rate Each sample is an arbitrary real number °Quantizing each sample Round each sample to one of a finite number of values Represent each sample in a fixed number of bits 4 bit representation (values 0-15)

ECE242 L30: Compression Audio Examples °Speech Sampling rate: 8000 samples/second Sample size: 8 bits per sample Rate: 64 kbps Compact Disc (CD) –Sampling rate: 44,100 samples/second –Sample size: 16 bits per sample –Rate: kbps for mono, Mbps for stereo

ECE242 L30: Compression Audio Compression °Audio data requires too much bandwidth Speech: 64 kbps is too high for a dial-up modem user Stereo music: Mbps exceeds most access rates °Compression to reduce the size Remove redundancy Remove details that human tend not to perceive °Example audio formats Speech: GSM (13 kbps), G.729 (8 kbps), and G (6.4 and 5.3 kbps) Stereo music: MPEG 1 layer 3 (MP3) at 96 kbps, 128 kbps, and 160 kbps

ECE242 L30: Compression Digital Video °Sampling the analog signal Sample at some fixed rate (e.g., 24 or 30 times per sec) Each sample is an image °Quantizing each sample Representing an image as an array of picture elements Each pixel is a mixture of colors (red, green, and blue) E.g., 24 bits, with 8 bits per color

ECE242 L30: Compression The 320 x 240 hand The 2272 x 1704 hand

ECE242 L30: Compression Video Compression: Within an Image °Image compression Exploit spatial redundancy (e.g., regions of same color) Exploit aspects humans tend not to notice °Common image compression formats Joint Pictures Expert Group (JPEG) Graphical Interchange Format (GIF) Uncompressed: 167 KBGood quality: 46 KBPoor quality: 9 KB

ECE242 L30: Compression Video Compression: Across Images °Compression across images Exploit temporal redundancy across images °Common video compression formats (~26:1) MPEG 1: CD-ROM quality video (1.5 Mbps) MPEG 2: high-quality DVD video (3-6 Mbps) Proprietary protocols like QuickTime

ECE242 L30: Compression Compression is necessary for storage and transmission °Data Storage Hard disk access rate: 115MB/s Access 1 Terabyte of data from hard disk needs 2.3 hours °Data Delivery over Network Local Area: - Gigabit Ethernet bandwidth: 125 MB/s Wide Area -ADSL or Cable Modem: 1.5 Mb/s

ECE242 L30: Compression Text Compression °Files can often be compressed. Represented using fewer bytes than the standard representation. °Fixed-length encoding Somewhat wasteful, because some characters are more common than others. If a character appears frequently, it should have a shorter representation.

ECE242 L30: Compression Compression °“beekeepers & bees” ° °

ECE242 L30: Compression Compression °Huffman encodings are designed so that no code is a prefix of another code.

ECE242 L30: Compression Compression °First construct a binary tree. On each pass through the main loop, we choose the two lowest- count roots and merge them. Ties don't matter. Count for the new parent is the sum of its children's counts.

ECE242 L30: Compression Compression

ECE242 L30: Compression Compression

ECE242 L30: Compression Compression °The code for each character is determined by the path from the root to the corresponding leaf. Right is 1 Left is 0 'b' is right-right-left and its code is 110