An Example of 1D Transform with Two Variables

Slides:



Advertisements
Similar presentations
Time Series II.
Advertisements

Fourier Transform (Chapter 4)
Quantum One: Lecture 16.
Spatial and Temporal Data Mining
6 6.1 © 2012 Pearson Education, Inc. Orthogonality and Least Squares INNER PRODUCT, LENGTH, AND ORTHOGONALITY.
Computer Graphics Recitation 6. 2 Motivation – Image compression What linear combination of 8x8 basis signals produces an 8x8 block in the image?
Lecture05 Transform Coding.
Chapter 3 Determinants and Matrices
SWE 423: Multimedia Systems Chapter 7: Data Compression (3)
Digital Image Processing Final Project Compression Using DFT, DCT, Hadamard and SVD Transforms Zvi Devir and Assaf Eden.
MSP1 References Jain (a text book?; IP per se; available) Castleman (a real text book ; image analysis; less available) Lim (unavailable?)
Orthogonal Transforms
SWE 423: Multimedia Systems Chapter 7: Data Compression (5)
Input image Output image Transform equation All pixels Transform equation.
Lossy Image Compression
Orthogonal Matrices and Spectral Representation In Section 4.3 we saw that n  n matrix A was similar to a diagonal matrix if and only if it had n linearly.
ENG4BF3 Medical Image Processing
1 February 24 Matrices 3.2 Matrices; Row reduction Standard form of a set of linear equations: Chapter 3 Linear Algebra Matrix of coefficients: Augmented.
A first look Ref: Walker (ch1) Jyun-Ming Chen, Spring 2001
Transform Coding Heejune AHN Embedded Communications Laboratory
CS654: Digital Image Analysis Lecture 15: Image Transforms with Real Basis Functions.
Transforms. 5*sin (2  4t) Amplitude = 5 Frequency = 4 Hz seconds A sine wave.
1 Chapter 5 Image Transforms. 2 Image Processing for Pattern Recognition Feature Extraction Acquisition Preprocessing Classification Post Processing Scaling.
CS654: Digital Image Analysis Lecture 12: Separable Transforms.
EE465: Introduction to Digital Image Processing 1 Data Compression: Advanced Topics  Huffman Coding Algorithm Motivation Procedure Examples  Unitary.
Part I: Image Transforms DIGITAL IMAGE PROCESSING.
Digital Image Processing Chapter 4 Image Enhancement in the Frequency Domain Part I.
Image Transforms and Image Enhancement in Frequency Domain Lecture 5, Feb 25 th, 2008 Lexing Xie thanks to G&W website, Mani Thomas, Min Wu and Wade Trappe.
DCT.
Image transformations Digital Image Processing Instructor: Dr. Cheng-Chien LiuCheng-Chien Liu Department of Earth Sciences National Cheng Kung University.
Inverse DFT. Frequency to time domain Sometimes calculations are easier in the frequency domain then later convert the results back to the time domain.
Dr. Scott Umbaugh, SIUE Discrete Transforms.
EE565 Advanced Image Processing Copyright Xin Li Statistical Modeling of Natural Images in the Wavelet Space Why do we need transform? A 30-min.
CS654: Digital Image Analysis
CS654: Digital Image Analysis Lecture 13: Discrete Fourier Transformation.
Fourier Transform.
CS 376b Introduction to Computer Vision 03 / 17 / 2008 Instructor: Michael Eckmann.
EE465: Introduction to Digital Image Processing1 Lossy Image Compression: a Quick Tour of JPEG Coding Standard Why lossy for grayscale images?  Tradeoff.
Image hole-filling. Agenda Project 2: Will be up tomorrow Due in 2 weeks Fourier – finish up Hole-filling (texture synthesis) Image blending.
CS654: Digital Image Analysis Lecture 11: Image Transforms.
Chapter 13 Discrete Image Transforms
BYST Xform-1 DIP - WS2002: Fourier Transform Digital Image Processing Bundit Thipakorn, Ph.D. Computer Engineering Department Fourier Transform and Image.
Image Processing Architecture, © Oleh TretiakPage 1Lecture 5 ECEC 453 Image Processing Architecture Lecture 5, 1/22/2004 Rate-Distortion Theory,
Fourier Transform (Chapter 4) CS474/674 – Prof. Bebis.
Signal Prediction and Transformation Trac D. Tran ECE Department The Johns Hopkins University Baltimore MD
Singular Value Decomposition and its applications
Image Transformation Spatial domain (SD) and Frequency domain (FD)
References Jain (a text book?; IP per se; available)
Jean Baptiste Joseph Fourier
JPEG Compression What is JPEG? Motivation
Wavelets : Introduction and Examples
Last update on June 15, 2010 Doug Young Suh
Digital Image Procesing Discrete Walsh Trasform (DWT) in Image Processing Discrete Hadamard Trasform (DHT) in Image Processing DR TANIA STATHAKI READER.
2D Discrete Cosine Transform
Discrete Cosine Transform (DCT)
4. DIGITAL IMAGE TRANSFORMS 4.1. Introduction
Quantum One.
Chapter 3 Linear Algebra
1-D DISCRETE COSINE TRANSFORM DCT
Wavelet Transform Fourier Transform Wavelet Transform
Digital Image Procesing Discrete CosineTrasform (DCT) in Image Processing DR TANIA STATHAKI READER (ASSOCIATE PROFFESOR) IN SIGNAL PROCESSING IMPERIAL.
Digital Image Procesing Unitary Transforms Discrete Fourier Trasform (DFT) in Image Processing DR TANIA STATHAKI READER (ASSOCIATE PROFFESOR) IN SIGNAL.
The Report of Monographic Study
Fourier Transforms.
Chapter 15: Wavelets (i) Fourier spectrum provides all the frequencies
Digital Image Procesing Unitary Transforms Discrete Fourier Trasform (DFT) in Image Processing DR TANIA STATHAKI READER (ASSOCIATE PROFFESOR) IN SIGNAL.
ENEE222 Elements of Discrete Signal Analysis Lab 9 1.
Digital Image Processing
Outline Sparse Reconstruction RIP Condition
Presentation transcript:

