chapter 3

28
Chapter 3 Image Enhancement in the Spatial Domain

Upload: kiaria

Post on 09-Feb-2016

49 views

Category:

Documents


0 download

DESCRIPTION

Chapter 3. Image Enhancement in the Spatial Domain. Outline. Background Basic Gray-level transformation Histogram Processing Arithmetic-Logic Operation Basics of Spatial Filtering Smoothing Spatial Filters Sharpening Spatial Filters Combining Spatial Enhancement Methods. Background. - PowerPoint PPT Presentation

TRANSCRIPT

Page 1: Chapter 3

Chapter 3Image Enhancement in the Spatial Domain

Page 2: Chapter 3

Outline Background Basic Gray-level transformation Histogram Processing Arithmetic-Logic Operation Basics of Spatial Filtering Smoothing Spatial Filters Sharpening Spatial Filters Combining Spatial Enhancement Methods

Page 3: Chapter 3

Image enhancement approaches fall into two broad categories: spatial domain methods and frequency domain methods.

The term spatial domain refers to the image plane itself.

g(x,y)= T[f(x,y)] , T is an operator on f, defined over some neighborhood of f(x,y)

Background

Page 4: Chapter 3

Size of Neighborhood Point processing Larger neighborhood: mask (kernel,

template, window) processing

Page 5: Chapter 3

Gray-level Transformation

Contrast stretching thresholding

Page 6: Chapter 3

Basic Gray Level Transformation

Image negatives: s =L-1-r Log transformation: s =clog(1+r) Power-law transformation: s=cr

Page 7: Chapter 3

Image Negatives

Page 8: Chapter 3

Log Transformation

Page 9: Chapter 3

Gamma Correction (I) Cathode ray tube (CRT) devices have an

intensity-to-voltage response that is a power function, with exponents varying from 1.8 to 2.5.

Page 10: Chapter 3

Gamma Correction (II)

Page 11: Chapter 3

Piece-wise Linear Transformation Contrast stretching Gray-level slicing

(Figure 3.11) Bit-plane slicing

(Figures 3.13-14)

Page 12: Chapter 3

Gray-level Slicing

Page 13: Chapter 3

Bit-plane Slicing

Page 14: Chapter 3

Histogram Processing The histogram of a digital image with gray-levels in the range [0,L-1] is a discrete function h(rk)=nk where rk is the kth gray level and nk is the number of pixels in the image having gray level rk Normalized histogram: p(rk)=nk/n. Easy to compute, good for real-time image processing.

Page 15: Chapter 3

Four Basic Image Types

Page 16: Chapter 3

Histogram Equalization s= T(r) What if we take the transformation T to be: It can be shown that ps(s)=1 Discrete version:

Page 17: Chapter 3

Histogram Matching

Page 18: Chapter 3

Local Enhancements

Page 19: Chapter 3

Histogram Statistics N-th moment of r about its mean:

Page 20: Chapter 3

Logic Operations

Page 21: Chapter 3

Arithmetic Operations Image Subtraction Image Averaging

Page 22: Chapter 3

Basics of Spatial Filtering

•Mask, convolution kernels•Odd sizes

Page 23: Chapter 3

Smoothing Spatial Filters Smoothing linear filters: averaging filters,

low-pass filters Box filter Weighted average

Order-statistics filters: Median-filter: removing salt-and-pepper noise Max filter Min filter

Page 24: Chapter 3

Sharpening Spatial Filters Foundation:

)(2)1()1(

)()1(

2

2

xfxfxfxf

xfxfxf

Page 25: Chapter 3

The Laplacian Development of the method:

),(4)1,()1,(),1(),1(

),(2)1,()1,(

),(2),1(),1(

2

2

2

2

2

2

2

2

22

yxfyxfyxfyxfyxff

yxfyxfyxfyf

yxfyxfyxfxf

yf

xff

Page 26: Chapter 3

Image Enhancement

Page 27: Chapter 3

The Gradient

Simplification

Page 28: Chapter 3

Combining Spatial Enhancement Methods

(a) original (b) Laplacian, (c) a+b, (d) Sobel of (a)

(a) (b) (c) (d)