Digital Image Processing CPE3643

Lecture 3:

Basic relationships between pixels

and pixel operations

3/11/2025 Capital University of Science and Technology Digital Image Processing CPE3643 1

Basic relationships between pixels

Arrangement of pixels: 0 1 1
0 1 0
0 0 1
4 neighbours N4(p): 1
0 1 0
0

Diagonal neighbours ND(p): 0 1

1
0 1

8 neighbours N8 (p) = ND(p) U N4(p) : 0 1 1

0 1 0
0 0 1
3/11/2025 Capital University of Science and Technology Digital Image Processing CPE3643 2

1
 Basic relationships between Pixels
▪ Connectivity between pixels:
An important concept used in establishing boundaries of objects
and components of regions
Two pixels p and q are connected if
– They are adjacent in some sense
– If their gray levels satisfy a specified criterion of similarity

V: Set of gray level values used to define the criterion of

similarity

3/11/2025 Capital University of Science and Technology Digital Image Processing CPE3643 3

Basic relationships between pixels

Path
Let coordinates of pixel p: (x, y), and of pixel q: (s, t)
A path from p to q is a sequence of distinct pixels with
coordinates: (x0, y0), (x1, y1), ......, (xn, yn) where
(x0, y0) = (x, y) & (xn, yn) = (s, t),
and (xi, yi) is adjacent to (xi-1, yi-1) 1 i  n
Regions
A set of pixels in an image where all component pixels are
connected
Boundary of a region
A set of pixels of a region R that have one of more neighbors
that are not in R
3/11/2025 Capital University of Science and Technology Digital Image Processing CPE3643 4

2
 Distance Measures
Given coordinates of pixels p, q, and z: (x,y), (s,t), and (u,v)
Euclidean distance between p and q:
De ( p, q) = ( x − s ) 2 + ( y − t ) 2

City-block distance between p and q:

D4 ( p, q) = x − s + y − t

Chessboard distance between p and q:

D8 ( p, q) = max(| x − s |, | y − t |)

3/11/2025 Capital University of Science and Technology Digital Image Processing CPE3643 5

Image Enhancement
Process an image to make the result more suitable than the original
image for a specific application
– Image enhancement is subjective (problem/application
oriented)
Image enhancement methods
Spatial domain: Direct manipulation of pixel in an image(on the
image plane)
Frequency domain: Processing the image based on modifying the
Fourier transform of an image

Many techniques are based on various combinations of methods from

these two categories

3/11/2025 Capital University of Science and Technology Digital Image Processing CPE3643 6

3
 Image Enhancement
Types of image enhancement operations
Point/pixel operations Output value at specific coordinates (x,y) is
dependent only on the input value at (x,y)
Local operations The output value at (x,y) is dependent on the
input values in the neighborhood of (x,y)
Global operations The output value at (x,y) is dependent on all
the values in the input image

3/11/2025 Capital University of Science and Technology Digital Image Processing CPE3643 7

Basic concepts
Spatial domain enhancement methods can be generalized as
g(x,y)=T[f(x,y)]
f(x,y) : input image
g(x,y): processed (output) image
T[*] : an operator on f (or a set of input images),
defined over neighborhood of (x,y)

Neighborhood about (x,y): a square or rectangular sub-

image area centered at (x,y)

3/11/2025 Capital University of Science and Technology Digital Image Processing CPE3643 8

4
 Basic Concepts

3x3 neighborhood about (x,y)

3/11/2025 Capital University of Science and Technology Digital Image Processing CPE3643 9

Basic concepts
Pixel/point operation:
Neighborhood of size 1x1: g depends only on f at (x,y)
T: a gray-level/intensity transformation/mapping function
Let r = f(x,y) s = g(x,y)
r and s represent gray levels of f and g at (x,y)
Then s = T(r)
Local operations:
g depends on the predefined number of neighbors of f at (x,y)
Implemented by using mask processing or filtering
Masks (filters, windows, kernels, templates) :
a small (e.g. 3×3) 2-D array, in which the values of the
coefficients determine the nature of the process
3/11/2025 Capital University of Science and Technology Digital Image Processing CPE3643 10

10

5
 Common pixel operations
▪ Image negatives

▪ Log transformations

▪ Power-law
transformations

3/11/2025 Capital University of Science and Technology Digital Image Processing CPE3643 11

11

Image negatives
▪ Reverses the gray level order
▪ For L gray levels the transformation function is
s =T(r) = (L-1)-r

Input image (X-ray image) Output image (negative)

3/11/2025 Capital University of Science and Technology Digital Image Processing CPE3643 12

12

6
 Image negatives
Application: To enhance the visibility for images with more
dark portion

Original digital mammogram Output image

3/11/2025 Capital University of Science and Technology Digital Image Processing CPE3643 13

13

Image scaling
s =T(r) = a.r (a is a constant)

3/11/2025 Capital University of Science and Technology Digital Image Processing CPE3643 14

14

7
 Log transformations
Function of s = c Log(1+r)

3/11/2025 Capital University of Science and Technology Digital Image Processing CPE3643 15

15

Log transformations
Properties of log transformations
– For lower amplitudes of input image the range of gray levels is
expanded
– For higher amplitudes of input image the range of gray levels is
compressed
Application:
– Dynamic range of a processed image far exceeds the capability
of the display device
• (e.g. display of the Fourier spectrum of an image)
– Also called “dynamic-range compression / expansion”

3/11/2025 Capital University of Science and Technology Digital Image Processing CPE3643 16

16

8
 Log transformations

Fourier spectrum with values of The result applying log transformation,

range 0 to 1.5 x 106 scaled linearly c=1

3/11/2025 Capital University of Science and Technology Digital Image Processing CPE3643 17

17

Power-law Transformation
Basic form:

s = crg ,
where c & g
are positive

Plots of equation
s = crg,
For various values of g
(c = 1)

3/11/2025 Capital University of Science and Technology Digital Image Processing CPE3643 18

18

9
 Power-law Transformation
For γ < 1: Expands values of dark pixels, compress values of
brighter pixels
For γ > 1: Compresses values of dark pixels, expand values of
brighter pixels
If γ=1 & c=1: Identity transformation (s = r)

A variety of devices (image capture, printing, display) respond

according to a power law and need to be corrected;

Gamma (γ) correction

The process used to correct the power-law response phenomena

3/11/2025 Capital University of Science and Technology Digital Image Processing CPE3643 19

19

Power-law Transformation
▪ Example of gamma correction

▪ To linearize the CRT response a pre-distortion circuit is

needed s = cr1/g

3/11/2025 Capital University of Science and Technology Digital Image Processing CPE3643 20

20

10
 Gamma correction

Linear Response of
wedge gray CRT to Linear
scale image wedge

Gamma Output of
corrected monitor
wedge

3/11/2025 Capital University of Science and Technology Digital Image Processing CPE3643 21

21

Power-law Transformation: Example

MRI image of Result of applying Result of applying Result of applying

fractured human power-law power-law power-law
spine transformation transformation transformation
c = 1, g = 0.6 c = 1, g = 0.4 c = 1, g = 0.3

3/11/2025 Capital University of Science and Technology Digital Image Processing CPE3643 22

22

11
 Power-law Transformation: Example

Original Result of applying

satellite power-law
image transformation
c = 1, g = 3.0

Result of Result of applying

applying power-law
power-law transformation
transformation
c = 1, g = 5.0
c = 1, g = 4.0

3/11/2025 Capital University of Science and Technology Digital Image Processing CPE3643 23

23

12