Even Discrete Cosine Transform The Chinese University of Hong Kong

Slides:



Advertisements
Similar presentations
Fourier Transform and its Application in Image Processing
Advertisements

Fourier Transform (Chapter 4)
Chapter Four Image Enhancement in the Frequency Domain.
DEPARTMENT OF MATHEMATI CS [ YEAR OF ESTABLISHMENT – 1997 ] DEPARTMENT OF MATHEMATICS, CVRCE.
Lecture05 Transform Coding.
Reminder Fourier Basis: t  [0,1] nZnZ Fourier Series: Fourier Coefficient:
New Image Encryption and Compression Method Based on Independent Component Analysis.
Introduction to Fast Fourier Transform (FFT) Algorithms R.C. Maher ECEN4002/5002 DSP Laboratory Spring 2003.
Chapter 15 Digital Signal Processing
Image Compression and Signal Processing Dan Hewett CS 525.
SWE 423: Multimedia Systems Chapter 7: Data Compression (3)
Digital Image Processing Chapter 4: Image Enhancement in the Frequency Domain.
Digital Image Processing Final Project Compression Using DFT, DCT, Hadamard and SVD Transforms Zvi Devir and Assaf Eden.
Orthogonal Transforms
SWE 423: Multimedia Systems Chapter 7: Data Compression (5)
DEPARTMENT OF MATHEMATI CS [ YEAR OF ESTABLISHMENT – 1997 ] DEPARTMENT OF MATHEMATICS, CVRCE.
Input image Output image Transform equation All pixels Transform equation.
Transforms. 5*sin (2  4t) Amplitude = 5 Frequency = 4 Hz seconds A sine wave.
Math 3360: Mathematical Imaging Prof. Ronald Lok Ming Lui Department of Mathematics, The Chinese University of Hong Kong Lecture 2: Image Transformation.
DCT.
Math 3360: Mathematical Imaging Prof. Ronald Lok Ming Lui Department of Mathematics, The Chinese University of Hong Kong Lecture 9: More about Discrete.
Inverse DFT. Frequency to time domain Sometimes calculations are easier in the frequency domain then later convert the results back to the time domain.
Math 3360: Mathematical Imaging Prof. Ronald Lok Ming Lui Department of Mathematics, The Chinese University of Hong Kong Lecture 11: Types of noises.
CS654: Digital Image Analysis Lecture 13: Discrete Fourier Transformation.
CS 376b Introduction to Computer Vision 03 / 17 / 2008 Instructor: Michael Eckmann.
The Chinese University of Hong Kong
Chapter 13 Discrete Image Transforms
The Frequency Domain Digital Image Processing – Chapter 8.
Eeng Chapter 2 Discrete Fourier Transform (DFT) Topics:  Discrete Fourier Transform. Using the DFT to Compute the Continuous Fourier Transform.
Chapter 2. Characteristics of Signal ※ Signal : transmission of information The quality of the information depends on proper selection of a measurement.
Fourier transform.
Digital Image Processing Lecture 7: Image Enhancement in Frequency Domain-I Naveed Ejaz.
Chapter 7 Infinite Series. 7.6 Expand a function into the sine series and cosine series 3 The Fourier series of a function of period 2l 1 The Fourier.
Singular Value Decomposition and its applications
Chapter 4 Discrete-Time Signals and transform
Math 3360: Mathematical Imaging
Jean Baptiste Joseph Fourier
The content of lecture This lecture will cover: Fourier Transform
Integral Transform Method
Section II Digital Signal Processing ES & BM.
Pat P. W. Chan,  Michael R. Lyu, Roland T. Chin*
Math 3360: Mathematical Imaging
Digital Image Processing Lecture 21: Lossy Compression May 18, 2005
Wavelets : Introduction and Examples
Discrete Fourier Transform The Chinese University of Hong Kong
The Chinese University of Hong Kong
Math 3360: Mathematical Imaging
CSI-447: Multimedia Systems
The Chinese University of Hong Kong
Researchlab 4 Presentation
2D Discrete Cosine Transform
Discrete Cosine Transform (DCT)
Math 3360: Mathematical Imaging
Fourier Transform and Data Compression
Image Processing, Leture #14
Math 3360: Mathematical Imaging
Discrete Fourier Transform The Chinese University of Hong Kong
Math 3360: Mathematical Imaging
Math 3360: Mathematical Imaging
Singular Value Decompsition The Chinese University of Hong Kong
1-D DISCRETE COSINE TRANSFORM DCT
Even Discrete Cosine Transform The Chinese University of Hong Kong
Math 3360: Mathematical Imaging
Digital Image Procesing Discrete CosineTrasform (DCT) in Image Processing DR TANIA STATHAKI READER (ASSOCIATE PROFFESOR) IN SIGNAL PROCESSING IMPERIAL.
Haar Transform and Walsh Transform The Chinese University of Hong Kong
Math 3360: Mathematical Imaging
Discrete Fourier Transform
The Chinese University of Hong Kong
The Frequency Domain Any wave shape can be approximated by a sum of periodic (such as sine and cosine) functions. a--amplitude of waveform f-- frequency.
Even Discrete Cosine Transform The Chinese University of Hong Kong
Presentation transcript:

