SWE 423: Multimedia Systems Chapter 7: Data Compression (3)

Slides:



Advertisements
Similar presentations
Multimedia Data Compression
Advertisements

Fourier Transforms and Their Use in Data Compression
Fourier Transform (Chapter 4)
1 Chapter 16 Fourier Analysis with MATLAB Fourier analysis is the process of representing a function in terms of sinusoidal components. It is widely employed.
Chapter Four Image Enhancement in the Frequency Domain.
IT-101 Section 001 Lecture #8 Introduction to Information Technology.
School of Computing Science Simon Fraser University
Computer Graphics Recitation 6. 2 Motivation – Image compression What linear combination of 8x8 basis signals produces an 8x8 block in the image?
Computer Graphics Recitation 7. 2 Motivation – Image compression What linear combination of 8x8 basis signals produces an 8x8 block in the image?
Spatial and Temporal Data Mining
JPEG.
JPEG Still Image Data Compression Standard
Fourier Analysis Without Tears : Computational Photography Alexei Efros, CMU, Fall 2005 Somewhere in Cinque Terre, May 2005.
Fourier Analysis D. Gordon E. Robertson, PhD, FCSB School of Human Kinetics University of Ottawa.
Department of Computer Engineering University of California at Santa Cruz Data Compression (2) Hai Tao.
SWE 423: Multimedia Systems Chapter 7: Data Compression (5)
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.
CH#3 Fourier Series and Transform
Basics of Signal Processing. frequency = 1/T  speed of sound × T, where T is a period sine wave period (frequency) amplitude phase.
Chapter 25 Nonsinusoidal Waveforms. 2 Waveforms Used in electronics except for sinusoidal Any periodic waveform may be expressed as –Sum of a series of.
Introduction to JPEG Alireza Shafaei ( ) Fall 2005.
Digital Image Processing Chapter # 4 Image Enhancement in Frequency Domain Digital Image Processing Chapter # 4 Image Enhancement in Frequency Domain.
Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 1 Chapter 19.
Image Enhancement in the Frequency Domain Spring 2006, Jen-Chang Liu.
Spectral Analysis AOE March 2011 Lowe 1. Announcements Lectures on both Monday, March 28 th, and Wednesday, March 30 th. – Fracture Testing –
CMPT 365 Multimedia Systems
JPEG. The JPEG Standard JPEG is an image compression standard which was accepted as an international standard in  Developed by the Joint Photographic.
Indiana University Purdue University Fort Wayne Hongli Luo
1 Fourier Representations of Signals & Linear Time-Invariant Systems Chapter 3.
Part I: Image Transforms DIGITAL IMAGE PROCESSING.
The Physical Layer Lowest layer in Network Hierarchy. Physical transmission of data. –Various flavors Copper wire, fiber optic, etc... –Physical limits.
Understanding JPEG MIT-CETI Xi’an ‘99 Lecture 10 Ben Walter, Lan Chen, Wei Hu.
Digital Image Processing, 2nd ed. © 2002 R. C. Gonzalez & R. E. Woods Background Any function that periodically repeats itself.
Spatial Frequencies Spatial Frequencies. Why are Spatial Frequencies important? Efficient data representation Provides a means for modeling and removing.
7- 1 Chapter 7: Fourier Analysis Fourier analysis = Series + Transform ◎ Fourier Series -- A periodic (T) function f(x) can be written as the sum of sines.
The task of compression consists of two components, an encoding algorithm that takes a file and generates a “compressed” representation (hopefully with.
Fourier Transform.
HOW JEPG WORKS Presented by: Hao Zhong For 6111 Advanced Algorithm Course.
ELE 488 F06 ELE 488 Fall 2006 Image Processing and Transmission ( ) Image Compression Quantization independent samples uniform and optimum correlated.
JPEG.
CS654: Digital Image Analysis
Chapter 8 Lossy Compression Algorithms. Fundamentals of Multimedia, Chapter Introduction Lossless compression algorithms do not deliver compression.
CS 376b Introduction to Computer Vision 03 / 17 / 2008 Instructor: Michael Eckmann.
Dr. Abdul Basit Siddiqui FUIEMS. QuizTime 30 min. How the coefficents of Laplacian Filter are generated. Show your complete work. Also discuss different.
Computer Graphics & Image Processing Chapter # 4 Image Enhancement in Frequency Domain 2/26/20161.
JPEG. Introduction JPEG (Joint Photographic Experts Group) Basic Concept Data compression is performed in the frequency domain. Low frequency components.
Chapter 13 Discrete Image Transforms
Entropy vs. Average Code-length Important application of Shannon’s entropy measure is in finding efficient (~ short average length) code words The measure.
The Frequency Domain Digital Image Processing – Chapter 8.
Chapter 2. Characteristics of Signal ※ Signal : transmission of information The quality of the information depends on proper selection of a measurement.
Digital Image Processing Lecture 7: Image Enhancement in Frequency Domain-I Naveed Ejaz.
CH#3 Fourier Series and Transform 1 st semester King Saud University College of Applied studies and Community Service 1301CT By: Nour Alhariqi.
Fourier Transform (Chapter 4) CS474/674 – Prof. Bebis.
Fourier Analysis Patrice Koehl Department of Biological Sciences National University of Singapore
Chapter 8 Lossy Compression Algorithms
Singular Value Decomposition and its applications
JPEG Compression What is JPEG? Motivation
A Simple Image Compression : JPEG
JPEG Image Coding Standard
Last update on June 15, 2010 Doug Young Suh
JPEG.
CSI-447: Multimedia Systems
Dr. Nikos Desypris, Oct Lecture 3
Researchlab 4 Presentation
1-D DISCRETE COSINE TRANSFORM DCT
Fourier Analysis Without Tears
Islamic University of Gaza
Discrete Fourier Transform
Presentation transcript:

SWE 423: Multimedia Systems Chapter 7: Data Compression (3)

Outline Transform Coding –Discrete Cosine Transform

Transform Coding Let be a vector of samples. There is a good chance that a substantial amount of correlation is inherent among neighboring samples x i. The rational behind transform coding is that if Y is the result of a linear transform T of X in such a way that the components of Y are much less correlated, then Y can be coded more efficiently than X

Transform Coding In dimensions higher than 3, if most information is accurately described in the first few components of a transformed vector, the remaining components can be coarsely quantized or even set to zero with little signal distortion. –The less effect one dimension has on another, the more chance we have of dealing differently with axes that store relatively minor amounts of information without affecting reasonably accurate reconstruction of the signal from its quantized or truncated transform coefficients. –Therefore, compression comes from the quantization of the components of Y.

Discrete Cosine Transform 2D DCT: Given a function f(i, j) over two integer variables i and j (e.g. a piece of an image), the 2D DCT transforms it into a new function F(u, v), with integers u and v running over the same range as i and j such that where i,u = 0,..., M – 1 and j,v = 0,..., N – 1 and

Discrete Cosine Transform For N = M = 8 (used for JPEG Standard), the 2D DCT is... The inverse DCT (2D-IDCT) is

Discrete Cosine Transform 1D DCT: Given a function f(i) over integer variable i, the 1D DCT transforms it into a new function F(u), with integer u running over the same range as i such that (M=8) where i,u = 0,..., 7 and

Discrete Cosine Transform The inverse 1D-DCT is defined by where i,u = 0,..., 7 and

Discrete Cosine Transform An electrical signal with constant magnitude is known as a DC signal (Direct Current) –For example, a 9-volts battery. An electrical signal that changes its magnitude periodically at a certain frequency is known as an AC signal (alternating Current) –For example, household electric power circuit (110 volts, 60Hz vs. 220 volts 50Hz) Although most signals are complex, any signal can be expressed as a sum of multiple signals that are sine or cosine waveforms at various amplitudes and frequencies. –This is known as Fourier Analysis

Discrete Cosine Transform If a cosine function is used, the process of determining the amplitudes of the AC and DC components of the signal is called a Cosine Transform, and the integer indices make it a Discrete Cosine Transform. –When u=0, F(u) yields the DC coefficient –When u = 1, 2,..., 7, F(u) yields the first, second,..., seventh AC coefficient.

Discrete Cosine Transform The inverse transform uses a sum of the products of the DC or AC coefficients and the cosine functions to reconstruct the function f ( i ), now known as f ~ ( i ). Both DCT and IDCT use the same set of cosine functions, known as basis functions. The idea behind Transform Coding is to use only a few coefficients that result in the highest energy

Examples (1D-DCT)

Examples (1D-IDCT)

Discrete Cosine Transform Approximation of the ramp function using a 3-term DCT approximation vs. a 3-term DFT approximation.