Scribd Logo
Upload

Welcome to Scribd!

  • (IT413P) Pattern Recognition Grade Four DR: Nagham Mekky

    Uploaded by

    Mustafa Elmalky
    7 views21 pages
    This document is a chapter summary for a pattern recognition course. It discusses: 1) Classifiers can be represented as a set of discriminant functions gi(x) that assign a feature vector x to the class with the largest function value. 2) For the Bayes classifier, the discriminant functions are the posterior probabilities P(ωi|x). Taking the log of these yields commonly used discriminant functions. 3) A single discriminant function g(x) is often used for two-category classification, defined as the log odds ratio of the posterior probabilities. Discriminant functions divide the feature space into decision regions separated by decision boundaries defined by where two discriminant values are equal.

    Original Description:

    agcl lecture

    Original Title

    lacture4

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document is a chapter summary for a pattern recognition course. It discusses: 1) Classifiers can be represented as a set of discriminant functions gi(x) that assign a feature vector x to the class with the largest function value. 2) For the Bayes classifier, the discriminant functions are the posterior probabilities P(ωi|x). Taking the log of these yields commonly used discriminant functions. 3) A single discriminant function g(x) is often used for two-category classification, defined as the log odds ratio of the posterior probabilities. Discriminant functions divide the feature space into decision regions separated by decision boundaries defined by where two discriminant values are equal.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    7 views21 pages

    (IT413P) Pattern Recognition Grade Four DR: Nagham Mekky

    Uploaded by

    Mustafa Elmalky
    This document is a chapter summary for a pattern recognition course. It discusses: 1) Classifiers can be represented as a set of discriminant functions gi(x) that assign a feature vector x to the class with the largest function value. 2) For the Bayes classifier, the discriminant functions are the posterior probabilities P(ωi|x). Taking the log of these yields commonly used discriminant functions. 3) A single discriminant function g(x) is often used for two-category classification, defined as the log odds ratio of the posterior probabilities. Discriminant functions divide the feature space into decision regions separated by decision boundaries defined by where two discriminant values are equal.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 21

    Mansoura University

    Faculty of Computers and Information


    Department of Information Technology
    First Semester- 2020-2021

    [IT413P] Pattern Recognition


    Grade: Four
    Dr: Nagham Mekky
    CHAPTER (2)
    BAYESIAN DECISION
    THEORY
    2.4 Classifiers, Discriminant Functions and Decision Surfaces
    2.4.1 The Multi-Category Case
     There are many different ways to represent pattern
    classifiers. One of the most useful is in terms of a
    set of discriminant functions gi(x), i = 1, . . . , c,
    The classifier is said to assign a feature vector x to
    class ωi if

     Thus, the classifier is viewed as a network or


    machine that computes c discriminant functions
    and selects the category corresponding to the
    largest discriminant.

    Pattern Classification, Chapter
    2 (Part 2) 13
    Discriminants for Bayes Classifier
     Assuming a general loss function:
    gi(x)= -R(αi / x)

     Assuming the zero-one loss function:


    gi(x)=P(ωi / x)
    Discriminants for Bayes Classifier
     Is the choice of gi unique?
     Replacing gi(x) with f(gi(x)), where f(.) is monotonically
    increasing function, does not change the classification results.

    p(x / i ) P(i )
    g i ( x) 
    p ( x)
    gi(x)=P(ωi/x)
    gi (x)  p(x / i ) P(i )
    gi (x)  ln p(x / i )  ln P(i )

    we’ll use this


    discriminant extensively!
    Case of Two Categories
     More common to use a single discriminant function
    instead of two:

     Examples:
    g (x)  P(1 / x)  P(2 / x)
    p(x / 1 ) P(1 )
    g (x)  ln  ln
    p ( x / 2 ) P(2 )
    Decision Regions and Boundaries
     Discriminants divide the feature space in decision regions
    R1, R2, …, Rc, separated by decision boundaries.

    Decision boundary
    is defined by:
    g1(x)=g2(x)
    Pattern Classification, Chapter
    2 (Part 2) 18
    2.5 The Normal Density
    2.5.1Univariate ‫احادي المتغير‬density

     We begin with the continuous univariate normal or


    Gaussian density,
    1  1 x 
    2

    P( x )  exp    ,
    2   2    
    Where:
     = mean (or expected value) of x
    2 = expected squared standard deviation or variance

    Pattern Classification, Chapter 2


    (Part 2)
    19
    Pattern Classification, Chapter 2
    (Part 2)
    20
    21

    You might also like