Digital Image Processing
|
|
- Hugo Mathews
- 6 years ago
- Views:
Transcription
1 Digital Image Processing Part 3: Fourier Transform and Filtering in the Frequency Domain AASS Learning Systems Lab, Dep. Teknik Room T109 (Fr, 11-1 o'clock) Course Book Chapter
2 Fourier transform properties, revisited Conjugate Symmetry y Spectrum symmetric about the origin F( u, v) F but not * ( u, v) F( u, v) F * ( u, v)
3 Contents Nyquist-Shannon Sampling Theorem
4 5 Nyquist-Shannon Sampling Theorem Aliasing / Undersampling, Moiré Pattern decrease resolution
5 5 Nyquist-Shannon Sampling Theorem How to avoid Aliasing Problems? y y sampling continuous function (irradiance in the camera) discrete grid number of samples relative to the function seems important a signal sampled too slowly is misrepresented by the samples from "Computer Vision A Modern Approach", Forsyth and Ponce, Prentice Hall, 00
6 5 Nyquist-Shannon Sampling Theorem Sampling a Signal in 1D f() Reconstruction of the Original Continuous Signal y which sample rate? y how to derive the continuous signal from the samples? y how to model the sampling process?
7 5 Nyquist-Shannon Sampling Theorem Sampling a Signal in 1D f() How to Model the Sampling Process? y continuous model of a sampled signal needed y sum of delta functions (D: "bed-of-nails function") sampling process = multiplication with a sampling function f III ()
8 5 Nyquist-Shannon Sampling Theorem Considering Band-Limited Signals f() F F(u) u -w w y signal band-width: band/range of non-ero frequencies y a band-limited signal is constrained in terms of how fast it can change
9 5 Nyquist-Shannon Sampling Theorem Fourier Transform of a Sampled Signal f()f III () y sampling = multiplication with the sampling function in the spatial domain
10 5 Nyquist-Shannon Sampling Theorem Fourier Transform of a Sampled Signal f()f III () F F(u)F III (u) Fourier transform of a "Dirac comb" is again a Dirac comb ( Poisson summation) y sampling = multiplication with the sampling function in the spatial domain y equals convolution in the frequency domain
11 5 Nyquist-Shannon Sampling Theorem Fourier Transform of a Sampled Signal f()f III () F F(u)F III (u) w y sampling = multiplication with the sampling function in the spatial domain y equals convolution in the frequency domain u
12 5 Nyquist-Shannon Sampling Theorem Fourier Transform of a Sampled Signal f()f III () F F(u)F III (u) w y non-overlapping support of the "shifted Fourier Transforms" we can reconstruct the signal from the sampled versions u
13 5 Nyquist-Shannon Sampling Theorem Reconstruction of the Signal from "Computer Vision A Modern Approach", Forsyth and Ponce, Prentice Hall, 00
14 5 Nyquist-Shannon Sampling Theorem Reconstruction of the Signal from "Computer Vision A Modern Approach", Forsyth and Ponce, Prentice Hall, 00
15 5 Nyquist-Shannon Sampling Theorem Reconstruction of the Signal Inverse Fourier Transform Cut out by multiplication with bo filter from "Computer Vision A Modern Approach", Forsyth and Ponce, Prentice Hall, 00
16 5 Nyquist-Shannon Sampling Theorem Reconstruction of the Signal Inverse Fourier Transform Cut out by multiplication with bo filter from "Computer Vision A Modern Approach", Forsyth and Ponce, Prentice Hall, 00
17 5 Nyquist-Shannon Interpolation Formula sinc Eact Recovering From Samples y convolution of the samples with sinc sin( ) 1 f scaled so that the ero-crossings occur at the sampling instants f n ( ) n sinc, n : 0 : 0 sinc() F 1 w H(u) u w
18 5 Nyquist-Shannon Sampling Theorem Reconstruction of the Signal y but if support regions do overlap? we can't reconstruct the signal Fourier transform in the regions that overlap can't be determined
19 5 Nyquist-Shannon Sampling Theorem Fourier Transform of a "Dirac comb" f III () F F III (u) Δ w 1/Δ u y reciprocal behaviour of Δ and Δu
20 5 Nyquist-Shannon Sampling Theorem Sampling Theorem y there should be no overlap between the repetitions of the FT of the signal F III (u) y the sampling interval should be more than double of the highest frequency (1/w) present in the signal w 1/Δ u w 1 1 w
21 5 Nyquist-Shannon Sampling Theorem f()f III () F F(u)F III (u) w u f III () F F III (u) Δ 1/Δ u
22 5 Nyquist-Shannon Sampling Theorem Aliasing / Undersampling f() F(u) u f III () F(u)F III (u) u Δ aliasing
23 5 Nyquist-Shannon Sampling Theorem Aliasing / Undersampling, Moiré Pattern
24 5 Nyquist-Shannon Sampling Theorem Avoiding Moiré Patterns? y anti-alias filter: use a low-pass filter before down-sampling
25 5 Nyquist-Shannon Sampling Theorem Avoiding Moiré Patterns y anti-alias filter: use a low-pass filter before down-sampling eample: no low-pass filter used Fourier Transform (scaled + 'tile'd) from "Computer Vision A Modern Approach", Forsyth and Ponce, Prentice Hall, 00
26 5 Nyquist-Shannon Sampling Theorem Avoiding Moiré Patterns y anti-alias filter: use a low-pass filter before down-sampling eample: mild Gaussian low-pass filter used ( = 1 piel) Fourier Transform (scaled + 'tile'd) from "Computer Vision A Modern Approach", Forsyth and Ponce, Prentice Hall, 00
27 5 Nyquist-Shannon Sampling Theorem Avoiding Moiré Patterns y anti-alias filter: use a low-pass filter before down-sampling eample: more aggressive Gaussian low-pass filter used ( = piels) Fourier Transform (scaled + 'tile'd) from "Computer Vision A Modern Approach", Forsyth and Ponce, Prentice Hall, 00
28 Contents Fast Fourier Transform
29 6 Discrete Fourier Transform (DFT) Direct Calculation of the DFT F( u) 1 M M 1 0 f ( ) e ju/ M y for each Fourier coefficient M comple multiplications and M 1 comple additions y altogether: M multiplications and (M 1) additions comple mult. = 4 real multiplications + real additions comple addition = real additions 4 M real multiplications and 4 M M + real additions ~ M
30 6 Fast Fourier Transform (FFT) 1D-DFT requires ~M operations F( u) 1 M M 1 0 f ( ) e ju/ M FFT requires only ~ M log M operations y divide-and-conquer algorithm y avoid calculation of the same products multiple times
31 6 Fast Fourier Transform (FFT) FFT requires only ~ M log M operations y the FT can be divided into successive two-point transforms, which reduces the number of operations to M log M
32 6 Fast Fourier Transform (FFT) FFT requires only ~ M log M operations y the FT can be divided into successive two-point transforms, which reduces the number of operations to M log M y eample M = 51 DFT: ~M = 6144 operations FFT: ~ M log M = 4608 operations computational advantage: ~M / M log M = 57
33 Contents 1. Fourier Transform, Discrete Fourier Transform Comple Numbers. Filtering in the Frequency Domain y Convolution, Convolution Theorem y Relation Between Spatial and Frequency Filters 3. Recovering Intrinsic Images, Homomorphic Filtering 4. Properties of the Fourier Transform y Correlation 5. Nyquist-Shannon Sampling Theorem 6. Fast Fourier Transform
34 Digital Image Processing Part 4: Image Restoration AASS Learning Systems Lab, Dep. Teknik Room T109 Course Book Chapter
35 Contents 1. Image Degradation and Restoration. Noise Models 3. Noise Reduction 4. Image Restoration Linear, Position Invariant (LPI) Degradation Processes Inverse Filtering, Deconvolution Wiener Filtering
36 Contents Image Degradation and Restoration
37 1 Image Degradation and Restoration Restore a Degraded Image y restoration using knowledge of the degradation process y modelling the degradation process ( inverse methods) noise, bad focusing, non-linear sensors, motion, y obtain an estimate of the original image Comparison with Image Enhancement y image enhancement: make the image "better" in some way (heuristic) y image restoration: often involves formulation of a performance measure more objective methods
38 1 Image Degradation and Restoration Model of the Image Degradation Process f(,y) H deg (,y) + g(,y) n(,y) y f(,y): y H deg (,y): y n(,y): y g(,y): "ideal" input image (original image) degradation function (imaging system, ) additive noise degraded image: g(,y) = H deg [f(,y)] + n(,y)
39 1 Image Degradation and Restoration Model of the Image Restoration Process ^ f(,y) restoration filter g(,y) y g(,y): ^ y f(,y): degraded image: g(,y) = H deg [f(,y)] + n(,y) estimate of the original image (restored image)! H and H deg are not clearly distinguished in GW
40 Contents Noise Models
41 Noise Models Model of the Image Degradation Process f(,y) H deg (,y) + g(,y) n(,y)
42 Noise Models Model of the Image Degradation Process H deg = I f(,y) + g(,y) n(,y) Noise Models y noise is assumed to be uncorrelated with the image process independent of spatial coordinates y and independent of piel brightness no correlation between piel values and noise component
43 Noise Models Gaussian Noise (Normal Noise) p 1 ( ) ( ) e p() mean and variance
44 Noise Models ) ( 1 ) ( e p Gaussian Noise (Normal Noise) = 0, = 1 ) ( 1 ) ( e p
45 Noise Models = 0, = 1 Gaussian Noise (Normal Noise) p 1 ( ) ( ) e y parameters: (average value) and (standard deviation) sufficient to describe the distribution y central limit theorem many small effects add independently into an observed variable y used to model sensor noise (low light levels)
46 Gaussian Noise Noise Models f = imread('bubbles.tif'); imshow(f,[]);[m N] = sie(f); ) ( 1 ) ( e p ) ( 1 ) ( e p
47 Gaussian Noise Noise Models f = imread('bubbles.tif'); imshow(f,[]);[m N] = sie(f); ) ( 1 ) ( e p ) ( 1 ) ( e p
48 Noise Models Gaussian Noise p 1 ( ) ( ) ( ) e f = imread('bubbles.tif'); imshow(f,[]);[m N] = sie(f); fgn = imnoise(f, 'gaussian', 0, 0.01); figure; imshow(fgn,[]);
49 Noise Models Uniform p( ) b 1 0 a : a b : otherwise 1 b a p() mean and variance a b ( b 1 a ) a b
50 Noise Models a = 0, b = 1 Uniform p( ) b 1 0 a : a b : otherwise
51 Noise Models a = 0, b = 1 Uniform p( ) b 1 0 a : a b : otherwise y parameters: a, b y generated by a "standard" random number generator
52 Noise Models Uniform p( ) b 1 0 a : a b : otherwise y parameters: a, b y generated by a "standard" random number generator
53 Noise Models Salt and Pepper (Impulse) y bipolar impulse noise Pa : a p( ) Pb : b 0 : otherwise p() P b P a a b
54 Noise Models P a = 0.5, a = 0; P b = 0.5, b = 1 Salt and Pepper (Impulse) y bipolar impulse noise Pa : a p( ) Pb : b 0 : otherwise
55 Noise Models P a = 0.5, a = 0; P b = 0.5, b = 1 Salt and Pepper (Impulse) y bipolar impulse noise Pa : a p( ) Pb : b 0 : otherwise y parameters: a, b y modelling of large impulse corruptions (often a, b are saturated values: 0 and 55)
56 Noise Models Salt and Pepper (Impulse) y bipolar impulse noise Pa : a p( ) Pb : b 0 : otherwise f = imread('bubbles.tif'); imshow(f,[]);[m N] = sie(f);
57 Noise Models Salt and Pepper (Impulse) y bipolar impulse noise Pa : a p( ) Pb : b 0 : otherwise f = imread('bubbles.tif'); imshow(f,[]);[m N] = sie(f);
58 Noise Models Salt and Pepper (Impulse) y bipolar impulse noise Pa : a p( ) Pb : b 0 : otherwise f = imread('bubbles.tif'); imshow(f,[]);[m N] = sie(f); fsap = imnoise(f, 'salt & pepper', 0.05); figure; imshow(fsap,[]);
59 Rayleigh mean and variance Noise Models a a e a b p b a : 0 : ) ( ) ( p() a b a 4 a b / 4 ) (4 b
60 Noise Models a = 0, b = 1 Rayleigh p( ) b a 0 e ( a) b : : a a
61 Noise Models a = 0, b = 1 Rayleigh p( ) b a 0 e ( a) b : : a a y parameters: a, b y distribution of the length of a D vector with normally distributed components y characterising noise in range data y approimating skewed histograms also: spectrum of random comple numbers
62 Noise Models Rayleigh p( ) b a 0 e ( a) b : : a a y parameters: a, b y distribution of the length of a D vector distributed components y characterising noise in range data y approimating skewed histograms
63 Noise Models Eponential p( ) a e 0 a : : 0 0 p() a mean and variance 1 1 a a
64 Noise Models a = 1 Eponential p( ) a e 0 a : : 0 0
65 Noise Models a = 1 Eponential p( ) a e 0 a : : 0 0 y parameter: a y special case of Erlang (Gamma) noise (b = 1) y often used to model time intervals (>0!) between randomly occurring events (radioactive decay)
66 Noise Models Eponential p( ) a e 0 a : : 0 0 y parameter: a y special case of Erlang (Gamma) noise y often used to model time intervals (>0!) between randomly occurring events
67 Erlang (Gamma) Noise mean and variance Noise Models p() K a b 1 1) ( 1 1)! ( 1) ( b b e b b a K 0 : 0 0 : 1)! ( ) ( 1 e b a p a b b a b a b
68 Noise Models a =, b = 5 Erlang (Gamma) Noise p( ) b a ( b b1 e 1)! 0 a : : 0 0
69 Noise Models a =, b = 5 Erlang (Gamma) Noise p( ) b a ( b b1 e 1)! 0 a : : 0 0 y sum of b eponentially distributed variables y eponential distribution with parameter a
70 Contents Noise Reduction
71 3 Noise Reduction Additive Noise Additive Noise y assumed to be uncorrelated with the image y assumed to be the only degradation present in an image Estimation of Noise Shape and Noise Parameters y from images of a "flat" gray surface y from patches in the image where the gray value is approimately constant (as featureless as possible)
72 3 Noise Reduction Additive Noise Estimation of Noise Shape and Noise Parameters y from images of a "flat" gray surface f = imread('bubbles.tif'); selpol = roipoly(f);
73 3 Noise Reduction Additive Noise Estimation of Noise Shape and Noise Parameters y from images of a "flat" gray surface f = imread('bubbles.tif'); selpol = roipoly(f); figure; imhist(f(selpol));
74 3 Noise Reduction Additive Noise Estimation of Noise Shape and Noise Parameters y from images of a "flat" gray surface f = imread('bubbles.tif'); selpol = roipoly(f); figure; imhist(f(selpol));
75 3 Noise Reduction Additive Noise Restoration in Case of Additive Noise Only y spatial filtering: mean arithmetic, geometric, harmonic (Pythagorean means) cannot compensate for salt & pepper noise contra-harmonic (Lehmer) mean can compensate for salt or pepper noise order-statistics well suited for salt & pepper noise median, median with repeated passes,... midpoint alpha-trimmed filter
76 Digital Image Processing Part 4: Image Restoration AASS Learning Systems Lab, Dep. Teknik Room T109 Course Book Chapter
77 Contents 1. Image Degradation and Restoration. Noise Models 3. Noise Reduction 4. Image Restoration Linear, Position Invariant (LPI) Degradation Processes Inverse Filtering, Deconvolution Wiener Filtering
78 3 Noise Reduction Adaptive Mean Filter
79 3 Noise Reduction Adaptive Mean Filter fˆ, y g(, y) n g(, y) m L L
80 3 Noise Reduction Adaptive Mean Filter fˆ, y g(, y) n g(, y) m L L local mean
81 3 Noise Reduction Adaptive Mean Filter fˆ, y g(, y) n g(, y) m L L local variance local mean
82 3 Noise Reduction Adaptive Mean Filter needs to be estimated fˆ, y g(, y) n g(, y) m L L local variance local mean
83 Noise Reduction Adaptive Mean Filter y behaviour based on the local variance (~ average contrast) L L n m y g y g y f ), ( ), (, ˆ 3
84 Noise Reduction Adaptive Mean Filter y behaviour based on the local variance (~ average contrast) y if the noise has ero variance ( n = 0) then f(,y)=g(,y) L L n m y g y g y f ), ( ), (, ˆ ^ 3
85 3 Noise Reduction Adaptive Mean Filter fˆ, y g(, y) n g(, y) m y behaviour based on the local variance (~ average contrast) ^ y if the noise has ero variance ( n = 0) then f(,y)=g(,y) y if the local variance L is large compared to the noise variance n then ^ f(,y)g(,y) preserve edges L L
86 3 Noise Reduction Adaptive Mean Filter fˆ, y g(, y) n g(, y) m y behaviour based on the local variance (~ average contrast) ^ y if the noise has ero variance ( n = 0) then f(,y)=g(,y) y if the local variance L is large compared to the noise variance n then ^ f(,y)g(,y) preserve edges y if L n then f(,y)m L (mean over the neighbourhood) average out noise L L
87 3 Noise Reduction Adaptive Median Filter y subimage of varying sie y tries to recognie S&P noise piels (as min/ma values) Step A y epand subimage until median is not S&P noise median min AND median ma, continue with step B y or subimage has maimal sie piel = median Step B y piel = y if y min AND y ma y piel = median otherwise
88 3 Noise Reduction Periodic Noise Periodic Degradation Function H(,y) y additive, periodic (approimately sinusoidal) noise peaks in the Fourier transform F
89 3 Noise Reduction Periodic Noise Periodic Degradation Function H(,y) y additive, periodic (approimately sinusoidal) noise peaks in the Fourier transform F
90 3 Noise Reduction Periodic Noise Periodic Degradation Function H(,y) y applying a band-reject filter (sets the peaks to ero) y removes peaks in the Fourier transform in pairs Butterworth band-reject filter
91 3 Noise Reduction Periodic Noise Notch Filtering y periodic noise applying a notch filter y must appear in symmetric pairs about the origin ideal notch reject filter Gaussian notch reject filter not shown: Butterworth notch reject filter
92 Noise Reduction Periodic Noise Optimal Notch Filtering y estimate principal interference frequencies "by eye" using a notch pass filter H np (u,v) y subtract a weighted portion of the interference pattern y optimal value of the weight w? ), ( ), ( ), ( ˆ v G u v u H v u N np ), ) ˆ(, ( ), ( ), ( ˆ y n y w y g y f )}, ( ˆ { ), ( ˆ 1 v u N y n F 3
93 Noise Reduction Periodic Noise Optimal Notch Filtering Optimality Criterion y minimise variance of the estimate f(,y) over a (a+1)(b+1) neighbourhood y assume that w(,y) is approimately constant over the (a+1)(b+1) neighbourhood w( + s, y + t) w(,y) y w y w y, 0,,! ^ ), ˆ( ), ( ˆ ), ˆ( ), ( ), ) ˆ(, (, y n y n y n y g y n y g y w 3
94 Noise Reduction Periodic Noise Optimal Notch Filtering y tries to distinguish periodic and random noise y periodic large weight if degraded image is highly correlated with the noise estimate: cov[g(,y),n(,y)] is large y random small weight if the variance of the noise estimate over the neighbourhood is large (irregular noise) ), ˆ( ), ( ˆ ), ˆ( ), ( ), ) ˆ(, (, y n y n y n y g y n y g y w ), ) ˆ(, ( ), ( ), ( ˆ y n y w y g y f 3
Computer 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 informationComputer Vision. Filtering in the Frequency Domain
Computer Vision Filtering in the Frequency Domain Filippo Bergamasco (filippo.bergamasco@unive.it) http://www.dais.unive.it/~bergamasco DAIS, Ca Foscari University of Venice Academic year 2016/2017 Introduction
More informationFourier Transform 2D
Image Processing - Lesson 8 Fourier Transform 2D Discrete Fourier Transform - 2D Continues Fourier Transform - 2D Fourier Properties Convolution Theorem Eamples = + + + The 2D Discrete Fourier Transform
More informationSignals, Instruments, and Systems W5. Introduction to Signal Processing Sampling, Reconstruction, and Filters
Signals, Instruments, and Systems W5 Introduction to Signal Processing Sampling, Reconstruction, and Filters Acknowledgments Recapitulation of Key Concepts from the Last Lecture Dirac delta function (
More informationImage 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 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 informationECG782: Multidimensional Digital Signal Processing
Professor Brendan Morris, SEB 3216, brendan.morris@unlv.edu ECG782: Multidimensional Digital Signal Processing Filtering in the Frequency Domain http://www.ee.unlv.edu/~b1morris/ecg782/ 2 Outline Background
More informationMultiscale Image Transforms
Multiscale Image Transforms Goal: Develop filter-based representations to decompose images into component parts, to extract features/structures of interest, and to attenuate noise. Motivation: extract
More informationSEISMIC WAVE PROPAGATION. Lecture 2: Fourier Analysis
SEISMIC WAVE PROPAGATION Lecture 2: Fourier Analysis Fourier Series & Fourier Transforms Fourier Series Review of trigonometric identities Analysing the square wave Fourier Transform Transforms of some
More informationRepresentation of 1D Function
Bioengineering 280A Principles of Biomedical Imaging Fall Quarter 2005 Linear Systems Lecture 2 Representation of 1D Function From the sifting property, we can write a 1D function as g( = g(ξδ( ξdξ. To
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 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 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 informationStatistical Geometry Processing Winter Semester 2011/2012
Statistical Geometry Processing Winter Semester 2011/2012 Linear Algebra, Function Spaces & Inverse Problems Vector and Function Spaces 3 Vectors vectors are arrows in space classically: 2 or 3 dim. Euclidian
More informationEECS490: Digital Image Processing. Lecture #11
Lecture #11 Filtering Applications: OCR, scanning Highpass filters Laplacian in the frequency domain Image enhancement using highpass filters Homomorphic filters Bandreject/bandpass/notch filters Correlation
More informationESS Finite Impulse Response Filters and the Z-transform
9. Finite Impulse Response Filters and the Z-transform We are going to have two lectures on filters you can find much more material in Bob Crosson s notes. In the first lecture we will focus on some of
More informationIndex. p, lip, 78 8 function, 107 v, 7-8 w, 7-8 i,7-8 sine, 43 Bo,94-96
p, lip, 78 8 function, 107 v, 7-8 w, 7-8 i,7-8 sine, 43 Bo,94-96 B 1,94-96 M,94-96 B oro!' 94-96 BIro!' 94-96 I/r, 79 2D linear system, 56 2D FFT, 119 2D Fourier transform, 1, 12, 18,91 2D sinc, 107, 112
More informationSystem Modeling and Identification CHBE 702 Korea University Prof. Dae Ryook Yang
System Modeling and Identification CHBE 702 Korea University Prof. Dae Ryook Yang 1-1 Course Description Emphases Delivering concepts and Practice Programming Identification Methods using Matlab Class
More informationAnnouncements. Filtering. Image Filtering. Linear Filters. Example: Smoothing by Averaging. Homework 2 is due Apr 26, 11:59 PM Reading:
Announcements Filtering Homework 2 is due Apr 26, :59 PM eading: Chapter 4: Linear Filters CSE 52 Lecture 6 mage Filtering nput Output Filter (From Bill Freeman) Example: Smoothing by Averaging Linear
More informationPART 1. Review of DSP. f (t)e iωt dt. F(ω) = f (t) = 1 2π. F(ω)e iωt dω. f (t) F (ω) The Fourier Transform. Fourier Transform.
PART 1 Review of DSP Mauricio Sacchi University of Alberta, Edmonton, AB, Canada The Fourier Transform F() = f (t) = 1 2π f (t)e it dt F()e it d Fourier Transform Inverse Transform f (t) F () Part 1 Review
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 informationCorrelator I. Basics. Chapter Introduction. 8.2 Digitization Sampling. D. Anish Roshi
Chapter 8 Correlator I. Basics D. Anish Roshi 8.1 Introduction A radio interferometer measures the mutual coherence function of the electric field due to a given source brightness distribution in the sky.
More information3. Lecture. Fourier Transformation Sampling
3. Lecture Fourier Transformation Sampling Some slides taken from Digital Image Processing: An Algorithmic Introduction using Java, Wilhelm Burger and Mark James Burge Separability ² The 2D DFT can be
More informationComputer Vision Lecture 3
Computer Vision Lecture 3 Linear Filters 03.11.2015 Bastian Leibe RWTH Aachen http://www.vision.rwth-aachen.de leibe@vision.rwth-aachen.de Demo Haribo Classification Code available on the class website...
More informationThe Fourier Transform
The Fourier Transorm Fourier Series Fourier Transorm The Basic Theorems and Applications Sampling Bracewell, R. The Fourier Transorm and Its Applications, 3rd ed. New York: McGraw-Hill, 2. Eric W. Weisstein.
More informationFourier transform. Stefano Ferrari. Università degli Studi di Milano Methods for Image Processing. academic year
Fourier transform Stefano Ferrari Università degli Studi di Milano stefano.ferrari@unimi.it Methods for Image Processing academic year 27 28 Function transforms Sometimes, operating on a class of functions
More informationIntroduction to the Mathematics of Medical Imaging
Introduction to the Mathematics of Medical Imaging Second Edition Charles L. Epstein University of Pennsylvania Philadelphia, Pennsylvania EiaJTL Society for Industrial and Applied Mathematics Philadelphia
More informationInformation and Communications Security: Encryption and Information Hiding
Short Course on Information and Communications Security: Encryption and Information Hiding Tuesday, 10 March Friday, 13 March, 2015 Lecture 5: Signal Analysis Contents The complex exponential The complex
More informationUNIT III IMAGE RESTORATION Part A Questions 1. What is meant by Image Restoration? Restoration attempts to reconstruct or recover an image that has been degraded by using a clear knowledge of the degrading
More informationThe (Fast) Fourier Transform
The (Fast) Fourier Transform The Fourier transform (FT) is the analog, for non-periodic functions, of the Fourier series for periodic functions can be considered as a Fourier series in the limit that the
More informationCAP 5415 Computer Vision Fall 2011
CAP 545 Computer Vision Fall 2 Dr. Mubarak Sa Univ. o Central Florida www.cs.uc.edu/~vision/courses/cap545/all22 Oice 247-F HEC Filtering Lecture-2 General Binary Gray Scale Color Binary Images Y Row X
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 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 informationThe spatial frequency domain
The spatial frequenc /3/5 wk9-a- Recall: plane wave propagation λ z= θ path dela increases linearl with E ep i2π sinθ + λ z i2π cosθ λ z plane of observation /3/5 wk9-a-2 Spatial frequenc angle of propagation?
More informationChapter 4 Image Enhancement in the Frequency Domain
Chapter 4 Image Enhancement in the Frequency Domain Yinghua He School of Computer Science and Technology Tianjin University Background Introduction to the Fourier Transform and the Frequency Domain Smoothing
More informationCAP 5415 Computer Vision
CAP 545 Computer Vision Dr. Mubarak Sa Univ. o Central Florida Filtering Lecture-2 Contents Filtering/Smooting/Removing Noise Convolution/Correlation Image Derivatives Histogram Some Matlab Functions General
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 informationSignal Processing COS 323
Signal Processing COS 323 Digital Signals D: functions of space or time e.g., sound 2D: often functions of 2 spatial dimensions e.g. images 3D: functions of 3 spatial dimensions CAT, MRI scans or 2 space,
More informationECE Digital Image Processing and Introduction to Computer Vision
ECE592-064 Digital Image Processing and Introduction to Computer Vision Depart. of ECE, NC State University Instructor: Tianfu (Matt) Wu Spring 2017 Outline Recap, image degradation / restoration Template
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 informationPoles and Zeros in z-plane
M58 Mixed Signal Processors page of 6 Poles and Zeros in z-plane z-plane Response of discrete-time system (i.e. digital filter at a particular frequency ω is determined by the distance between its poles
More informationDepartment of Electrical and Telecommunications Engineering Technology TEL (718) FAX: (718) Courses Description:
NEW YORK CITY COLLEGE OF TECHNOLOGY The City University of New York 300 Jay Street Brooklyn, NY 11201-2983 Department of Electrical and Telecommunications Engineering Technology TEL (718) 260-5300 - FAX:
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 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 informationSIGNALS AND SYSTEMS I. RAVI KUMAR
Signals and Systems SIGNALS AND SYSTEMS I. RAVI KUMAR Head Department of Electronics and Communication Engineering Sree Visvesvaraya Institute of Technology and Science Mahabubnagar, Andhra Pradesh New
More informationElec4621 Advanced Digital Signal Processing Chapter 11: Time-Frequency Analysis
Elec461 Advanced Digital Signal Processing Chapter 11: Time-Frequency Analysis Dr. D. S. Taubman May 3, 011 In this last chapter of your notes, we are interested in the problem of nding the instantaneous
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 informationReview: Continuous Fourier Transform
Review: Continuous Fourier Transform Review: convolution x t h t = x τ h(t τ)dτ Convolution in time domain Derivation Convolution Property Interchange the order of integrals Let Convolution Property By
More informationLecture 04 Image Filtering
Institute of Informatics Institute of Neuroinformatics Lecture 04 Image Filtering Davide Scaramuzza 1 Lab Exercise 2 - Today afternoon Room ETH HG E 1.1 from 13:15 to 15:00 Work description: your first
More informationExperimental Fourier Transforms
Chapter 5 Experimental Fourier Transforms 5.1 Sampling and Aliasing Given x(t), we observe only sampled data x s (t) = x(t)s(t; T s ) (Fig. 5.1), where s is called sampling or comb function and can be
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 informationECE 425. Image Science and Engineering
ECE 425 Image Science and Engineering Spring Semester 2000 Course Notes Robert A. Schowengerdt schowengerdt@ece.arizona.edu (520) 62-2706 (voice), (520) 62-8076 (fa) ECE402 DEFINITIONS 2 Image science
More informationECG782: Multidimensional Digital Signal Processing
Professor Brendan Morris, SEB 3216, brendan.morris@unlv.edu ECG782: Multidimensional Digital Signal Processing Spring 2014 TTh 14:30-15:45 CBC C313 Lecture 05 Image Processing Basics 13/02/04 http://www.ee.unlv.edu/~b1morris/ecg782/
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 informationChap 4. Sampling of Continuous-Time Signals
Digital Signal Processing Chap 4. Sampling of Continuous-Time Signals Chang-Su Kim Digital Processing of Continuous-Time Signals Digital processing of a CT signal involves three basic steps 1. Conversion
More informationFourier Reconstruction. Polar Version of Inverse FT. Filtered Backprojection [ ] Bioengineering 280A Principles of Biomedical Imaging
Fourier Reconstruction Bioengineering 280A Principles of Biomedical Imaging Fall Quarter 2014 CT/Fourier Lecture 5 F Interpolate onto Cartesian grid with appropriate density correction then take inverse
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 informationTemplates, Image Pyramids, and Filter Banks
Templates, Image Pyramids, and Filter Banks 09/9/ Computer Vision James Hays, Brown Slides: Hoiem and others Review. Match the spatial domain image to the Fourier magnitude image 2 3 4 5 B A C D E Slide:
More informationA523 Signal Modeling, Statistical Inference and Data Mining in Astrophysics Spring 2011
A523 Signal Modeling, Statistical Inference and Data Mining in Astrophysics Spring 2011 Lecture 6 PDFs for Lecture 1-5 are on the web page Problem set 2 is on the web page Article on web page A Guided
More informationComputer Vision & Digital Image Processing. Periodicity of the Fourier transform
Computer Vision & Digital Image Processing Fourier Transform Properties, the Laplacian, Convolution and Correlation Dr. D. J. Jackson Lecture 9- Periodicity of the Fourier transform The discrete Fourier
More informationQuality Improves with More Rays
Recap Quality Improves with More Rays Area Area 1 shadow ray 16 shadow rays CS348b Lecture 8 Pat Hanrahan / Matt Pharr, Spring 2018 pixelsamples = 1 jaggies pixelsamples = 16 anti-aliased Sampling and
More informationELEN E4810: Digital Signal Processing Topic 11: Continuous Signals. 1. Sampling and Reconstruction 2. Quantization
ELEN E4810: Digital Signal Processing Topic 11: Continuous Signals 1. Sampling and Reconstruction 2. Quantization 1 1. Sampling & Reconstruction DSP must interact with an analog world: A to D D to A x(t)
More informationBIOSIGNAL PROCESSING. Hee Chan Kim, Ph.D. Department of Biomedical Engineering College of Medicine Seoul National University
BIOSIGNAL PROCESSING Hee Chan Kim, Ph.D. Department of Biomedical Engineering College of Medicine Seoul National University INTRODUCTION Biosignals (biological signals) : space, time, or space-time records
More informationFiltering in the Frequency Domain
Filtering in the Frequency Domain Outline Fourier Transform Filtering in Fourier Transform Domain 2/20/2014 2 Fourier Series and Fourier Transform: History Jean Baptiste Joseph Fourier, French mathematician
More informationSistemas de Aquisição de Dados. Mestrado Integrado em Eng. Física Tecnológica 2016/17 Aula 3, 3rd September
Sistemas de Aquisição de Dados Mestrado Integrado em Eng. Física Tecnológica 2016/17 Aula 3, 3rd September The Data Converter Interface Analog Media and Transducers Signal Conditioning Signal Conditioning
More informationTIME SERIES ANALYSIS
2 WE ARE DEALING WITH THE TOUGHEST CASES: TIME SERIES OF UNEQUALLY SPACED AND GAPPED ASTRONOMICAL DATA 3 A PERIODIC SIGNAL Dots: periodic signal with frequency f = 0.123456789 d -1. Dotted line: fit for
More informationTopics. View Aliasing. CT Sampling Requirements. Sampling Requirements in CT Sampling Theory Aliasing
Topics Bioengineering 280A Principles of Biomedical Imaging Sampling Requirements in CT Sampling Theory Aliasing Fall Quarter 2007 CT/Fourier Lecture 4 CT Sampling Requirements View Aliasing What should
More informationSolution Set #1
05-738-0083 Solution Set # i. Evaluate δ [SINC []] = δ sin[π] π Recall relation for Dirac delta function wit functional argument (Fourier Metods, δ [g []] = δ [ 0] (6.38) dg =0 Te SINC function as zeros
More informationEE16B - Spring 17 - Lecture 11B Notes 1
EE6B - Spring 7 - Lecture B Notes Murat Arcak 6 April 207 Licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License. Interpolation with Basis Functions Recall that
More informationChapter 2: Problem Solutions
Chapter 2: Problem Solutions Discrete Time Processing of Continuous Time Signals Sampling à Problem 2.1. Problem: Consider a sinusoidal signal and let us sample it at a frequency F s 2kHz. xt 3cos1000t
More informationLeast Squares with Examples in Signal Processing 1. 2 Overdetermined equations. 1 Notation. The sum of squares of x is denoted by x 2 2, i.e.
Least Squares with Eamples in Signal Processing Ivan Selesnick March 7, 3 NYU-Poly These notes address (approimate) solutions to linear equations by least squares We deal with the easy case wherein the
More informationFourier Transforms 1D
Fourier Transforms 1D 3D Image Processing Alireza Ghane 1 Overview Recap Intuitions Function representations shift-invariant spaces linear, time-invariant (LTI) systems complex numbers Fourier Transforms
More informationTutorial Sheet #2 discrete vs. continuous functions, periodicity, sampling
2.39 utorial Sheet #2 discrete vs. continuous functions, periodicity, sampling We will encounter two classes of signals in this class, continuous-signals and discrete-signals. he distinct mathematical
More informationFrequency2: Sampling and Aliasing
CS 4495 Computer Vision Frequency2: Sampling and Aliasing Aaron Bobick School of Interactive Computing Administrivia Project 1 is due tonight. Submit what you have at the deadline. Next problem set stereo
More informationFourier Transforms For additional information, see the classic book The Fourier Transform and its Applications by Ronald N. Bracewell (which is on the shelves of most radio astronomers) and the Wikipedia
More informationVarious signal sampling and reconstruction methods
Various signal sampling and reconstruction methods Rolands Shavelis, Modris Greitans 14 Dzerbenes str., Riga LV-1006, Latvia Contents Classical uniform sampling and reconstruction Advanced sampling and
More informationMultidimensional partitions of unity and Gaussian terrains
and Gaussian terrains Richard A. Bale, Jeff P. Grossman, Gary F. Margrave, and Michael P. Lamoureu ABSTRACT Partitions of unity play an important rôle as amplitude-preserving windows for nonstationary
More informationSyllabus for IMGS-616 Fourier Methods in Imaging (RIT #11857) Week 1: 8/26, 8/28 Week 2: 9/2, 9/4
IMGS 616-20141 p.1 Syllabus for IMGS-616 Fourier Methods in Imaging (RIT #11857) 3 July 2014 (TENTATIVE and subject to change) Note that I expect to be in Europe twice during the term: in Paris the week
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 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 informationI Chen Lin, Assistant Professor Dept. of CS, National Chiao Tung University. Computer Vision: 4. Filtering
I Chen Lin, Assistant Professor Dept. of CS, National Chiao Tung University Computer Vision: 4. Filtering Outline Impulse response and convolution. Linear filter and image pyramid. Textbook: David A. Forsyth
More informationDISCRETE-TIME SIGNAL PROCESSING
THIRD EDITION DISCRETE-TIME SIGNAL PROCESSING ALAN V. OPPENHEIM MASSACHUSETTS INSTITUTE OF TECHNOLOGY RONALD W. SCHÄFER HEWLETT-PACKARD LABORATORIES Upper Saddle River Boston Columbus San Francisco New
More informationImage Analysis. 3. Fourier Transform
Image Analysis Image Analysis 3. Fourier Transform Lars Schmidt-Thieme Information Systems and Machine Learning Lab (ISMLL) Institute for Business Economics and Information Systems & Institute for Computer
More information1-D MATH REVIEW CONTINUOUS 1-D FUNCTIONS. Kronecker delta function and its relatives. x 0 = 0
-D MATH REVIEW CONTINUOUS -D FUNCTIONS Kronecker delta function and its relatives delta function δ ( 0 ) 0 = 0 NOTE: The delta function s amplitude is infinite and its area is. The amplitude is shown as
More informationY m = y n e 2πi(m 1)(n 1)/N (1) Y m e 2πi(m 1)(n 1)/N (2) m=1
The Discrete Fourier Transform (Bretherton notes): 1 Definition Let y n, n = 1,..., N be a sequence of N possibly comple values. The discrete Fourier transform () of this sequence is the sequence Y m,
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 informationDiscrete-Time Signals and Systems. Efficient Computation of the DFT: FFT Algorithms. Analog-to-Digital Conversion. Sampling Process.
iscrete-time Signals and Systems Efficient Computation of the FT: FFT Algorithms r. eepa Kundur University of Toronto Reference: Sections 6.1, 6., 6.4, 6.5 of John G. Proakis and imitris G. Manolakis,
More informationSampling اهمتسیس و اهلانگیس یرهطم لضفلاوبا دیس فیرش یتعنص هاگشناد رتویپماک هدکشناد
Sampling سیگنالها و سیستمها سید ابوالفضل مطهری دانشکده کامپیوتر دانشگاه صنعتی شریف Sampling Conversion of a continuous-time signal to discrete time. x(t) x[n] 0 2 4 6 8 10 t 0 2 4 6 8 10 n Sampling Applications
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 informationEnhancement Using Local Histogram
Enhancement Using Local Histogram Used to enhance details over small portions o the image. Deine a square or rectangular neighborhood hose center moves rom piel to piel. Compute local histogram based on
More informationFourier Transform in Image Processing. CS/BIOEN 6640 U of Utah Guido Gerig (slides modified from Marcel Prastawa 2012)
Fourier Transform in Image Processing CS/BIOEN 6640 U of Utah Guido Gerig (slides modified from Marcel Prastawa 2012) Basis Decomposition Write a function as a weighted sum of basis functions f ( x) wibi(
More informationCITS 4402 Computer Vision
CITS 4402 Computer Vision Prof Ajmal Mian Adj/A/Prof Mehdi Ravanbakhsh, CEO at Mapizy (www.mapizy.com) and InFarm (www.infarm.io) Lecture 04 Greyscale Image Analysis Lecture 03 Summary Images as 2-D signals
More informationStatistical Analysis of the Quantizer Output
Chapter 4 Statistical Analysis of the Quantizer Output 4. PDF AND CF OF THE QUANTIZER OUTPUT Signal quantization is a nonlinear operation, and is therefore difficult to analyze directly. Instead of devoting
More informationSummary of Lecture 5
Summary of Lecture 5 In lecture 5 we learnt how to pick the reproduction levels for the given thresholds. We learnt how to design MSQE optimal (Lloyd-Max) quantizers. We reviewed linear systems, linear
More informationFOURIER INVERSION. an additive character in each of its arguments. The Fourier transform of f is
FOURIER INVERSION 1. The Fourier Transform and the Inverse Fourier Transform Consider functions f, g : R n C, and consider the bilinear, symmetric function ψ : R n R n C, ψ(, ) = ep(2πi ), an additive
More informationDISCRETE FOURIER TRANSFORM
DD2423 Image Processing and Computer Vision DISCRETE FOURIER TRANSFORM Mårten Björkman Computer Vision and Active Perception School of Computer Science and Communication November 1, 2012 1 Terminology:
More informationImage Acquisition and Sampling Theory
Image Acquisition and Sampling Theory Electromagnetic Spectrum The wavelength required to see an object must be the same size of smaller than the object 2 Image Sensors 3 Sensor Strips 4 Digital Image
More informationHistogram Processing
Histogram Processing The histogram of a digital image with gray levels in the range [0,L-] is a discrete function h ( r k ) = n k where r k n k = k th gray level = number of pixels in the image having
More informationDigital Signal Processing Prof. T. K. Basu Department of Electrical Engineering Indian Institute of Technology, Kharagpur
Digital Signal Processing Prof. T. K. Basu Department of Electrical Engineering Indian Institute of Technology, Kharagpur Lecture - 6 Z-Transform (Contd.) Discussing about inverse inverse Z transform,
More information