Pattern Matching and Clustering Techniques

& Technology

Pattern Recognition and

2 Platform

Clustering Techniqiues
of Science

Jully Sabat
The Java

Roll # IT200198026
National Institute

Mr. Anisur Rahman

Technical Seminar, Advisor
Jully Sabat, National Institute of Science & Technology [L1-1]
 Pattern Matching and Clustering Techniques

Introduction
& Technology

A pattern is essentially an arrangement.It is

2 Platform

characterised by the order of the elements which it is

made rather than by intrinsic nature of these
of Science

elements.
The Java

Image analyisis:-Image analysis is a process of

discovering,identifying, and understanding patterns
National Institute

that are relevant to the performance of an image-

based task.

Jully Sabat, National Institute of Science & Technology [L1-2]

 Pattern Matching and Clustering Techniques

Pattern and Pattern Classes

& Technology

• Pattern is a quantitative or structural

2 Platform

description of an object or some other entity

of interest in an image.
of Science

• A pattern is an arrangement of descriptors.

• A pattern classes is a family of patterns that
The Java

share some common properties.

National Institute

• Pattern classes are generally represented by

w1,w2,………wM where M is the number of
classes.

Jully Sabat, National Institute of Science & Technology [L1-3]

 Pattern Matching and Clustering Techniques

Decision –Theoretic Methods

& Technology

• Based on the use of decision function.

• Let x=(x1,x2,…..xn)T represent an n dimensional pattern.
2 Platform

• For M pattern classes w1,w2,….wM the basic problem in decision-theoretic

pattern recognition is to find M decision function d1(x),d2(x),…..dM(x)
of Science

• If a pattern x belongs class wi then di(x)>dj(x)1,2,3,4….M j≠ I

• The decisionboundary separating class from wi from wj is given by the values of
x for which di(x)=dj(x)=> di(x)-dj(x)=0=dij
The Java

dij (x)>0 for pattern of class wi

National Institute

dij (x)>0 for pattern of class wj

Jully Sabat, National Institute of Science & Technology [L1-4]

 Pattern Matching and Clustering Techniques
The Java
National Institute of Science & Technology
2 Platform

Jully Sabat, National Institute of Science & Technology [L1-5]

 Pattern Matching and Clustering Techniques
& Technology

w(x, y) is size of J×R

f(x, y) of size M×N
2 Platform

J ≤ m, K ≤ N
correlation between f(x, y), w(x, y) is
c ( s, t ) = ∑ ∑ f ( x, y)w( x, y)
of Science

x y

s = 0………..M-1
t = 0, 1, ……N-1
The Java

∑ ∑[ f ( x, y ) − f ( x, y )][ w( x − s, y −t ) − w ]
γ ( s, t ) =
x y
National Institute

1
 
∑[ f ( x, y ) − f ( x, y )] ∑ ∑[ w( x − s, y −t ) − w ]
2
∑
2 2

x y x y 

Where s = 0, 1, 2, . - . , M - 1; t = 0, 1, 2, . . ., N - 1, W is the average value of the

pixels in w(x, y) (computed only once), I(x, y) is the average value of f(x, y) in the
region coincident with the current location of w, and the summations are taken over
the coordinates common to both f and w.
Jully Sabat, National Institute of Science & Technology [L1-6]
 Pattern Matching and Clustering Techniques

Neural Network
& Technology
2 Platform

• Background
• Training Patterns
of Science

• Neurons
The Java

Perception for two pattern Classes

National Institute

• Activation Function
• Fixed increment correction Rule
• Perception Training Theorm
Jully Sabat, National Institute of Science & Technology [L1-7]
 Pattern Matching and Clustering Techniques

Bayes Decision Rule

& Technology

If There are two classes C1,C2

2 Platform

p1, ,p2->are class conditional densities

P1,P2->apriori probabilities
of Science

Problem:Given an observation vector x,in which class one

has to place the corresponding unit;C1,C2
The Java

Solution:
National Institute

Ω :All possible observation vectors

S1,S2 ⊆ Ω
S1 ∪ S2=φ
S1 ∩ S2=Ω
Jully Sabat, National Institute of Science & Technology [L1-8]
 Pattern Matching and Clustering Techniques