An Example of 1D Transform with Two Variables y2 y1 (1,1) (1.414,0) x1 Transform matrix

Generalization into N Variables forward transform basis vectors (column vectors of transform matrix)

Decorrelating Property of Transform x2 y2 y1 x1 x1 and x2 are highly correlated y1 and y2 are less correlated p(x1x2)  p(x1)p(x2) p(y1y2)  p(y1)p(y2)

Transform=Change of Coordinates Intuitively speaking, transform plays the role of facilitating the source modeling Due to the decorrelating property of transform, it is easier to model transform coefficients (Y) instead of pixel values (X) An appropriate choice of transform (transform matrix A) depends on the source statistics P(X) We will only consider the class of transforms corresponding to unitary matrices

Unitary Matrix and 1D Unitary Transform Definition conjugate transpose A matrix A is called unitary if A-1=A*T When the transform matrix A is unitary, the defined transform is called unitary transform Example For a real matrix A, it is unitary if A-1=AT

Inverse of Unitary Transform For a unitary transform, its inverse is defined by Inverse Transform basis vectors corresponding to inverse transform

Properties of Unitary Transform Energy compaction: only few transform coefficients have large magnitude Such property is related to the decorrelating role of unitary transform Energy conservation: unitary transform preserves the 2-norm of input vectors Such property essentially comes from the fact that rotating coordinates does not affect Euclidean distance

Energy Compaction Example Hadamard matrix significant insignificant

Energy Conservation* A is unitary Proof

Numerical Example Check:

2D Transform=Two Sequential 1D Transforms column transform (left matrix multiplication first) row transform row transform (right matrix multiplication first) column transform Conclusion:  2D separable transform can be decomposed into two sequential  The ordering of 1D transforms does not matter

Energy Compaction Property of 2D Unitary Transform  Example A coefficient is called significant if its magnitude is above a pre-selected threshold th insignificant coefficients (th=64)

Energy Conservation Property of 2D Unitary Transform 2-norm of a matrix X A unitary Example: You are asked to prove such property in your homework

Important 2D Unitary Transforms Discrete Fourier Transform Widely used in non-coding applications (frequency-domain approaches) Discrete Cosine Transform Used in JPEG standard Hadamard Transform All entries are 1 N=2: Haar Transform (simplest wavelet transform for multi-resolution analysis)

Discrete Cosine Transform

1D DCT  Real and orthogonal  DCT is NOT the real part of DFT forward transform inverse transform Properties  Real and orthogonal excellent energy compaction property  DCT is NOT the real part of DFT Fact The real and imaginary parts of DFT are generally not orthogonal matrices  fast implementation available: O(Nlog2N)

(2451 significant coefficients, th=64) 2D DCT Its DCT coefficients Y (2451 significant coefficients, th=64) Original cameraman image X Notice the excellent energy compaction property of DCT