DIGITAL IMAGE

PROCESSING
UNIVERSITY OF ENGINEERING & TECHNOLOGY,
MARDAN
QUESTIONS

• A function H computes the sum of pixel values in a small image subarea, S.

Show that H is a linear operator.
• Remember that H(af + bg) = a H(f) + b H(g)
• Let an image be represented by matrix S as follows and let f and g
represent subimages of S

1 2 3 
  4 5 5 6
S   4 5 6 , f    ,g   
 7 8  8 9 
7 8 9 
• Let a = 3, b = 2
 ANSWERS

• R.H.S.
• H(f) = 24
• H(g) = 28
• a.H(f)+b.H(g)=3*24 + 2*28=72+56=128

• L.H.S.
4 5 12 15  5 6 10 12
af  3 *     , bg  2 *    
 7 8   21 24  8 9   16 18 
22 27 
• H(af+bg) = 128 af  bg   
• Hence proved that H is a linear operator 37 42 
IMAGE
ENHANCEMENT
IN THE SPATIAL
DOMAIN
CHAPTER 3
IMAGE ENHANCEMENT

• WHY?
• RESULTING IMAGE IS MORE SUITABLE THAN ORIGINAL FOR
SPECIFIC APPLICATION

• IMAGE ENHANCEMENT METHODS

• SPATIAL DOMAIN
• REFERS TO IMAGE PLANE
• INVOLVES DIRECT MANIPULATION OF PIXELS IN AN IMAGE
• FREQUENCY DOMAIN
• BASED ON MODIFYING THE FOURIER TRANSFORM OF AN
IMAGE
IMAGE ENHANCEMENT

• USUALLY A SUBJECTIVE PROCESS

• FOR CASES OF VISUAL INTERPRETATION, VIEWER IS THE JUDGE
OF HOW WELL A PARTICULAR IMAGE ENHANCEMENT METHOD
WORKS

• SPATIAL DOMAIN
• AGGREGATE OF PIXELS COMPOSING AN IMAGE
• SPATIAL DOMAIN METHODS OPERATE DIRECTLY ON THE PIXELS
• g(x,y) = T[f(x,y)]
• g(x,y): PROCESSED IMAGE
• f(x,y): INPUT IMAGE
• T: Operator on f, defined over some neighbourhood of (x,y)
IMAGE ENHANCEMENT

• NEIGHBOURHOOD ABOUT (x,y)

• USE SQUARE/RECTANGULAR SUBIMAGE CENTRED AT (x,y)
• CENTRE OF SUBIMAGE IS MOVED FROM PIXEL TO PIXEL
• OPERATOR T IS APPLIED AT EACH LOCATION (x,y) TO YIELD
OUTPUT g AT THAT POINT
• PROCESS UTILISES ONLY THE PIXELS IN AREA OF IMAGE
SPANNED BY NEIGHBOURHOOD
• NEIGHBOURHOOD OF 1x1 IS 1 PIXEL
IMAGE ENHANCEMENT
IMAGE ENHANCEMENT

• FOR THE CASE WITH NEIGHBOURHOOD 1X1

• g DEPENDS ONLY ON THE VALUE OF f AT (x,y)
• ‘T’ BECOMES A GRAY LEVEL (INTENSITY/MAPPING)
TRANSFORMATION FUNCTION
• s=T(r)
• Where s and r denote the gray levels g(x,y) and f(x,y) at (x,y)
• T is an operator applied on gray level at (x,y) to produce a modified gray
level at that point
• For the 1x1 case (point processing), T depends only on the gray level at
(x,y) and none of the neighbouring pixels (this implies that if 3x3
case(mask processing) is used, the modified/resulting gray level at (x,y)
would depend not only on gray level at (x,y) but also its 8 neighbours
IMAGE ENHANCEMENT

• CONTRAST STRETCHING/ENHANCEMENT
• IF T(r) HAS THE FORM AS SHOWN IN ‘a’, AN IMAGE OF HIGHER CONTRAST THAN ORIGINAL IS PRODUCED
• DARKENING THE LEVELS BELOW ‘k’, BRIGHTENING THOSE ABOVE ‘k’
IMAGE ENHANCEMENT

• THRESHOLDING
• IF T(r) IS OF THE TYPE IN b, T(r) PRODUCES A 2-LEVEL
(BINARY) IMAGE

• POINT PROCESSING
• ENHANCEMENT AT ANY POINT IN AN IMAGE DEPENDS
ONLY ON THE GRAY LEVEL AT THAT POINT, SUCH
TECHNIQUES ARE CALLED POINT PROCESSING
IMAGE ENHANCEMENT

• LARGER NEIGHBOURHOOD CASES (LOCAL

OPERATIONS)
• ALLOW MORE FLEXIBILITY
• A FUNCTION OF THE VALUES OF f IN A PREDEFINED
NEIGHBOURHOOD OF (x,y) IS USED TO DETERMINE VALUE OF
g(x,y)
• MASKS(FILTERS/KERNELS/TEMPLATES/WINDOWS) ARE
USED
• MASK IS A SMALL ARRAY, IN WHICH VALUES OF MASK
COEFFICIENTS DETERMINE THE NATURE OF THE PROCESS
• KNOWN AS FILTERING OR MASK PROCESSING
TYPES OF DIGITAL IMAGES

• BINARY
• Each pixel is just black or white
• Since there are only two possible values for each pixel, we
only need one bit per pixel. Such images can be very efficient
in terms of storage.
• GRAYSCALE
• Each pixel is a shade of gray, normally from black to white
• Each pixel can be represented by eight bits
TYPES OF DIGITAL IMAGES

• TRUE COLOR (RGB)

• Here each pixel has a particular colour; that colour being
described by the amount of red, green and blue in it.
• If each of RGB components has a range 0 to 255, this
gives a total of 255^3=16,777,216 different possible
colours in the image (This is enough colours for any
image)
• Since the total number of bits required for each pixel is
24, such images are also called 24 bit colour images
TYPES OF DIGITAL IMAGES

• INDEXED
• Most colour images only have a small subset of the more than
sixteen million possible colours. For convenience of storage
and file handling, the image has an associated colour map or
colour palette, which is simply a list of all the colours used in
that image.
• Each pixel has a value which does not give its colour, but an
index to the colour in the map.
TYPES OF DIGITAL IMAGES
TYPES OF DIGITAL IMAGES
TYPES OF DIGITAL IMAGES
MATLAB

• IMAGE PROCESSING TOOLBOX

• BASIC COMMANDS
• ver
• Help imread
• To know which formats are supported by your version
• Example at the end of help to get info about imdata
• imread
• imwrite
• imfinfo
• imshow