Scribd
Upload
250 views27 pages

Image Acquisition and

The document discusses image formation, representation, and relationships between pixels in digital images. It describes how light interacts with objects to determine pixel intensity, and how digital images are represented as arrays of integer values. Basic concepts covered include pixel neighborhoods, paths, connectivity, regions, boundaries, and distance measures.

Uploaded by

Amit Singh
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
250 views27 pages

Image Acquisition and

The document discusses image formation, representation, and relationships between pixels in digital images. It describes how light interacts with objects to determine pixel intensity, and how digital images are represented as arrays of integer values. Basic concepts covered include pixel neighborhoods, paths, connectivity, regions, boundaries, and distance measures.

Uploaded by

Amit Singh
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 27

Image Acquisition and

Representation
A Simple Image formation model
f ( x, y )  i ( x, y )r ( x, y )

f ( x, y ) : intensity at the point (x, y)


i( x, y ) : illumination at the point (x, y)
(the amount of source illumination incident on the scene)
r ( x, y ) : reflectance/transmissivity at the point (x, y)
(the amount of illumination reflected/transmitted by the object)
where 0 < i( x, y ) <  and 0 < r ( x, y) < 1
Some Typical Ranges of illumination
► Illumination
Lumen — A unit of light flow or luminous flux
Lumen per square meter (lm/m2) — The metric unit of measure for
illuminance of a surface

– On a clear day, the sun may produce in excess of 90,000 lm/m 2 of illumination
on the surface of the Earth

– On a cloudy day, the sun may produce less than 10,000 lm/m2 of illumination
on the surface of the Earth

– On a clear evening, the moon yields about 0.1 lm/m2 of illumination

– The typical illumination level in a commercial office is about 1000 lm/m 2


Some Typical Ranges of Reflectance

► Reflectance

– 0.01 for black velvet

– 0.65 for stainless steel

– 0.80 for flat-white wall paint

– 0.90 for silver-plated metal

– 0.93 for snow


Sampling and Quantization
Representing Digital Images

►The representation of an M×N numerical


array as

 f (0,0) f (0,1) ... f (0, N  1) 


 f (1,0) f (1,1) ... f (1, N  1) 
f ( x, y )  
 ... ... ... ... 
 
 f (M  1,0) f (M  1,1) ... f ( M  1, N  1) 
Representing Digital Images

►The representation of an M×N numerical


array as

 a0,0 a0,1 ... a0, N 1 


 a a1,1 ... a1, N 1  
A  1,0

 ... ... ... ... 


 
 aM 1,0 aM 1,1 ... aM 1, N 1 
Representing Digital Images

► Discrete intensity interval [0, L-1], L=2 k

► The number b of bits required to store a M ×


N digitized image

b=M×N×k
Basic Relationships Between Pixels

• Neighborhood

• Adjacency

• Connectivity

• Paths

• Regions and boundaries


Basic Relationships Between Pixels

• Neighbors of a pixel p at coordinates (x,y)

 4-neighbors of p, denoted by N4(p):


(x-1, y), (x+1, y), (x,y-1), and (x, y+1).

 4 diagonal neighbors of p, denoted by ND(p):


(x-1, y-1), (x+1, y+1), (x+1,y-1), and (x-1, y+1).

 8 neighbors of p, denoted N8(p)


N8(p) = N4(p) U ND(p)
Basic Relationships Between Pixels

• Adjacency
Let V be the set of intensity values

 4-adjacency: Two pixels p and q with values from V


are 4-adjacent if q is in the set N4(p).

 8-adjacency: Two pixels p and q with values from V


are 8-adjacent if q is in the set N8(p).
Basic Relationships Between Pixels

 m-adjacency: Two pixels p and q with values from


V are m-adjacent if

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

(ii) q is in the set ND(p) and the set N4(p) ∩ N4(q)


has no pixels whose values are from V.
Basic Relationships Between Pixels
• Path
 A (digital) path (or curve) from pixel p with coordinates (x0, y0) to
pixel q with coordinates (xn, yn) is a sequence of distinct pixels with
coordinates

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

Where (xi, yi) and (xi-1, yi-1) are adjacent for 1 ≤ i ≤ n.

 Here n is the length of the path.

 If (x0, y0) = (xn, yn), the path is closed path.

 We can define 4-, 8-, and m-paths based on the type of adjacency used.
Examples: Adjacency and Path
V = {1, 2}

0 1 1 0 1 1 0 1 1
0 2 0 0 2 0 0 2 0
0 0 1 0 0 1 0 0 1
Examples: Adjacency and Path
V = {1, 2}

0 1 1 0 1 1 0 1 1
0 2 0 0 2 0 0 2 0
0 0 1 0 0 1 0 0 1
8-adjacent
Examples: Adjacency and Path
V = {1, 2}

0 1 1 0 1 1 0 1 1
0 2 0 0 2 0 0 2 0
0 0 1 0 0 1 0 0 1
8-adjacent m-adjacent
Examples: Adjacency and Path
V = {1, 2}

0 1 1
1,1 1,2 1,3 0 1 1 0 1 1
0 2 0
2,1 2,2 2,3 0 2 0 0 2 0
0 0 1
3,1 3,2 3,3 0 0 1 0 0 1
8-adjacent m-adjacent

The 8-path from (1,3) to (3,3): The m-path from (1,3) to (3,3):
(i) (1,3), (1,2), (2,2), (3,3) (1,3), (1,2), (2,2), (3,3)
(ii) (1,3), (2,2), (3,3)
Basic Relationships Between Pixels

• Connected in S
Let S represent a subset of pixels in an image. Two pixels p with
coordinates (x0, y0) and q with coordinates (xn, yn) are said to be
connected in S if there exists a path

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


Basic Relationships Between Pixels
Let S represent a subset of pixels in an image

• For every pixel p in S, the set of pixels in S that are connected to


p is called a connected component of S.

• If S has only one connected component, then S is called


Connected Set.

• We call R a region of the image if R is a connected set

• Two regions, Ri and Rj are said to be adjacent if their union forms


a connected set.

• Regions that are not adjacent are said to be disjoint.


Basic Relationships Between Pixels

• Boundary (or border)

 The boundary of the region R is the set of pixels in the


region that have one or more neighbors that are not in
R.

 If R happens to be an entire image, then its boundary is


defined as the set of pixels in the first and last rows and
columns of the image.
Question 1

• In the following arrangement of pixels, are the two regions (of


1s) adjacent? (if 8-adjacency is used)

1 1 1
Region 1
1 0 1
0 1 0
Region 2
0 0 1
1 1 1
1 1 1
Question 2

• In the following arrangement of pixels, are the two parts (of


1s) adjacent? (if 4-adjacency is used)

1 1 1
Part 1
1 0 1
0 1 0
Part 2
0 0 1
1 1 1
1 1 1
Distance Measures

You might also like