Image Enhancement in the Frequency Domain Chaiwoot Boonyasiriwat - - PowerPoint PPT Presentation

image enhancement
SMART_READER_LITE
LIVE PREVIEW

Image Enhancement in the Frequency Domain Chaiwoot Boonyasiriwat - - PowerPoint PPT Presentation

Image Enhancement in the Frequency Domain Chaiwoot Boonyasiriwat November 9, 2020 Discrete Fourier Transform DFT and IDFT of a signal x ( n 1 ), n 1 = 1, , N 1, are DFT and IDFT of a 2D signal x ( n 1 ,n 2 ) are 2 Discrete Fourier


slide-1
SLIDE 1

Chaiwoot Boonyasiriwat

November 9, 2020

Image Enhancement in the Frequency Domain

slide-2
SLIDE 2

2

▪ DFT and IDFT of a signal x(n1), n1 = 1, …, N1, are ▪ DFT and IDFT of a 2D signal x(n1,n2) are

Discrete Fourier Transform

slide-3
SLIDE 3

3

▪ Complex sinusoidal signals and their power spectra.

Discrete Fourier Transform

Russ and Neal (2016, p. 328)

slide-4
SLIDE 4

4

(a) Light micrograph of a stained skeletal muscle. (b) Power spectrum of (a). (c) Image reconstructed using the first three harmonics marked by the green dots.

Image Reconstruction

Russ and Neal (2016, p. 331)

slide-5
SLIDE 5

5

(a) Transmission electron microscopy (TEM) image atomic lattice of silicon. (b) Power spectrum of (a). (c) Dominant peaks in (b). (d) Image reconstructed using the dominant peaks in (c).

Image Reconstruction

Russ and Neal (2016, p. 332)

slide-6
SLIDE 6

6

Original Low-pass filter High-pass filter

Frequency-Selection Filters

Russ and Neal (2016, p. 339)

slide-7
SLIDE 7

7

To avoid the Gibbs phenomenon, the edge of the window should be tapered linearly or smoothly.

Tapering

Russ and Neal (2016, p. 339)

slide-8
SLIDE 8

8

“Periodic noise in an image is isolated into a few points in the frequency domain. So, the noise can be removed by removing these points in the frequency domain.”

Periodic Noise Removal

Russ and Neal (2016, p. 345-348)

slide-9
SLIDE 9

9

▪ Applying a filter to an image in the spatial domain is the 2D convolution of an image with the filter kernel. ▪ A filter can be applied more efficiently in the frequency domain by the multiplication of the Fourier transforms

  • f the image and filter kernel.

▪ The convolution of signals x and y can be performed using DFT and IDFT as follows.

2D Convolution

Russ and Neal (2016, p. 352)

slide-10
SLIDE 10

10

F[a] F[b] F-1[F[a]F[b]]

2D Convolution

Russ and Neal (2016, p. 354)

a*b

slide-11
SLIDE 11

11

▪ Let X, Y, and H be the DFT of x, y, and h. ▪ Here h is the smoothing filter kernel, x is the original image, and y is the filtered image given by ▪ Suppose we know y and h. We can estimate the orginal image as follows. where H* is the complex conjugate of H, and  is a small constant to avoid division by a very small number when H2 is close to zero.

Wiener Deconvolution

Russ and Neal (2016, p. 352)

slide-12
SLIDE 12

12

(a) Original blurred image (b) Normal deconvolution with  = 0 (c) Wiener deconvolution with a small  (d) Wiener deconvolution with  large enough to suppress noise

Wiener Deconvolution

Russ and Neal (2016, p. 360)

slide-13
SLIDE 13

13

▪ Cross-correlation is frequently used in image processing as a tool for pattern matching, e.g., searching for vehicles from traffic camera videos, or tracking the motion of storms in weather satellite images. ▪ The 2D cross-correlation of two continuous functions g and h is given by ▪ The cross-correlation is more efficiently performed in the frequency domain by

where G = F[g], H = F[h], and H* is complex conjugate of H.

2D Cross-Correlation

Russ and Neal (2016, p. 368-369)

slide-14
SLIDE 14

14

(a) Original image with bubbles to be located.

(b) Cross-correlation results showing spikes at the bubble positions. (c) The result of a top-hat filter superimposed on the cross- correlation image.

2D Cross-Correlation

Russ and Neal (2016, p. 370)

slide-15
SLIDE 15

15

(a) and (b) Schmidt wide-field camera images taken several days apart.

(c) Absolute difference image after automatic alignment by cross-correlation, showing a moving comet.

2D Cross-Correlation

Russ and Neal (2016, p. 371)

slide-16
SLIDE 16

16

(a) and (b) original light microscope images at different focal depths (top and bottom focus)

(c) Superposition of the two images (edge enhanced) in red and green channels to show lateral image shift (d) Extended focus result after alignment of all images in the set.

2D Cross-Correlation

Russ and Neal (2016, p. 371)

slide-17
SLIDE 17

17

▪ Autocorrelation is a cross-correlation of an image with

  • itself. It is typically used to find repetitive structures.

(a) Image of latex spheres self-organized in an approximately hexagonal array. (b) Autocorrelation image showing the pattern of neighbor distance and direction. (c) Measurement of the circularly averaged radial profile.

2D Autocorrelation

slide-18
SLIDE 18

▪ J. C. Russ and F. B. Neal, 2016, The Image Processing Handbook, 7th edition, CRC Press.

References