Overview of DSP and Image Processing
Overview of DSP and Image Processing
• Introduction to Signals
• Introduction to Systems
• Voice
• Radar pulse
• Electrocardiogram (ECG)
• Image
• Video
SIGNALS THAT ARE A FUNCTION OF TIME
5
• Lower cost
DSP APPLICATION AREAS
11
• Speech
• Audio
• Image
• Video
BASIC DISCRETE-TIME SIGNALS
12
Signal Name Mathematical Representation Graph
Unit Impulse 1, 𝑛 = 0, 1
(Unit sample) δ[𝑛] = ቊ
0, 𝑛≠0
Unit Step 1, 𝑛 ≥ 0,
u[𝑛] = ቊ
0, 𝑛 < 0
Real Exponential 𝑥 𝑛 = α𝑛
𝑥 𝑛 = 𝑥 𝑘 𝛿[𝑛 − 𝑘]
𝑘=−∞
DISCRETE-TIME LTI SYSTEM
14
δ𝑛 LTI System h𝑛
𝑥𝑛 y𝑛
• Linearity
• Time Invariance
15 CONVOLUTION
𝑦 𝑛 =𝑥 𝑛 ∗ℎ 𝑛
∞ ∞
𝑦[0]
• 𝑥[0] =
ℎ[0]
𝑦[𝑛]−σ𝑛
𝑚=1 ℎ[𝑚]𝑥[𝑛−𝑚]
• 𝑥 𝑛 =
ℎ(0)
17 BLIND DECONVOLUTION
• Autocorrelation
𝑟11 = σ𝑁−1
𝑘=0 𝑥1 𝑘 𝑥2 [𝑘]
Cross correlation
𝑟12 = σ𝑁−1
𝑘=0 𝑥1 𝑘 𝑥2 𝑘
Z-TRANSFORM
19
𝑋 𝑧 = 𝑥[𝑛]𝑧 −𝑛
𝑛=−∞
DISCRETE TIME FOURIER TRANSFORM (DTFT)
20
𝑋(𝑒 𝑗𝜔 )=σ∞
𝑛=−∞ 𝑥[𝑛]𝑒
−𝑗𝜔𝑛
1 𝑗𝜔 )
𝑥𝑛 = 𝑋(𝑒 𝑒 𝑗𝜔𝑛 𝑑𝜔
2𝜋 2𝜋
DISCRETE FOURIER TRANSFORM (DFT)
21
A periodic signal with N samples
𝑁−1ሖ
1
ሖ = 𝑋[𝑘]𝑒
𝑥[𝑛] ሖ 𝑗2𝜋𝑘𝑛/𝑁
𝑁
𝑘=0
DIGITAL FILTERS
22
A Discrete Time LTI system
• 𝑦 𝑛 = 𝑥 𝑛 ∗ ℎ[𝑛]
• Causal ℎ 𝑛 = 0, 𝑛<0
• Bounded σ∞
𝑛=−∞ ℎ 𝑛 < ∞
IDEAL FILTER RESPONSES
23
|𝐻𝐿𝑃 𝜔 | |𝐻𝐻𝑃 𝜔 |
1
ω𝑐 π
|𝐻𝐵𝑃 𝜔 | |𝐻𝐵𝑆 𝜔 |
DIGITAL FILTER IMPLEMENTATION
24
• 𝑦 𝑛 − σ∞ ∞
𝑘=1 𝑎𝑘 𝑦 𝑛 − 𝑘 = σ𝑚=0 𝑏𝑚 𝑥 𝑛 − 𝑚
• 𝐻 𝑧 =
𝑏𝑛 , 0≤𝑛≤𝑀
ℎ[𝑛] = ቊ
0, 𝑜𝑡ℎ𝑒𝑟𝑤𝑖𝑠𝑒
H(z)= σ𝑀
𝑛=0 𝑏𝑛 𝑧
−𝑛
WINDOW DESIGN IN FIR FILTERS
26
• ℎ 𝑛 = ℎ𝐼 [𝑛] ∙ 𝑤[𝑛]
• For M<N,
σ𝑀
𝑚=0 𝑏𝑚 𝑧
−𝑚
• H(z)=
1−σ𝑁 𝑎𝑘 𝑧 −𝑘
σ𝑀
𝑚=0 𝑏𝑚 𝑧
−𝑚 𝐴𝑘
• H(z)= σ𝑁 σ𝑁
𝑘=1
1− 𝑘=1 𝑁𝑎𝑘 𝑧 −𝑘 1−𝑑𝑘 𝑧 −1
• ℎ[𝑛]= σ𝑁 𝑛
𝑘=1 𝐴𝑘 (𝑑𝑘 ) 𝑢[𝑛]
IIR FILTER DESIGN METHODS
29
• 𝑥𝑝 𝑡 = 𝑥 𝑡 𝑝 𝑡
𝑝 𝑡
• 𝑝 𝑡 = σ∞
𝑛=−∞ 𝛿(𝑡 − 𝑛𝑇)
X
𝑥 𝑡 𝑥𝑝 (𝑡)
SPECTRUM OF SAMPLED SIGNAL
31
𝑋(𝑗ω)
𝜔𝑀 ω
P(𝑗ω)
𝜔𝑆
SAMPLING WITH AN IMPULSE TRAIN- EFFECT
32 ON THE FREQUENCY DOMAIN
𝜔𝑠 > 2𝜔𝑚
𝑋𝑝 (𝑗𝜔)
𝜔𝑀 𝜔𝑠 − 𝜔𝑀 𝜔𝑠
𝜔𝑠 − 𝜔𝑀 𝜔𝑀 𝜔𝑆
MULTIRATE SIGNAL PROCESSING- DECIMATION
33