Signal Processing COS 323
|
|
- Peregrine Abner Hubbard
- 5 years ago
- Views:
Transcription
1 Signal Processing COS 323
2 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, time video
3 Digital Signal Processing. Understand analogues of filters 2. Understand nature of sampling
4 Filtering Consider a noisy D signal ft One basic operation: smooth the signal Output = new function ht Filter ft ht
5 Filtering Consider a noisy D signal ft One basic operation: smooth the signal Output = new function ht Linear Shift-Invariant Filters If you double input, double output If you shift input by t, shift output by t
6 Simplest smoothing filter Take average of nearby points: Filter
7 Convolution Output signal at each point = weighted average of local region of input signal Depends on input signal, pattern of weights Filter g = function containing weights for linear combination Basic operation = move filter to some position, add up f times g g: c Filter 0
8 Convolution f g f g = f t g t dt Try for yourself:
9 Convolution f is called signal and g is filter or kernel, but the operation is symmetric *for real functions But: usually desirable to leave a constant signal unchanged: choose g such that g t dt =
10 Filter Choices Simple filters: bo, triangle
11 Gaussian Filter Commonly used filter G 2σ = e σ 2π 2 2
12 2D Gaussian Filter
13 Eample: Smoothing Original image Smoothed with 2D Gaussian kernel
14 Consider magnitude of gradient st derivative Eample: Edge Detection
15 Smoothed Derivative Derivative of noisy signal = more noisy Solution: smooth with a Gaussian before taking derivative Differentiation and convolution both linear operators: they commute d d f g = df d g = f dg d
16 Smoothed Derivative Result: good way of finding derivative = convolution with derivative of Gaussian
17 Results in D: Peak appears at edge
18 Smoothed Derivative in 2D What is derivative in 2D? Gradient: Gaussian is separable! Combine smoothing, differentiation: = y f f y f,, = =,,,,,, 2 y G G y f y G G y f y G G y f y G G y f y G y f, 2 y G G y G =
19 Smoothed Derivative in 2D = =,,,,,, 2 y G G y f y G G y f y G G y f y G G y f y G y f
20 Edge Detection using Derivative of Gaussian Original Image Smoothed Gradient Magnitude
21 Canny Edge Detector Smooth Find derivative Find maima Threshold
22 Canny Edge Detector Original Image Edges
23 Sampling
24 Sampled Signals Analog domain: Continuous signals Digital domain: Can t store continuous signal: instead store samples Usually evenly sampled: f 0 =f 0, f =f 0 +, f 2 =f 0 +2, f 3 =f 0 +3,
25 3 Hz sine wave
26 3Hz sine sampled at 5Hz
27 3Hz sine sampled at 5Hz
28 5Hz sine sampled at 27 Hz
29 5Hz sine sampled at 5Hz
30 5Hz sine sampled at 6Hz
31 5Hz sine sampled at 6Hz Aliasing!
32 Aliasing Need to sample at least twice per period to capture the signal unambiguously Nyquist s theorem: Highest allowed signal frequency is half the sampling frequency = Nyquist frequency E.g., CD quality audio is 44,00 Hz Highest frequency representable is 22,050 Hz Limit of human hearing: ~7kHz to 20kHz
33 Aliasing in D Frequencies above Nyquist get reflected back below Nyquist 0 f N
34 Aliasing strikes!
35
36 Preventing aliasing Use a sample rate high enough to capture frequencies of interest i.e., > twice the highest frequency of interest Apply a low-pass filter to remove frequencies above the Nyquist frequency, before sampling.
37 Discrete Convolution Integral becomes sum over samples f g = fi g i i Normalization condition is i g i =
38 Computing Discrete Convolutions f g = fi g for = to n for i = to m out = out + fi * g-i i i Does not handle boundaries! If f has n samples and g has m nonzero samples, straightforward computation takes time Onm OK for small filter kernels, bad for large ones
39 Fourier Analysis
40 Frequency Domain Any signal can be represented as a sum of sinusoids at discrete frequencies, each with a given magnitude and phase
41
42
43 Frequency content in audio Frequency related to pitch: A 440 : 440 Hz 880Hz: one octave above Frequency also related to timbre: Real sounds contain many frequencies Higher frequency content can make sounds brighter In speech, higher frequencies are related to vowels, consonants independent of spoken/sung pitch
44 Fourier Transform Transform applied to function to analyze a signal s frequency content Several versions: Continuous Time Discrete Time Aperiodic / unbounded time, continuous frequency Fourier Transform Discrete-time Fourier Transform DTFT Periodic or bounded time, discrete frequency Fourier Series Discrete Fourier Transform DFT FFT used here
45 Fourier Series f Periodic function f defined over [ π.. π ] = 2 a0 + a + n cos n bn sin n n= n= where a n = π π π f cos n d b n = π π π f sin n d
46 Applying Euler s Formula Euler s formula: e i = cos + isin Apply: f = 2 a0 + a + n cos n bn sin n n= n= becomes where f = c n = 2π n= π π c n e in f e in d
47 Fourier Transform [Continuous] Fourier transform: Fk = F f 2πik = f e d Discrete Fourier transform: F k = n = 0 2πi F is a function of frequency describes how much of each frequency f contains Fourier transform is invertible f e k n
48 The Convolution Theorem Fourier transform turns convolution into multiplication: F f * g = F f F g and vice versa: F f g = F f * F g
49 Fourier Transform and Convolution Useful application #: Use frequency space to understand effects of filters Eample: Fourier transform of a Gaussian is a Gaussian Thus: attenuates high frequencies Amplitude Amplitude = Amplitude Frequency Frequency Frequency
50 Fourier Transform and Convolution Bo function? In frequency space: sinc function sinc = sin / Not as good at attenuating high frequencies
51 Fourier Transform and Convolution Fourier transform of derivative: d d Blows up for high frequencies! f = 2 k f F πi F After Gaussian smoothing, doesn t blow up
52 Fourier Transform and Convolution Useful application #2: Efficient computation Fast Fourier Transform FFT takes time On log n Thus, convolution can be performed in time On log n + m log m Greatest efficiency gains for large filters
Filtering 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 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 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 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 information!Sketch f(t) over one period. Show that the Fourier Series for f(t) is as given below. What is θ 1?
Second Year Engineering Mathematics Laboratory Michaelmas Term 998 -M L G Oldfield 30 September, 999 Exercise : Fourier Series & Transforms Revision 4 Answer all parts of Section A and B which are marked
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 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 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 informationLecture 5. The Digital Fourier Transform. (Based, in part, on The Scientist and Engineer's Guide to Digital Signal Processing by Steven Smith)
Lecture 5 The Digital Fourier Transform (Based, in part, on The Scientist and Engineer's Guide to Digital Signal Processing by Steven Smith) 1 -. 8 -. 6 -. 4 -. 2-1 -. 8 -. 6 -. 4 -. 2 -. 2. 4. 6. 8 1
More informationTopic 3: Fourier Series (FS)
ELEC264: Signals And Systems Topic 3: Fourier Series (FS) o o o o Introduction to frequency analysis of signals CT FS Fourier series of CT periodic signals Signal Symmetry and CT Fourier Series Properties
More informationE : Lecture 1 Introduction
E85.2607: Lecture 1 Introduction 1 Administrivia 2 DSP review 3 Fun with Matlab E85.2607: Lecture 1 Introduction 2010-01-21 1 / 24 Course overview Advanced Digital Signal Theory Design, analysis, and implementation
More informationImages have structure at various scales
Images have structure at various scales Frequency Frequency of a signal is how fast it changes Reflects scale of structure A combination of frequencies 0.1 X + 0.3 X + 0.5 X = Fourier transform Can we
More informationEdge Detection. CS 650: Computer Vision
CS 650: Computer Vision Edges and Gradients Edge: local indication of an object transition Edge detection: local operators that find edges (usually involves convolution) Local intensity transitions are
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 information8/19/16. Fourier Analysis. Fourier analysis: the dial tone phone. Fourier analysis: the dial tone phone
Patrice Koehl Department of Biological Sciences National University of Singapore http://www.cs.ucdavis.edu/~koehl/teaching/bl5229 koehl@cs.ucdavis.edu Fourier analysis: the dial tone phone We use Fourier
More informationFrom Fourier Series to Analysis of Non-stationary Signals - II
From Fourier Series to Analysis of Non-stationary Signals - II prof. Miroslav Vlcek October 10, 2017 Contents Signals 1 Signals 2 3 4 Contents Signals 1 Signals 2 3 4 Contents Signals 1 Signals 2 3 4 Contents
More informationTopic 7. Convolution, Filters, Correlation, Representation. Bryan Pardo, 2008, Northwestern University EECS 352: Machine Perception of Music and Audio
Topic 7 Convolution, Filters, Correlation, Representation Short time Fourier Transform Break signal into windows Calculate DFT of each window The Spectrogram spectrogram(y,1024,512,1024,fs,'yaxis'); A
More informationDEPARTMENT OF ELECTRICAL AND ELECTRONIC ENGINEERING EXAMINATIONS 2010
[E2.5] IMPERIAL COLLEGE LONDON DEPARTMENT OF ELECTRICAL AND ELECTRONIC ENGINEERING EXAMINATIONS 2010 EEE/ISE PART II MEng. BEng and ACGI SIGNALS AND LINEAR SYSTEMS Time allowed: 2:00 hours There are FOUR
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 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 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 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 informationQUESTION BANK SIGNALS AND SYSTEMS (4 th SEM ECE)
QUESTION BANK SIGNALS AND SYSTEMS (4 th SEM ECE) 1. For the signal shown in Fig. 1, find x(2t + 3). i. Fig. 1 2. What is the classification of the systems? 3. What are the Dirichlet s conditions of Fourier
More informationEE123 Digital Signal Processing
EE123 Digital Signal Processing Lecture 5 based on slides by J.M. Kahn Info Last time Finished DTFT Ch. 2 z-transforms Ch. 3 Today: DFT Ch. 8 Reminders: HW Due tonight The effects of sampling What is going
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 informationENT 315 Medical Signal Processing CHAPTER 2 DISCRETE FOURIER TRANSFORM. Dr. Lim Chee Chin
ENT 315 Medical Signal Processing CHAPTER 2 DISCRETE FOURIER TRANSFORM Dr. Lim Chee Chin Outline Introduction Discrete Fourier Series Properties of Discrete Fourier Series Time domain aliasing due to frequency
More informationSpatial Enhancement Region operations: k'(x,y) = F( k(x-m, y-n), k(x,y), k(x+m,y+n) ]
CEE 615: Digital Image Processing Spatial Enhancements 1 Spatial Enhancement Region operations: k'(x,y) = F( k(x-m, y-n), k(x,y), k(x+m,y+n) ] Template (Windowing) Operations Template (window, box, kernel)
More informationV(t) = Total Power = Calculating the Power Spectral Density (PSD) in IDL. Thomas Ferree, Ph.D. August 23, 1999
Calculating the Power Spectral Density (PSD) in IDL Thomas Ferree, Ph.D. August 23, 1999 This note outlines the calculation of power spectra via the fast Fourier transform (FFT) algorithm. There are several
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 informationToday s lecture. The Fourier transform. Sampling, aliasing, interpolation The Fast Fourier Transform (FFT) algorithm
Today s lecture The Fourier transform What is it? What is it useful for? What are its properties? Sampling, aliasing, interpolation The Fast Fourier Transform (FFT) algorithm Jean Baptiste Joseph Fourier
More informationChapter 16. Local Operations
Chapter 16 Local Operations g[x, y] =O{f[x ± x, y ± y]} In many common image processing operations, the output pixel is a weighted combination of the gray values of pixels in the neighborhood of the input
More informationTime-Frequency Analysis
Time-Frequency Analysis Basics of Fourier Series Philippe B. aval KSU Fall 015 Philippe B. aval (KSU) Fourier Series Fall 015 1 / 0 Introduction We first review how to derive the Fourier series of a function.
More informationIn this Lecture. Frequency domain analysis
In this Lecture Frequency domain analysis Introduction In most cases we want to know the frequency content of our signal Why? Most popular analysis in frequency domain is based on work of Joseph Fourier
More informationESE 250: Digital Audio Basics. Week 4 February 5, The Frequency Domain. ESE Spring'13 DeHon, Kod, Kadric, Wilson-Shah
ESE 250: Digital Audio Basics Week 4 February 5, 2013 The Frequency Domain 1 Course Map 2 Musical Representation With this compact notation Could communicate a sound to pianist Much more compact than 44KHz
More informationChapter 5 Frequency Domain Analysis of Systems
Chapter 5 Frequency Domain Analysis of Systems CT, LTI Systems Consider the following CT LTI system: xt () ht () yt () Assumption: the impulse response h(t) is absolutely integrable, i.e., ht ( ) dt< (this
More informationBEE604 Digital Signal Processing
BEE64 Digital Signal Processing Copiled by, Mrs.S.Sherine Assistant Professor Departent of EEE BIHER. COTETS Sapling Discrete Tie Fourier Transfor Properties of DTFT Discrete Fourier Transfor Inverse Discrete
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 informationBME 50500: Image and Signal Processing in Biomedicine. Lecture 2: Discrete Fourier Transform CCNY
1 Lucas Parra, CCNY BME 50500: Image and Signal Processing in Biomedicine Lecture 2: Discrete Fourier Transform Lucas C. Parra Biomedical Engineering Department CCNY http://bme.ccny.cuny.edu/faculty/parra/teaching/signal-and-image/
More informationFourier Analysis Overview (0A)
CTFS: Fourier Series CTFT: Fourier Transform DTFS: Fourier Series DTFT: Fourier Transform DFT: Discrete Fourier Transform Copyright (c) 2011-2016 Young W. Lim. Permission is granted to copy, distribute
More informationSummary of lecture 1. E x = E x =T. X T (e i!t ) which motivates us to define the energy spectrum Φ xx (!) = jx (i!)j 2 Z 1 Z =T. 2 d!
Summary of lecture I Continuous time: FS X FS [n] for periodic signals, FT X (i!) for non-periodic signals. II Discrete time: DTFT X T (e i!t ) III Poisson s summation formula: describes the relationship
More informationMath 56 Homework 5 Michael Downs
1. (a) Since f(x) = cos(6x) = ei6x 2 + e i6x 2, due to the orthogonality of each e inx, n Z, the only nonzero (complex) fourier coefficients are ˆf 6 and ˆf 6 and they re both 1 2 (which is also seen from
More informationarxiv:math/ v1 [math.na] 12 Feb 2005
arxiv:math/0502252v1 [math.na] 12 Feb 2005 An Orthogonal Discrete Auditory Transform Jack Xin and Yingyong Qi Abstract An orthogonal discrete auditory transform (ODAT) from sound signal to spectrum is
More informationCorrelation, discrete Fourier transforms and the power spectral density
Correlation, discrete Fourier transforms and the power spectral density visuals to accompany lectures, notes and m-files by Tak Igusa tigusa@jhu.edu Department of Civil Engineering Johns Hopkins University
More informationE2.5 Signals & Linear Systems. Tutorial Sheet 1 Introduction to Signals & Systems (Lectures 1 & 2)
E.5 Signals & Linear Systems Tutorial Sheet 1 Introduction to Signals & Systems (Lectures 1 & ) 1. Sketch each of the following continuous-time signals, specify if the signal is periodic/non-periodic,
More informationRepresentation of Signals & Systems
Representation of Signals & Systems Reference: Chapter 2,Communication Systems, Simon Haykin. Hilbert Transform Fourier transform frequency content of a signal (frequency selectivity designing frequency-selective
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 informationSignal Modeling Techniques in Speech Recognition. Hassan A. Kingravi
Signal Modeling Techniques in Speech Recognition Hassan A. Kingravi Outline Introduction Spectral Shaping Spectral Analysis Parameter Transforms Statistical Modeling Discussion Conclusions 1: Introduction
More information12.1 Fourier Transform of Discretely Sampled Data
494 Chapter 12. Fast Fourier Transform now is: The PSD-per-unit-time converges to finite values at all frequencies except those where h(t) has a discrete sine-wave (or cosine-wave) component of finite
More informationChapter 5 Frequency Domain Analysis of Systems
Chapter 5 Frequency Domain Analysis of Systems CT, LTI Systems Consider the following CT LTI system: xt () ht () yt () Assumption: the impulse response h(t) is absolutely integrable, i.e., ht ( ) dt< (this
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 informationFourier Analysis of Signals Using the DFT
Fourier Analysis of Signals Using the DFT ECE 535 Lecture April 29, 23 Overview: Motivation Many applications require analyzing the frequency content of signals Speech processing study resonances of vocal
More informationAnalog Digital Sampling & Discrete Time Discrete Values & Noise Digital-to-Analog Conversion Analog-to-Digital Conversion
Analog Digital Sampling & Discrete Time Discrete Values & Noise Digital-to-Analog Conversion Analog-to-Digital Conversion 6.082 Fall 2006 Analog Digital, Slide Plan: Mixed Signal Architecture volts bits
More informationBiomedical Engineering Image Formation II
Biomedical Engineering Image Formation II PD Dr. Frank G. Zöllner Computer Assisted Clinical Medicine Medical Faculty Mannheim Fourier Series - A Fourier series decomposes periodic functions or periodic
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 informationANALOG AND DIGITAL SIGNAL PROCESSING ADSP - Chapter 8
ANALOG AND DIGITAL SIGNAL PROCESSING ADSP - Chapter 8 Fm n N fnt ( ) e j2mn N X() X() 2 X() X() 3 W Chap. 8 Discrete Fourier Transform (DFT), FFT Prof. J.-P. Sandoz, 2-2 W W 3 W W x () x () x () 2 x ()
More informationGaussian Processes for Audio Feature Extraction
Gaussian Processes for Audio Feature Extraction Dr. Richard E. Turner (ret26@cam.ac.uk) Computational and Biological Learning Lab Department of Engineering University of Cambridge Machine hearing pipeline
More informationTopic 6. Timbre Representations
Topic 6 Timbre Representations We often say that singer s voice is magnetic the violin sounds bright this French horn sounds solid that drum sounds dull What aspect(s) of sound are these words describing?
More informationEE123 Digital Signal Processing
EE123 Digital Signal Processing Lecture 2A D.T Systems D. T. Fourier Transform A couple of things Read Ch 2 2.0-2.9 It s OK to use 2nd edition My office hours: posted on-line W 4-5pm Cory 506 ham radio
More informationwhere =0,, 1, () is the sample at time index and is the imaginary number 1. Then, () is a vector of values at frequency index corresponding to the mag
Efficient Discrete Tchebichef on Spectrum Analysis of Speech Recognition Ferda Ernawan and Nur Azman Abu Abstract Speech recognition is still a growing field of importance. The growth in computing power
More informationCMPT 889: Lecture 3 Fundamentals of Digital Audio, Discrete-Time Signals
CMPT 889: Lecture 3 Fundamentals of Digital Audio, Discrete-Time Signals Tamara Smyth, tamaras@cs.sfu.ca School of Computing Science, Simon Fraser University October 6, 2005 1 Sound Sound waves are longitudinal
More informationLecture Notes 5: Multiresolution Analysis
Optimization-based data analysis Fall 2017 Lecture Notes 5: Multiresolution Analysis 1 Frames A frame is a generalization of an orthonormal basis. The inner products between the vectors in a frame and
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 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 informationThe Hilbert Transform
The Hilbert Transform David Hilbert 1 ABSTRACT: In this presentation, the basic theoretical background of the Hilbert Transform is introduced. Using this transform, normal real-valued time domain functions
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 informationTheory and Problems of Signals and Systems
SCHAUM'S OUTLINES OF Theory and Problems of Signals and Systems HWEI P. HSU is Professor of Electrical Engineering at Fairleigh Dickinson University. He received his B.S. from National Taiwan University
More informationL29: Fourier analysis
L29: Fourier analysis Introduction The discrete Fourier Transform (DFT) The DFT matrix The Fast Fourier Transform (FFT) The Short-time Fourier Transform (STFT) Fourier Descriptors CSCE 666 Pattern Analysis
More informationContinuous Fourier transform of a Gaussian Function
Continuous Fourier transform of a Gaussian Function Gaussian function: e t2 /(2σ 2 ) The CFT of a Gaussian function is also a Gaussian function (i.e., time domain is Gaussian, then the frequency domain
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 informationComputational Data Analysis!
12.714 Computational Data Analysis! Alan Chave (alan@whoi.edu)! Thomas Herring (tah@mit.edu),! http://geoweb.mit.edu/~tah/12.714! Concentration Problem:! Today s class! Signals that are near time and band
More informationIntroduction to Linear Systems
cfl David J Fleet, 998 Introduction to Linear Systems David Fleet For operator T, input I, and response R = T [I], T satisfies: ffl homogeniety: iff T [ai] = at[i] 8a 2 C ffl additivity: iff T [I + I 2
More informationChirp Transform for FFT
Chirp Transform for FFT Since the FFT is an implementation of the DFT, it provides a frequency resolution of 2π/N, where N is the length of the input sequence. If this resolution is not sufficient in a
More information6.003 Signal Processing
6.003 Signal Processing Week 6, Lecture A: The Discrete Fourier Transform (DFT) Adam Hartz hz@mit.edu What is 6.003? What is a signal? Abstractly, a signal is a function that conveys information Signal
More information6.003 Signal Processing
6.003 Signal Processing Week 6, Lecture A: The Discrete Fourier Transform (DFT) Adam Hartz hz@mit.edu What is 6.003? What is a signal? Abstractly, a signal is a function that conveys information Signal
More informationCS Sampling and Aliasing. Analog vs Digital
CS 112 - Sampling and Aliasing Aditi Majumder, CS 112, Winter 2007 Slide 1 Analog vs Digital God has created the world analog Man has created digital world Aditi Majumder, CS 112, Winter 2007 Slide 2 1
More informationFourier Analysis Overview (0A)
CTFS: Fourier Series CTFT: Fourier Transform DTFS: Fourier Series DTFT: Fourier Transform DFT: Discrete Fourier Transform Copyright (c) 2011-2016 Young W. Lim. Permission is granted to copy, distribute
More informationHomework 4. May An LTI system has an input, x(t) and output y(t) related through the equation y(t) = t e (t t ) x(t 2)dt
Homework 4 May 2017 1. An LTI system has an input, x(t) and output y(t) related through the equation y(t) = t e (t t ) x(t 2)dt Determine the impulse response of the system. Rewriting as y(t) = t e (t
More informationIB Paper 6: Signal and Data Analysis
IB Paper 6: Signal and Data Analysis Handout 5: Sampling Theory S Godsill Signal Processing and Communications Group, Engineering Department, Cambridge, UK Lent 2015 1 / 85 Sampling and Aliasing All of
More informationLAB 6: FIR Filter Design Summer 2011
University of Illinois at Urbana-Champaign Department of Electrical and Computer Engineering ECE 311: Digital Signal Processing Lab Chandra Radhakrishnan Peter Kairouz LAB 6: FIR Filter Design Summer 011
More informationFeature extraction 1
Centre for Vision Speech & Signal Processing University of Surrey, Guildford GU2 7XH. Feature extraction 1 Dr Philip Jackson Cepstral analysis - Real & complex cepstra - Homomorphic decomposition Filter
More informationAN INVERTIBLE DISCRETE AUDITORY TRANSFORM
COMM. MATH. SCI. Vol. 3, No. 1, pp. 47 56 c 25 International Press AN INVERTIBLE DISCRETE AUDITORY TRANSFORM JACK XIN AND YINGYONG QI Abstract. A discrete auditory transform (DAT) from sound signal to
More informationELEG 3124 SYSTEMS AND SIGNALS Ch. 5 Fourier Transform
Department of Electrical Engineering University of Arkansas ELEG 3124 SYSTEMS AND SIGNALS Ch. 5 Fourier Transform Dr. Jingxian Wu wuj@uark.edu OUTLINE 2 Introduction Fourier Transform Properties of Fourier
More informationFILTERING IN THE FREQUENCY DOMAIN
1 FILTERING IN THE FREQUENCY DOMAIN Lecture 4 Spatial Vs Frequency domain 2 Spatial Domain (I) Normal image space Changes in pixel positions correspond to changes in the scene Distances in I correspond
More informationDCSP-2: Fourier Transform
DCSP-2: Fourier Transform Jianfeng Feng Department of Computer Science Warwick Univ., UK Jianfeng.feng@warwick.ac.uk http://www.dcs.warwick.ac.uk/~feng/dcsp.html Data transmission Channel characteristics,
More informationEEO 401 Digital Signal Processing Prof. Mark Fowler
EEO 4 Digital Signal Processing Pro. Mark Fowler ote Set # Using the DFT or Spectral Analysis o Signals Reading Assignment: Sect. 7.4 o Proakis & Manolakis Ch. 6 o Porat s Book /9 Goal o Practical Spectral
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 02 DSP Fundamentals 14/01/21 http://www.ee.unlv.edu/~b1morris/ee482/
More information1 1.27z z 2. 1 z H 2
E481 Digital Signal Processing Exam Date: Thursday -1-1 16:15 18:45 Final Exam - Solutions Dan Ellis 1. (a) In this direct-form II second-order-section filter, the first stage has
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 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 informationDHANALAKSHMI COLLEGE OF ENGINEERING DEPARTMENT OF ELECTRICAL AND ELECTRONICS ENGINEERING EC2314- DIGITAL SIGNAL PROCESSING UNIT I INTRODUCTION PART A
DHANALAKSHMI COLLEGE OF ENGINEERING DEPARTMENT OF ELECTRICAL AND ELECTRONICS ENGINEERING EC2314- DIGITAL SIGNAL PROCESSING UNIT I INTRODUCTION PART A Classification of systems : Continuous and Discrete
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 informationLINEAR SYSTEMS. J. Elder PSYC 6256 Principles of Neural Coding
LINEAR SYSTEMS Linear Systems 2 Neural coding and cognitive neuroscience in general concerns input-output relationships. Inputs Light intensity Pre-synaptic action potentials Number of items in display
More informationReview of Linear System Theory
Review of Linear System Theory The following is a (very) brief review of linear system theory and Fourier analysis. I work primarily with discrete signals. I assume the reader is familiar with linear algebra
More informationReview of Linear Systems Theory
Review of Linear Systems Theory The following is a (very) brief review of linear systems theory, convolution, and Fourier analysis. I work primarily with discrete signals, but each result developed in
More informationJim Lambers ENERGY 281 Spring Quarter Lecture 5 Notes
Jim ambers ENERGY 28 Spring Quarter 27-8 ecture 5 Notes These notes are based on Rosalind Archer s PE28 lecture notes, with some revisions by Jim ambers. Fourier Series Recall that in ecture 2, when we
More informationKey Intuition: invertibility
Introduction to Fourier Analysis CS 510 Lecture #6 January 30, 2017 In the extreme, a square wave Graphic from http://www.mechatronics.colostate.edu/figures/4-4.jpg 2 Fourier Transform Formally, the Fourier
More informationWave Phenomena Physics 15c
Wave Phenomena Physics 5c Lecture Fourier Analysis (H&L Sections 3. 4) (Georgi Chapter ) What We Did Last ime Studied reflection of mechanical waves Similar to reflection of electromagnetic waves Mechanical
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 informationCS 1124Media computation. Oct 6, 2008 Steve Harrison
CS 1124Media computation Oct 6, 2008 Steve Harrison Today Midterm Introduction to working with sound HW 5 - Faster and Faster Today Midterm Introduction to working with sound HW 5 - Faster and Faster Mid
More information