Downloaded From: www.EasyEngineering.

net

ww
w.E
asy
En
gin
eer
ing
.ne
t

®
TM

TECHNICAL PUBLICATIONS - An up thrust for knowledge

 Downloaded From: www.EasyEngineering.net

b1 c1
b1

n1 n2 nk nk

nk n k− 1
b0
b1

ww
w.E
b0 asy
c0 b0
En
c0

b0 c0 gin 1
3
2
1
b1

eer
c1
b0 b1
b1 2

ing 0 4 0

0 1 2 3 4 5
x
5
.ne 7

t
3 6
0
(a) 4-dimensional chain (b) 8-dimensional chain
1 c0 b 0 code code

3
Boundary point
depicted in
4
red is the
starting point 1 0
5 for boundary
tracing algorithm.
6 1 3

7 0
2 0
8
1 3
9

3 2 2
y

®
TM

TECHNICAL PUBLICATIONS - An up thrust for knowledge

 Downloaded From: www.EasyEngineering.net

N−1
2
⇒
E2 ∑ x i − di
i=2

⇒ max x i − di
E max
2 ≤ i ≤ N −1

2 0 S

3 1

ww 2
4
7

w.E
4 0
2
6
5
6
7
3
asy
4
5

(a) Object boundary (b) Boundary enclosed by

En cells

gin
eer
0 1
0
3 ing
(c) Boundary is shrinked
by MPP
1
2 2
3

.ne
4-Directional chain code Boundary of object t

®
TM

TECHNICAL PUBLICATIONS - An up thrust for knowledge

 Downloaded From: www.EasyEngineering.net

y2
y2

x1 xN
x1 xN y3

y2
y2

ww y4
y4

w.E
x1 y3

xN xN
y3

asy
En
gin y1

xN eer xN

ing z1

x1
.ne
t

®
TM

TECHNICAL PUBLICATIONS - An up thrust for knowledge

 Downloaded From: www.EasyEngineering.net

r r
θ θ

A
A

r(θ) r(θ)

ww
w.E
0 π
4
π
2
3π
4
π 5π 3π 7π 2π θ
4 2 4
0 π/2 π 3π/2 θ

asy
En
gin p
p

eer q q

ing
.ne
Convex Non - convex

t
t
Se ⇒
S

max [D (p i , p j )] pi , pj
i, j

®
TM

TECHNICAL PUBLICATIONS - An up thrust for knowledge

 Downloaded From: www.EasyEngineering.net

Chain code : 0 3 2 1

Difference : 0 3 2 1

3 3 3 3

Shape no : 3 3 3 3

ww Order : 4

w.E
S 0
Order 6
0
asy
1 iy

1 3 2 0
En t
z(t) z(t) = x(t) + i y(t)

2 2
3
gin
eer x

Chain code : 0 0 3 2 2 1 ing

.ne
Difference : 0

3
0

0
3

3
2

3
2

0
1

3
t
Shape no : 0 3 3 0 3 3

Order : 6
N−1
⎡ − i 2 pnk ⎤
∑ z(n) exp ⎢
⎣ N ⎥⎦
n= 0

1 N−1 ⎡ i 2 pnk ⎤
N ∑ z(k) exp ⎢
⎣ N ⎥⎦
1 k= 0
0

1 3 2 0

2
3

®
TM

TECHNICAL PUBLICATIONS - An up thrust for knowledge

 Downloaded From: www.EasyEngineering.net

z0 n
∑ (x i − X)
z t (n) z (n) + z 0 i=1

z0 x0 + i y 0
n
z (0)
∑ (x i − X) 2
i=1
z t (0) z (0) + z 0

θ
iθ
z r (n) z (n)

ww
Z r (k) Z(k) iθ

w.E
z s (n) a z(n) asy n (x i − X) 3
Z s (k) a Z(k)
En ∑
i=1 nS 3

z t (n) z (n − n 0 )
gin
eer
Z t (k) Z(k) − j 2π n0 k N n
∑ing
i=1
(x i − X)
nS 4

.ne
N−1
z 1 (n) z 2 (n) t
∑[ z 1 , ( ) − z 2 (k) ] 2
k= 0

P2 π
4πA
CR
P2

®
TM

TECHNICAL PUBLICATIONS - An up thrust for knowledge

 Downloaded From: www.EasyEngineering.net

1) H = 1
2) C = 1
3) E = 0

ww
w.E
asy
En
1) H = 2
gin Texture
2) C = 1
3) E = –1
eer
ing
(A) Statistical texture descriptor (B) Spectral texture descriptor

.ne
t
Histogram Co-occurance
based based

1) H = 0
2) C = 3
3) E = 3

L−1
μ n (z) ∑ (z i − m) n p(z i )
i= 0

