Final Project Part I MATLAB Session

Slides:



Advertisements
Similar presentations
MATLAB Session 5 ES 156 Signals and Systems 2007 HSEAS Prepared by Frank Tompkins.
Advertisements

Image Enhancement in the Frequency Domain (2)
EE313 Linear Systems and Signals Fall 2010 Initial conversion of content to PowerPoint by Dr. Wade C. Schwartzkopf Prof. Brian L. Evans Dept. of Electrical.
Final Project Part II MATLAB Session ES 156 Signals and Systems 2007 SEAS Prepared by Frank Tompkins.
Fourier: ApplicationsModern Seismology – Data processing and inversion 1 Fourier Transform: Applications Seismograms Eigenmodes of the Earth Time derivatives.
1 Image Filtering Readings: Ch 5: 5.4, 5.5, 5.6,5.7.3, 5.8 (This lecture does not follow the book.) Images by Pawan SinhaPawan Sinha formal terminology.
Introduction to Computer Vision CS / ECE 181B  Handout #4 : Available this afternoon  Midterm: May 6, 2004  HW #2 due tomorrow  Ack: Prof. Matthew.
APPLICATIONS OF FOURIER REPRESENTATIONS TO
Lecture 2: Image filtering
About this Course Subject: Textbook Reference book Course website
ELE 488 F06 ELE 488 Fall 2006 Image Processing and Transmission Linear 2-D Image Filtering 1-D discrete convolution 2-D discrete convolution 2-D.
Image (and Video) Coding and Processing Lecture 2: Basic Filtering Wade Trappe.
Discrete-Time Convolution Linear Systems and Signals Lecture 8 Spring 2008.
Discrete-Time and System (A Review)
(Lecture #08)1 Digital Signal Processing Lecture# 8 Chapter 5.
Digital Signal Processing – Chapter 10
Technion, CS department, SIPC Spring 2014 Tutorials 12,13 discrete signals and systems 1/39.
Fourier Analysis of Discrete Time Signals
Lecture 6: DFT XILIANG LUO 2014/10. Periodic Sequence  Discrete Fourier Series For a sequence with period N, we only need N DFS coefs.
Digital Image Processing (Digitaalinen kuvankäsittely) Exercise 2
Spatial Filtering (Applying filters directly on Image) By Engr. Muhammad Saqib.
Convolution in Matlab The convolution in matlab is accomplished by using “conv” command. If “u” is a vector with length ‘n’ and “v” is a vector with length.
Fourier Analysis of Signals and Systems
ECE 8443 – Pattern Recognition EE 3512 – Signals: Continuous and Discrete Objectives: Causality Linearity Time Invariance Temporal Models Response to Periodic.
EEE 503 Digital Signal Processing Lecture #2 : EEE 503 Digital Signal Processing Lecture #2 : Discrete-Time Signals & Systems Dr. Panuthat Boonpramuk Department.
ES97H Biomedical Signal Processing
Digital Signal Processing. Discrete Fourier Transform Inverse Discrete Fourier Transform.
Image processing Honza Černocký, ÚPGM. 1D signal 2.
Linear filtering based on the DFT
Technological Educational Institute Of Crete Department Of Applied Informatics and Multimedia Neural Networks Laboratory Slide 1 DISCRETE SIGNALS AND SYSTEMS.
11 Lecture 2 Signals and Systems (II) Principles of Communications Fall 2008 NCTU EE Tzu-Hsien Sang.
Signal and System I The representation of discrete-time signals in terms of impulse Example.
Fast Fourier Transforms. 2 Discrete Fourier Transform The DFT pair was given as Baseline for computational complexity: –Each DFT coefficient requires.
CS 179: GPU Programming Lecture 9 / Homework 3. Recap Some algorithms are “less obviously parallelizable”: – Reduction – Sorts – FFT (and certain recursive.
Digital Signal Processing Lecture 3 LTI System
Prepared by:D K Rout DSP-Chapter 2 Prepared by  Deepak Kumar Rout.
بسم الله الرحمن الرحيم Digital Signal Processing Lecture 14 FFT-Radix-2 Decimation in Frequency And Radix -4 Algorithm University of Khartoum Department.
Review of DSP.
1 Chapter 8 The Discrete Fourier Transform (cont.)
 Carrier signal is strong and stable sinusoidal signal x(t) = A cos(  c t +  )  Carrier transports information (audio, video, text, ) across.
Chapter 4 Discrete-Time Signals and transform
Chapter 8. The Discrete Fourier Transform
Basic Principles Photogrammetry V: Image Convolution & Moving Window:
Review of DSP.
Signal Processing First
Digital Signal Processing
Lecture 11 FIR Filtering Intro
CE Digital Signal Processing Fall Discrete-time Fourier Transform
Discrete-time Systems
Digital Signal Processing Lecture 4 DTFT
Signal Processing First
Lecture 12 Linearity & Time-Invariance Convolution
FFT-based filtering and the
Laplace and Z transforms
ELE 488 Fall 2006 Image Processing and Transmission
Lecture 4: Discrete-Time Systems
4.1 DFT In practice the Fourier components of data are obtained by digital computation rather than by analog processing. The analog values have to be.
Lecture 13 Frequency Response of FIR Filters
CS3291: "Interrogation Surprise" on Section /10/04
1-D DISCRETE COSINE TRANSFORM DCT
Signal Processing First
Chapter 8 The Discrete Fourier Transform
Digital Image Procesing Discrete CosineTrasform (DCT) in Image Processing DR TANIA STATHAKI READER (ASSOCIATE PROFFESOR) IN SIGNAL PROCESSING IMPERIAL.
Chapter 8 The Discrete Fourier Transform
Lecture 22 IIR Filters: Feedback and H(z)
Concept of frequency in Discrete Signals & Introduction to LTI Systems
Lecture 4 Image Enhancement in Frequency Domain
Review of DSP.
Matlab Tutorial #2 Kathleen Chen February 13, 2018.
Even Discrete Cosine Transform The Chinese University of Hong Kong
Presentation transcript:

Final Project Part I MATLAB Session ES 156 Signals and Systems 2007 SEAS Prepared by Frank Tompkins

Outline Discrete Cosine Transform (DCT) Basic Image Processing Review of DFT/FFT 1-D and 2-D Basic Image Processing 2-D LTI systems Impulse response Filtering kernels and fspecial Thresholding

DFT Review Finite length discrete time signal x[n] Discrete fourier transform fft, ifft, fftshift, ifftshift in MATLAB

DCT Discrete Cosine Transform Discrete Fourier Transform Note the similarity DCT is roughly real part of DFT

2-D Discrete Time Signals x[m,n], finite length in both dimensions Can think of it as a matrix Doesn’t have to be square An image is one example How to do frequency analysis of a 2-D signal? Just do two Fourier transforms; one for each dimension

DCT (2-D) Each signal/function can be thought of as a matrix We can treat x[m,n] as a function of m for each n Define xn[m] = x[m,n] Compute DCT of xn[m], call it Xn[k] Treat Xn[k] as a function of n for each k Define xk[n] = Xn[k] Compute DCT of xk[n], call it Xk[l] Then we define the (2-D) DCT of x[m,n] to be X[k, l] = Xk[l]

DCT Overall formula Note that signal doesn’t need to be square Compute with MATLAB commands dct2 and idct2

DCT Example

2-D LTI Systems In 1-D, LTI systems is characterized entirely by impulse response h[n] Input x[n] yields output y[n] = h[n] * x[n] For 2-D LTI systems, we have a similar result Input x[m,n] yields output y[m,n] = h[m,n] ** x[m,n] This is a 2-D convolution

2-D Convolution MATLAB command conv2

But what is h[m,n]? Analogous to 1-D case In 1-D, h[n] is output when d[n] is input In 2-D, h[m,n] is output when d[m,n] = d[m]d[n] is input

fspecial MATLAB command to generate some common 2-D filters (aka kernels) Gaussian Sobel Prewitt

Filtering Example Prewitt kernel This filter emphasizes horizontal edges in an image H = fspecial('prewitt'); filt = conv2(H, X); imshow(filt); XT = dct2(filt); imshow(XT);

Filtering Example Note that the left side of the DCT is for horizontal edges

Thresholding Set lowest 78% (or whatever) image values to zero and the rest to white to emphasize edges frac = 0.78; thresh = max(max(filt))*frac + min(min(filt))*(1-frac); result = filt > thresh; imshow(result);