Escolar Documentos
Profissional Documentos
Cultura Documentos
Acquisition
Lecture # 3
1/48
Principal Sensor Arrangements
Incoming energy transformed into voltage by the
combination of:
Electrical power
Sensor material (responsive to type of energy)
Output voltage is proportional to intensity
Filter can improve selectivity ( Green etc)
2/48
Principal Sensor Arrangements
Three Principal Sensor arrangement to transform illumination
energy into digital image
Line sensor
Array sensor
3/48
Image Acquisition
4/48
Image Acquisition
5/48
Digital Camera Technologies
CCD (Charge Coupled Device)
Capacitive device
6/48
Image Acquisition Digital Camera
Transfer Architecture
Frame Transfer
Architecture
Interline Transfer
Architecture
Active Pixel
Architecture
8/48
Digital Camera Technologies (1)
CCD Array
Cameras
Frame Transfer
Architecture
9/48
Digital Camera Technologies (2)
CCD Array
Cameras
Interline Transfer
Architecture
11/48
Digital Camera Technologies (3)
Active pixel architecture
CMOS Array
Cameras
Standard semiconductor
production line
Active pixel architecture
Photo-detector and amplifier
are both fabricated inside each
pixel.
12/48
Basic Relationship b/w pixels
Neighbors of a pixel
Adjacency
Connectivity
Path
Region / boundaries
Distance Measures
14/48
Relationship Between Pixels
Neighbors of a Pixel
0 0 0 1 1 1
1 1 1 1 1 1
0 0 1 0 1 0
1 1 1 1 1 1
1 1 1 0 0 0
1 1 1 1 1 0
15/48
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
N8(p) : 8-neighbors of p :
a combination of N4(p) and ND(p)
17/48
Basic relationships between Pixels
Adjacency between pixels:
Two pixels p and q are adjacent if
They are neighbor
Their gray levels satisfy a specified criterion of similarity
18/48
Adjacency
q
q q q
q p q q p q
q q q q
19/48
Basic relationships between Pixels
PATH
A path 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 (xi, yi) is adjacent to
(xi-1,yi-1)
n is the length of the path
we can define 4-,8-, or m-paths depending on type of adjacency
specified.
20/48
Basic relationships between Pixels
PATH. Find Shortest 4 path
21/48
Basic relationships between Pixels
PATH. Find Shortest 8 path
22/48
Adjacency
Mixed Adjacency:
Note: Mixed adjacency can eliminate the multiple path
connections that often occurs in 8-adjacency
24/48
Basic relationships between Pixels
PATH. Find Shortest m path
25/48
M- Adjacency
Are b & c m-adjacent
Yes
26/48
Yes
M- Adjacency
No
27/48
m-connectivitys distance
28/48
Basic relationships between Pixels
Connectivity between pixels:
An important concept used in establishing boundaries of
objects and components of regions
Let S represent a subset of pixel in an image. Two pixels p
and q are connected if there exit a path between them.
29/48
Basic relationships between pixels
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
30/48
Boundary
0 0 0 0
0 0 0 0
0 1 1 1
0 1 1 1
0 1 1 1
0 1 1 1
0 0 1 1
0 0 1 1
31/48
Boundary
0 0 0 0
0 0 0 0
0 1 0 0
0 1 1 1
0 1 1 1
0 1 1 1
0 0 1 1
0 0 1 1
32/48
Boundary
0 0 0 0
0 0 0 0
0 1 0 0
0 1 1 0
0 1 1 1
0 1 1 1
0 0 1 1
0 0 1 1
33/48
Basic relationships between pixels
Neighbor -> adjacent -> path -> connected -> region
34/48
Distance Measures
For pixel p, q and z with coordinates (x, y), (s, t) and (u, v)
respectively
D is a distance function or metric
s,t
y-t
x,y
x-s
35/48
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
The pixels with De distance r from (x,y) define a disk of radius r
centered at (x,y)
City-block distance between p and q:
D4 ( p, q) x s y t
The pixels with D4 distance r from (x,y) form a diamond centered at
(x,y)
the pixels with D4=1 are the 4-neighbors of (x,y)
Chessboard distance between p and q:
D8 ( p, q) max(| x s |, | y t |)
The pixels with D8 distance r from (x,y) form a square centered at (x,y)
The pixels with D8=1 are the 8-neighbors of (x,y)
36/48
Euclidean Distance Between p and q
37/48
City-block distance: D4 distance
D4(p,q) = (|x s| + |y t |)
D4 =1 are 4-neighbors of (x, y)
Draw D4 distance 2
D4 distance 2 from (x,y) form the diamond centered at (x, y)
s,t
y-t
x,y
x-s
38/48
Chessboard distance: D8 Distance
D8 (p, q) = max (|x s|, |y t |)
D8 =1 are 8-neighbors of (x, y)
Draw D8 distance 2 from (x,y)
D8 distance 2 from (x,y) form the square centered at
(x, y)
s,t
y-t
x,y
x-s
39/48
Distance Measures
close all; clear all
bw = zeros(5,5); bw(3,3) = 1 %bw(4,4) = 1
[DEucli] = bwdist(bw)
[DChess] = bwdist(bw,'chessboard')
[DCity] = bwdist(bw,'cityblock')
40/48
Distance.m
D4 and D8 Distances
We can consider both D4 and D8 distances b/w p and q
regardless of whether a connected path exists between them or
not because the definitions of these distances involve only the
coordinates.
41/48
Adjacent
Two image area subsets S1 and S2 are adjacent
if some pixel in S1 is adjacent to some pixel S2.
42/48
Exercise
Consider the two image subsets S1 and S2
43/48
Exercise
Consider the two image subsets S1 and S2
44/48
Reading Assignment
Chapters 1 and 2 of Digital Image Processing by
Gonzalez.
Chapter 2 of Digital Image Processing using
MATLAB by Gonzalez.
45/48