Multimedia Outline Compression RTP Scheduling Spring 2000 CS 461.

Slides:



Advertisements
Similar presentations
T.Sharon-A.Frank 1 Multimedia Compression Basics.
Advertisements

15 Data Compression Foundations of Computer Science ã Cengage Learning.
Data Compression CS 147 Minh Nguyen.
Chapter 7 End-to-End Data
Spring 2003CS 4611 Multimedia Outline Compression RTP Scheduling.
End-to-End Data Outline Presentation Formatting Data Compression.
Chapter 7 Multimedia Operating Systems
CMPT 365 Multimedia Systems
T.Sharon-A.Frank 1 Multimedia Image Compression 2 T.Sharon-A.Frank Coding Techniques – Hybrid.
2007Theo Schouten1 Compression "lossless" : f[x,y]  { g[x,y] = Decompress ( Compress ( f[x,y] ) | “lossy” : quality measures e 2 rms = 1/MN  ( g[x,y]
CS430 © 2006 Ray S. Babcock Lossy Compression Examples JPEG MPEG JPEG MPEG.
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.
©Brooks/Cole, 2003 Chapter 15 Data Compression. ©Brooks/Cole, 2003 Realize the need for data compression. Differentiate between lossless and lossy compression.
Image and Video Compression
Image Compression - JPEG. Video Compression MPEG –Audio compression Lossy / perceptually lossless / lossless 3 layers Models based on speech generation.
Lecture 10 Data Compression.
Introduction to JPEG Alireza Shafaei ( ) Fall 2005.
CS Spring 2012 CS 414 – Multimedia Systems Design Lecture 8 – JPEG Compression (Part 3) Klara Nahrstedt Spring 2012.
ECE472/572 - Lecture 12 Image Compression – Lossy Compression Techniques 11/10/11.
1 Image Compression. 2 GIF: Graphics Interchange Format Basic mode Dynamic mode A LZW method.
Introduction to JPEG and MPEG Ingemar J. Cox University College London.
MULTIMEDIA TECHNOLOGY SMM 3001 DATA COMPRESSION. In this chapter The basic principles for compressing data The basic principles for compressing data Data.
1 Computer Networks: A Systems Approach, 5e Larry L. Peterson and Bruce S. Davie Chapter 7 End-to-End Data Copyright © 2010, Elsevier Inc. All rights Reserved.
11 CS716 Advanced Computer Networks By Dr. Amir Qayyum.
Klara Nahrstedt Spring 2011
D ATA C OMMUNICATIONS Compression Techniques. D ATA C OMPRESSION Whether data, fax, video, audio, etc., compression can work wonders Compression can be.
1 Lecture 17 – March 21, 2002 Content-delivery services. Multimedia services Reminder  next week individual meetings and project status report are due.
JPEG. The JPEG Standard JPEG is an image compression standard which was accepted as an international standard in  Developed by the Joint Photographic.
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.
Chapter 7 – End-to-End Data Two main topics Presentation formatting Compression We will go over the main issues in presentation formatting, but not much.
22-Oct-15CPSC558: Advanced Computer Networks Chapter 7 End-to-End Data –Data Manipulating Functions (Affecting Throughputs) How to encode the message into.
Image Compression Supervised By: Mr.Nael Alian Student: Anwaar Ahmed Abu-AlQomboz ID: IT College “Multimedia”
Addressing Image Compression Techniques on current Internet Technologies By: Eduardo J. Moreira & Onyeka Ezenwoye CIS-6931 Term Paper.
1 Image Formats. 2 Color representation An image = a collection of picture elements (pixels) Each pixel has a “color” Different types of pixels Binary.
Compression video overview 演講者:林崇元. Outline Introduction Fundamentals of video compression Picture type Signal quality measure Video encoder and decoder.
An introduction to audio/video compression Dr. Malcolm Wilson.
Spring 2001CS Multimedia, QoS Multimedia (7.2, 9.3) Compression RTP Realtime Applications Integrated Services Differentiated Services Quality.
Spring 2000CS 4611 Multimedia Outline Compression RTP Scheduling.
CS654: Digital Image Analysis Lecture 34: Different Coding Techniques.
CSE Computer Networks Prof. Aaron Striegel Department of Computer Science & Engineering University of Notre Dame Lecture 22 – April 1, 2010.
JPEG.
STATISTIC & INFORMATION THEORY (CSNB134) MODULE 11 COMPRESSION.
1 Multimedia Outline Compression RTP Scheduling. 2 Compression Overview Encoding and Compression –Huffman codes Lossless –data received = data sent –used.
MPEG CODING PROCESS. Contents  What is MPEG Encoding?  Why MPEG Encoding?  Types of frames in MPEG 1  Layer of MPEG1 Video  MPEG 1 Intra frame Encoding.
An introduction to audio/video compression Prepared by :: Bhatt shivani ( )
IS502:M ULTIMEDIA D ESIGN FOR I NFORMATION S YSTEM M ULTIMEDIA OF D ATA C OMPRESSION Presenter Name: Mahmood A.Moneim Supervised By: Prof. Hesham A.Hefny.
Submitted To-: Submitted By-: Mrs.Sushma Rani (HOD) Aashish Kr. Goyal (IT-7th) Deepak Soni (IT-8 th )
JPEG Compression What is JPEG? Motivation
Image compression.
IMAGE PROCESSING IMAGE COMPRESSION
IMAGE COMPRESSION.
Data Compression.
Algorithms in the Real World
Data Compression.
Chapter 7.2: Layer 5: Compression
Data Compression CS 147 Minh Nguyen.
CMPT 365 Multimedia Systems
Judith Molka-Danielsen, Oct. 29, 2001
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.
الوحدة الرابعة ضغط البيانات
CIS679: MPEG MPEG.
Standards Presentation ECE 8873 – Data Compression and Modeling
Judith Molka-Danielsen, Oct. 02, 2000
15 Data Compression Foundations of Computer Science ã Cengage Learning.
Chapter 8 – Compression Aims: Outline the objectives of compression.
Fundamentals of Video Compression
15 Data Compression Foundations of Computer Science ã Cengage Learning.
Presentation transcript:

Multimedia Outline Compression RTP Scheduling Spring 2000 CS 461

Compression Overview Encoding and Compression Lossless Lossy Huffman codes Lossless data received = data sent used for executables, text files, numeric data Lossy data received does not != data sent used for images, video, audio Spring 2000 CS 461

Lossless Algorithms Run Length Encoding (RLE) example: AAABBCDDDD encoding as 3A2B1C4D good for scanned text (8-to-1 compression ratio) can increase size for data with variation (e.g., some images) Differential Pulse Code Modulation (DPCM) example AAABBCDDDD encoding as A0001123333 change reference symbol if delta becomes too large works better than RLE for many digital images (1.5-to-1) Spring 2000 CS 461

Dictionary-Based Methods Build dictionary of common terms variable length strings Transmit index into dictionary for each term Lempel-Ziv (LZ) is the best-known example Commonly achieve 2-to-1 ration on text Variation of LZ used to compress GIF images first reduce 24-bit color to 8-bit color treat common sequence of pixels as terms in dictionary not uncommon to achieve 10-to-1 compression (x3) Spring 2000 CS 461

Image Compression JPEG: Joint Photographic Expert Group (ISO/ITU) Lossy still-image compression Three phase process process in 8x8 block chunks (macroblock) greyscale: each pixel is three values (YUV) DCT: transforms signal from spatial domain into and equivalent signal in the frequency domain (loss-less) apply a quantization to the results (lossy) RLE-like encoding (loss-less) Source image JPEG compression DCT Quantization Encoding Compressed Spring 2000 CS 461

Quantization and Encoding Quantization Table 3 5 7 9 11 13 15 17 5 7 9 11 13 15 17 19 7 9 11 13 15 17 19 21 9 11 13 15 17 19 21 23 11 13 15 17 19 21 23 25 13 15 17 19 21 23 25 27 15 17 19 21 23 25 27 29 17 19 21 23 25 27 29 31 Encoding Pattern Spring 2000 CS 461

MPEG Motion Picture Expert Group Lossy compression of video First approximation: JPEG on each frame Also remove inter-frame redundancy Spring 2000 CS 461

MPEG (cont) Frame types Example sequence transmitted as I P B B I B B I frames: intrapicture P frames: predicted picture B frames: bidirectional predicted picture Example sequence transmitted as I P B B I B B Frame 1 Frame 2 Frame 3 Frame 4 Frame 5 Frame 6 Frame 7 I frame B frame P frame MPEG compression Forward prediction Bidirectional Compressed stream Input Spring 2000 CS 461

MPEG (cont) B and P frames Effectiveness coordinate for the macroblock in the frame motion vector relative to previous reference frame (B, P) motion vector relative to subsequent reference frame (B) delta for each pixel in the macro block Effectiveness typically 90-to-1 as high as 150-to-1 30-to-1 for I frames P and B frames get another 3 to 5x Spring 2000 CS 461

RTP Application-Level Framing Data Packets sequence number timestamp (app defines “tick”) Control Packets (send periodically) loss rate (fraction of packets received since last report) measured jitter Spring 2000 CS 461

Real-Time Scheduling Priority Earliest Deadline First (EDF) Rate Monotonic (RM) Proportional Share with feedback with adjustments for deadlines Spring 2000 CS 461