29
Image Restoration and Denoising Chapter Seven – Part II

Image Restoration and Denoising

  • Upload
    hasana

  • View
    54

  • Download
    2

Embed Size (px)

DESCRIPTION

Image Restoration and Denoising. Chapter Seven – Part II. Image Restoration Techniques. Inverse of degradation process Depending on the knowledge of degradation, it can be classified into. Image Restoration Model. f’(x,y). η (x, y). Image Restoration Model. In this model, - PowerPoint PPT Presentation

Citation preview

Page 1: Image Restoration and Denoising

Image Restoration and Denoising

Chapter Seven – Part II

Page 2: Image Restoration and Denoising

Image Restoration Techniques• Inverse of degradation process• Depending on the knowledge of degradation,

it can be classified intoDeterministic Random

If prior knowledge about degradation is known

If not known

Linear Non-linear

Restore the image by a filtere.g. Inverse FilteringDrawback: ringing artifacts near edges

Nonlinear function is usedRinging artifacts is reduced

Page 3: Image Restoration and Denoising

Image Restoration Model

η (x, y) f’(x,y)

Page 4: Image Restoration and Denoising

Image Restoration Model

• In this model,– f(x,y) input image– h(x,y) degradation– f'(x,y) restored image– η(x,y) additive noise– g(x,y) degraded image

Page 5: Image Restoration and Denoising

Image Restoration Model

• In spatial domain,g(x,y) = f(x,y) * h(x,y)

and in frequency domainG(k,l) = F(k,l). H(k,l)

Where G,F and H are fourier transform of g,f and h

Page 6: Image Restoration and Denoising

Linear Restoration Technique

• They are quick and simple• But limited capabilities• It includes

– Inverse Filter– Pseudo Inverse Filter– Wiener Filter– Constrained Least Square Filter

Page 7: Image Restoration and Denoising

Inverse Filtering

• If we know exact PSF and ignore noise effect, this approach can be used.

• In practice PSF is unknown and degradation is affected by noise and hence this approach is not perfect.

• Advantage - Simple

Page 8: Image Restoration and Denoising

Inverse Filtering

• From image restoration model

• For simplicity, the co-ordinate of the image are ignored so that the above equation becomes

• Then the error function becomes

Page 9: Image Restoration and Denoising

Inverse Filtering

• We wish to ignore η and use to approximate under least square sense. Then the error function is given as

• To find the minimum of , the above equation is differentiated wrt and equating it to zero

)ˆ( fJf̂

Page 10: Image Restoration and Denoising

Inverse Filtering

• Solving for , we get

• Taking fourier transform on both sides we get

• The restored image in spatial domain is obtained by taking Inverse Fourier Transform as

Page 11: Image Restoration and Denoising

Inverse FilteringOriginal Image Degraded Image

Restored Image

Page 12: Image Restoration and Denoising

Inverse Filtering

• Advantages:– It requires only blur PSF– It gives perfect reconstruction in the absence of

noise

• Drawbacks:– It is not always possible to obtain an inverse

(singular matrices)– If noise is present, inverse filter amplifies noise.

(better option is wiener filter)

Page 13: Image Restoration and Denoising

Inverse Filtering with NoiseOriginal Image Degraded+noise Image

Restored Image

Page 14: Image Restoration and Denoising

Pseudo-Inverse Filtering

• For an inverse filter,

• Here H(k,l) represents the spectrum of the PSF.

• The division of H(k,l) leads to large amplification at high frequencies and thus noise dominates over image

Page 15: Image Restoration and Denoising

Pseudo-Inverse Filtering

• To avoid this problem, a pseudo-inverse filter is defined as

• The value of ε affects the restored image• With no clear objective selection of ε, the

restored images are generally noisy and not suitable for further analysis

Page 16: Image Restoration and Denoising

Pseudo-Inverse Filtering

Original Image Degraded+noise Image

Page 17: Image Restoration and Denoising

Pseudo-Inverse Filtering with ε = 0.2

Page 18: Image Restoration and Denoising

Pseudo-Inverse Filtering with ε = 0.02

Page 19: Image Restoration and Denoising

Pseudo-Inverse Filtering with ε = 0.002

Page 20: Image Restoration and Denoising

Pseudo-Inverse Filtering with ε = 0

Page 21: Image Restoration and Denoising

SVD Approach for Pseudo-Inverse Filtering

• SVD stands for Singular Value Decomposition• Using SVD any matrix can be decomposed into

a series of eigen matrices• From image restoration model we have

• The blur matrix is represented by H• H is decomposed into eigen matrices as

where U and V are unitary and D is diagonal matrix

Page 22: Image Restoration and Denoising

SVD Approach for Pseudo-Inverse Filtering

• Then the pseudo inverse of H is given by

• The generalized inverse is the estimate is the result of multiplying H† with g

• R indicates the rank of the matrix• The resulting sequence estimation formula is

given as

Page 23: Image Restoration and Denoising

SVD Approach for Pseudo-Inverse Filtering

• Advantage– Effective with noise amplification problem as we

can interactively terminate the restoration– Computationally efficient if noise is space

invariant

• Disadvantage– Presence of noise can lead to numerical instability

Page 24: Image Restoration and Denoising

Wiener Filter• The objective is to minimize the mean sqaure

error• It has the capability of handling both the

degradation function and noise• From the restoration model, the error

between input image f(m,n) and the estimated image is given by)),(( nmf

Page 25: Image Restoration and Denoising

Wiener Filter• The square error is given by

• The mean square error is given by

Page 26: Image Restoration and Denoising

Wiener Filter

• The objective of the Wiener filter is top minimize

• Given a system we have y=h*x + v

h-blur functionx - original imagey – observed image (degraded image)v – additive noise

Page 27: Image Restoration and Denoising

Wiener Filter• The goal is to obtain g such that

is the restored image that minimizes mean square error

• The deconvolution provides such a g(t)

ygx ˆ

Page 28: Image Restoration and Denoising

Wiener Filter• The filter is described in frequency domain as

• G and H are fourier transform of g and h• S – mean power of spectral density of x• N – mean power of spectral density of v• * - complex conjugate

)()()(

)()()( 2

fNfSfH

fSfHfG

Page 29: Image Restoration and Denoising

Wiener Filter

• Drawback – It requires prior knowledge of power spectral density of image which is unavailable in practice