Thanks to visit codestin.com
Credit goes to www.scribd.com

Scribd
Upload
35 views29 pages

Lecture 4

The document discusses image sharpening techniques including unsharp masking and highboost filtering. It introduces the concepts behind these techniques such as blurring an image, subtracting it from the original, and adding the result back to the original. It also provides mathematical formulas and examples to demonstrate how unsharp masking and highboost filtering work.

Uploaded by

bedline.sales
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
35 views29 pages

Lecture 4

The document discusses image sharpening techniques including unsharp masking and highboost filtering. It introduces the concepts behind these techniques such as blurring an image, subtracting it from the original, and adding the result back to the original. It also provides mathematical formulas and examples to demonstrate how unsharp masking and highboost filtering work.

Uploaded by

bedline.sales
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 29

Image Sharpening by Unsharp Masking and

Highboost Filtering

1. Blur the original


image
2. Subtract the blurred
image from the
original to get the
mask
3. Add the mask to the
original
Image Sharpening by Unsharp Masking
and Highboost Filtering


g(x, y)  f (x, y)  k * f (x, y)  f (x, y)  k0

When 𝑘 > 1, it becomes a highboost filtering.

Example: when 𝑘 = 1

0 0 0 0 0 0 1 1 1 1 1 −1 −1 −1
0 1 0 + 0 1 0 − 1 1 1 = −1 17 −1
9 9 −1 −1 −1
0 0 0 0 0 0 1 1 1

Sum of the coefficients is 1


Original
An Example

Blurred

Unsharp mask

Unsharp masking k=1

Highboost filitering k=4.5


Gradient for Image Sharpening -- Example

Original Sobel gradient

An application in industrial defect detection.


Median Filter (Smoothing Filter)
Why We Need Fourier Transform

• Filtering in frequency domain

Image smoothing Edge Image sharpening

• Efficient computation for convolution


Preliminary Concepts
Im
Complex number C  R  jI j  1 𝐶

Conjugate C*  R  jI 𝜃
Re
Polar coordinate representation
𝐶∗
C | C | (cos  j sin

| C | R 2  I 2 ,

Euler’s formula e j
 cos   j sin  C | C | e j
Concept of Fourier Series And Transforms

Fourier series: any periodic function can be


represented by a discrete weighted sum of
sines and cosines
Concept of Fourier Series And Transforms

Fourier series: any periodic function can be represented by a


discrete weighted sum of sines and cosines

Fourier transform: an arbitrary function with finite duration


(non-periodic function) can be expressed by a weighted
integrals of sines and cosines

Fourier transform is more general!


Fourier Series

𝑓(𝑡) is a continuous function with period 𝑇, we have


Fourier Transform in 1D

𝒇(𝒕) is an arbitrary non-periodic function

𝐹 𝜔 = න 𝑓(𝑡)𝑒 −𝑗2𝜋𝑓𝑡 𝑑𝑡 Fourier transform

−∞

∞
𝑗2𝜋𝑓𝑡 Inverse fourier transform
𝑓 𝑡 = න 𝐹(𝜔)𝑒 𝑑𝜔
−∞

FT has the property of Linearity

x(t)  af (t)  bg(t)  X (  )  aF ( )  bG( )


FT of a Rectangle Function

Rectangle function  Sinc function


Impulse
Impulse

𝐹𝛿 𝑡 = 1

𝐹 𝛿 𝑡 − 𝑡𝑜 = 𝑒 −𝑗2𝜋𝑓𝑡𝑜
Impulse Train

FT of Impulse Train

S(ω) ω
Sampling in Spatial Domain
Convolution
FT of Convolution
Sampling in Frequency Domain

f f F(f)
f

F(f)
F(f)

F(f)

F(f)
Reconstruction
Alising-Undersampling

f
Extension of FT to 2D
Extension of FT to 2D
2D Sampling
Alising in 2D
Alising Example
FT and Phase Angle
FT and Phase Angle
FT- Translation and Rotation

You might also like