

Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
The topics covered in the cmsc 828j final exam, including hidden markov models (hmms), corners detection, linear separators, and geometry. It includes practice problems and challenges to help students prepare. Topics include features, markov chains, baum-welch algorithm, perceptron algorithm, support vector machines, winnow, invariants, linear subspaces, morphometrics, template matching, and geometry.
Typology: Exams
1 / 3
This page cannot be seen from the preview
Don't miss anything!


Topics to be covered on the final.
Since the midterm:
Before the Midterm
I am allowed to base a challenge problem on material in one of the readings.
Practice Problems
These problems are meant to give you examples of some things that might be asked on the final. It should be helpful to do these while studying. These are NOT comprehensive, and the final may include questions on any of the above topics.
a. Suppose we are equally likely to start in either state. After a very large number of transitions, what is the probability that we will wind up in state 1?
b. Suppose we have possible observations A and B. The probability of observing A in state 1 is ¾, and the probability of observing A in state 2 is 2/3. What is the probability that we observe ABA?
c. What is the most likely sequence of 10 observations?
d. What is the probability that we observe AABAABAAB… over 3k observations, for any k?
e. Suppose we observe AABB. Compute an iteration of the Baum-Welch algorithm given this observation, and see what the new model will be.