Multimedia Data The DCT and JPEG Image Compression Dr Mike Spann Electronic, Electrical and Computer.

Slides:



Advertisements
Similar presentations
Código de Huffman.
Advertisements

JPEG Compresses real images Standard set by the Joint Photographic Experts Group in 1991.
Chapter 7 End-to-End Data
SWE 423: Multimedia Systems
School of Computing Science Simon Fraser University
School of Computing Science Simon Fraser University
Multimedia Data Introduction to Image Processing Dr Mike Spann Electronic, Electrical and Computer.
Department of Computer Engineering University of California at Santa Cruz Data Compression (3) Hai Tao.
JPEG.
CS :: Fall 2003 MPEG-1 Video (Part 1) Ketan Mayer-Patel.
JPEG Still Image Data Compression Standard
CMPT 365 Multimedia Systems
T.Sharon-A.Frank 1 Multimedia Image Compression 2 T.Sharon-A.Frank Coding Techniques – Hybrid.
CS430 © 2006 Ray S. Babcock Lossy Compression Examples JPEG MPEG JPEG MPEG.
5. 1 JPEG “ JPEG ” is Joint Photographic Experts Group. compresses pictures which don't have sharp changes e.g. landscape pictures. May lose some of the.
1 JPEG Compression CSC361/661 Burg/Wong. 2 Fact about JPEG Compression JPEG stands for Joint Photographic Experts Group JPEG compression is used with.jpg.
Image Compression: JPEG Multimedia Systems (Module 4 Lesson 1)
Image and Video Compression
Trevor McCasland Arch Kelley.  Goal: reduce the size of stored files and data while retaining all necessary perceptual information  Used to create an.
CM613 Multimedia storage and retrieval Lecture: Lossy Compression Slide 1 CM613 Multimedia storage and retrieval Lossy Compression D.Miller.
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.
Klara Nahrstedt Spring 2011
Concepts of Multimedia Processing and Transmission IT 481, Lecture 5 Dennis McCaughey, Ph.D. 19 February, 2007.
Hyperspectral Imagery Compression Using Three Dimensional Discrete Transforms Tong Qiao Supervisor: Dr. Jinchang Ren 04/07/2013.
EE465: Introduction to Digital Image Processing1 Data Compression Techniques Text: WinZIP, WinRAR (Lempel-Ziv compression’1977) Image: JPEG (DCT-based),
JPEG. The JPEG Standard JPEG is an image compression standard which was accepted as an international standard in  Developed by the Joint Photographic.
Multimedia Data Introduction to Image Processing Dr Sandra I. Woolley Electronic, Electrical.
Image Processing and Computer Vision: 91. Image and Video Coding Compressing data to a smaller volume without losing (too much) information.
Multimedia Data DCT Image Compression
Indiana University Purdue University Fort Wayne Hongli Luo
JPEG CIS 658 Fall 2005.
Image Compression Supervised By: Mr.Nael Alian Student: Anwaar Ahmed Abu-AlQomboz ID: IT College “Multimedia”
Hardware/Software Codesign Case Study : JPEG Compression.
1 Image Formats. 2 Color representation An image = a collection of picture elements (pixels) Each pixel has a “color” Different types of pixels Binary.
Chapter 9 Image Compression Standards 9.1 The JPEG Standard 9.2 The JPEG2000 Standard 9.3 The JPEG-LS Standard 9.5 Further Exploration Li & Drew1.
Compression There is need for compression: bandwidth constraints of multimedia applications exceed the capability of communication channels Ex. QCIF bit.
An introduction to audio/video compression Dr. Malcolm Wilson.
Spring 2000CS 4611 Multimedia Outline Compression RTP Scheduling.
CS Spring 2014 CS 414 – Multimedia Systems Design Lecture 10 – Compression Basics and JPEG Compression (Part 4) Klara Nahrstedt Spring 2014.
Advances in digital image compression techniques Guojun Lu, Computer Communications, Vol. 16, No. 4, Apr, 1993, pp
Digital Image Processing Lecture 21: Lossy Compression Prof. Charlene Tsai.
JPEG - JPEG2000 Isabelle Marque JPEGJPEG2000. JPEG Joint Photographic Experts Group Committe created in 1986 by: International Organization for Standardization.
The task of compression consists of two components, an encoding algorithm that takes a file and generates a “compressed” representation (hopefully with.
JPEG (Joint Photographic Expert Group)
JPEG.
CS654: Digital Image Analysis
STATISTIC & INFORMATION THEORY (CSNB134) MODULE 11 COMPRESSION.
Chapter 8 Lossy Compression Algorithms. Fundamentals of Multimedia, Chapter Introduction Lossless compression algorithms do not deliver compression.
Introduction to JPEG m Akram Ben Ahmed
JPEG. Introduction JPEG (Joint Photographic Experts Group) Basic Concept Data compression is performed in the frequency domain. Low frequency components.
By Dr. Hadi AL Saadi Lossy Compression. Source coding is based on changing of the original image content. Also called semantic-based coding High compression.
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.
Chapter 8 Lossy Compression Algorithms
JPEG Compression What is JPEG? Motivation
IMAGE COMPRESSION.
Chapter 9 Image Compression Standards
Multimedia Outline Compression RTP Scheduling Spring 2000 CS 461.
Digital Image Processing Lecture 21: Lossy Compression May 18, 2005
Digital Image Processing Lecture 21: Lossy Compression
JPEG.
CMPT 365 Multimedia Systems
JPEG Still Image Data Compression Standard
Image Compression Techniques
Image Coding and Compression
Presentation transcript:

Multimedia Data The DCT and JPEG Image Compression Dr Mike Spann Electronic, Electrical and Computer Engineering

Contents  The philosophy behind the lossy of processes of DCT image compression.  A summary of the processes involved in DCT image compression.  Consideration of DCT ringing and blocking compression artefacts; their appearance and their origin.

Lossy DCT Image Compression  The lossy (Discrete Cosine Transform) DCT method compression method is widely used in current standards. For example, JPEG images and MPEG-1 and MPEG-2 (DVD) videos.  The image here is increasingly compressed from left to right.  Blocking artefacts are visible. Ringing artefacts can also be seen around edges.  This lecture will explain how the method works and how these artefacts are caused.

Rate/Distortion  As we have seen, quality can fall rapidly as shown by the steep slope of rate/ distortion graph.  The DCT methods typically* work well up to around 10:1 compression ratios and then quality falls rapidly beyond this. *Note – the original quality and image type are important considerations. a) Original b) CR 8:1 c) CR 11.6:1 d) CR 13.6:1 e) CR 14.2:1 f) Difference a-e g) CR=8:1 with Channel Error

