Wiener Filter for Deterministic Blur Model
|
|
- Malcolm Sutton
- 5 years ago
- Views:
Transcription
1 Wiener Filter for Deterministic Blur Model Based on Ch. 5 of Gonzalez & Woods, Digital Image Processing, nd Ed., Addison-Wesley, 00 One common application of the Wiener filter has been in the area of simultaneous de-blurring and de-noising of an image. From Section 5.5: ff(xx, yy) is the original image (-D signal of xx, yy spatial variables) Observed image is g xy, = H f xy, + nxy (, ) Observed Image Blur Operator Original Image -D Random Noise If there were only blurring seek to find inverse of H If there were only noise seek a filter that passes image & removes some noise The Wiener filter seeks to optimally balance these two issues! 1
2 LSI Blur Model (Section 5.5) Common model for the blur operator is Linear Shift-Invariant (LSI): (, ) + (, ) = (, ) + (, ) Haf xy af xy ahf xy ahf xy Linearity (, ) = (, ) Hf xy f xy ( α, β) = ( α, β) in out H fin x y fout x y Shift Inv. An LSI system can be described by its impulse response: (, ) (, ) H δ xy hxy Also called Linear Position-Invariant (LPI) Then the output is expressed as a -D convolution: (, ) = (, ) (, ) H f xy hx αy β f αβ dαdβ This is a continuousspace version it is possible to do the same for discrete-space version
3 Now our blurred image model is: blur (, ) = (, ) (, ) f xy hx αy β f αβ dαdβ Taking the -D Fourier transform of the above model gives blur (, ) = (, ) (, ) F uv H uv F uv Where the -D Fourier transforms are given by (, ) (, ) jπ ( ux+ vy) = (, ) (, ) F u v f x y e dxdy jπ ( ux+ vy) H u v h x y e dxdy = Frequency Response of Blur Note that in principle if we know HH uu, vv then we can use the inverse filter to recover the original image (, ) F uv = Fblur ( uv, ) (, ) H uv 3
4 Blur Caused by Planar Motion (see Section 5.6.3) A common blur model is that due to planar motion while the camera s aperture is open during time interval [0,T]. This means that during [0,T] the image moves in the x and y directions according to functions xx 0 (tt) and yy 0 (tt) Then our observed image model is: (, ) = ( (), ()) + (, ) g xy f x x t y y t dt nxy 0 0 Converting to frequency domain gives (see Gonzalez & Woods for steps): with (, ) (, ) = (, ) (, ) + (, ) G uv H uv F uv N uv T [ ] j ux0() t vy0() t H u v e π + dt = 0 4
5 Blur Caused by Uniform Linear Motion (see Section 5.6.3) This is planar motion with constant speed in each direction: xx 0 tt = aaaa TT and yy 0 (tt) = bbtt TT Then the blur s frequency response is two sincs: ( ua + vb) ( ua + vb) sin π j ( ua vb) π + H( uv, ) = T e π So this is like a -D lowpass filter! Original Image Blurred Image w/ aa = bb = , TT = 11 5
6 Blurred and Noisy Image Now our observed image model is: -D WSS Noise Process (, ) = ( α, β) ( αβ, ) α β+ (, ) g xy hx y f d d nxy Taking the -D Fourier transform of the above model gives (, ) = (, ) (, ) + (, ) G uv H uv F uv N uv Solving this using the Inverse Filtering Viewpoint gives G uv, N uv, F( uv, ) = = F( uv, ) + H uv, H uv, This can exacerbate the noise when HH(uu, vv) is 0 or small at some frequencies! The inverse filter focuses on the de-blurring The Wiener filter seeks to optimally balance these two issues. We will solve the Wiener filter in this Frequency-Domain view 6
7 Wiener Filter for Blurred & Noisy Images (see Sect. 5.8) Without going into the details we will borrow the frequencydomain view we saw for the IIR Wiener smoother. Recall. x[n] = s[n] + w[n] No Blurring Pss ( f ) + S f = X f Pss f Pww f Accounting for the blurring and the change to -D gives (, ) = (, ) (, ) + (, ) G uv H uv F uv N uv Must Know! * H ( uv, ) Pff ( uv, ) F( uv, ) = H( uv, ) Pff ( uv, ) + Pnn ( uv, ) PP ffff (uu, vv) = Power Spectral Density of Image PP nnnn (uu, vv) = Power Spectral Density of Noise Bayesian!! Thing we are estimating is modeled as random! 7
8 In practice our knowledge needed varies: HH(uu, vv) might be reasonably well known PP nnnn (uu, vv) might be quite well known PP ffff (uu, vv) might NOT be known at all! E.g., white noise PP nnnn uu, vv = NN oo (constant) Then re-arranging gives F( uv) * H ( uv, ), = H( uv, ) + No Pff ( uv, ) A common trick is to replace this term by a constant K: * H ( uv, ) F( uv, ) = H( uv, ) + K then the value of K is chosen interactively to give the best result. (So this is an off-line approach). With enough attention to detail, this approach can be implemented using the FFT algorithm and applied to discrete images. 8
9 Results for Wiener Filter (sect. 5.8 of Gonzalez and Woods) Blurred & Noisy Inverse Filter Wiener Filter Original Image Increasing Noise Variance Uniform Blurred Image w/ aa = bb = , TT = 11 9
10 Iterative Wiener Filter (Not in Gonzalez and Woods) Start by using the above solution: * H ( uv, ) F0 ( uv, ) = H( uv, ) + K Now use that estimate image to estimate the PSD of the image F uv, P uv, 0 ff,0 Re-Estimate image using F( uv) Iterate: F uv, P uv, n ff, n Lots of literature on how to estimate the PSD of a WSS process * H ( uv, ) 1, = H( uv, ) + No Pff,0 ( uv, ) * H ( uv, ) Fn + 1 uv, = H( uv, ) + No Pff, n ( uv, ) 10
11 Alternate View (not in Gonzalez and Woods) An alternate view is a discrete-image, space-domain approach: H is blurring matrix formed to provide equivalent of D conv g = Hf + n f is vector formed by stacking columns of discrete image RR ffff = Correlation Matrix of Image s Vector f RR nnnn = Correlation Matrix of Noise s Vector n Recall our general Wiener smoothing with vector parameter: x = s+ w s = R ss ( R ss + R ww [ N N][ N N][ N 1] Modifying this to handle the blurring matrix gives T T = ff ff + nn ) 1 x 1 f R H HR H R g g & n vectors defined similarly Compare to previous Freq. Domain result: * H ( uv, ) Pff ( uv, ) F( uv, ) = H( uv, ) Pff ( uv, ) + Pnn ( uv, ) 11
12 Iterative Version of Alternate View (not in Gonzalez and Woods) Initial Filtering: Use g to get estimate RR gggg Use it to approximate RR ffff,00 = RR gggg Use that in place of RR ffff in filter to get ff 00 Iteration for n = 1,, 3, : Use ff nn 11 to estimate RR ffff,nn+11 Use RR ffff,nn+11 in filter to get ff nn Lots of literature on how to estimate the Correlation Matrix of a WSS process 1
Image Degradation Model (Linear/Additive)
Image Degradation Model (Linear/Additive),,,,,,,, g x y h x y f x y x y G uv H uv F uv N uv 1 Source of noise Image acquisition (digitization) Image transmission Spatial properties of noise Statistical
More informationINTRODUCTION Noise is present in many situations of daily life for ex: Microphones will record noise and speech. Goal: Reconstruct original signal Wie
WIENER FILTERING Presented by N.Srikanth(Y8104060), M.Manikanta PhaniKumar(Y8104031). INDIAN INSTITUTE OF TECHNOLOGY KANPUR Electrical Engineering dept. INTRODUCTION Noise is present in many situations
More informationProf. Dr.-Ing. Armin Dekorsy Department of Communications Engineering. Stochastic Processes and Linear Algebra Recap Slides
Prof. Dr.-Ing. Armin Dekorsy Department of Communications Engineering Stochastic Processes and Linear Algebra Recap Slides Stochastic processes and variables XX tt 0 = XX xx nn (tt) xx 2 (tt) XX tt XX
More informationMIT 2.71/2.710 Optics 10/31/05 wk9-a-1. The spatial frequency domain
10/31/05 wk9-a-1 The spatial frequency domain Recall: plane wave propagation x path delay increases linearly with x λ z=0 θ E 0 x exp i2π sinθ + λ z i2π cosθ λ z plane of observation 10/31/05 wk9-a-2 Spatial
More information13. Power Spectrum. For a deterministic signal x(t), the spectrum is well defined: If represents its Fourier transform, i.e., if.
For a deterministic signal x(t), the spectrum is well defined: If represents its Fourier transform, i.e., if jt X ( ) = xte ( ) dt, (3-) then X ( ) represents its energy spectrum. his follows from Parseval
More informationWorksheets for GCSE Mathematics. Algebraic Expressions. Mr Black 's Maths Resources for Teachers GCSE 1-9. Algebra
Worksheets for GCSE Mathematics Algebraic Expressions Mr Black 's Maths Resources for Teachers GCSE 1-9 Algebra Algebraic Expressions Worksheets Contents Differentiated Independent Learning Worksheets
More informationEmpirical Mean and Variance!
Global Image Properties! Global image properties refer to an image as a whole rather than components. Computation of global image properties is often required for image enhancement, preceding image analysis.!
More informationImage Degradation Model (Linear/Additive)
Image Degradation Model (Linear/Additive),,,,,,,, g x y f x y h x y x y G u v F u v H u v N u v 1 Source of noise Objects Impurities Image acquisition (digitization) Image transmission Spatial properties
More informationMath 171 Spring 2017 Final Exam. Problem Worth
Math 171 Spring 2017 Final Exam Problem 1 2 3 4 5 6 7 8 9 10 11 Worth 9 6 6 5 9 8 5 8 8 8 10 12 13 14 15 16 17 18 19 20 21 22 Total 8 5 5 6 6 8 6 6 6 6 6 150 Last Name: First Name: Student ID: Section:
More information1. The graph of a function f is given above. Answer the question: a. Find the value(s) of x where f is not differentiable. Ans: x = 4, x = 3, x = 2,
1. The graph of a function f is given above. Answer the question: a. Find the value(s) of x where f is not differentiable. x = 4, x = 3, x = 2, x = 1, x = 1, x = 2, x = 3, x = 4, x = 5 b. Find the value(s)
More informationEECE 2150 Circuits and Signals Final Exam Fall 2016 Dec 9
EECE 2150 Circuits and Signals Final Exam Fall 2016 Dec 9 Name: Instructions: Write your name and section number on all pages Closed book, closed notes; Computers and cell phones are not allowed You can
More informationConvolution Spatial Aliasing Frequency domain filtering fundamentals Applications Image smoothing Image sharpening
Frequency Domain Filtering Correspondence between Spatial and Frequency Filtering Fourier Transform Brief Introduction Sampling Theory 2 D Discrete Fourier Transform Convolution Spatial Aliasing Frequency
More informationCommunication Systems Lecture 21, 22. Dong In Kim School of Information & Comm. Eng. Sungkyunkwan University
Communication Systems Lecture 1, Dong In Kim School of Information & Comm. Eng. Sungkyunkwan University 1 Outline Linear Systems with WSS Inputs Noise White noise, Gaussian noise, White Gaussian noise
More informationEE538 Final Exam Fall 2007 Mon, Dec 10, 8-10 am RHPH 127 Dec. 10, Cover Sheet
EE538 Final Exam Fall 2007 Mon, Dec 10, 8-10 am RHPH 127 Dec. 10, 2007 Cover Sheet Test Duration: 120 minutes. Open Book but Closed Notes. Calculators allowed!! This test contains five problems. Each of
More informationWork, Energy, and Power. Chapter 6 of Essential University Physics, Richard Wolfson, 3 rd Edition
Work, Energy, and Power Chapter 6 of Essential University Physics, Richard Wolfson, 3 rd Edition 1 With the knowledge we got so far, we can handle the situation on the left but not the one on the right.
More informationSupport Vector Machines. CSE 4309 Machine Learning Vassilis Athitsos Computer Science and Engineering Department University of Texas at Arlington
Support Vector Machines CSE 4309 Machine Learning Vassilis Athitsos Computer Science and Engineering Department University of Texas at Arlington 1 A Linearly Separable Problem Consider the binary classification
More informationGrover s algorithm. We want to find aa. Search in an unordered database. QC oracle (as usual) Usual trick
Grover s algorithm Search in an unordered database Example: phonebook, need to find a person from a phone number Actually, something else, like hard (e.g., NP-complete) problem 0, xx aa Black box ff xx
More informationELEN E4810: Digital Signal Processing Topic 2: Time domain
ELEN E4810: Digital Signal Processing Topic 2: Time domain 1. Discrete-time systems 2. Convolution 3. Linear Constant-Coefficient Difference Equations (LCCDEs) 4. Correlation 1 1. Discrete-time systems
More informationProbability and Statistics for Final Year Engineering Students
Probability and Statistics for Final Year Engineering Students By Yoni Nazarathy, Last Updated: May 24, 2011. Lecture 6p: Spectral Density, Passing Random Processes through LTI Systems, Filtering Terms
More informationEE482: Digital Signal Processing Applications
Professor Brendan Morris, SEB 3216, brendan.morris@unlv.edu EE482: Digital Signal Processing Applications Spring 2014 TTh 14:30-15:45 CBC C222 Lecture 11 Adaptive Filtering 14/03/04 http://www.ee.unlv.edu/~b1morris/ee482/
More informationWorksheets for GCSE Mathematics. Quadratics. mr-mathematics.com Maths Resources for Teachers. Algebra
Worksheets for GCSE Mathematics Quadratics mr-mathematics.com Maths Resources for Teachers Algebra Quadratics Worksheets Contents Differentiated Independent Learning Worksheets Solving x + bx + c by factorisation
More informationTutorial 9 The Discrete Fourier Transform (DFT) SIPC , Spring 2017 Technion, CS Department
Tutorial 9 The Discrete Fourier Transform (DFT) SIPC 236327, Spring 2017 Technion, CS Department The DFT Matrix The DFT matrix of size M M is defined as DFT = 1 M W 0 0 W 0 W 0 W where W = e i2π M i =
More information10.4 The Cross Product
Math 172 Chapter 10B notes Page 1 of 9 10.4 The Cross Product The cross product, or vector product, is defined in 3 dimensions only. Let aa = aa 1, aa 2, aa 3 bb = bb 1, bb 2, bb 3 then aa bb = aa 2 bb
More informationEEM 409. Random Signals. Problem Set-2: (Power Spectral Density, LTI Systems with Random Inputs) Problem 1: Problem 2:
EEM 409 Random Signals Problem Set-2: (Power Spectral Density, LTI Systems with Random Inputs) Problem 1: Consider a random process of the form = + Problem 2: X(t) = b cos(2π t + ), where b is a constant,
More informationMassachusetts Institute of Technology Department of Electrical Engineering and Computer Science : Discrete-Time Signal Processing
Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science 6.34: Discrete-Time Signal Processing OpenCourseWare 006 ecture 8 Periodogram Reading: Sections 0.6 and 0.7
More informationComputer Vision & Digital Image Processing
Computer Vision & Digital Image Processing Image Restoration and Reconstruction I Dr. D. J. Jackson Lecture 11-1 Image restoration Restoration is an objective process that attempts to recover an image
More informationSecondary 3H Unit = 1 = 7. Lesson 3.3 Worksheet. Simplify: Lesson 3.6 Worksheet
Secondary H Unit Lesson Worksheet Simplify: mm + 2 mm 2 4 mm+6 mm + 2 mm 2 mm 20 mm+4 5 2 9+20 2 0+25 4 +2 2 + 2 8 2 6 5. 2 yy 2 + yy 6. +2 + 5 2 2 2 0 Lesson 6 Worksheet List all asymptotes, holes and
More information26. Filtering. ECE 830, Spring 2014
26. Filtering ECE 830, Spring 2014 1 / 26 Wiener Filtering Wiener filtering is the application of LMMSE estimation to recovery of a signal in additive noise under wide sense sationarity assumptions. Problem
More informationUCSD ECE 153 Handout #46 Prof. Young-Han Kim Thursday, June 5, Solutions to Homework Set #8 (Prepared by TA Fatemeh Arbabjolfaei)
UCSD ECE 53 Handout #46 Prof. Young-Han Kim Thursday, June 5, 04 Solutions to Homework Set #8 (Prepared by TA Fatemeh Arbabjolfaei). Discrete-time Wiener process. Let Z n, n 0 be a discrete time white
More information7.3 The Jacobi and Gauss-Seidel Iterative Methods
7.3 The Jacobi and Gauss-Seidel Iterative Methods 1 The Jacobi Method Two assumptions made on Jacobi Method: 1.The system given by aa 11 xx 1 + aa 12 xx 2 + aa 1nn xx nn = bb 1 aa 21 xx 1 + aa 22 xx 2
More informationLecture 19: Bayesian Linear Estimators
ECE 830 Fall 2010 Statistical Signal Processing instructor: R Nowa, scribe: I Rosado-Mendez Lecture 19: Bayesian Linear Estimators 1 Linear Minimum Mean-Square Estimator Suppose our data is set X R n,
More informationA A A A A A A A A A A A. a a a a a a a a a a a a a a a. Apples taste amazingly good.
Victorian Handwriting Sheet Aa A A A A A A A A A A A A Aa Aa Aa Aa Aa Aa Aa a a a a a a a a a a a a a a a Apples taste amazingly good. Apples taste amazingly good. Now make up a sentence of your own using
More informationProblem Value Score No/Wrong Rec
GEORGIA INSTITUTE OF TECHNOLOGY SCHOOL of ELECTRICAL & COMPUTER ENGINEERING QUIZ #2 DATE: 14-Oct-11 COURSE: ECE-225 NAME: GT username: LAST, FIRST (ex: gpburdell3) 3 points 3 points 3 points Recitation
More informationSystems of Linear Equations
Systems of Linear Equations As stated in Section G, Definition., a linear equation in two variables is an equation of the form AAAA + BBBB = CC, where AA and BB are not both zero. Such an equation has
More informationF.4 Solving Polynomial Equations and Applications of Factoring
section F4 243 F.4 Zero-Product Property Many application problems involve solving polynomial equations. In Chapter L, we studied methods for solving linear, or first-degree, equations. Solving higher
More informationModule 7 (Lecture 27) RETAINING WALLS
Module 7 (Lecture 27) RETAINING WALLS Topics 1.1 RETAINING WALLS WITH METALLIC STRIP REINFORCEMENT Calculation of Active Horizontal and vertical Pressure Tie Force Factor of Safety Against Tie Failure
More informationELEG 3143 Probability & Stochastic Process Ch. 6 Stochastic Process
Department of Electrical Engineering University of Arkansas ELEG 3143 Probability & Stochastic Process Ch. 6 Stochastic Process Dr. Jingxian Wu wuj@uark.edu OUTLINE 2 Definition of stochastic process (random
More informationMassachusetts Institute of Technology
Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science 6.011: Introduction to Communication, Control and Signal Processing QUIZ, April 1, 010 QUESTION BOOKLET Your
More informationIntroduction to the Discrete Fourier Transform
Introduction to the Discrete ourier Transform Lucas J. van Vliet www.ph.tn.tudelft.nl/~lucas TNW: aculty of Applied Sciences IST: Imaging Science and technology PH: Linear Shift Invariant System A discrete
More informationDigital Image Processing. Filtering in the Frequency Domain
2D Linear Systems 2D Fourier Transform and its Properties The Basics of Filtering in Frequency Domain Image Smoothing Image Sharpening Selective Filtering Implementation Tips 1 General Definition: System
More informationCH 61 USING THE GCF IN EQUATIONS AND FORMULAS
CH 61 USING THE GCF IN EQUATIONS AND FORMULAS Introduction A while back we studied the Quadratic Formula and used it to solve quadratic equations such as x 5x + 6 = 0; we were also able to solve rectangle
More informationEECE 2150 Circuits and Signals Final Exam Fall 2016 Dec 12
EECE 2150 Circuits and Signals Final Exam Fall 2016 Dec 12 Instructions: Write your name and section number on all pages Closed book, closed notes; Computers and cell phones are not allowed You can use
More informationGeneral Strong Polarization
General Strong Polarization Madhu Sudan Harvard University Joint work with Jaroslaw Blasiok (Harvard), Venkatesan Gurswami (CMU), Preetum Nakkiran (Harvard) and Atri Rudra (Buffalo) May 1, 018 G.Tech:
More informationModule 3. Convolution. Aim
Module Convolution Digital Signal Processing. Slide 4. Aim How to perform convolution in real-time systems efficiently? Is convolution in time domain equivalent to multiplication of the transformed sequence?
More informationG52IVG, School of Computer Science, University of Nottingham
Image Transforms Fourier Transform Basic idea 1 Image Transforms Fourier transform theory Let f(x) be a continuous function of a real variable x. The Fourier transform of f(x) is F ( u) f ( x)exp[ j2πux]
More informationMathematics Ext 2. HSC 2014 Solutions. Suite 403, 410 Elizabeth St, Surry Hills NSW 2010 keystoneeducation.com.
Mathematics Ext HSC 4 Solutions Suite 43, 4 Elizabeth St, Surry Hills NSW info@keystoneeducation.com.au keystoneeducation.com.au Mathematics Extension : HSC 4 Solutions Contents Multiple Choice... 3 Question...
More informationMachine Learning. A Bayesian and Optimization Perspective. Academic Press, Sergios Theodoridis 1. of Athens, Athens, Greece.
Machine Learning A Bayesian and Optimization Perspective Academic Press, 2015 Sergios Theodoridis 1 1 Dept. of Informatics and Telecommunications, National and Kapodistrian University of Athens, Athens,
More informationDeconvolution. Parameter Estimation in Linear Inverse Problems
Image Parameter Estimation in Linear Inverse Problems Chair for Computer Aided Medical Procedures & Augmented Reality Department of Computer Science, TUM November 10, 2006 Contents A naive approach......with
More informationECE-340, Spring 2015 Review Questions
ECE-340, Spring 2015 Review Questions 1. Suppose that there are two categories of eggs: large eggs and small eggs, occurring with probabilities 0.7 and 0.3, respectively. For a large egg, the probabilities
More informationIntroduction to Probability and Stochastic Processes I
Introduction to Probability and Stochastic Processes I Lecture 3 Henrik Vie Christensen vie@control.auc.dk Department of Control Engineering Institute of Electronic Systems Aalborg University Denmark Slides
More informationModule 7 (Lecture 25) RETAINING WALLS
Module 7 (Lecture 25) RETAINING WALLS Topics Check for Bearing Capacity Failure Example Factor of Safety Against Overturning Factor of Safety Against Sliding Factor of Safety Against Bearing Capacity Failure
More informationF.3 Special Factoring and a General Strategy of Factoring
F.3 Special Factoring and a General Strategy of Factoring Difference of Squares section F4 233 Recall that in Section P2, we considered formulas that provide a shortcut for finding special products, such
More informationApproximate Second Order Algorithms. Seo Taek Kong, Nithin Tangellamudi, Zhikai Guo
Approximate Second Order Algorithms Seo Taek Kong, Nithin Tangellamudi, Zhikai Guo Why Second Order Algorithms? Invariant under affine transformations e.g. stretching a function preserves the convergence
More informationImage Enhancement in the frequency domain. GZ Chapter 4
Image Enhancement in the frequency domain GZ Chapter 4 Contents In this lecture we will look at image enhancement in the frequency domain The Fourier series & the Fourier transform Image Processing in
More informationCOMP344 Digital Image Processing Fall 2007 Final Examination
COMP344 Digital Image Processing Fall 2007 Final Examination Time allowed: 2 hours Name Student ID Email Question 1 Question 2 Question 3 Question 4 Question 5 Question 6 Total With model answer HK University
More informationLinear Convolution Using FFT
Linear Convolution Using FFT Another useful property is that we can perform circular convolution and see how many points remain the same as those of linear convolution. When P < L and an L-point circular
More informationStochastic Processes. M. Sami Fadali Professor of Electrical Engineering University of Nevada, Reno
Stochastic Processes M. Sami Fadali Professor of Electrical Engineering University of Nevada, Reno 1 Outline Stochastic (random) processes. Autocorrelation. Crosscorrelation. Spectral density function.
More informationGaussian Basics Random Processes Filtering of Random Processes Signal Space Concepts
White Gaussian Noise I Definition: A (real-valued) random process X t is called white Gaussian Noise if I X t is Gaussian for each time instance t I Mean: m X (t) =0 for all t I Autocorrelation function:
More informationNow, suppose that the signal is of finite duration (length) NN. Specifically, the signal is zero outside the range 0 nn < NN. Then
EE 464 Discrete Fourier Transform Fall 2018 Read Text, Chapter 4. Recall that for a complex-valued discrete-time signal, xx(nn), we can compute the Z-transform, XX(zz) = nn= xx(nn)zz nn. Evaluating on
More information16.584: Random (Stochastic) Processes
1 16.584: Random (Stochastic) Processes X(t): X : RV : Continuous function of the independent variable t (time, space etc.) Random process : Collection of X(t, ζ) : Indexed on another independent variable
More informationCDS 101/110: Lecture 3.1 Linear Systems
CDS /: Lecture 3. Linear Systems Goals for Today: Revist and motivate linear time-invariant system models: Summarize properties, examples, and tools Convolution equation describing solution in response
More informationIII.C - Linear Transformations: Optimal Filtering
1 III.C - Linear Transformations: Optimal Filtering FIR Wiener Filter [p. 3] Mean square signal estimation principles [p. 4] Orthogonality principle [p. 7] FIR Wiener filtering concepts [p. 8] Filter coefficients
More informationLight Propagation in Free Space
Intro Light Propagation in Free Space Helmholtz Equation 1-D Propagation Plane waves Plane wave propagation Light Propagation in Free Space 3-D Propagation Spherical Waves Huygen s Principle Each point
More informationProf. Mohd Zaid Abdullah Room No:
EEE 52/4 Advnced Digital Signal and Image Processing Tuesday, 00-300 hrs, Data Com. Lab. Friday, 0800-000 hrs, Data Com. Lab Prof. Mohd Zaid Abdullah Room No: 5 Email: mza@usm.my www.eng.usm.my Electromagnetic
More informationdue date: third day of class estimated time: 10 hours (for planning purposes only; work until you finish)
Honors PreCalculus Summer Work 016 due date: third day of class estimated time: 10 hours (for planning purposes only; work until you finish) Dear Honors PreCalculus Students, This assignment is designed
More informationContents. Signals as functions (1D, 2D)
Fourier Transform The idea A signal can be interpreted as en electromagnetic wave. This consists of lights of different color, or frequency, that can be split apart usign an optic prism. Each component
More informationUnit 6 Note Packet List of topics for this unit/assignment tracker Date Topic Assignment & Due Date Absolute Value Transformations Day 1
Name: Period: Unit 6 Note Packet List of topics for this unit/assignment tracker Date Topic Assignment & Due Date Absolute Value Transformations Day 1 Absolute Value Transformations Day 2 Graphing Equations
More informationGeneral Strong Polarization
General Strong Polarization Madhu Sudan Harvard University Joint work with Jaroslaw Blasiok (Harvard), Venkatesan Gurswami (CMU), Preetum Nakkiran (Harvard) and Atri Rudra (Buffalo) December 4, 2017 IAS:
More informationStochastic Processes
Elements of Lecture II Hamid R. Rabiee with thanks to Ali Jalali Overview Reading Assignment Chapter 9 of textbook Further Resources MIT Open Course Ware S. Karlin and H. M. Taylor, A First Course in Stochastic
More informationImage Processing 1 (IP1) Bildverarbeitung 1
MIN-Fakultät Fachbereich Informatik Arbeitsbereich SAV/BV (KOGS) Image Processing 1 (IP1) Bildverarbeitung 1 Lecture 7 Spectral Image Processing and Convolution Winter Semester 2014/15 Slides: Prof. Bernd
More informationLesson 24: Using the Quadratic Formula,
, b ± b 4ac x = a Opening Exercise 1. Examine the two equation below and discuss what is the most efficient way to solve each one. A. 4xx + 5xx + 3 = xx 3xx B. cc 14 = 5cc. Solve each equation with the
More informationLecture 4 Filtering in the Frequency Domain. Lin ZHANG, PhD School of Software Engineering Tongji University Spring 2016
Lecture 4 Filtering in the Frequency Domain Lin ZHANG, PhD School of Software Engineering Tongji University Spring 2016 Outline Background From Fourier series to Fourier transform Properties of the Fourier
More informationEE538 Final Exam Fall :20 pm -5:20 pm PHYS 223 Dec. 17, Cover Sheet
EE538 Final Exam Fall 005 3:0 pm -5:0 pm PHYS 3 Dec. 17, 005 Cover Sheet Test Duration: 10 minutes. Open Book but Closed Notes. Calculators ARE allowed!! This test contains five problems. Each of the five
More informationECE 8440 Unit 13 Sec0on Effects of Round- Off Noise in Digital Filters
ECE 8440 Unit 13 Sec0on 6.9 - Effects of Round- Off Noise in Digital Filters 1 We have already seen that if a wide- sense staonary random signal x(n) is applied as input to a LTI system, the power density
More information4.1 All in a Row (BC)
4.1 All in a Row (BC) Introduction to Series and Sequences You encounter sequences every day. Your monthly rent payments, the annual interest you earn on investments, a list of your car s miles per gallon
More informationCDS 101/110: Lecture 3.1 Linear Systems
CDS /: Lecture 3. Linear Systems Goals for Today: Describe and motivate linear system models: Summarize properties, examples, and tools Joel Burdick (substituting for Richard Murray) jwb@robotics.caltech.edu,
More informationTSKS01 Digital Communication Lecture 1
TSKS01 Digital Communication Lecture 1 Introduction, Repetition, and Noise Modeling Emil Björnson Department of Electrical Engineering (ISY) Division of Communication Systems Emil Björnson Course Director
More informationLecture 11. Kernel Methods
Lecture 11. Kernel Methods COMP90051 Statistical Machine Learning Semester 2, 2017 Lecturer: Andrey Kan Copyright: University of Melbourne This lecture The kernel trick Efficient computation of a dot product
More informationTerms of Use. Copyright Embark on the Journey
Terms of Use All rights reserved. No part of this packet may be reproduced, stored in a retrieval system, or transmitted in any form by any means - electronic, mechanical, photo-copies, recording, or otherwise
More informationChapter 4: Filtering in the Frequency Domain. Fourier Analysis R. C. Gonzalez & R. E. Woods
Fourier Analysis 1992 2008 R. C. Gonzalez & R. E. Woods Properties of δ (t) and (x) δ : f t) δ ( t t ) dt = f ( ) f x) δ ( x x ) = f ( ) ( 0 t0 x= ( 0 x0 1992 2008 R. C. Gonzalez & R. E. Woods Sampling
More informationSatellite image deconvolution using complex wavelet packets
Satellite image deconvolution using complex wavelet packets André Jalobeanu, Laure Blanc-Féraud, Josiane Zerubia ARIANA research group INRIA Sophia Antipolis, France CNRS / INRIA / UNSA www.inria.fr/ariana
More informationDefinition: A sequence is a function from a subset of the integers (usually either the set
Math 3336 Section 2.4 Sequences and Summations Sequences Geometric Progression Arithmetic Progression Recurrence Relation Fibonacci Sequence Summations Definition: A sequence is a function from a subset
More informationP.3 Division of Polynomials
00 section P3 P.3 Division of Polynomials In this section we will discuss dividing polynomials. The result of division of polynomials is not always a polynomial. For example, xx + 1 divided by xx becomes
More informationRotational Motion. Chapter 10 of Essential University Physics, Richard Wolfson, 3 rd Edition
Rotational Motion Chapter 10 of Essential University Physics, Richard Wolfson, 3 rd Edition 1 We ll look for a way to describe the combined (rotational) motion 2 Angle Measurements θθ ss rr rrrrrrrrrrrrrr
More informationFourier Methods in Digital Signal Processing Final Exam ME 579, Spring 2015 NAME
Fourier Methods in Digital Signal Processing Final Exam ME 579, Instructions for this CLOSED BOOK EXAM 2 hours long. Monday, May 8th, 8-10am in ME1051 Answer FIVE Questions, at LEAST ONE from each section.
More informationECE-S Introduction to Digital Signal Processing Lecture 3C Properties of Autocorrelation and Correlation
ECE-S352-701 Introduction to Digital Signal Processing Lecture 3C Properties of Autocorrelation and Correlation Assuming we have two sequences x(n) and y(n) from which we form a linear combination: c(n)
More informationEE482: Digital Signal Processing Applications
Professor Brendan Morris, SEB 3216, brendan.morris@unlv.edu EE482: Digital Signal Processing Applications Spring 2014 TTh 14:30-15:45 CBC C222 Lecture 11 Adaptive Filtering 14/03/04 http://www.ee.unlv.edu/~b1morris/ee482/
More informationWave Motion. Chapter 14 of Essential University Physics, Richard Wolfson, 3 rd Edition
Wave Motion Chapter 14 of Essential University Physics, Richard Wolfson, 3 rd Edition 1 Waves: propagation of energy, not particles 2 Longitudinal Waves: disturbance is along the direction of wave propagation
More informationCharge carrier density in metals and semiconductors
Charge carrier density in metals and semiconductors 1. Introduction The Hall Effect Particles must overlap for the permutation symmetry to be relevant. We saw examples of this in the exchange energy in
More informationConvolution and Linear Systems
CS 450: Introduction to Digital Signal and Image Processing Bryan Morse BYU Computer Science Introduction Analyzing Systems Goal: analyze a device that turns one signal into another. Notation: f (t) g(t)
More informationWiener Filtering. EE264: Lecture 12
EE264: Lecture 2 Wiener Filtering In this lecture we will take a different view of filtering. Previously, we have depended on frequency-domain specifications to make some sort of LP/ BP/ HP/ BS filter,
More informationSystem Identification & Parameter Estimation
System Identification & Parameter Estimation Wb3: SIPE lecture Correlation functions in time & frequency domain Alfred C. Schouten, Dept. of Biomechanical Engineering (BMechE), Fac. 3mE // Delft University
More informationContents. Signals as functions (1D, 2D)
Fourier Transform The idea A signal can be interpreted as en electromagnetic wave. This consists of lights of different color, or frequency, that can be split apart usign an optic prism. Each component
More informationHomework 6 Solutions
8-290 Signals and Systems Profs. Byron Yu and Pulkit Grover Fall 208 Homework 6 Solutions. Part One. (2 points) Consider an LTI system with impulse response h(t) e αt u(t), (a) Compute the frequency response
More informationBME 50500: Image and Signal Processing in Biomedicine. Lecture 5: Correlation and Power-Spectrum CCNY
1 BME 50500: Image and Signal Processing in Biomedicine Lecture 5: Correlation and Power-Spectrum Lucas C. Parra Biomedical Engineering Department CCNY http://bme.ccny.cuny.edu/faculty/parra/teaching/signal-and-image/
More informationGravitation. Chapter 8 of Essential University Physics, Richard Wolfson, 3 rd Edition
Gravitation Chapter 8 of Essential University Physics, Richard Wolfson, 3 rd Edition 1 What you are about to learn: Newton's law of universal gravitation About motion in circular and other orbits How to
More informationContents. Signals as functions (1D, 2D)
Fourier Transform The idea A signal can be interpreted as en electromagnetic wave. This consists of lights of different color, or frequency, that can be split apart usign an optic prism. Each component
More information5 Kalman filters. 5.1 Scalar Kalman filter. Unit delay Signal model. System model
5 Kalman filters 5.1 Scalar Kalman filter 5.1.1 Signal model System model {Y (n)} is an unobservable sequence which is described by the following state or system equation: Y (n) = h(n)y (n 1) + Z(n), n
More informationPROBABILITY AND RANDOM PROCESSESS
PROBABILITY AND RANDOM PROCESSESS SOLUTIONS TO UNIVERSITY QUESTION PAPER YEAR : JUNE 2014 CODE NO : 6074 /M PREPARED BY: D.B.V.RAVISANKAR ASSOCIATE PROFESSOR IT DEPARTMENT MVSR ENGINEERING COLLEGE, NADERGUL
More informationLecture No. 1 Introduction to Method of Weighted Residuals. Solve the differential equation L (u) = p(x) in V where L is a differential operator
Lecture No. 1 Introduction to Method of Weighted Residuals Solve the differential equation L (u) = p(x) in V where L is a differential operator with boundary conditions S(u) = g(x) on Γ where S is a differential
More information