Morphological Image Processing
|
|
- Barry Harrington
- 5 years ago
- Views:
Transcription
1 Morphological Image Processig Biary dilatio ad erosio Set-theoretic iterpretatio Opeig, closig, morphological edge detectors Hit-miss filter Morphological filters for gray-level images Cascadig dilatios ad erosios Rak filters, media filters, majority filters Digital Image Processig: Berd Girod, Staford Uiversity -- Morphological Image Processig 1
2 Biary images are commo Biary image processig l Itermediate abstractio i a gray-scale/color image aalysis system Thresholdig/segmetatio Presece/absece of some image property l Text ad lie graphics, documet image processig Represetatio of idividual pixels as 0 or 1, covetio: l foregroud, object = 1 (white) l backgroud = 0 (black) Processig by logical fuctios is fast ad simple Shift-ivariat logical operatios o biary images: morphological image processig Morphological image processig has bee geeralized to gray-level images via level sets Digital Image Processig: Berd Girod, Staford Uiversity -- Morphological Image Processig 2
3 Shift-ivariace Assume that digital images f [x,y] ad g[x,y] have ifiite support [ x, y] {, 2, 1,0,1,2, } {, 2, 1,0,1,2, }... the, for all itegers a ad b [ ] g[ x, y] f x, y Shiftivariat system [ ] g[ x a, y b] f x a, y b Shiftivariat system Shift-ivariace does ot imply liearity (or vice versa). Digital Image Processig: Berd Girod, Staford Uiversity -- Morphological Image Processig 3
4 Structurig elemet Neighborhood widow operator { } = f x W f x, y 180 degree rotatio { } x, y y : x, y Π xy structurig elemet ˆ W f x, y { } = { f x + x ʹ, y + yʹ x, yʹ } The hat otatio idicates Π xy Example structurig elemets : : ʹ Π xy upright structurig elemet (i.e., ot rotated!) 5x5 square x x cross y y Digital Image Processig: Berd Girod, Staford Uiversity -- Morphological Image Processig 4
5 Biary dilatio (expadig foregroud) { } g x, y = OR W f x, y := dilate( f,w ) x f [x, y] Π y xy g[x, y] Digital Image Processig: Berd Girod, Staford Uiversity -- Morphological Image Processig 5
6 Biary dilatio with square structurig elemet { } g x, y = OR W f x, y := dilate( f,w ) Expads the size of 1-valued objects Smoothes object boudaries Closes holes ad gaps Origial (701x781) dilatio with 3x3 structurig elemet dilatio with 7x7 structurig elemet Digital Image Processig: Berd Girod, Staford Uiversity -- Morphological Image Processig 6
7 Biary erosio (shrikig foregroud) g x, y = AND W ˆ f x, y { } := erode( f,w ) x f [x, y] Π y xy g[x, y] Caveat: There is aother defiitio of erosio i the literature, which flips the structurig elemet, as for dilatio. The Laguita olie videos use that alterative defiitio. Matlab fuctio imerode uses the defiitio o this slide. To the best of our kowledge, there is o such discrepacy defiig dilatio. Digital Image Processig: Berd Girod, Staford Uiversity -- Morphological Image Processig 7
8 Biary erosio with square structurig elemet g x, y = AND W ˆ f x, y { } := erode( f,w ) Origial (701x781) erosio with 3x3 structurig elemet erosio with 7x7 structurig elemet Shriks the size of 1-valued objects Smoothes object boudaries Removes peisulas, figers, ad small objects Digital Image Processig: Berd Girod, Staford Uiversity -- Morphological Image Processig 8
9 Relatioship betwee dilatio ad erosio Duality: erosio is dilatio of the backgroud dilate f,w erode f,w ( ) ( ) = NOT erode NOT f ( ) = NOT dilate NOT f, Wˆ ( ), Wˆ But: erosio is ot the iverse of dilatio f ( ) ( ) x, y erode dilate( f,w ),W dilate erode( f,w ),W Digital Image Processig: Berd Girod, Staford Uiversity -- Morphological Image Processig 9
10 Example: blob separatio/detectio by erosio Origial biary image Circles (792x892) Erosio by 30x30 structurig elemet Erosio by 70x70 structurig elemet Erosio by 96x96 structurig elemet Digital Image Processig: Berd Girod, Staford Uiversity -- Morphological Image Processig 10
11 Example: blob separatio/detectio by erosio Origial biary image Circles (792x892) Erosio by disk-shaped structurig elemet Diameter=15 Erosio by disk-shaped structurig elemet Diameter=35 Erosio by disk-shaped structurig elemet Diameter=48 Digital Image Processig: Berd Girod, Staford Uiversity -- Morphological Image Processig 11
12 Example: chai lik fece hole detectio Origial grayscale image Fece (1023 x 1173) Fece thresholded usig Otsu s method Erosio with 151x151 cross structurig elemet Digital Image Processig: Berd Girod, Staford Uiversity -- Morphological Image Processig 12
13 Set-theoretic iterpretatio Set of object pixels F {( x, y): f ( x, y) = 1} Backgroud: complemet of foregroud set F c {( x, y): f ( x, y) = 0} Dilatio is Mikowski set additio G = F Π xy Cotiuous (x,y). Works for discrete [x,y] i the same way. Commutative ad associative! { ( ) F, ( p x, p ) y Π } xy = ( x + p x, y + p y ): x, y ( p x,p y ) Π xy = F + px,p y ( ) traslatio of F ( by vector p x, p ) y Digital Image Processig: Berd Girod, Staford Uiversity -- Morphological Image Processig 13
14 Set-theoretic iterpretatio: dilatio G F y x Π xy G = F Π xy { ( ) F, ( p x, p ) y Π } xy = ( x + p x, y + p y ): x, y = F + px,p y ( p x,p y ) Π xy ( ) Digital Image Processig: Berd Girod, Staford Uiversity -- Morphological Image Processig 14
15 Set-theoretic iterpretatio: erosio G F Mikowski set subtractio Not commutative! Not associative! y x Π xy G = ( p x, p y ) Π xy F + px,p y ( ) = FΘΠ xy Digital Image Processig: Berd Girod, Staford Uiversity -- Morphological Image Processig 15
16 Opeig ad closig Goal: smoothig without size chage Ope filter Close filter ( ) = dilate erode f,w ( ) = erode dilate f,w ope f,w close f,w ( ( ),W ) ( ),W ( ) Ope filter ad close filter are biased l Ope filter removes small 1-regios l Close filter removes small 0-regios l Bias is ofte desired for ehacemet or detectio! Ubiased size-preservig smoothers close ope f,w ope close f,w ( ( ),W ) ( ( ),W ) ( ) = close ope f,w ( ) = ope close f,w close-ope ad ope-close are duals, but ot iverses of each other. Digital Image Processig: Berd Girod, Staford Uiversity -- Morphological Image Processig 16
17 Small hole removal by closig Origial biary mask Dilatio 10x10 Closig 10x10 Differece to origial mask Digital Image Processig: Berd Girod, Staford Uiversity -- Morphological Image Processig 17
18 Morphological edge detectors f x, y dilate( f,w) f erode( f,w) f dilate( f,w) erode( f,w) Digital Image Processig: Berd Girod, Staford Uiversity -- Morphological Image Processig 18
19 Recogitio by erosio Biary image f ( ) dilate erode( NOT f,w ),W Structurig elemet W Digital Image Processig: Berd Girod, Staford Uiversity -- Morphological Image Processig 19
20 Recogitio by erosio Structurig elemet W Digital Image Processig: Berd Girod, Staford Uiversity -- Morphological Image Processig 20
21 Recogitio by erosio Biary image f ( ) dilate erode( NOT f,w ),W Structurig elemet W Digital Image Processig: Berd Girod, Staford Uiversity -- Morphological Image Processig 21
22 Recogitio by erosio Structurig elemet W Digital Image Processig: Berd Girod, Staford Uiversity -- Morphological Image Processig 22
23 Hit-miss filter Biary image f ( ( ) & erode( f,w ),W ) dilate erode NOT f,v Structurig elemet V Structurig elemet W Digital Image Processig: Berd Girod, Staford Uiversity -- Morphological Image Processig 23
24 Hit-miss filter Structurig elemet V Structurig elemet W Digital Image Processig: Berd Girod, Staford Uiversity -- Morphological Image Processig 24
25 Morphological filters for gray-level images Threshold sets of a gray-level image f [x,y] ( ) = x, y Τ θ f x, y { : f x, y θ}, < θ < + Recostructio of origial image from threshold sets f x, y { ( )} = sup θ : x, y Τ θ f x, y Idea of morphological operators for multi-level (or cotiuous-amplitude) sigals l Decompose ito threshold sets l Apply biary morphological operator to each threshold set l Recostruct via supremum operatio l Gray-level operators thus obtaied: flat operators! Flat morphological operators ad thresholdig are commutative Digital Image Processig: Berd Girod, Staford Uiversity -- Morphological Image Processig 25
26 Dilatio/erosio for gray-level images Explicit decompositio ito threshold sets ot required i practice Flat dilatio operator: local maximum over widow W g x, y = max{ W { f x, y }}:= dilate f,w Flat erosio operator: local miimum over widow W ( ) g x, y = mi{ Wˆ { f x, y } }:= erode f,w ( ) Biary dilatio/erosio operators cotaied as special case Digital Image Processig: Berd Girod, Staford Uiversity -- Morphological Image Processig 26
27 1-d illustratio of erosio ad dilatio Structurig elemet legth = Dilatio Erosio Origial Structurig elemet: horizotal lie Amplitude Sample o. Digital Image Processig: Berd Girod, Staford Uiversity -- Morphological Image Processig 27
28 Image example Origial 394 x 305 Dilatio 10x10 square Erosio 10x10 square Digital Image Processig: Berd Girod, Staford Uiversity -- Morphological Image Processig 28
29 Flat dilatio with differet structurig elemets Origial Diamod Disk 20 degree lie 9 poits 2 horizotal lies Digital Image Processig: Berd Girod, Staford Uiversity -- Morphological Image Processig 29
30 Example: coutig cois thresholded 1 coected compoet Origial 20 coected compoets dilatio thresholded after dilatio Digital Image Processig: Berd Girod, Staford Uiversity -- Morphological Image Processig 30
31 Example: chai lik fece hole detectio Origial grayscale image Fece (1023 x 1173) Flat erosio with 151x151 cross structurig elemet Biarized by Thresholdig Digital Image Processig: Berd Girod, Staford Uiversity -- Morphological Image Processig 31
32 Morphological edge detector origial f dilatio g g f g-f g f thresholded Digital Image Processig: Berd Girod, Staford Uiversity -- Morphological Image Processig 32
33 Beyod flat morphological operators Geeral dilatio operator g x, y = sup α,β Like liear covolutio, with sup replacig summatio, additio replacig multiplicatio Dilatio with uit impulse d α,β does ot chage iput sigal: { f x α, y β + w α,β } = sup = 0 α = β = 0 else α,β { } w x α, y β + f α,β f x, y = sup α,β { f x α, y β + d α,β } Digital Image Processig: Berd Girod, Staford Uiversity -- Morphological Image Processig 33
34 Fid such that Aswer: w α,β f x, y Flat dilatio as a special case = sup α,β { f x α, y β + w α,β } = dilate f,w w α,β = 0 α,β Π xy else ( ) Hece, write i geeral g!" x, y# $ = sup{ f!" x α, y β # $ + w!" α,β # $ } α,β = dilate f,w ( ) = dilate( w, f ) Digital Image Processig: Berd Girod, Staford Uiversity -- Morphological Image Processig 34
35 Geeral erosio for gray-level images Geeral erosio operator g x, y = if α,β Dual of dilatio g x, y = if α,β = sup α,β f x +α, y + β w α,β { } = erode( f,w) f x +α, y + β w α,β { } f x +α, y + β + w α,β { } = dilate( f,ŵ) Flat erosio cotaied as a special case Digital Image Processig: Berd Girod, Staford Uiversity -- Morphological Image Processig 35
36 Cascaded dilatios f dilate( f,w 1 ) dilate ( f,w,w 1 2 ) dilate ( f,w,w,w 1 2 3) dilate dilate( f,w 1 ),w 2 = dilate( f,w) where w = dilate( w 1,w ) 2 Digital Image Processig: Berd Girod, Staford Uiversity -- Morphological Image Processig 36
37 Cascaded erosios Cascaded erosios ca be lumped ito sigle erosio erode erode( f,w 1 ),w 2 = erode dilate ( f,ŵ 1 ),w 2 = dilate dilate( f,ŵ 1 ),ŵ 2 = dilate( f,ŵ) = erode( f,w) where w = dilate( w 1,w ) 2 New structurig elemet (SE) is ot the erosio of oe SE by the other, but dilatio. Digital Image Processig: Berd Girod, Staford Uiversity -- Morphological Image Processig 37
38 Fast dilatio ad erosio Idea: build larger dilatio ad erosio operators by cascadig simple, small operators Example: biary erosio by 11x11 widow f x, y f x, y Erosio with 1x3 widow Erosio with 1x3 widow Erosio with 11x11 widow 5 stages g x, y g x, y Erosio with 3x1 widow Erosio with 3x1 widow 5 stages 120 AND per pixel 2x10 = 20 AND per pixel Digital Image Processig: Berd Girod, Staford Uiversity -- Morphological Image Processig 38
39 Rak filters Geeralisatio of flat dilatio/erosio: i lieu of mi or max value i widow, use the p-th raked value Icreases robustess agaist oise Best-kow example: media filter for oise reductio Cocept useful for both gray-level ad biary images All rak filters are commutative with thresholdig Digital Image Processig: Berd Girod, Staford Uiversity -- Morphological Image Processig 39
40 Media filter Gray-level media filter Biary images: majority filter Self-duality g x, y = media W f x, y { } g x, y = MAJ W f x, y media f,w majority f,w ( ) = media( f,w ) { } ( ) = NOT majority NOT f := media( f,w ) := majority( f,w ) (,W ) Digital Image Processig: Berd Girod, Staford Uiversity -- Morphological Image Processig 40
41 Majority filter: example Biary image with 5% Salt&Pepper oise 3x3 majority filter 20% Salt&Pepper oise 3x3 majority filter Digital Image Processig: Berd Girod, Staford Uiversity -- Morphological Image Processig 41
42 Media filter: example Origial image 5% Salt&Pepper oise 3x3 media filterig 7x7 media filterig Digital Image Processig: Berd Girod, Staford Uiversity -- Morphological Image Processig 42
43 Example: o-uiform lightig compesatio Origial image 1632x1216 pixels Dilatio (local max) Rak filter 61x61 structurig elemet 10st brightest pixel 61x61 structurig elemet Digital Image Processig: Berd Girod, Staford Uiversity -- Morphological Image Processig 43
44 Example: o-uiform lightig compesatio Backgroud origial image After global thresholdig Digital Image Processig: Berd Girod, Staford Uiversity -- Morphological Image Processig 44
Structuring Element Representation of an Image and Its Applications
Iteratioal Joural of Cotrol Structurig Automatio Elemet ad Represetatio Systems vol. of a o. Image 4 pp. ad 50955 Its Applicatios December 004 509 Structurig Elemet Represetatio of a Image ad Its Applicatios
More informationMathematical Description of Discrete-Time Signals. 9/10/16 M. J. Roberts - All Rights Reserved 1
Mathematical Descriptio of Discrete-Time Sigals 9/10/16 M. J. Roberts - All Rights Reserved 1 Samplig ad Discrete Time Samplig is the acquisitio of the values of a cotiuous-time sigal at discrete poits
More informationDiscrete-Time Systems, LTI Systems, and Discrete-Time Convolution
EEL5: Discrete-Time Sigals ad Systems. Itroductio I this set of otes, we begi our mathematical treatmet of discrete-time s. As show i Figure, a discrete-time operates or trasforms some iput sequece x [
More informationLinear time invariant systems
Liear time ivariat systems Alejadro Ribeiro Dept. of Electrical ad Systems Egieerig Uiversity of Pesylvaia aribeiro@seas.upe.edu http://www.seas.upe.edu/users/~aribeiro/ February 25, 2016 Sigal ad Iformatio
More informationImage pyramid example
Multiresolutio image processig Laplacia pyramids Discrete Wavelet Trasform (DWT) Quadrature mirror filters ad cojugate quadrature filters Liftig ad reversible wavelet trasform Wavelet theory Berd Girod:
More informationLecture 2 Linear and Time Invariant Systems
EE3054 Sigals ad Systems Lecture 2 Liear ad Time Ivariat Systems Yao Wag Polytechic Uiversity Most of the slides icluded are extracted from lecture presetatios prepared by McClella ad Schafer Licese Ifo
More informationScale-space image processing
Scale-space image processig Correspodig image features ca appear at differet scales Like shift-ivariace, scale-ivariace of image processig algorithms is ofte desirable. Scale-space represetatio is useful
More informationLecture 3. Digital Signal Processing. Chapter 3. z-transforms. Mikael Swartling Nedelko Grbic Bengt Mandersson. rev. 2016
Lecture 3 Digital Sigal Processig Chapter 3 z-trasforms Mikael Swartlig Nedelko Grbic Begt Madersso rev. 06 Departmet of Electrical ad Iformatio Techology Lud Uiversity z-trasforms We defie the z-trasform
More informationPractical Spectral Anaysis (continue) (from Boaz Porat s book) Frequency Measurement
Practical Spectral Aaysis (cotiue) (from Boaz Porat s book) Frequecy Measuremet Oe of the most importat applicatios of the DFT is the measuremet of frequecies of periodic sigals (eg., siusoidal sigals),
More informationx[0] x[1] x[2] Figure 2.1 Graphical representation of a discrete-time signal.
x[ ] x[ ] x[] x[] x[] x[] 9 8 7 6 5 4 3 3 4 5 6 7 8 9 Figure. Graphical represetatio of a discrete-time sigal. From Discrete-Time Sigal Processig, e by Oppeheim, Schafer, ad Buck 999- Pretice Hall, Ic.
More informationThe z-transform. 7.1 Introduction. 7.2 The z-transform Derivation of the z-transform: x[n] = z n LTI system, h[n] z = re j
The -Trasform 7. Itroductio Geeralie the complex siusoidal represetatio offered by DTFT to a represetatio of complex expoetial sigals. Obtai more geeral characteristics for discrete-time LTI systems. 7.
More informationTemplate matching. s[x,y] t[x,y] Problem: locate an object, described by a template t[x,y], in the image s[x,y] Example
Template matchig Problem: locate a object, described by a template t[x,y], i the image s[x,y] Example t[x,y] s[x,y] Digital Image Processig: Berd Girod, 013-018 Staford Uiversity -- Template Matchig 1
More informationSignal Processing in Mechatronics. Lecture 3, Convolution, Fourier Series and Fourier Transform
Sigal Processig i Mechatroics Summer semester, 1 Lecture 3, Covolutio, Fourier Series ad Fourier rasform Dr. Zhu K.P. AIS, UM 1 1. Covolutio Covolutio Descriptio of LI Systems he mai premise is that the
More informationQuestion1 Multiple choices (circle the most appropriate one):
Philadelphia Uiversity Studet Name: Faculty of Egieerig Studet Number: Dept. of Computer Egieerig Fial Exam, First Semester: 2014/2015 Course Title: Digital Sigal Aalysis ad Processig Date: 01/02/2015
More informationSignals & Systems Chapter3
Sigals & Systems Chapter3 1.2 Discrete-Time (D-T) Sigals Electroic systems do most of the processig of a sigal usig a computer. A computer ca t directly process a C-T sigal but istead eeds a stream of
More informationDiscrete-Time Signals and Systems. Signals and Systems. Digital Signals. Discrete-Time Signals. Operations on Sequences: Basic Operations
-6.3 Digital Sigal Processig ad Filterig..8 Discrete-ime Sigals ad Systems ime-domai Represetatios of Discrete-ime Sigals ad Systems ime-domai represetatio of a discrete-time sigal as a sequece of umbers
More informationChapter 7 z-transform
Chapter 7 -Trasform Itroductio Trasform Uilateral Trasform Properties Uilateral Trasform Iversio of Uilateral Trasform Determiig the Frequecy Respose from Poles ad Zeros Itroductio Role i Discrete-Time
More informationFFTs in Graphics and Vision. The Fast Fourier Transform
FFTs i Graphics ad Visio The Fast Fourier Trasform 1 Outlie The FFT Algorithm Applicatios i 1D Multi-Dimesioal FFTs More Applicatios Real FFTs 2 Computatioal Complexity To compute the movig dot-product
More informationEEO 401 Digital Signal Processing Prof. Mark Fowler
EEO 40 Digital Sigal Processig Prof. Mark Fowler Note Set #3 Covolutio & Impulse Respose Review Readig Assigmet: Sect. 2.3 of Proakis & Maolakis / Covolutio for LTI D-T systems We are tryig to fid y(t)
More informationELEG 4603/5173L Digital Signal Processing Ch. 1 Discrete-Time Signals and Systems
Departmet of Electrical Egieerig Uiversity of Arasas ELEG 4603/5173L Digital Sigal Processig Ch. 1 Discrete-Time Sigals ad Systems Dr. Jigxia Wu wuj@uar.edu OUTLINE 2 Classificatios of discrete-time sigals
More informationELEG3503 Introduction to Digital Signal Processing
ELEG3503 Itroductio to Digital Sigal Processig 1 Itroductio 2 Basics of Sigals ad Systems 3 Fourier aalysis 4 Samplig 5 Liear time-ivariat (LTI) systems 6 z-trasform 7 System Aalysis 8 System Realizatio
More informationLesson 10: Limits and Continuity
www.scimsacademy.com Lesso 10: Limits ad Cotiuity SCIMS Academy 1 Limit of a fuctio The cocept of limit of a fuctio is cetral to all other cocepts i calculus (like cotiuity, derivative, defiite itegrals
More informationChapter 7: The z-transform. Chih-Wei Liu
Chapter 7: The -Trasform Chih-Wei Liu Outlie Itroductio The -Trasform Properties of the Regio of Covergece Properties of the -Trasform Iversio of the -Trasform The Trasfer Fuctio Causality ad Stability
More information2D DSP Basics: 2D Systems
- Digital Image Processig ad Compressio D DSP Basics: D Systems D Systems T[ ] y = T [ ] Liearity Additivity: If T y = T [ ] The + T y = y + y Homogeeity: If The T y = T [ ] a T y = ay = at [ ] Liearity
More informationOlli Simula T / Chapter 1 3. Olli Simula T / Chapter 1 5
Sigals ad Systems Sigals ad Systems Sigals are variables that carry iformatio Systemstake sigals as iputs ad produce sigals as outputs The course deals with the passage of sigals through systems T-6.4
More informationThe Z-Transform. (t-t 0 ) Figure 1: Simplified graph of an impulse function. For an impulse, it can be shown that (1)
The Z-Trasform Sampled Data The geeralied fuctio (t) (also kow as the impulse fuctio) is useful i the defiitio ad aalysis of sampled-data sigals. Figure below shows a simplified graph of a impulse. (t-t
More informationFilter banks. Separately, the lowpass and highpass filters are not invertible. removes the highest frequency 1/ 2and
Filter bas Separately, the lowpass ad highpass filters are ot ivertible T removes the highest frequecy / ad removes the lowest frequecy Together these filters separate the sigal ito low-frequecy ad high-frequecy
More informationFinite-length Discrete Transforms. Chapter 5, Sections
Fiite-legth Discrete Trasforms Chapter 5, Sectios 5.2-50 5.0 Dr. Iyad djafar Outlie The Discrete Fourier Trasform (DFT) Matrix Represetatio of DFT Fiite-legth Sequeces Circular Covolutio DFT Symmetry Properties
More information6.003 Homework #3 Solutions
6.00 Homework # Solutios Problems. Complex umbers a. Evaluate the real ad imagiary parts of j j. π/ Real part = Imagiary part = 0 e Euler s formula says that j = e jπ/, so jπ/ j π/ j j = e = e. Thus the
More informationAnalog and Digital Signals. Introduction to Digital Signal Processing. Discrete-time Sinusoids. Analog and Digital Signals
Itroductio to Digital Sigal Processig Chapter : Itroductio Aalog ad Digital Sigals aalog = cotiuous-time cotiuous amplitude digital = discrete-time discrete amplitude cotiuous amplitude discrete amplitude
More informationB = B is a 3 4 matrix; b 32 = 3 and b 2 4 = 3. Scalar Multiplication
MATH 37 Matrices Dr. Neal, WKU A m matrix A = (a i j ) is a array of m umbers arraged ito m rows ad colums, where a i j is the etry i the ith row, jth colum. The values m are called the dimesios (or size)
More informationWeb Appendix O - Derivations of the Properties of the z Transform
M. J. Roberts - 2/18/07 Web Appedix O - Derivatios of the Properties of the z Trasform O.1 Liearity Let z = x + y where ad are costats. The ( z)= ( x + y )z = x z + y z ad the liearity property is O.2
More informationChapter 8. DFT : The Discrete Fourier Transform
Chapter 8 DFT : The Discrete Fourier Trasform Roots of Uity Defiitio: A th root of uity is a complex umber x such that x The th roots of uity are: ω, ω,, ω - where ω e π /. Proof: (ω ) (e π / ) (e π )
More informationCEE 522 Autumn Uncertainty Concepts for Geotechnical Engineering
CEE 5 Autum 005 Ucertaity Cocepts for Geotechical Egieerig Basic Termiology Set A set is a collectio of (mutually exclusive) objects or evets. The sample space is the (collectively exhaustive) collectio
More informationELEC1200: A System View of Communications: from Signals to Packets Lecture 3
ELEC2: A System View of Commuicatios: from Sigals to Packets Lecture 3 Commuicatio chaels Discrete time Chael Modelig the chael Liear Time Ivariat Systems Step Respose Respose to sigle bit Respose to geeral
More informationAPPENDIX F Complex Numbers
APPENDIX F Complex Numbers Operatios with Complex Numbers Complex Solutios of Quadratic Equatios Polar Form of a Complex Number Powers ad Roots of Complex Numbers Operatios with Complex Numbers Some equatios
More informationThe Discrete Fourier Transform
The iscrete Fourier Trasform The discrete-time Fourier trasform (TFT) of a sequece is a cotiuous fuctio of!, ad repeats with period. I practice we usually wat to obtai the Fourier compoets usig digital
More informationSolutions. Number of Problems: 4. None. Use only the prepared sheets for your solutions. Additional paper is available from the supervisors.
Quiz November 4th, 23 Sigals & Systems (5-575-) P. Reist & Prof. R. D Adrea Solutios Exam Duratio: 4 miutes Number of Problems: 4 Permitted aids: Noe. Use oly the prepared sheets for your solutios. Additioal
More informationTime-Domain Representations of LTI Systems
2.1 Itroductio Objectives: 1. Impulse resposes of LTI systems 2. Liear costat-coefficiets differetial or differece equatios of LTI systems 3. Bloc diagram represetatios of LTI systems 4. State-variable
More informationFrequency Response of FIR Filters
EEL335: Discrete-Time Sigals ad Systems. Itroductio I this set of otes, we itroduce the idea of the frequecy respose of LTI systems, ad focus specifically o the frequecy respose of FIR filters.. Steady-state
More informationECE-S352 Introduction to Digital Signal Processing Lecture 3A Direct Solution of Difference Equations
ECE-S352 Itroductio to Digital Sigal Processig Lecture 3A Direct Solutio of Differece Equatios Discrete Time Systems Described by Differece Equatios Uit impulse (sample) respose h() of a DT system allows
More informationCHAPTER I: Vector Spaces
CHAPTER I: Vector Spaces Sectio 1: Itroductio ad Examples This first chapter is largely a review of topics you probably saw i your liear algebra course. So why cover it? (1) Not everyoe remembers everythig
More information3. Z Transform. Recall that the Fourier transform (FT) of a DT signal xn [ ] is ( ) [ ] = In order for the FT to exist in the finite magnitude sense,
3. Z Trasform Referece: Etire Chapter 3 of text. Recall that the Fourier trasform (FT) of a DT sigal x [ ] is ω ( ) [ ] X e = j jω k = xe I order for the FT to exist i the fiite magitude sese, S = x [
More informationMedian and IQR The median is the value which divides the ordered data values in half.
STA 666 Fall 2007 Web-based Course Notes 4: Describig Distributios Numerically Numerical summaries for quatitative variables media ad iterquartile rage (IQR) 5-umber summary mea ad stadard deviatio Media
More informationDiscrete-Time Signals and Systems. Discrete-Time Signals and Systems. Signal Symmetry. Elementary Discrete-Time Signals.
Discrete-ime Sigals ad Systems Discrete-ime Sigals ad Systems Dr. Deepa Kudur Uiversity of oroto Referece: Sectios. -.5 of Joh G. Proakis ad Dimitris G. Maolakis, Digital Sigal Processig: Priciples, Algorithms,
More informationTEACHER CERTIFICATION STUDY GUIDE
COMPETENCY 1. ALGEBRA SKILL 1.1 1.1a. ALGEBRAIC STRUCTURES Kow why the real ad complex umbers are each a field, ad that particular rigs are ot fields (e.g., itegers, polyomial rigs, matrix rigs) Algebra
More informationGEORGIA INSTITUTE OF TECHNOLOGY SCHOOL OF ELECTRICAL AND COMPUTER ENGINEERING
GEORGIA INSTITUTE OF TECHNOLOGY SCHOOL OF ELECTRICAL AND COMPUTER ENGINEERING ECE 06 Summer 07 Problem Set #5 Assiged: Jue 3, 07 Due Date: Jue 30, 07 Readig: Chapter 5 o FIR Filters. PROBLEM 5..* (The
More informationEECS564 Estimation, Filtering, and Detection Hwk 2 Solns. Winter p θ (z) = (2θz + 1 θ), 0 z 1
EECS564 Estimatio, Filterig, ad Detectio Hwk 2 Sols. Witer 25 4. Let Z be a sigle observatio havig desity fuctio where. p (z) = (2z + ), z (a) Assumig that is a oradom parameter, fid ad plot the maximum
More informationZ - Transform. It offers the techniques for digital filter design and frequency analysis of digital signals.
Z - Trasform The -trasform is a very importat tool i describig ad aalyig digital systems. It offers the techiques for digital filter desig ad frequecy aalysis of digital sigals. Defiitio of -trasform:
More informationCALCULUS BASIC SUMMER REVIEW
CALCULUS BASIC SUMMER REVIEW NAME rise y y y Slope of a o vertical lie: m ru Poit Slope Equatio: y y m( ) The slope is m ad a poit o your lie is, ). ( y Slope-Itercept Equatio: y m b slope= m y-itercept=
More informationADVANCED DIGITAL SIGNAL PROCESSING
ADVANCED DIGITAL SIGNAL PROCESSING PROF. S. C. CHAN (email : sccha@eee.hku.hk, Rm. CYC-702) DISCRETE-TIME SIGNALS AND SYSTEMS MULTI-DIMENSIONAL SIGNALS AND SYSTEMS RANDOM PROCESSES AND APPLICATIONS ADAPTIVE
More informationRun-length & Entropy Coding. Redundancy Removal. Sampling. Quantization. Perform inverse operations at the receiver EEE
Geeral e Image Coder Structure Motio Video (s 1,s 2,t) or (s 1,s 2 ) Natural Image Samplig A form of data compressio; usually lossless, but ca be lossy Redudacy Removal Lossless compressio: predictive
More informationEE / EEE SAMPLE STUDY MATERIAL. GATE, IES & PSUs Signal System. Electrical Engineering. Postal Correspondence Course
Sigal-EE Postal Correspodece Course 1 SAMPLE STUDY MATERIAL Electrical Egieerig EE / EEE Postal Correspodece Course GATE, IES & PSUs Sigal System Sigal-EE Postal Correspodece Course CONTENTS 1. SIGNAL
More information1 of 7 7/16/2009 6:06 AM Virtual Laboratories > 6. Radom Samples > 1 2 3 4 5 6 7 6. Order Statistics Defiitios Suppose agai that we have a basic radom experimet, ad that X is a real-valued radom variable
More informationDigital signal processing: Lecture 5. z-transformation - I. Produced by Qiangfu Zhao (Since 1995), All rights reserved
Digital sigal processig: Lecture 5 -trasformatio - I Produced by Qiagfu Zhao Sice 995, All rights reserved DSP-Lec5/ Review of last lecture Fourier trasform & iverse Fourier trasform: Time domai & Frequecy
More informationStatistical Noise Models and Diagnostics
L. Yaroslavsky: Advaced Image Processig Lab: A Tutorial, EUSIPCO2 LECTURE 2 Statistical oise Models ad Diagostics 2. Statistical models of radom iterfereces: (i) Additive sigal idepedet oise model: r =
More informationOptimum LMSE Discrete Transform
Image Trasformatio Two-dimesioal image trasforms are extremely importat areas of study i image processig. The image output i the trasformed space may be aalyzed, iterpreted, ad further processed for implemetig
More informationIt is always the case that unions, intersections, complements, and set differences are preserved by the inverse image of a function.
MATH 532 Measurable Fuctios Dr. Neal, WKU Throughout, let ( X, F, µ) be a measure space ad let (!, F, P ) deote the special case of a probability space. We shall ow begi to study real-valued fuctios defied
More informationCS / MCS 401 Homework 3 grader solutions
CS / MCS 401 Homework 3 grader solutios assigmet due July 6, 016 writte by Jāis Lazovskis maximum poits: 33 Some questios from CLRS. Questios marked with a asterisk were ot graded. 1 Use the defiitio of
More informationWavelet Transform and its relation to multirate filter banks
Wavelet Trasform ad its relatio to multirate filter bas Christia Walliger ASP Semiar th Jue 007 Graz Uiversity of Techology, Austria Professor Georg Holzma, Horst Cerja, Christia 9..005 Walliger.06.07
More informationFrequency Domain Filtering
Frequecy Domai Filterig Raga Rodrigo October 19, 2010 Outlie Cotets 1 Itroductio 1 2 Fourier Represetatio of Fiite-Duratio Sequeces: The Discrete Fourier Trasform 1 3 The 2-D Discrete Fourier Trasform
More informationComplex Numbers Solutions
Complex Numbers Solutios Joseph Zoller February 7, 06 Solutios. (009 AIME I Problem ) There is a complex umber with imagiary part 64 ad a positive iteger such that Fid. [Solutio: 697] 4i + + 4i. 4i 4i
More information62. Power series Definition 16. (Power series) Given a sequence {c n }, the series. c n x n = c 0 + c 1 x + c 2 x 2 + c 3 x 3 +
62. Power series Defiitio 16. (Power series) Give a sequece {c }, the series c x = c 0 + c 1 x + c 2 x 2 + c 3 x 3 + is called a power series i the variable x. The umbers c are called the coefficiets of
More informationParallel Vector Algorithms David A. Padua
Parallel Vector Algorithms 1 of 32 Itroductio Next, we study several algorithms where parallelism ca be easily expressed i terms of array operatios. We will use Fortra 90 to represet these algorithms.
More informationChapter 6 Infinite Series
Chapter 6 Ifiite Series I the previous chapter we cosidered itegrals which were improper i the sese that the iterval of itegratio was ubouded. I this chapter we are goig to discuss a topic which is somewhat
More informationAppendix F: Complex Numbers
Appedix F Complex Numbers F1 Appedix F: Complex Numbers Use the imagiary uit i to write complex umbers, ad to add, subtract, ad multiply complex umbers. Fid complex solutios of quadratic equatios. Write
More informationAddition: Property Name Property Description Examples. a+b = b+a. a+(b+c) = (a+b)+c
Notes for March 31 Fields: A field is a set of umbers with two (biary) operatios (usually called additio [+] ad multiplicatio [ ]) such that the followig properties hold: Additio: Name Descriptio Commutativity
More informationLecture Notes for Analysis Class
Lecture Notes for Aalysis Class Topological Spaces A topology for a set X is a collectio T of subsets of X such that: (a) X ad the empty set are i T (b) Uios of elemets of T are i T (c) Fiite itersectios
More informationDigital Signal Processing, Fall 2006
Digital Sigal Processig, Fall 26 Lecture 1: Itroductio, Discrete-time sigals ad systems Zheg-Hua Ta Departmet of Electroic Systems Aalborg Uiversity, Demark zt@kom.aau.dk 1 Part I: Itroductio Itroductio
More informationChapter 1. Complex Numbers. Dr. Pulak Sahoo
Chapter 1 Complex Numbers BY Dr. Pulak Sahoo Assistat Professor Departmet of Mathematics Uiversity Of Kalyai West Begal, Idia E-mail : sahoopulak1@gmail.com 1 Module-2: Stereographic Projectio 1 Euler
More informationECON 3150/4150, Spring term Lecture 3
Itroductio Fidig the best fit by regressio Residuals ad R-sq Regressio ad causality Summary ad ext step ECON 3150/4150, Sprig term 2014. Lecture 3 Ragar Nymoe Uiversity of Oslo 21 Jauary 2014 1 / 30 Itroductio
More informationChapter 0. Review of set theory. 0.1 Sets
Chapter 0 Review of set theory Set theory plays a cetral role i the theory of probability. Thus, we will ope this course with a quick review of those otios of set theory which will be used repeatedly.
More information4.1 Sigma Notation and Riemann Sums
0 the itegral. Sigma Notatio ad Riema Sums Oe strategy for calculatig the area of a regio is to cut the regio ito simple shapes, calculate the area of each simple shape, ad the add these smaller areas
More informationSignal Processing. Lecture 02: Discrete Time Signals and Systems. Ahmet Taha Koru, Ph. D. Yildiz Technical University.
Sigal Processig Lecture 02: Discrete Time Sigals ad Systems Ahmet Taha Koru, Ph. D. Yildiz Techical Uiversity 2017-2018 Fall ATK (YTU) Sigal Processig 2017-2018 Fall 1 / 51 Discrete Time Sigals Discrete
More informationPAPER : IIT-JAM 2010
MATHEMATICS-MA (CODE A) Q.-Q.5: Oly oe optio is correct for each questio. Each questio carries (+6) marks for correct aswer ad ( ) marks for icorrect aswer.. Which of the followig coditios does NOT esure
More information(3) If you replace row i of A by its sum with a multiple of another row, then the determinant is unchanged! Expand across the i th row:
Math 5-4 Tue Feb 4 Cotiue with sectio 36 Determiats The effective way to compute determiats for larger-sized matrices without lots of zeroes is to ot use the defiitio, but rather to use the followig facts,
More informationFall 2011, EE123 Digital Signal Processing
Lecture 5 Miki Lustig, UCB September 14, 211 Miki Lustig, UCB Motivatios for Discrete Fourier Trasform Sampled represetatio i time ad frequecy umerical Fourier aalysis requires a Fourier represetatio that
More informationDefinition of z-transform.
- Trasforms Frequecy domai represetatios of discretetime sigals ad LTI discrete-time systems are made possible with the use of DTFT. However ot all discrete-time sigals e.g. uit step sequece are guarateed
More informationRandom Variables, Sampling and Estimation
Chapter 1 Radom Variables, Samplig ad Estimatio 1.1 Itroductio This chapter will cover the most importat basic statistical theory you eed i order to uderstad the ecoometric material that will be comig
More informationIntroduction to Signals and Systems, Part V: Lecture Summary
EEL33: Discrete-Time Sigals ad Systems Itroductio to Sigals ad Systems, Part V: Lecture Summary Itroductio to Sigals ad Systems, Part V: Lecture Summary So far we have oly looked at examples of o-recursive
More informationPrinciple Of Superposition
ecture 5: PREIMINRY CONCEP O RUCUR NYI Priciple Of uperpositio Mathematically, the priciple of superpositio is stated as ( a ) G( a ) G( ) G a a or for a liear structural system, the respose at a give
More informationSIGNALS AND SYSTEMS I Computer Assignment 1
SIGNALS AND SYSTEMS I Computer Assigmet I MATLAB, sigals are represeted by colum vectors or as colums i matrices. Row vectors ca be used; however, MATLAB typically prefers colum vectors. Vector or matrices
More informationSensitivity Analysis of Daubechies 4 Wavelet Coefficients for Reduction of Reconstructed Image Error
Proceedigs of the 6th WSEAS Iteratioal Coferece o SIGNAL PROCESSING, Dallas, Texas, USA, March -4, 7 67 Sesitivity Aalysis of Daubechies 4 Wavelet Coefficiets for Reductio of Recostructed Image Error DEVINDER
More informationDigital Signal Processing
Digital Sigal Processig Z-trasform dftwave -Trasform Backgroud-Defiitio - Fourier trasform j ω j ω e x e extracts the essece of x but is limited i the sese that it ca hadle stable systems oly. jω e coverges
More informationModule 18 Discrete Time Signals and Z-Transforms Objective: Introduction : Description: Discrete Time Signal representation
Module 8 Discrete Time Sigals ad Z-Trasforms Objective:To uderstad represetig discrete time sigals, apply z trasform for aalyzigdiscrete time sigals ad to uderstad the relatio to Fourier trasform Itroductio
More informationA sequence of numbers is a function whose domain is the positive integers. We can see that the sequence
Sequeces A sequece of umbers is a fuctio whose domai is the positive itegers. We ca see that the sequece,, 2, 2, 3, 3,... is a fuctio from the positive itegers whe we write the first sequece elemet as
More information6.003 Homework #12 Solutions
6.003 Homework # Solutios Problems. Which are rue? For each of the D sigals x [] through x 4 [] (below), determie whether the coditios listed i the followig table are satisfied, ad aswer for true or F
More informationMultiresolution coding and wavelets. Interpolation error coding, I
Multiresolutio codig ad wavelets Predictive (closed-loop) pyramids Ope-loop ( Laplacia ) pyramids Discrete Wavelet Trasform (DWT) Quadrature mirror filters ad cojugate quadrature filters Liftig ad reversible
More informationa for a 1 1 matrix. a b a b 2 2 matrix: We define det ad bc 3 3 matrix: We define a a a a a a a a a a a a a a a a a a
Math E-2b Lecture #8 Notes This week is all about determiats. We ll discuss how to defie them, how to calculate them, lear the allimportat property kow as multiliearity, ad show that a square matrix A
More informationA. Basics of Discrete Fourier Transform
A. Basics of Discrete Fourier Trasform A.1. Defiitio of Discrete Fourier Trasform (8.5) A.2. Properties of Discrete Fourier Trasform (8.6) A.3. Spectral Aalysis of Cotiuous-Time Sigals Usig Discrete Fourier
More informationM2.The Z-Transform and its Properties
M2.The Z-Trasform ad its Properties Readig Material: Page 94-126 of chapter 3 3/22/2011 I. Discrete-Time Sigals ad Systems 1 What did we talk about i MM1? MM1 - Discrete-Time Sigal ad System 3/22/2011
More informationSignals and Systems. Problem Set: From Continuous-Time to Discrete-Time
Sigals ad Systems Problem Set: From Cotiuous-Time to Discrete-Time Updated: October 5, 2017 Problem Set Problem 1 - Liearity ad Time-Ivariace Cosider the followig systems ad determie whether liearity ad
More informationPolynomial Functions and Their Graphs
Polyomial Fuctios ad Their Graphs I this sectio we begi the study of fuctios defied by polyomial expressios. Polyomial ad ratioal fuctios are the most commo fuctios used to model data, ad are used extesively
More informationPRELIM PROBLEM SOLUTIONS
PRELIM PROBLEM SOLUTIONS THE GRAD STUDENTS + KEN Cotets. Complex Aalysis Practice Problems 2. 2. Real Aalysis Practice Problems 2. 4 3. Algebra Practice Problems 2. 8. Complex Aalysis Practice Problems
More informationSpectral Analysis. This week in lab. Next classes: 3/26 and 3/28. Your next experiment Homework is to prepare
Spectral Aalysis This week i lab Your ext experimet Homework is to prepare Next classes: 3/26 ad 3/28 Aero Testig, Fracture Toughess Testig Read the Experimets 5 ad 7 sectios of the course maual Spectral
More informationFurther Concepts for Advanced Mathematics (FP1) MONDAY 2 JUNE 2008
ADVANCED SUBSIDIARY GCE 4755/0 MATHEMATICS (MEI) Further Cocepts for Advaced Mathematics (FP) MONDAY JUNE 008 Additioal materials: Aswer Booklet (8 pages) Graph paper MEI Examiatio Formulae ad Tables (MF)
More informationChimica Inorganica 3
himica Iorgaica Irreducible Represetatios ad haracter Tables Rather tha usig geometrical operatios, it is ofte much more coveiet to employ a ew set of group elemets which are matrices ad to make the rule
More informationLecture 3 The Lebesgue Integral
Lecture 3: The Lebesgue Itegral 1 of 14 Course: Theory of Probability I Term: Fall 2013 Istructor: Gorda Zitkovic Lecture 3 The Lebesgue Itegral The costructio of the itegral Uless expressly specified
More informationR is a scalar defined as follows:
Math 8. Notes o Dot Product, Cross Product, Plaes, Area, ad Volumes This lecture focuses primarily o the dot product ad its may applicatios, especially i the measuremet of agles ad scalar projectio ad
More informationIn number theory we will generally be working with integers, though occasionally fractions and irrationals will come into play.
Number Theory Math 5840 otes. Sectio 1: Axioms. I umber theory we will geerally be workig with itegers, though occasioally fractios ad irratioals will come ito play. Notatio: Z deotes the set of all itegers
More information