Recognition Based On

Decision Theoretical Method

Submitted By Qazi Saadullah Latif
12.2 Recognition Based on Decision-
Theoretic Methods
• Let 𝒙 = 𝒙𝟏 , 𝒙𝟐 , … , 𝒙𝒏 𝑻 for 𝑾 pattern class 𝝎𝟏 , 𝝎𝟐 , … , 𝝎𝑾
• 𝒅𝒊 𝒙 > 𝒅𝒋 𝒙 𝒋 = 𝟏, 𝟐, … , 𝑾; 𝒋 ≠ 𝒊

• In other words, an unknown pattern 𝒙 is said to belong to the ith

pattern class if, upon substitution of 𝒙 into all decision functions,
𝒅𝒊 𝒙 yields the largest numerical value.
12.2.1 Matching

• Minimum Distance Classifier

• Define the prototype of each pattern class
• Assign x to class 𝝎𝒋 if 𝑫𝒋 (𝒙) is the smallest distance.
• Selecting the smallest distance is equivalent to evaluating the
functions
• Assign x to class 𝝎𝒋 if 𝒅𝒋 (𝒙) is the largest numerical value.
12.2.1 Matching

Decision boundary of minimum distance classifier. (Dark dot and square are
the means)
12.2.1 Matching

• American Bankers
Association E-13B font
character set and
corresponding waveforms.
 12.2.1 Matching

• The mechanics of template

matching
12.2.1 Matching

Satellite image Template

Location of the
Correlation best match
Coefficient
12.2.2 Optimum Statistical
Classifiers

Probability density functions for two 1-D pattern classes. The point x0 shown
is the decision boundary if the two classes are equally likely to occur.
12.2.2 Optimum Statistical
Classifiers
• Two Simple Pattern Classes and their Bayes Decision Boundary
12.2.2 Optimum Statistical
Classifiers
Formation of a pattern vector
from registered pixels of four
digital images generated by a
multispectral scanner.
12.2.3 Neural Networks
12.2.3 Neural Networks

Three-layer Neural
Network
12.2.3 Neural Networks
• Performance of the neural network as a function of noise level.
12.2.3 Neural Networks

Improvement in performance
for Rt=0.4 by increasing the
number of training patterns
(the curve for Rt=0.3 is
shown for reference).
12.2.3 Neural Networks
12.2.3 Neural Networks

Types of decision regions that can be formed by single- and multilayer

feedforward neural networks.