1 / 82

Digital Image Processing

Digital Image Processing. Image Restoration. Image Restoration. Image restoration vs. image enhancement Enhancement: largely a subjective process Priori knowledge about the degradation is not a must (sometimes no degradation is involved)

rmaddocks
Download Presentation

Digital Image Processing

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. Digital Image Processing Image Restoration

  2. Image Restoration • Image restoration vs. image enhancement • Enhancement: • largely a subjective process • Priori knowledge about the degradation is not a must (sometimes no degradation is involved) • Procedures are heuristic and take advantage of the psychophysical aspects of human visual system • Restoration: • more an objective process • Images are degraded • Tries to recover the images by using the knowledge about the degradation H.R. Pourreza

  3. Image Restoration Image restoration concerns the removal or reduction of degradations which have occurred during the acquisition of the image. Such degradations may include noise, which are errors in the pixel values, or optical effects such as out of focus blurring, or blurring due to camera motion. We shall see that some restoration techniques can be performed very successfully using neighbourhood operations, while others require the use of frequency domain processes. Image restoration remains one of the most important areas of image processing, but in this chapter the emphasis will be on the techniques for dealing with restoration, rather than with the degradations themselves, or the properties of electronic equipment which give rise to image degradation.

  4. An Image Degradation Model • Two types of degradation • Additive noise • Spatial domain restoration (denoising) techniques are preferred • Image blur • Frequency domain methods are preferred • We model the degradation process by a degradation function h(x,y), an additive noise term, (x,y), as g(x,y)=h(x,y)*f(x,y)+ (x,y) • f(x,y) is the (input) image free from any degradation • g(x,y) is the degraded image • * is the convolution operator • The goal is to obtain an estimate of f(x,y) according to the knowledge about the degradation function h and the additive noise  • In frequency domain: G(u,v)=H(u,v)F(u,v)+N(u,v) • Three cases are considered in this Chapter • g(x,y)=f(x,y)+ (x,y) (5-2~5-4) • g(x,y)=h(x,y)*f(x,y) (5-5~5-6) • g(x,y)=h(x,y)*f(x,y)+ (x,y) (5-7~5-9)

  5. A Model of the Image Degradation/Restoration Process

  6. A Model of the Image Degradation/Restoration Process

  7. Noise

  8. Noise Model • We first consider the degradation due to noise only • h is an impulse for now ( H is a constant) • White noise • Autocorrelation function is an impulse function multiplied by a constant • It means there is no correlation between any two pixels in the noise image • There is no way to predict the next noise value • The spectrum of the autocorrelation function is a constant (white) (the statement in page 222 about white noise is wrong)

  9. Gaussian Noise • Noise (image) can be classified according the distribution of the values of pixels (of the noise image) or its (normalized) histogram • Gaussian noise is characterized by two parameters,  (mean) and σ2 (variance), by • 70% values of z fall in the range [(-σ),(+σ)] • 95% values of z fall in the range [(-2σ),(+2σ)]

  10. Gaussian Noise

  11. Gaussian Noise

  12. Gaussian Noise H.R. Pourreza

  13. Other Noise Models • Rayleigh noise • The mean and variance of this density are given by • a and b can be obtained through mean and variance

  14. Other Noise Models • Erlang (Gamma) noise • The mean and variance of this density are given by • a and b can be obtained through mean and variance

  15. Other Noise Models • Exponential noise • The mean and variance of this density are given by • Special case pf Erlang PDF with b=1

  16. Other Noise Models • Uniform noise • The mean and variance of this density are given by

  17. Other Noise Models • Impulse (salt-and-pepper) noise • If either Pa or Pb is zero, the impulse noise is called unipolar • a and b usually are extreme values because impulse corruption is usually large compared with the strength of the image signal • It is the only type of noise that can be distinguished from others visually

  18. Salt-and-pepper Noise

  19. Salt-and-pepper Noise

  20. A Sample Image

  21. Effect of Adding Noise to Sample Image

  22. Effect of Adding Noise to Sample Image

  23. Periodic Noise • Arises typically from electrical or electromechanical interference during image acquisition • It can be observed by visual inspection both in the spatial domain and frequency domain • The only spatially dependent noise will be considered

  24. Periodic Noise

  25. Noise Removal Salt and pepper noise, Gaussian noise and speckle noise can all be cleaned by using spatial filtering techniques. Periodic noise, however, requires the use of frequency domain filtering because whereas the other forms of noise can be modelled as local degradations, periodic noise is a global effect. H.R. Pourreza

  26. Noise Removal

  27. Noise Removal

  28. Noise Removal H.R. Pourreza

  29. Noise Removal

  30. Noise Removal H.R. Pourreza

  31. Noise Removal

  32. Noise Removal

  33. Estimation of Noise Parameters • Periodic noise • Parameters can be estimated by inspection of the spectrum • Noise PDFs • From sensor specifications • If imaging sensors are available, capture a set of images of plain environments • If only noisy images are available, parameters of the PDF involved can be estimated from small patches of constant regions of the noisy images

  34. Estimation of Noise Parameters • In most cases, only mean and variance are to be estimated • Others can be obtained from the estimated mean and variance • Assume a sub-image with plain scene is available and is denoted by S

  35. Restoration in the Presence of Noise Only (De-Noising) • Mean filters • Arithmetic mean filter • g(x,y) is the corrupted image • Sx,y is the mask • Geometric mean filters • Tends to preserve more details • Harmonic mean filter • Works well for salt noise but fails for pepper noise • Contraharmonic mean filter • Q: order of the filter • Positive Q works for pepper noise • Negative Q works for salt noise • Q=0arithmetic mean filter • Q=-1harmonic mean filter

  36. De-Noising Corrupted by Gaussian Noise Mean Filtering Geometric Mean Filtering

  37. De-Noising Corrupted by pepper noise Corrupted by salt noise 3x3 Contraharmonic Q=1.5 3x3 Contraharmonic Q=-1.5

  38. De-Noising

  39. Filters Based on Order Statistics(De-Noising) • Median filter • Median represents the 50th percentile of a ranked set of numbers • Max and min filter • Max filter uses the 100th percentile of a ranked set of numbers • Good for removing pepper noise • Min filter uses the 1 percentile of a ranked set of numbers • Good for removing salt noise • Midpoint filter • Works best for noise with symmetric PDF like Gaussian or uniform noise

  40. De-Noising One pass median filtering Corrupted by salt & pepper noise Three pass median filtering Two pass median filtering

  41. Corrupted by pepper noise Corrupted by salt noise De-Noising Max Filtering Min Filtering

  42. Alpha-Trimmed Mean Filter(De-Noising) • Alpha-trimmed mean filter takes the mean value of the pixels enclosed by an m×n mask after deleting the pixels with the d/2 lowest and the d/2 highest gray-level values • gr(s,t) represent the remaining mn-d pixels • It is useful in situations involving multiple types of noise like a combination of salt-and-pepper and Gaussian

  43. De-Noising Added salt & pepper noise Corrupted by additive Uniform noise 5x5 Mean Filtering 5x5 Geo-Mean Filtering 5x5 Median Filtering 5x5 Alpha-trimmed Mean Filtering H.R. Pourreza

  44. Adaptive Filters(De-Noising) • Adaptive Local Noise Reduction Filter • Assume the variance of the noise is either known or can be estimated satisfactorily • Filtering operation changes at different regions of an image according to local variance calculated within an M×N region • If , the filtering operation is defined as • If , the output takes the mean value • That is: • At edges, it is assumes that

  45. De-Noising Corrupted by Gaussian noise Mean Filtering Adaptive Filtering Geo-Mean Filtering

  46. Adaptive Median Filter(De-Noising) • Median filter is effective for removing salt-and-pepper noise • The density of the impulse noise can not be too large • Adaptive median filter • Notation • Zmin: minimum gray value in Sxy • Zmax: maximum gray value in Sxy • Zmed: median of gray levels in Sxy • Zxy: gray value of the image at (x,y) • Smax: maximum allowed size of Sxy

  47. Adaptive Median Filter(De-Noising) • Two levels of operations • Level A: • A1= Zmed –Zmin • A2= Zmed –Zmax • If A1 > 0 AND A2 < 0, Go to level B else increase the window size by 2 • If window size <= Smax repeat level A else output Zxy • Level B: • B1= Zxy –Zmin • B2= Zxy –Zmax • If B1 > 0 AND B2 < 0, output Zxy else output Zmed Used to test whether Zmed is part of s-and-p noise. If yes, window size is increased Used to test whether Zxy is part of s-and-p noise. If yes, apply regular median filtering

  48. De-Noising Median Filtering Adaptive Median Filtering

  49. Periodic Noise Reduction by Frequency Domain Filtering • Lowpass and highpass filters for image enhancement have been studied • Bandreject, bandpass, and notch filters as tools for periodic noise reduction or removal are to be studied in this section.

More Related