Basics on 2-D 2 D Random Signal
|
|
- Dominick Pitts
- 6 years ago
- Views:
Transcription
1 Basics on -D D Random Signal Spring 06 Instructor: K. J. Ray Liu ECE Department, Univ. of Maryland, College Park Overview Last Time: Fourier Analysis for -D signals Image enhancement via spatial filtering Today Spatial filtering (cont d): image sharpening and edge detection Characterize -D random signal (random field) ENEE63 Digital Image Processing (Spring'06) ENEE63 Digital Image Processing (Spring'06) Lec6 -D Random Signal [] UMCP ENEE408G Slides (created by M.Wu & R.Liu 00) Image Sharpening Use LPF to generate HPF Subtract a low pass filtered result from the original signal HPF extracts edges and transitions Enhance edges I 0 I LP 0 I HP = I 0 I LP I = I 0 + a*i HP UMCP ENEE408G Slides (created by M.Wu & R.Liu 00) Example of Image Sharpening v(m, = u(m, + a * g(m, Often use Laplacian operator to obtain g(m, Laplacian operator is a discrete form of nd -order derivatives ¼ 0 -¼ -¼ 0 -¼ 0 ENEE63 Digital Image Processing (Spring'06) Lec6 -D Random Signal [3] ENEE63 Digital Image Processing (Spring'06) Lec6 -D Random Signal [4]
2 UMCP ENEE408G Slides (created by M.Wu & R.Liu 00) Example of Image Sharpening Original moon image is from Matlab Image Toolbox. Other Variations of Image Sharpening High boost filter (Gonzalez-Woods /e pp3 & pp88) Image example is from Gonzalez- Woods /e online slides. UMCP ENEE408G Slides (created by M.Wu 00) I 0 I LP I HP = I 0 I LP I = (b-) I 0 + I HP Equiv. to high pass filtering for b= Amplify or suppress original image pixel values when b Combine sharpening with histogram equalization ENEE63 Digital Image Processing (Spring'06) Lec6 -D Random Signal [5] ENEE63 Digital Image Processing (Spring'06) Lec6 -D Random Signal [6] UMCP ENEE408G Slides (created by M.Wu & R.Liu 00) Spatial LPF, HPF, & BPF HPF and BPF can be constructed from LPF Low-pass filter Useful in noise smoothing and downsampling/upsampling High-pass filter h HP (m, = δ (m, h LP (m, Useful in edge extraction and image sharpening Band-pass filter h BP (m, = h L (m, h L (m, Useful in edge enhancement Also good for high-pass tasks in the presence of noise avoid amplifying high-frequency noise ENEE63 Digital Image Processing (Spring'06) Lec6 -D Random Signal [7] UMCP ENEE408G Slides (created by M.Wu & R.Liu 00) Gradient, st -order Derivatives, and Edges Edge: pixel locations of abrupt luminance change For binary image Take black pixels with immediate white neighbors as edge pixel Detectable by XOR operations For continuous-tone image Spatial luminance gradient vector of an edge pixel edge a vector consists of partial derivatives along two orthogonal directions gradient gives the direction with highest rate of luminance changes How to represent edge? by intensity + direction => Edge map ~ edge intensity + directions Detection Method-: prepare edge examples (templates) of different intensities and directions, then find the best match Detection Method-: measure transitions along orthogonal directions ENEE63 Digital Image Processing (Spring'06) Lec6 -D Random Signal [8]
3 UMCP ENEE408G Slides (created by M.Wu & R.Liu 00) Common Gradient Operators for Edge Detection H (m, H (m, Roberts Prewitt Sobel Move the operators across the image and take the inner products Magnitude of gradient vector g(m, = g x (m, + g y (m, Direction of gradient vector tan [ g y (m, / g x (m, ] Gradient operator is HPF in nature ~ could amplify noise Prewitt and Sobel operators compute horizontal and vertical differences of local sum to reduce the effect of noise Examples of Edge Detectors Quantize edge intensity to 0/: set a threshold white pixel denotes strong edge Roberts Prewitt Sobel UMCP ENEE408G Slides (created by M.Wu & R.Liu 00) ENEE63 Digital Image Processing (Spring'06) Lec6 -D Random Signal [9] ENEE63 Digital Image Processing (Spring'06) Lec6 -D Random Signal [0] Examples of Edge Detectors UMCP ENEE408G Slides (created by M.Wu & R.Liu 00) Frequency Domain View of LPF / HPF Quantize edge intensity to 0/: set a threshold white pixel denotes strong edge Roberts Prewitt Sobel Image example is from Gonzalez-Woods /e online slides. ENEE63 Digital Image Processing (Spring'06) Lec6 -D Random Signal [] ENEE63 Digital Image Processing (Spring'06) Lec6 -D Random Signal [] 3
4 UMCP ENEE408G Slides (created by M.Wu & R.Liu 00) Edge Detection: Summary Measure gradient vector Along two orthogonal directions ~ usually horizontal and vertical g x = L / x g y = L / y Magnitude of gradient vector g(m, = g x (m, + g y (m, g(m, = g x (m, + g y (m, (preferred in hardware implement.) Direction of gradient vector tan [ g y (m, / g x (m, ] Characterizing edges in an image (binary) Edge map: specify edge point locations with g(m, > thresh. Edge intensity map: specify gradient magnitude at each pixel Edge direction map: specify directions Summary -D Fourier Transform Image enhancement via spatial filtering Filtering with a small FIR filter Edge detection Readings Jain s book Section.4-.6, 3.3, 7.4 Gonzalez s book Section 4.-4., ENEE63 Digital Image Processing (Spring'06) Lec6 -D Random Signal [3] ENEE63 Digital Image Processing (Spring'06) Lec6 -D Random Signal [4] Statistical Representation of Images Each pixel is considered as a random variable (r.v.) -D D Random Signals Side-by-Side Comparison with -D Random Process () Sequences of random variables & joint distributions () First two moment functions and their properties (3) Wide-sense stationarity (4) Unique to -D case: separable and isotropic covariance function (5) Power spectral density and properties Relations between pixels Simplest case: i.i.d. More realistically, the color value at a pixel may be statistically related to the colors of its neighbors A sample image A specific image we have obtained to study can be considered as a sample from an ensemble of images The ensemble represents all possible value combinations of random variable array Similar ensemble concept for -D random noise signals ENEE63 Digital Image Processing (Spring'06) Lec6 -D Random Signal [5] ENEE63 Digital Image Processing (Spring'06) Lec6 -D Random Signal [6] 4
5 Characterize the Ensemble of -D D Signals Specify by a joint probability distribution function Difficult to measure and specify the joint distribution for images of practical size => too many r.v. : e.g. 5 x 5 = 6,44 Specify by the first few moments Mean ( st moment) and Covariance ( nd moment) may still be non-trivial to measure for the entire image size By various stochastic models Use a few parameters to describe the relations among all pixels E.g. -D extensions from -D Autoregressive (AR) model Important for a variety of image processing tasks image compression, enhancement, restoration, understanding, => Today: some basics on -D random signals Discrete Random Field We call a -D sequence discrete random field if each of its elements is a random variable when the random field represents an ensemble of images, we often call it a random image Mean and Covariance of a complex random field E[u(m,] = μ(m, Cov[u(m,, u(m,n )] = E[(u(m, μ(m,) (u(m,n ) μ(m,n )) * ] = r u ( m, n; m, n ) For zero-mean random field, autocorrelation function = cov. function Wide-sense stationary μ(m, = μ = constant r u ( m, n; m, n ) = r u ( m m, n n ; 0, 0) = r( m m, n n ) also called shift invariant, spatial invariant in some literature ENEE63 Digital Image Processing (Spring'06) Lec6 -D Random Signal [7] ENEE63 Digital Image Processing (Spring'06) Lec6 -D Random Signal [8] Special Random Fields White noise field A stationary random field Any two elements at different locations x(m, and x(m,n ) are mutually uncorrelated r x ( m m, n n ) = σ x ( m, n ) δ( m m, n n ) Gaussian random field Every segment defined on an arbitrary finite grid is Gaussian i.e. every finite segment of u(m, when mapped into a vector have a joint Gaussian p.d.f. of Special Random Fields White noise field A stationary random field Any two elements at different locations x(m, and x(m,n ) are mutually uncorrelated r x ( m m, n n ) = σ x ( m, n ) δ( m m, n n ) Gaussian random field Every segment defined on an arbitrary finite grid is Gaussian i.e. every finite segment of u(m, when mapped into a vector have a joint Gaussian p.d.f. of ENEE63 Digital Image Processing (Spring'06) Lec6 -D Random Signal [9] ENEE63 Digital Image Processing (Spring'06) Lec6 -D Random Signal [0] 5
6 Properties of Covariance for Random Field [Similar to the properties of covariance function for -D random process] Symmetry r u ( m, n; m, n ) = r u* ( m, n ; m, For stationary random field: r( m, n ) = r * ( -m, -n ) For stationary real random field: r( m, n ) = r( -m, -n ) Note in general r u ( m, n; m, n ) r u ( m, n; m, n ) r u ( m, n; m, n ) Non-negativity For x(m, 0 at all (m,: Σ m Σ n Σ m Σ n x(m, r u ( m, n; m, n ) x * (m, n ) 0 Properties of Covariance for Random Field [Recall similar properties of covariance function for -D random process] Symmetry r u ( m, n; m, n ) = r u* ( m, n ; m, For stationary random field: r( m, n ) = r * ( -m, -n ) For stationary real random field: r( m, n ) = r( -m, -n ) Note in general r u ( m, n; m, n ) r u ( m, n; m, n ) r u ( m, n; m, n ) Non-negativity For x(m, 0 at all (m,: Σ m Σ n Σ m Σ n x(m, r u ( m, n; m, n ) x * (m, n ) 0 ENEE63 Digital Image Processing (Spring'06) Lec6 -D Random Signal [] ENEE63 Digital Image Processing (Spring'06) Lec6 -D Random Signal [] Separable Covariance Functions Separable If the covariance function of a random field can be expressed as a product of covariance functions of -D sequences r( m, n; m, n ) = r ( m, m ) r ( n, n ) Nonstationary case r( m, n ) = r ( m ) r ( n ) Stationary case Example: A separable stationary cov function often used in image proc r(m, = σ ρ m ρ n, ρ < and ρ < σ represents the variance of the random field; ρ and ρ are the one-step correlations in the m and n directions Separable Covariance Functions Separable If the covariance function of a random field can be expressed as a product of covariance functions of -D sequences r( m, n; m, n ) = r ( m, m ) r ( n, n ) Nonstationary case r( m, n ) = r ( m ) r ( n ) Stationary case Example: A separable stationary cov function often used in image proc r(m, = σ ρ m ρ n, ρ < and ρ < σ represents the variance of the random field; ρ and ρ are the one-step correlations in the m and n directions ENEE63 Digital Image Processing (Spring'06) Lec6 -D Random Signal [3] ENEE63 Digital Image Processing (Spring'06) Lec6 -D Random Signal [4] 6
7 Isotropic Covariance Functions Isotropic / circularly symmetric i.e. the covariance function only changes with respect to the radius (the distance to the origi, and isn t affected by the angle Example A nonseparable exponential function used as a more realistic cov function for images When a = a = a, this becomes isotropic: r(m, = σ ρ d As a function of the Euclidean distance of d = ( m + n ) / ρ = exp(- a ) Estimating the Mean and Covariance Function Approximate the ensemble average with sample average Example: for an M x N real-valued image x(m, ENEE63 Digital Image Processing (Spring'06) Lec6 -D Random Signal [5] ENEE63 Digital Image Processing (Spring'06) Lec6 -D Random Signal [6] Spectral Density Function The Spectral density function (SDF) is defined as the Fourier transform of the covariance function r x Δ + + ( ω, ω ) = rx ( m, exp[ j( ωm + ω m= n= S ] Also known as the power spectral density (p.s.d.) ( in some text, p.s.d. is defined as the FT of autocorrelation function ) Example: SDF of stationary white noise field with r(m,= σ δ(m, S + + ( ω, ω) = σδ( m, exp[ j( ωm + ω] = σ m= n= Spectral Density Function The Spectral density function (SDF) is defined as the Fourier transform of the covariance function r x Δ + + ( ω, ω ) = rx ( m, exp[ j( ωm + ω m= n= S ] Also known as the power spectral density (p.s.d.) ( in some text, p.s.d. is defined as the FT of autocorrelation function ) Example: SDF of stationary white noise field with r(m,= σ δ(m, S + + ( ω, ω) = σδ( m, exp[ j( ωm + ω] = σ m= n= ENEE63 Digital Image Processing (Spring'06) Lec6 -D Random Signal [7] ENEE63 Digital Image Processing (Spring'06) Lec6 -D Random Signal [8] 7
8 Properties of Power Spectrum [Recall similar properties in -D random process] SDF is real: S(ω, ω ) = S*(ω, ω ) Follows the conjugate symmetry of the covariance function r(m, = r * (-m, - SDF is nonnegative: S(ω, ω ) 0 for ω,ω Follows the non-negativity property of covariance function Intuition: power cannot be negative SDF of the output from a LSI system w/ freq response H(ω, ω ) S y (ω, ω ) = H(ω, ω ) S x (ω, ω ) Z-Transform Expression of Power Spectrum The Z transform of r u Known as the covariance generating function (CGF) or the ZT expression of the power spectrum S( z, z ) Δ S( ω, ω ) = S( z, z + + = x m= n= r ( m, z ) m jω = e, z z z = e n jω ENEE63 Digital Image Processing (Spring'06) Lec6 -D Random Signal [9] ENEE63 Digital Image Processing (Spring'06) Lec6 -D Random Signal [30] Rational Spectrum Rational Spectrum is the SDF that can be expressed as a ratio of finite polynomials in z and z Realize by Linear Shift-Invariant systems LSI system represented by finite-order difference equations between the -D input and output -D D Z-TransformZ The -D Z-transform is defined by The space represented by the complex variable pair (z, z ) is 4-D Unit surface If ROC include unit surface Transfer function of -D discrete LSI system ENEE63 Digital Image Processing (Spring'06) Lec6 -D Random Signal [3] ENEE63 Digital Image Processing (Spring'06) Lec6 -D Random Signal [3] 8
9 Stability Recall for -D LTI system Stability condition in bounded-input bounded-output sense (BIBO) is that the impulse response h[n] is absolutely summable i.e. ROC of H(z) includes the unit circle The ROC of H(z) for a causal and stable system should have all poles inside the unit circle -D Stable LSI system Requires the -D impulse response is absolutely summable Stability Recall for -D LTI system Stability condition in bounded-input bounded-output sense (BIBO) is that the impulse response h[n] is absolutely summable i.e. ROC of H(z) includes the unit circle The ROC of H(z) for a causal and stable system should have all poles inside the unit circle -D Stable LSI system Requires the -D impulse response is absolutely summable i.e. ROC of H(z, z ) must include the unit surface z =, z = i.e. ROC of H(z, z ) must include the unit surface z =, z = ENEE63 Digital Image Processing (Spring'06) Lec6 -D Random Signal [33] ENEE63 Digital Image Processing (Spring'06) Lec6 -D Random Signal [34] Summary of Today s s Lecture Spatial filter: LPF, HPF, BPF Image sharpening Edge detection Basics on -D random signals Next time Image restoration Readings Jain s book 7.4; 9.4;.9-. Gonzalez s book ENEE63 Digital Image Processing (Spring'06) Lec6 -D Random Signal [35] 9
Parametric Signal Modeling and Linear Prediction Theory 1. Discrete-time Stochastic Processes
Parametric Signal Modeling and Linear Prediction Theory 1. Discrete-time Stochastic Processes Electrical & Computer Engineering North Carolina State University Acknowledgment: ECE792-41 slides were adapted
More informationParametric Signal Modeling and Linear Prediction Theory 1. Discrete-time Stochastic Processes (cont d)
Parametric Signal Modeling and Linear Prediction Theory 1. Discrete-time Stochastic Processes (cont d) Electrical & Computer Engineering North Carolina State University Acknowledgment: ECE792-41 slides
More informationLocal Enhancement. Local enhancement
Local Enhancement Local Enhancement Median filtering (see notes/slides, 3.5.2) HW4 due next Wednesday Required Reading: Sections 3.3, 3.4, 3.5, 3.6, 3.7 Local Enhancement 1 Local enhancement Sometimes
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 informationLocal enhancement. Local Enhancement. Local histogram equalized. Histogram equalized. Local Contrast Enhancement. Fig 3.23: Another example
Local enhancement Local Enhancement Median filtering Local Enhancement Sometimes Local Enhancement is Preferred. Malab: BlkProc operation for block processing. Left: original tire image. 0/07/00 Local
More informationThe Z transform (2) 1
The Z transform (2) 1 Today Properties of the region of convergence (3.2) Read examples 3.7, 3.8 Announcements: ELEC 310 FINAL EXAM: April 14 2010, 14:00 pm ECS 123 Assignment 2 due tomorrow by 4:00 pm
More informationReview of Quantization. Quantization. Bring in Probability Distribution. L-level Quantization. Uniform partition
Review of Quantization UMCP ENEE631 Slides (created by M.Wu 004) Quantization UMCP ENEE631 Slides (created by M.Wu 001/004) L-level Quantization Minimize errors for this lossy process What L values to
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 informationRoadmap. Introduction to image analysis (computer vision) Theory of edge detection. Applications
Edge Detection Roadmap Introduction to image analysis (computer vision) Its connection with psychology and neuroscience Why is image analysis difficult? Theory of edge detection Gradient operator Advanced
More informationProbability Space. J. McNames Portland State University ECE 538/638 Stochastic Signals Ver
Stochastic Signals Overview Definitions Second order statistics Stationarity and ergodicity Random signal variability Power spectral density Linear systems with stationary inputs Random signal memory Correlation
More informationDigital Image Processing
Digital Image Processing 2D SYSTEMS & PRELIMINARIES Hamid R. Rabiee Fall 2015 Outline 2 Two Dimensional Fourier & Z-transform Toeplitz & Circulant Matrices Orthogonal & Unitary Matrices Block Matrices
More informationReview of Discrete-Time System
Review of Discrete-Time System Electrical & Computer Engineering University of Maryland, College Park Acknowledgment: ENEE630 slides were based on class notes developed by Profs. K.J. Ray Liu and Min Wu.
More informationIntroduction to Computer Vision. 2D Linear Systems
Introduction to Computer Vision D Linear Systems Review: Linear Systems We define a system as a unit that converts an input function into an output function Independent variable System operator or Transfer
More informationMachine vision, spring 2018 Summary 4
Machine vision Summary # 4 The mask for Laplacian is given L = 4 (6) Another Laplacian mask that gives more importance to the center element is given by L = 8 (7) Note that the sum of the elements in the
More informationLecture 7: Edge Detection
#1 Lecture 7: Edge Detection Saad J Bedros sbedros@umn.edu Review From Last Lecture Definition of an Edge First Order Derivative Approximation as Edge Detector #2 This Lecture Examples of Edge Detection
More informationEE5356 Digital Image Processing
EE5356 Digital Image Processing INSTRUCTOR: Dr KR Rao Spring 007, Final Thursday, 10 April 007 11:00 AM 1:00 PM ( hours) (Room 111 NH) INSTRUCTIONS: 1 Closed books and closed notes All problems carry weights
More information! Introduction. ! Discrete Time Signals & Systems. ! Z-Transform. ! Inverse Z-Transform. ! Sampling of Continuous Time Signals
ESE 531: Digital Signal Processing Lec 25: April 24, 2018 Review Course Content! Introduction! Discrete Time Signals & Systems! Discrete Time Fourier Transform! Z-Transform! Inverse Z-Transform! Sampling
More informationMachine vision. Summary # 4. The mask for Laplacian is given
1 Machine vision Summary # 4 The mask for Laplacian is given L = 0 1 0 1 4 1 (6) 0 1 0 Another Laplacian mask that gives more importance to the center element is L = 1 1 1 1 8 1 (7) 1 1 1 Note that the
More informationNonparametric and Parametric Defined This text distinguishes between systems and the sequences (processes) that result when a WN input is applied
Linear Signal Models Overview Introduction Linear nonparametric vs. parametric models Equivalent representations Spectral flatness measure PZ vs. ARMA models Wold decomposition Introduction Many researchers
More informationStability Condition in Terms of the Pole Locations
Stability Condition in Terms of the Pole Locations A causal LTI digital filter is BIBO stable if and only if its impulse response h[n] is absolutely summable, i.e., 1 = S h [ n] < n= We now develop a stability
More informationEE123 Digital Signal Processing. M. Lustig, EECS UC Berkeley
EE123 Digital Signal Processing Today Last time: DTFT - Ch 2 Today: Continue DTFT Z-Transform Ch. 3 Properties of the DTFT cont. Time-Freq Shifting/modulation: M. Lustig, EE123 UCB M. Lustig, EE123 UCB
More informationVery useful for designing and analyzing signal processing systems
z-transform z-transform The z-transform generalizes the Discrete-Time Fourier Transform (DTFT) for analyzing infinite-length signals and systems Very useful for designing and analyzing signal processing
More informationEdge Detection. Introduction to Computer Vision. Useful Mathematics Funcs. The bad news
Edge Detection Introduction to Computer Vision CS / ECE 8B Thursday, April, 004 Edge detection (HO #5) Edge detection is a local area operator that seeks to find significant, meaningful changes in image
More informationReading. 3. Image processing. Pixel movement. Image processing Y R I G Q
Reading Jain, Kasturi, Schunck, Machine Vision. McGraw-Hill, 1995. Sections 4.-4.4, 4.5(intro), 4.5.5, 4.5.6, 5.1-5.4. 3. Image processing 1 Image processing An image processing operation typically defines
More informationStatistical signal processing
Statistical signal processing Short overview of the fundamentals Outline Random variables Random processes Stationarity Ergodicity Spectral analysis Random variable and processes Intuition: A random variable
More informationParametric Signal Modeling and Linear Prediction Theory 4. The Levinson-Durbin Recursion
Parametric Signal Modeling and Linear Prediction Theory 4. The Levinson-Durbin Recursion Electrical & Computer Engineering North Carolina State University Acknowledgment: ECE792-41 slides were adapted
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 informationMultidimensional digital signal processing
PSfrag replacements Two-dimensional discrete signals N 1 A 2-D discrete signal (also N called a sequence or array) is a function 2 defined over thex(n set 1 of, n 2 ordered ) pairs of integers: y(nx 1,
More informationIntensity Transformations and Spatial Filtering: WHICH ONE LOOKS BETTER? Intensity Transformations and Spatial Filtering: WHICH ONE LOOKS BETTER?
: WHICH ONE LOOKS BETTER? 3.1 : WHICH ONE LOOKS BETTER? 3.2 1 Goal: Image enhancement seeks to improve the visual appearance of an image, or convert it to a form suited for analysis by a human or a machine.
More informationCommunications and Signal Processing Spring 2017 MSE Exam
Communications and Signal Processing Spring 2017 MSE Exam Please obtain your Test ID from the following table. You must write your Test ID and name on each of the pages of this exam. A page with missing
More information( ) John A. Quinn Lecture. ESE 531: Digital Signal Processing. Lecture Outline. Frequency Response of LTI System. Example: Zero on Real Axis
John A. Quinn Lecture ESE 531: Digital Signal Processing Lec 15: March 21, 2017 Review, Generalized Linear Phase Systems Penn ESE 531 Spring 2017 Khanna Lecture Outline!!! 2 Frequency Response of LTI System
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 informationLecture 6: Edge Detection. CAP 5415: Computer Vision Fall 2008
Lecture 6: Edge Detection CAP 5415: Computer Vision Fall 2008 Announcements PS 2 is available Please read it by Thursday During Thursday lecture, I will be going over it in some detail Monday - Computer
More informationDigital Signal Processing Lecture 10 - Discrete Fourier Transform
Digital Signal Processing - Discrete Fourier Transform Electrical Engineering and Computer Science University of Tennessee, Knoxville November 12, 2015 Overview 1 2 3 4 Review - 1 Introduction Discrete-time
More informationEcon 424 Time Series Concepts
Econ 424 Time Series Concepts Eric Zivot January 20 2015 Time Series Processes Stochastic (Random) Process { 1 2 +1 } = { } = sequence of random variables indexed by time Observed time series of length
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 informationProblem Session #5. EE368/CS232 Digital Image Processing
Problem Session #5 EE368/CS232 Digital Image Processing 1. Solving a Jigsaw Puzzle Please download the image hw5_puzzle_pieces.jpg from the handouts webpage, which shows the pieces of a jigsaw puzzle.
More informationCourse content (will be adapted to the background knowledge of the class):
Biomedical Signal Processing and Signal Modeling Lucas C Parra, parra@ccny.cuny.edu Departamento the Fisica, UBA Synopsis This course introduces two fundamental concepts of signal processing: linear systems
More informationFinal Exam January 31, Solutions
Final Exam January 31, 014 Signals & Systems (151-0575-01) Prof. R. D Andrea & P. Reist Solutions Exam Duration: Number of Problems: Total Points: Permitted aids: Important: 150 minutes 7 problems 50 points
More informationECE 450 Homework #3. 1. Given the joint density function f XY (x,y) = 0.5 1<x<2, 2<y< <x<4, 2<y<3 0 else
ECE 450 Homework #3 0. Consider the random variables X and Y, whose values are a function of the number showing when a single die is tossed, as show below: Exp. Outcome 1 3 4 5 6 X 3 3 4 4 Y 0 1 3 4 5
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 informationEE 123: Digital Signal Processing Spring Lecture 23 April 10
EE 123: Digital Signal Processing Spring 2007 Lecture 23 April 10 Lecturer: Anant Sahai Scribe: Chuo J. Liu 23.1 Outline In this lecture, we talked about implementation issue for rational transfer function.
More informationSlide a window along the input arc sequence S. Least-squares estimate. σ 2. σ Estimate 1. Statistically test the difference between θ 1 and θ 2
Corner Detection 2D Image Features Corners are important two dimensional features. Two dimensional image features are interesting local structures. They include junctions of dierent types Slide 3 They
More informationLecture 16: Filter Design: Impulse Invariance and Bilinear Transform
EE58 Digital Signal Processing University of Washington Autumn 2 Dept. of Electrical Engineering Lecture 6: Filter Design: Impulse Invariance and Bilinear Transform Nov 26, 2 Prof: J. Bilmes
More informationLet H(z) = P(z)/Q(z) be the system function of a rational form. Let us represent both P(z) and Q(z) as polynomials of z (not z -1 )
Review: Poles and Zeros of Fractional Form Let H() = P()/Q() be the system function of a rational form. Let us represent both P() and Q() as polynomials of (not - ) Then Poles: the roots of Q()=0 Zeros:
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 informationComputer Engineering 4TL4: Digital Signal Processing
Computer Engineering 4TL4: Digital Signal Processing Day Class Instructor: Dr. I. C. BRUCE Duration of Examination: 3 Hours McMaster University Final Examination December, 2003 This examination paper includes
More informationwhere r n = dn+1 x(t)
Random Variables Overview Probability Random variables Transforms of pdfs Moments and cumulants Useful distributions Random vectors Linear transformations of random vectors The multivariate normal distribution
More informationECE503: Digital Signal Processing Lecture 5
ECE53: Digital Signal Processing Lecture 5 D. Richard Brown III WPI 3-February-22 WPI D. Richard Brown III 3-February-22 / 32 Lecture 5 Topics. Magnitude and phase characterization of transfer functions
More informationLecture 3: Linear Filters
Lecture 3: Linear Filters Professor Fei Fei Li Stanford Vision Lab 1 What we will learn today? Images as functions Linear systems (filters) Convolution and correlation Discrete Fourier Transform (DFT)
More informationThe Cooper Union Department of Electrical Engineering ECE111 Signal Processing & Systems Analysis Final May 4, 2012
The Cooper Union Department of Electrical Engineering ECE111 Signal Processing & Systems Analysis Final May 4, 2012 Time: 3 hours. Close book, closed notes. No calculators. Part I: ANSWER ALL PARTS. WRITE
More informationEstimation, Detection, and Identification CMU 18752
Estimation, Detection, and Identification CMU 18752 Graduate Course on the CMU/Portugal ECE PhD Program Spring 2008/2009 Instructor: Prof. Paulo Jorge Oliveira pjcro @ isr.ist.utl.pt Phone: +351 21 8418053
More informationPart III Spectrum Estimation
ECE79-4 Part III Part III Spectrum Estimation 3. Parametric Methods for Spectral Estimation Electrical & Computer Engineering North Carolina State University Acnowledgment: ECE79-4 slides were adapted
More informationStatistical and Adaptive Signal Processing
r Statistical and Adaptive Signal Processing Spectral Estimation, Signal Modeling, Adaptive Filtering and Array Processing Dimitris G. Manolakis Massachusetts Institute of Technology Lincoln Laboratory
More informationStochastic Processes. A stochastic process is a function of two variables:
Stochastic Processes Stochastic: from Greek stochastikos, proceeding by guesswork, literally, skillful in aiming. A stochastic process is simply a collection of random variables labelled by some parameter:
More informationFundamentals of Digital Commun. Ch. 4: Random Variables and Random Processes
Fundamentals of Digital Commun. Ch. 4: Random Variables and Random Processes Klaus Witrisal witrisal@tugraz.at Signal Processing and Speech Communication Laboratory www.spsc.tugraz.at Graz University of
More informationECE 636: Systems identification
ECE 636: Systems identification Lectures 3 4 Random variables/signals (continued) Random/stochastic vectors Random signals and linear systems Random signals in the frequency domain υ ε x S z + y Experimental
More informationLecture 3: Linear Filters
Lecture 3: Linear Filters Professor Fei Fei Li Stanford Vision Lab 1 What we will learn today? Images as functions Linear systems (filters) Convolution and correlation Discrete Fourier Transform (DFT)
More informationChapter 6. Random Processes
Chapter 6 Random Processes Random Process A random process is a time-varying function that assigns the outcome of a random experiment to each time instant: X(t). For a fixed (sample path): a random process
More informationLecture 15. Theory of random processes Part III: Poisson random processes. Harrison H. Barrett University of Arizona
Lecture 15 Theory of random processes Part III: Poisson random processes Harrison H. Barrett University of Arizona 1 OUTLINE Poisson and independence Poisson and rarity; binomial selection Poisson point
More informationECE Homework Set 3
ECE 450 1 Homework Set 3 0. Consider the random variables X and Y, whose values are a function of the number showing when a single die is tossed, as show below: Exp. Outcome 1 3 4 5 6 X 3 3 4 4 Y 0 1 3
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 informationLecture 4 - Spectral Estimation
Lecture 4 - Spectral Estimation The Discrete Fourier Transform The Discrete Fourier Transform (DFT) is the equivalent of the continuous Fourier Transform for signals known only at N instants separated
More informationELEG 833. Nonlinear Signal Processing
Nonlinear Signal Processing ELEG 833 Gonzalo R. Arce Department of Electrical and Computer Engineering University of Delaware arce@ee.udel.edu February 15, 2005 1 INTRODUCTION 1 Introduction Signal processing
More informationChapter 7: The z-transform
Chapter 7: The -Transform ECE352 1 The -Transform - definition Continuous-time systems: e st H(s) y(t) = e st H(s) e st is an eigenfunction of the LTI system h(t), and H(s) is the corresponding eigenvalue.
More informationBasic Multi-rate Operations: Decimation and Interpolation
1 Basic Multirate Operations 2 Interconnection of Building Blocks 1.1 Decimation and Interpolation 1.2 Digital Filter Banks Basic Multi-rate Operations: Decimation and Interpolation Building blocks for
More information2.161 Signal Processing: Continuous and Discrete Fall 2008
MIT OpenCourseWare http://ocw.mit.edu 2.161 Signal Processing: Continuous and Discrete Fall 2008 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms. Massachusetts
More informationEdge Detection. Image Processing - Computer Vision
Image Processing - Lesson 10 Edge Detection Image Processing - Computer Vision Low Level Edge detection masks Gradient Detectors Compass Detectors Second Derivative - Laplace detectors Edge Linking Image
More informationEEG- Signal Processing
Fatemeh Hadaeghi EEG- Signal Processing Lecture Notes for BSP, Chapter 5 Master Program Data Engineering 1 5 Introduction The complex patterns of neural activity, both in presence and absence of external
More informationSRI VIDYA COLLEGE OF ENGINEERING AND TECHNOLOGY UNIT 3 RANDOM PROCESS TWO MARK QUESTIONS
UNIT 3 RANDOM PROCESS TWO MARK QUESTIONS 1. Define random process? The sample space composed of functions of time is called a random process. 2. Define Stationary process? If a random process is divided
More informationFiltering and Edge Detection
Filtering and Edge Detection Local Neighborhoods Hard to tell anything from a single pixel Example: you see a reddish pixel. Is this the object s color? Illumination? Noise? The next step in order of complexity
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 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 informationEE 602 TERM PAPER PRESENTATION Richa Tripathi Mounika Boppudi FOURIER SERIES BASED MODEL FOR STATISTICAL SIGNAL PROCESSING - CHONG YUNG CHI
EE 602 TERM PAPER PRESENTATION Richa Tripathi Mounika Boppudi FOURIER SERIES BASED MODEL FOR STATISTICAL SIGNAL PROCESSING - CHONG YUNG CHI ABSTRACT The goal of the paper is to present a parametric Fourier
More informationSignals and Systems
204181 Signals and Systems Examination Scheme: Teaching Scheme: Theory Online : 50 Marks Lectures: 4 Hrs/ Week Theory Paper : 50 Marks Tutorial : 1 Hr/Week Term work: 25 Course Objectives and Outcomes:
More informationImage Gradients and Gradient Filtering Computer Vision
Image Gradients and Gradient Filtering 16-385 Computer Vision What is an image edge? Recall that an image is a 2D function f(x) edge edge How would you detect an edge? What kinds of filter would you use?
More informationCommunication Theory II
Communication Theory II Lecture 8: Stochastic Processes Ahmed Elnakib, PhD Assistant Professor, Mansoura University, Egypt March 5 th, 2015 1 o Stochastic processes What is a stochastic process? Types:
More informationDigital Signal Processing Lecture 9 - Design of Digital Filters - FIR
Digital Signal Processing - Design of Digital Filters - FIR Electrical Engineering and Computer Science University of Tennessee, Knoxville November 3, 2015 Overview 1 2 3 4 Roadmap Introduction Discrete-time
More informationImage Segmentation: Definition Importance. Digital Image Processing, 2nd ed. Chapter 10 Image Segmentation.
: Definition Importance Detection of Discontinuities: 9 R = wi z i= 1 i Point Detection: 1. A Mask 2. Thresholding R T Line Detection: A Suitable Mask in desired direction Thresholding Line i : R R, j
More informationResponses of Digital Filters Chapter Intended Learning Outcomes:
Responses of Digital Filters Chapter Intended Learning Outcomes: (i) Understanding the relationships between impulse response, frequency response, difference equation and transfer function in characterizing
More informationUniversity of Illinois at Urbana-Champaign ECE 310: Digital Signal Processing
University of Illinois at Urbana-Champaign ECE 0: Digital Signal Processing Chandra Radhakrishnan PROBLEM SET : SOLUTIONS Peter Kairouz Problem. Hz z 7 z +/9, causal ROC z > contains the unit circle BIBO
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 informationENSC327 Communications Systems 19: Random Processes. Jie Liang School of Engineering Science Simon Fraser University
ENSC327 Communications Systems 19: Random Processes Jie Liang School of Engineering Science Simon Fraser University 1 Outline Random processes Stationary random processes Autocorrelation of random processes
More informationStochastic Processes: I. consider bowl of worms model for oscilloscope experiment:
Stochastic Processes: I consider bowl of worms model for oscilloscope experiment: SAPAscope 2.0 / 0 1 RESET SAPA2e 22, 23 II 1 stochastic process is: Stochastic Processes: II informally: bowl + drawing
More informationToday. ESE 531: Digital Signal Processing. IIR Filter Design. Impulse Invariance. Impulse Invariance. Impulse Invariance. ω < π.
Today ESE 53: Digital Signal Processing! IIR Filter Design " Lec 8: March 30, 207 IIR Filters and Adaptive Filters " Bilinear Transformation! Transformation of DT Filters! Adaptive Filters! LMS Algorithm
More informationLinear Stochastic Models. Special Types of Random Processes: AR, MA, and ARMA. Digital Signal Processing
Linear Stochastic Models Special Types of Random Processes: AR, MA, and ARMA Digital Signal Processing Department of Electrical and Electronic Engineering, Imperial College d.mandic@imperial.ac.uk c Danilo
More informationCorner. Corners are the intersections of two edges of sufficiently different orientations.
2D Image Features Two dimensional image features are interesting local structures. They include junctions of different types like Y, T, X, and L. Much of the work on 2D features focuses on junction L,
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 informationSF2943: TIME SERIES ANALYSIS COMMENTS ON SPECTRAL DENSITIES
SF2943: TIME SERIES ANALYSIS COMMENTS ON SPECTRAL DENSITIES This document is meant as a complement to Chapter 4 in the textbook, the aim being to get a basic understanding of spectral densities through
More informationECE 410 DIGITAL SIGNAL PROCESSING D. Munson University of Illinois Chapter 12
. ECE 40 DIGITAL SIGNAL PROCESSING D. Munson University of Illinois Chapter IIR Filter Design ) Based on Analog Prototype a) Impulse invariant design b) Bilinear transformation ( ) ~ widely used ) Computer-Aided
More informationECE 438 Exam 2 Solutions, 11/08/2006.
NAME: ECE 438 Exam Solutions, /08/006. This is a closed-book exam, but you are allowed one standard (8.5-by-) sheet of notes. No calculators are allowed. Total number of points: 50. This exam counts for
More informationDigital Signal Processing Lecture 8 - Filter Design - IIR
Digital Signal Processing - Filter Design - IIR Electrical Engineering and Computer Science University of Tennessee, Knoxville October 20, 2015 Overview 1 2 3 4 5 6 Roadmap Discrete-time signals and systems
More informationEE 521: Instrumentation and Measurements
Aly El-Osery Electrical Engineering Department, New Mexico Tech Socorro, New Mexico, USA November 1, 2009 1 / 27 1 The z-transform 2 Linear Time-Invariant System 3 Filter Design IIR Filters FIR Filters
More informationDigital Signal Processing:
Digital Signal Processing: Mathematical and algorithmic manipulation of discretized and quantized or naturally digital signals in order to extract the most relevant and pertinent information that is carried
More informationIMAGE ENHANCEMENT II (CONVOLUTION)
MOTIVATION Recorded images often exhibit problems such as: blurry noisy Image enhancement aims to improve visual quality Cosmetic processing Usually empirical techniques, with ad hoc parameters ( whatever
More informationEE5356 Digital Image Processing. Final Exam. 5/11/06 Thursday 1 1 :00 AM-1 :00 PM
EE5356 Digital Image Processing Final Exam 5/11/06 Thursday 1 1 :00 AM-1 :00 PM I), Closed books and closed notes. 2), Problems carry weights as indicated. 3), Please print your name and last four digits
More informationECE 673-Random signal analysis I Final
ECE 673-Random signal analysis I Final Q ( point) Comment on the following statement "If cov(x ; X 2 ) 0; then the best predictor (without limitation on the type of predictor) of the random variable X
More informationFilter Analysis and Design
Filter Analysis and Design Butterworth Filters Butterworth filters have a transfer function whose squared magnitude has the form H a ( jω ) 2 = 1 ( ) 2n. 1+ ω / ω c * M. J. Roberts - All Rights Reserved
More informationTAKEHOME FINAL EXAM e iω e 2iω e iω e 2iω
ECO 513 Spring 2015 TAKEHOME FINAL EXAM (1) Suppose the univariate stochastic process y is ARMA(2,2) of the following form: y t = 1.6974y t 1.9604y t 2 + ε t 1.6628ε t 1 +.9216ε t 2, (1) where ε is i.i.d.
More informationDiscrete-time signals and systems
Discrete-time signals and systems 1 DISCRETE-TIME DYNAMICAL SYSTEMS x(t) G y(t) Linear system: Output y(n) is a linear function of the inputs sequence: y(n) = k= h(k)x(n k) h(k): impulse response of the
More information