final_fa11

final_fa11 - CSE166 – Image Processing – Final...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: CSE166 – Image Processing – Final Instructor: Prof. Serge Belongie http://www-cse.ucsd.edu/classes/fa11/cse166-a 11:30am-2:30pm Thu. Dec. 8, 2011. On this exam you are allowed to use a calculator and two 8.5” by 11” sheets of notes. The total number of points possible is 56. Good luck! Part I: Fill in the Blank (1 pt. per blank, 20 pts. total). 1. True or False: k-means is an unsupervised learning method. 2. True or False: a minimum distance classifier is a supervised learning method. 3. If X is an n × k matrix with k < n , the rank of the matrix XX > is . 4. When computing the covariance for a set of vectors, we must first the data. 5. PCA applied to face recognition is known as . 6. True or False: Huffman Coding assigns infrequently occurring symbols short codewords. 7. A good choice of kernel for enhancing oriented fingerprint ridges while suppressing noise would be a(n) . 8. The convolution of the 3rd row and the 5th row of Pascal’s triangle yields ....
View Full Document

This note was uploaded on 12/11/2011 for the course CSE 166 taught by Professor Belongie during the Fall '06 term at UCSD.

Page1 / 2

final_fa11 - CSE166 – Image Processing – Final...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online