Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd
Upload
21 views

Digital Image Processing

1. Image enhancement aims to process an image to make it more suitable for a specific application. 2. There are two broad categories of image enhancement approaches: spatial domain methods and frequency domain methods. 3. Spatial domain methods operate directly on pixel values using neighborhood operations like filters, while frequency domain methods operate on the Fourier transform of the image.

Uploaded by

Hatem Dheer
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
21 views

Digital Image Processing

1. Image enhancement aims to process an image to make it more suitable for a specific application. 2. There are two broad categories of image enhancement approaches: spatial domain methods and frequency domain methods. 3. Spatial domain methods operate directly on pixel values using neighborhood operations like filters, while frequency domain methods operate on the Fourier transform of the image.

Uploaded by

Hatem Dheer
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 14

Digital Image Processing

Image
Enhancement
Part I
Image Enhancement
The principal objective of enhancement is to
process an image so that the result is more
suitable than the original image for a specific
application
So, the specific application may determine
approaches or techniques for image enhancement
ex) Enhancing X-ray images may be different from
enhancing pictures from Mars
Image enhancement approaches fall into two
broad categories
Spatial domain methods
Frequency domain methods
Spatial Domain Methods
Spatial domain?
Spatial domain refers to the aggregate of pixels composing
an image
The space where pixels reside
p(x,y) or p(x,y,c) c:color plane index
ex) p(2,3,1) : the red value of pixel at location (2,3)
 Spatial domain methods
 Spatial domain methods are procedures that operate
directly on the pixels
 g(x,y) = T[f(x,y)]
f(x,y) : input image g(x,y) : output image
T[ ] : an operator defined over some neighborhood of (x,y)
Spatial Domain Methods
The principal approach in defining a neighborhood about a point (x,y)
is to use a square or rectangular subimage area centered at (x,y)
The center of the subimage is moved from pixel to pixel starting at
the top left corner.
The operator T is applied at each location (x,y) to yield the output g,
at that location
Other neighborhood shapes such as approximations to a circle,
sometimes are used
Spatial Domain Methods
when the neighborhood is of size 1x1
-> point processing
s=T(r) ; gray-level transformation
s,r : gray level
One of the principal approaches is based on the use of so-called
masks (filters, kernels, templates, or windows)
a mask is a small (say, 3x3) 2D array in which the values of the
mask coefficients determine the nature of the process
-> mask processing, filtering
Gray Level Transformations
s=T(r) ; T is a transformation that maps pixel value r into a
pixel value s
Transformation depends only on gray level of pixels
The mapping can be implemented by table lookups
Transformation
Identity: s=r, no transformation
Image Negatives
Image in the range [0, L-1]
It is useful in displaying medical images
Image Negatives
Suited for enhancing white or gray details
embedded in dark region.
Log Transformations
s = c log(1+r) c : constant, r >= 0
We use a transformation of this type to expand the values of
dark pixels while compressing the higher-level values
The opposite is true of the inverse log transformation
It compresses the dynamic range of images with large
variations in pixel values
Histogram of a Digital image
The histogram with a gray level range [0, L-1] is a discrete function
h(r=k) = nk , h(rk) = nk
where nk is the number of pixels in the image having gray level k
It is common practice to normalize a histogram by dividing each of its
values by the total number of pixels in the image(n)
p(r=k) = p(rk) = nk/n , k=0, 1, …, L-1
p(r=k) is an estimate of the probability of occurrence of gray level k
Histogram of a Digital image
Histogram of a Digital image
Histogram of a Digital image
An image with low contrast has
narrow histogram distribution
For a monochrome image this
implies a dull, washed-out gray
look
The components of the
histogram in the high-contrast
image cover a broad range of
the gray scale, and the
distribution is almost uniform
It is possible to develop a
transformation that can achieve
this effect based only on
information available in the
histogram

You might also like