Even Discrete Cosine Transform The Chinese University of Hong Kong Math 3360: Mathematical Imaging Lecture 11: More about DFT & Even Discrete Cosine Transform Prof. Ronald Lok Ming Lui Department of Mathematics, The Chinese University of Hong Kong

Recap: Properties of DFT

Recap: Algorithm of FFT

Elementary images of DFT decomposition Recap

Elementary images of DFT decomposition Recap

Real example Truncate smallest X% Fourier coefficients Truncate 70% of Fourier coefficients Truncate 50% of Fourier coefficients Truncate 30% of Fourier coefficients Truncate 10% of Fourier coefficients

Real example Truncate smallest X% Fourier coefficients Difference Image: Original minus Compressed image Truncate ~63% of Fourier coefficients Original

Real example Truncate smallest X% Fourier coefficients Difference Image: Original minus Compressed image Truncate 10% of Fourier coefficients

Real example Truncate smallest X% Fourier coefficients Truncate 30% of Fourier coefficients

Real example Truncate smallest X% Fourier coefficients Truncate 50% of Fourier coefficients

Real example Truncate smallest X% Fourier coefficients Truncate 70% of Fourier coefficients

Even Discrete Cosine Transform 1D and 2D Even Discrete Cosine Transform: 1D: 2D: For details, please refer to Lecture Note Chapter 2

Inverse Even Discrete Cosine Transform Image Decomposition

Elementary images of EDCT decomposition

Reconstruction w/ EDCT decomposition = using 1x1 elementary images (first 1 row and first 1 column elementary images; = using 2x2 elementary images (first 2 rows and first 2 column elementary images…and so on…

Other similar transforms Odd Discrete Cosine Transform: Even Discrete Sine Transform: Odd Discrete Sine Transform: All of them have explicit formula for their inverses. (For details, please refer to Lecture Note Chapter 2)

Other similar transforms Inverse Odd Discrete Cosine Transform: Inverse Even Discrete Sine Transform: Inverse Odd Discrete Sine Transform: (For details, please refer to Lecture Note Chapter 2)

Elementary images of ODCT decomposition

Reconstruction w/ ODCT decomposition = using 1x1 elementary images (first 1 row and first 1 column elementary images; = using 2x2 elementary images (first 2 rows and first 2 column elementary images…and so on…

Elementary images of EDST decomposition

Reconstruction w/ EDST decomposition = using 1x1 elementary images (first 1 row and first 1 column elementary images; = using 2x2 elementary images (first 2 rows and first 2 column elementary images…and so on…

Elementary images of ODST decomposition

Reconstruction w/ ODST decomposition = using 1x1 elementary images (first 1 row and first 1 column elementary images; = using 2x2 elementary images (first 2 rows and first 2 column elementary images…and so on…

Comparison of errors The flower example:

More example on DCT decomposition

More example on DCT decomposition Original image DCT

More example on DCT decomposition Original image DCT

More example on DCT decomposition Original image DCT

More example on DCT decomposition

More example on DCT decomposition

More example on DCT decomposition

More example on DCT decomposition

More example on DCT decomposition

More example on DCT decomposition