EELE 5310: Digital Image Processing

Chapter 2

Fundamentals of Digital Image Processing

Image Acquisition

Image Sampling and Quantization

Digitalization of an analog signal involves two operations:

Sampling: Degitizing the x- and y-coordinates.

Quantization: Degitizing the amplitude values.

Image Sampling and Quantization

Representing Ddigital Images

A digital image is composed of M rows and N columns

of pixels each storing a value.

Representing Ddigital Images

A complete M × N digital image can be written in the following compact matrix form:

The right side of this equation is by definition a digital image. Each element of his matrix array is called an image element, picture element, pixel, or pel.

Storage Capacity

A digital image can be represented as a 2-D function whose coordinates and amplitude values are integers.

The digitization process requires decisions about values for M, N, and for the number, L, of discrete gray levels allowed for each pixel.

Due to processing, storage, and sampling hardware consideration, the number of gray levels is a power of 2:

The discrete levels are equally spaced integers in the interval [0, L-1], this range is called the dynamic range of an image.

Images with high dynamic range will have high contrast and (vise versa).

The number, b, of bits required to store a digitized image

is: b = M x N x k

When M=N the equation become b=N2k

Storage Capacity cont…..

Storage Capacity cont…..

When an image can have 2k gray levels, it is common

practice to refer to the image as a “k-bit image.”For

example, an image with 256 possible gray-level values is

called an 8-bit image. Note that storage requirements for

8-bit images of size 1024*1024 and higher are not

insignificant.

Spatial Resolution

The spatial resolution of an image is determined by

how sampling was carried out

Spatial resolution simply refers to the smallest

discernable detail in an image

Gray-level Resolution

Gray-level resolution is the smallest discernible

change in gray level.

Due to hardware considerations, the number of gray

levels is usually an integer power of 2. The most

common number is 8 bits, i.e 256 levels.

It is common to refer to an L-level digital image of

size MxN as having a spatial resolution of MxN

pixels and a gray-level resolution of L levels.

Effects of Varying Spatial Resolution

Effects of Varying Spatial Resolution

Effects of Varying Gray-Level Resolution

Ridge like

structure

False contouring

Effects of Varying Gray-Level Resolution

Effects of Varying Gray-Level Resolution

As a very rough rule of thumb, and assuming

powers of 2 for convenience, images of size

256*256 pixels and 64 gray levels are about the

smallest images that can be expected to be

reasonably free of objectionable sampling

checkerboards and false contouring.

Relationships Between Pixels

1- Neighbors of a Pixel:

The 4- neighbors of pixel p are: N4(p)

A pixel p at coordinates (x, y) has four

horizontal and vertical neighbors whose coordinates are given by:

P

Relationships Between Pixels cont…

The 4- diagonal neighbors are: ND(p)

The 8-neighbors are : N8(p)

The 4- diagonal neighbors together with the 4-

neighbors of p

P

P

Relationships Between Pixels cont…

Connectivity between pixels is important because it is

used in establishing boundaries of objects and

components of regions in an image

Two pixels are connected if:

They are neighbors (i.e. adjacent in some sense -- e.g.

N4(p), N8(p), …)

Their gray levels satisfy a specified criterion of

similarity (e.g. equality, …)

Adjacency

Let V be the set of intensity used to define adjacency;

e.g. V={1} in a binary image or

V={100,101,102,…,120} in a gray-scale image.

We consider three types of adjacency :

1. 4-adjacency:

Two pixels p and q with values from V are 4-adjacent if

q is in the set N4(p).

2. 8-adjacency:

Two pixels p and q with values from V are 8- adjacent if

q is in the set N8(p).

Adjacency

3. m-adjacency (mixed adjacency):

Two pixels p and q with values from V are m- adjacent if :

(i) q is in N4(p),or

(ii) q is in ND( p)and N4( p)∩ N4(q) is empty

Mixed adjacency is a modification of 8-adjacency. It is introduced to

eliminate the ambiguities that often arise when 8-adjacency is used.

Two image subsets S1 and S2 are adjacent if some pixel in S1 is adjacent

to some pixel in S2.

Digital path (curve)

A (digital) path (or curve) from pixel p with coordinates

(x, y) to pixel q with coordinates (s, t) is a sequence of

distinct pixels with coordinates

(x0, y0), (x1,y1), ……., (xn, yn)

where (x0, y0) = (x, y), (xn, yn) = (s, t), and pixels (xi, yi)

and (xi-1, yi-1) are adjacent for 1≤ i ≤ n. In this case, n is

the length of the path. If (x0, y0) = (xn, yn) the path is a

closed path.

Regions

Let S represent a subset of pixels in an image.

Two pixels p and q are said to be connected in S if

there exists a path between them consisting of pixels

in S.

For any pixel p in S, the set of pixels that are

connected to it in S is called a connected component

of S.

If S only has one connected component, then it is

called a connected set.

Let R be a subset of pixels in an image. We call R a

region of the image if R is a connected set

Region Boundary and edge

The boundary (also called border or contour) of

a region R is the set of pixels in the region that

have one or more neighbors that are not in R.

Edges are formed from pixels with derivative

values that exceed a preset threshold.

An edge is a “local” concept that is based on a

measure of gray-level discontinuity at a point.

Distance Measures

Distance Measures

Distance Measures

Distance Measures

The Dm distance: the shortest m-path

between the points.

Image Operations on a Pixel Basis

when we refer to an operation like “dividing one

image by another,” we mean specifically that the

division is carried out between corresponding

pixels in the two images.

Reading

Sections 2.4 and 2.5 of the textbook.

Homework

Answer the following problems from the text

book:

9, 11, 15,18, 19