DCT Compression

DCT Image Compression  The philosophy behind DCT image compression is that the human eye is less sensitive to higher- frequency information and also more sensitive to intensity than to colour.  The examples here show the effects of percentage reduction of colour by spatially sub-sampling the colour (UV) channels

DCT Image Compression  The DCT method is an example of a transform method. Rather than simply trying to compress the pixel values directly, the image is first TRANSFORMED into the frequency domain. Compression can now be achieved by more coarsely quantizing the large amount of high-frequency components usually present.  The JPEG* standard algorithm for full-colour and grey-scale image compression is a DCT compression standard that uses 8x8 blocks.  It was not designed for graphics or line drawings and is not suited to these image types. *Joint [CCITT and ISO] Photographic Experts Group

DCT Image Compression  The Discrete Cosine Method uses continuous cosine waves, like cos(x) below, of increasing frequencies to represent the image pixels.  The bases are the set of 64 frequencies that can be combined to represent each block of 64 pixels.  Firstly, the image must be transformed into the frequency domain. This is done in blocks across the whole image.

The Discrete Cosine Transform Bases Low frequency High frequency

The DCT  Take each 8x8 pixel block and represent it as amounts (coefficients) of the basis functions (the frequency set). –represent the 8x8 pixels as amounts of lowest frequency (the average or DC value) through to the highest frequency –64 pixels values are TRANSFORMED into 64 coefficients which represent the amount of each frequency.

DCT Image Compression  The DCT itself does not achieve compression, but rather prepares the image for compression.  Once in the frequency domain the image's high- frequency coefficients can be coarsely quantised so that many of them (>50%) can be truncated to zero.  The coefficients can then be arranged so that the zeroes are clustered (zig-zag collection) and Run- Length Encoded.  The remaining data is then compressed with Huffman coding*.  *The JPEG standard actually specifies many variants which have not been widely used. For example, a more efficient algorithm than Huffman, called arithmetic coding, is a standard variant, but there are several patents on this method. We usually refer to the JPEG baseline algorithm if there is a possibility of confusion between variants.

DCT Image Compression  ‘Baseline’ JPEG uses a standard quantization matrix - determined by subjective testing –Higher frequency DCT coefficients G ij are attenuated more as the HVS is less sensitive to high frequencies Q =

DCT Compression Stages  Blocking (8x8)  DCT (Discrete Cosine Transformation)  Quantization  Zigzag Scan  DPCM* on the dc value (the average value in the top left) – DPCM – Differential Pulse Code Modulation – Instead of sending the value send the difference from the previous value.  RLE on the ac values (all 63 values which aren’t the dc/ average)  Huffman Coding

DCT Mathematics  The formula is shown here for interest only (not assessed material!).  The Discrete Cosine Transform below takes the image pixels I(x,y) and generates DCT(i,j) values. – Its easy to go in the opposite direction as shown in the second equation

Gibb’s Phenomenon  The presence of artefacts around sharp edges is referred to as Gibb's phenomenon.  These are caused by the inability of a finite combination of continuous functions (like cosines) to describe jump discontinuities (e.g. edges).  At higher compression ratios these losses become more apparent, as do the boundaries of the 8x8 blocks.  The loss of edge clarity can be clearly seen in a difference mapping comparing an original image with its heavily compressed equivalent.

Original Test Image An extreme example for demonstrating Gibb’s phenomenon

Heavily Compressed DCT Image

The Difference (Gibb’s Phenomenon)

Summary of DCT The philosophy behind the lossy processes of DCT image compression. A summary of the processes involved in DCT image compression. Consideration of DCT ringing and blocking compression artefacts; their appearance and their origin. For interest … more links on compression …

State of the art compression methods  The DCT is the transformation underpinning the original JPEG standard –Block based transformation –Blocking artefacts will always be an issue at high compression rates  JPEG2000 is based on the discrete wavelet transform (DWT) –A more complex transformation across the whole image –Blocking artefacts no longer a problem DWT

State of the art compression methods  Performance of wavelet based methods is impressive –This is in terms of the quality of the compressed image at high compression rates AND –The absence of blocking artefacts  We can compare DCT and DWT based compression at 32:1 compression ratio DCT DWT

State of the art compression methods  Its much easier to see a difference if we ‘zoom in’ on a small region –Blocking artefacts are clearly visible in the DCT based method –Wavelet based methods ‘degrade’ much more gracefully at higher compression ratios DCT DWT

State of the art compression methods  Another advantage of these methods is that it produces an ‘embedded’ bitstream –Important for video streaming services –The image can be reconstructed from the bitstream at any time according to the quality required at any given compression … ……… …. bitstream lossless

 This concludes our introduction to DCT image compression.  You can find course information, including slides and supporting resources, on-line on the course web page at Thank You