17 2.5 (Neighbors) 1. f(x,y) p q S 2. N4(p) (4-neighbors of p)
(x+1, y) (x-1, y) (x, y+1) (x, y-1) 3. ND (p) (4- diagonal
neighbors of p) (x+1, y+1) (x-1, y-1) (x-1, y+1) (x+1, y-1) 4.
N8(p) (8-neighbors of p) N8(p) = N4(p) ND(p)
Slide 18
18 (Adjacent) 1. (4-adjacency) q N4(p) p q p q 2. (8-adjacency)
q N8(p) p q p q 3.m (m-adjacency) p q (1).q N4(p) (2).q ND(p)
N4(p)N4(q)
Slide 19
19 1. S1,S2 S1 S2 2. p q (Path) (x0, y0), (x1, y1),..., (xn,
yn), p q n (Length) 3. S p,q p q (Connected)
Slide 20
20 (Distance measures) 1. (Distance function) p, q, z (x,y),
(s,t), (u,v) (1). D(p,q) 0 ( D(p,q) = 0 iff p = q ) (2). D(p,q)
D(q,p), and (3). D(p,z) D(p,q) + D(q,z) 2. (Euclidean distance)
De(p,q) = [ (x - s)2 + (y - t)2 ]1/2 3.D4 (D4 distance) D4 = x - s
+ y - t 4.D8 (D8 distance) D8 = max(x - s,y - t)
Slide 21
21 5. D4 D8 m-
Slide 22
22 1. p + q, p - q, p * q, p q 2. AND: p AND q OR: p OR q
COMPLEMENT: NOT q EXCLUSIVE OR: XOR q 3. (1). (Pixel-by-pixel
operation) (2). (Neighborhood oriented operation) 4. (Mask
operation)
Slide 23
23
Slide 24
24 2.6 H H H (Linear Operator) H (Nonlinear Operator) H(a f + b
g) = a H(f) + b H(g) f g