& Technology

PROBABILITY OF MISCALCULATION
∈= P2 + ∫ [ P1 p1 ( x) − P2 p 2 ( x ) ]dx
2 Platform

S2

Hence 2ε = ( P1 + P2 ) + ∫ ( P2 p 2 ( x) − P1 p1 ( x) ) dx + ∫ ( P1 p1 ( x) − P2 p 2 ( x) ) dx
of Science

s1 s2

=1+ ∫ ( P2 p2 ( x) − P1 p1 ( x) ) dx + ∫ ( P1 p1 ( x) − P2 p2 ( x) ) dx
s1 s2
The Java

so, we need to minimize,

∫( P p ( x) − P1 p1 ( x ) ) dx + ∫ ( P1 p1 ( x) − P2 p 2 ( x) ) dx
National Institute

2 2
s1 s2

The optimal choice of Si is

S1= { x : p1 pi ( x) ≥ p j p j ( x)∀ j + i}
∃ a j0
Where where the strict inequality holds.
Jully Sabat, National Institute of Science & Technology [L1-9]
 Pattern Matching and Clustering Techniques
& Technology

CLUSTERING TECHNIQUES
2 Platform

•Unsupervised classification techniques

•Supervised classification techniques
of Science

Dissimilarity
The Java

Distance measure:- Let x’ = (x1,......xn) and y’ =(y,.....y).

{
National Institute

(i) dp (x,y) = ∑ i x − y i
p
} 1/ p
; p ≥1
It can be shown that, for every P ≥ 1, dp is a metric. For p=2, we get
Euclidean, distance.
(ii) d∞ (x,y) = max
i =1...n |xi-yi|

Jully Sabat, National Institute of Science & Technology [L1-10]

 Pattern Matching and Clustering Techniques

K-Means Algorithm
& Technology

• Usually the algorithm converges.

2 Platform

• Many time, the users choose the value of

number of iterations before stating the
of Science

process.
The Java

• It is necessarily true that two different

National Institute

initial partitions give rise to the same final

clustering.
• Not useful in demarking non-convex or
elongated clusters.
Jully Sabat, National Institute of Science & Technology [L1-11]
 Pattern Matching and Clustering Techniques

Hierarchical Clustering Technique

& Technology

These are of two types

2 Platform

• Agglomerative:-Here initially,the number of

clusters is taken to be the same as the number of
of Science

points.At each stage two clusters and merged and

ultimately the algorithm ends up with one cluster.
The Java

• Divisive:-Initially,the number of clusters is taken

National Institute

to be one.At each stage a cluster is divided into

two clusters and ultimately the algorithm ends up
with n clusters where N=number of points in data
sets.
Jully Sabat, National Institute of Science & Technology [L1-12]
 Pattern Matching and Clustering Techniques

Remarks
& Technology
2 Platform

• K-means algorithm is an example of a non-

hierarchical technique.
of Science

• If the number of clusters is known then the

hierarchical technique is stopped and we
The Java

obtain the desired number of clusters.

National Institute

• If the number of clusters is unknown,then

we find the number of clusters in some
other way after forming the completely .

Jully Sabat, National Institute of Science & Technology [L1-13]

 Pattern Matching and Clustering Techniques

Agglomerative Clustering Technique

& Technology

• . Single Linkage Technique

2 Platform

• Complete Linkage Technique

The Java
National Institute of Science

Jully Sabat, National Institute of Science & Technology [L1-14]

 Pattern Matching and Clustering Techniques

Conclusion
& Technology

• Solutions of problems of image analysis are

2 Platform

characterized by the task formulations, thus limiting

the capability for advancement using the time-tired
methods of building a generalized body of result based
of Science

on preceding accomplishments.
• For the forseenable future, the design of image
The Java

analysis systems will continue to require a mixture of

National Institute

art and science. In that sense, the points discussed in

this project may be vied as a strong base upon which
to build solutions to image processing problems in a
broadspectrum of disciplines.

Jully Sabat, National Institute of Science & Technology [L1-15]

 Pattern Matching and Clustering Techniques
& Technology
2 Platform
of Science

THANK YOU!!
The Java
National Institute

Jully Sabat, National Institute of Science & Technology [L1-16]