ADTP: Statistical Pattern Recognition - Homework 2 | CS 591Q, Assignments of Computer Science

Material Type: Assignment; Professor: Ross; Class: ADTP:Statistcl Pattrn Recogntn; Subject: Computer Science; University: West Virginia University; Term: Spring 2007;

Typology: Assignments

Pre 2010

Uploaded on 09/17/2009

koofers-user-vck-1
koofers-user-vck-1 🇺🇸

10 documents

1 / 2

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
Homework 2
CS 591Q/791V - Pattern Recognition
Instructor: Dr. Arun Ross
Due Date: Feb 27, 2007
Note: You are permitted to discuss the following questions with others in the class.
However, you must write up your own solutions to these questions. Any indication to the
contrary will be considered an act of academic dishonesty.
1. Solve the following problems in DHS.
(a) [5 points] 2.27, p. 72.
(b) [15 points] 2.48 (a), p. 78.
(c) [20 points] 2.52, p. 79.
2. [15 points] Consider the following class-conditional density function for feature vector x=
x1
x2:
p(x|ω)N(µ, Σ)
where,
µ=µ1
µ2;Σ=σ2
1σ12
σ21 σ2
2;σ12 =σ21.
(a) Write down the expression for the Euclidean distance between point xand mean vector
µ.
(b) Write down the expression for the Mahalanobis distance between point xand mean
vector µ. Simplify this expression by expanding the quadratic term.
(c) Compare the two expressions. How does the Mahalanobis distance differ from the
Euclidean distance? When are the two distances equal? When is it more appropriate
to use the Mahalanobis distance?
3. [20 points] Consider a two-category classification problem with two-dimensional feature vec-
tor x= (x1, x2). The two categories are ω1and ω2
p(x|ω1)N(0, I),
p(x|ω2)N([1,1]T, I), and
P(ω1) = P(ω2) = 1
2.
pf2

Partial preview of the text

Download ADTP: Statistical Pattern Recognition - Homework 2 | CS 591Q and more Assignments Computer Science in PDF only on Docsity!

Homework 2

CS 591Q/791V - Pattern Recognition Instructor: Dr. Arun Ross Due Date: Feb 27, 2007

Note: You are permitted to discuss the following questions with others in the class. However, you must write up your own solutions to these questions. Any indication to the contrary will be considered an act of academic dishonesty.

  1. Solve the following problems in DHS.

(a) [5 points] 2.27, p. 72. (b) [15 points] 2.48 (a), p. 78. (c) [20 points] 2.52, p. 79.

  1. [15 points] Consider the following class-conditional density function for feature vector[ x = x 1 x 2

]

p(x | ω) ∼ N(μ, Σ)

where,

μ =

[

μ 1 μ 2

]

[

σ^21 σ 12 σ 21 σ 22

]

; σ 12 = σ 21.

(a) Write down the expression for the Euclidean distance between point x and mean vector μ. (b) Write down the expression for the Mahalanobis distance between point x and mean vector μ. Simplify this expression by expanding the quadratic term. (c) Compare the two expressions. How does the Mahalanobis distance differ from the Euclidean distance? When are the two distances equal? When is it more appropriate to use the Mahalanobis distance?

  1. [20 points] Consider a two-category classification problem with two-dimensional feature vec- tor x = (x 1 , x 2 ). The two categories are ω 1 and ω 2 p(x | ω 1 ) ∼ N(0, I), p(x | ω 2 ) ∼ N([1, 1]T^ , I), and P (ω 1 ) = P (ω 2 ) = 12.

(a) Calculate the Bayes decision boundary. (b) Generate (using Matlab) 100 patterns from each of the two class-conditional densities and plot them in the two-dimensional feature space. Draw the decision boundary on this plot. (c) Calculate the Bhattacharya error bound. How tight is this bound?

Note: You may use the MATLAB package to generate multivariate random patterns. Use the “mvnrnd” (multivariate normal random point generator), “plot” and “ezplot” commands in matlab to generate and plot the data and the decision boundary.

  1. CS 791V students must solve the following problems also (from DHS) in addition to the problems above.

(a) [10 points] 2.33, p. 73. (b) [10 points] 2.44, p. 77. (c) [25 points] Computer Exercise 2.6, p. 81.