L−1
∑ z i p(z i )
i= 0
®
TM

TECHNICAL PUBLICATIONS - An up thrust for knowledge

 Downloaded From: www.EasyEngineering.net

⇒ ⎡ ⎤
⎢ ⎥
⇒ ⎢ ⎥⇒
⎢ ⎥
⇒ ⎢ ⎥
⎣ ⎦

A 21 ⇒
L−1
∑ p 2 (z i) ⎡ ⎤
i=0 ⎢ ⎥
⎢ ⎥⇒
⎢ ⎥
⎢ ⎥
⎣ ⎦

A 22 ⇒

ww L−1
∑ p(z i ) log 2 p(z i )
i=0
⎡
⎢
⎤
⎥

w.E ⎢
⎢
⎢
⎣
⎥⇒
⎥
⎥
⎦

asy ⎡
⎢
⎣
⎤
⎥
⎦
× a i,j
zi En
zj
gin max i,j (C i j )

∑ ∑ C2i,j
C i,j
eer i j

−∑ ∑ C i j log 2 C i j
zi zj
ing i j

⎡0 0 0 0⎤
×
.ne
⎢1
⎢
⎢0
⎢1
1 1 1⎥
0 0 0⎥
⎥

1 1 1 ⎥⎦ θ
t
⎣
θ S θ (r)

⎡A 11 A 12 ⎤ S θ (r) S r ( θ)
⎢A A 22 ⎥⎦
⎣ 21 S r ( θ) ⇒ S r ( θ)
π
⎡ ⎤
⎢ ⎥ ∑ S θ (r)
⎢ ⎥⇒ θ=
A 11 ⇒
⎢ ⎥
⎢ ⎥ R
⎣ ⎦ θ ∑ S r ( θ)
r= 1
A 12 ⇒

®
TM

TECHNICAL PUBLICATIONS - An up thrust for knowledge

 Downloaded From: www.EasyEngineering.net

Iris versicolor
Iris setosa

Petal width
+
–

Petal length

ww W

w.E
Pattern arrangement asy ⎡ x 1 ⎤ x 1 ⇒ petal length

En ⎢x ⎥ x ⇒
⎣ 2⎦ 2 width

Vectors Strings Trees gin

eer
⎡x1 ⎤
⎢x ⎥ ing
⎢ 2⎥
⎢ ⎥
⎢x ⎥
[x 1 , x 2 , ... , x n ]
.ne
⎣ n⎦

a a

b
t
b a
b

a
b
a
b
a

b
a

i) Staircase structure ii) Coded structure

®
TM

TECHNICAL PUBLICATIONS - An up thrust for knowledge

 Downloaded From: www.EasyEngineering.net

ww
w.E Multispectral image

asy
Down town
En Residential

gin
Buildings Highways
eer Housing Shopping
malls
Highways

ing
High
density
Large Multiple
structures
Loops Low
density
Small
structures
Single
.neFew
Intersection

t
[x 1 , ... , x n ] T
θ f1 , f2 , ... , fθ θ
d 1 (x), d 2 (x), ... , d θ (x) fi

d i (x) > d j (x) θ

≠
fi fi
d i (x) d j (x)
d ij (x) d i (x) − d j (x)
fi
d ij (x) > 0 θ

≠
®
TM

TECHNICAL PUBLICATIONS - An up thrust for knowledge

 Downloaded From: www.EasyEngineering.net

∑ ∑[ ][ ]
ν
⎧ ⎫
⇒
⎨∑ ∑[ ] ∑ ∑[ ] ⎬
⎩ ⎭

ν
⇒

ww mj
1
Nj ∑ x j , j = 1,2, ... , θ
x ε θj

D j (x) x − mj
w.E j = 1, ... , θ

fj D j (x)
asy
En
d j (x)
1
X T m j − m Tj m j , j = 1,2, ... , θ
2
gin
fj d j (x)
eer
fi fj
ing
d i j (x) d i (x) − d j (x) .ne
1
x T (m i − m j ) − (m i − m j ) T (m i − m j )
2 t
∑∑

T [au 1 + bu 2 ] aT (u 1 ) + bT (u 2 )

®
TM

TECHNICAL PUBLICATIONS - An up thrust for knowledge

 Downloaded From: www.EasyEngineering.net

ε(n) Bq(z) 1 (z) u(n)

MA model AP
AR model

ww∑ q

w.E
ε(n)
Bq(z) =
k=0
b(k)z –k u(n)

asy
En
gin
eer
ing
.ne
t

®
TM

TECHNICAL PUBLICATIONS - An up thrust for knowledge

 Downloaded From: www.EasyEngineering.net

ww
w.E
asy
En
gin
eer
ing
.ne
t

®
TM

TECHNICAL PUBLICATIONS - An up thrust for knowledge