Presentation is loading. Please wait.

Presentation is loading. Please wait.

Learn how to make your drawings come alive…  NEW COURSE: SKETCH RECOGNITION Analysis, implementation, and comparison of sketch recognition algorithms,

Similar presentations


Presentation on theme: "Learn how to make your drawings come alive…  NEW COURSE: SKETCH RECOGNITION Analysis, implementation, and comparison of sketch recognition algorithms,"— Presentation transcript:

1 Learn how to make your drawings come alive…  NEW COURSE: SKETCH RECOGNITION Analysis, implementation, and comparison of sketch recognition algorithms, including feature-based, vision-based, geometry-based, and timing-based recognition algorithms; examination of methods to combine results from various algorithms to improve recognition using AI techniques, such as graphical models.

2 Rubine Features Make sure your to convert to double before dividing in Java Remove the second point not the first for duplicate points Try to get your values as close to mine and move on.

3 Rubine Classification Evaluate each gesture 0 <= c <= C. V c = value = goodness of fit for that gesture c. Pick the largest V c, and return gesture c

4 Rubine Classification W c0 = initial weight of gesture W ci = weight for the I’th feature F i = i th feature value Sum the features together

5 Collect E examples of each gesture (e should be 15 according to paper) Calculate the feature vector for each example F cei = the feature value of the i th feature for the e th example of the c th gesture

6 Find average feature values for gesture For each gesture, compute the average feature value for each feature F ci is the average value for the i th feature for the c th gesture

7 Compute gesture covariance matrix How are the features of the shape related to each other? Look at one example - look at two features – how much does each feature differ from the mean – take the average for all examples – that is one spot in the matrix http://mathworld.wolfram.com/Covariance.html Is there a dependency (umbrellas/raining)

8 Normalize cov(X) or cov(X,Y) normalizes by N-1, if N>1, where N is the number of observations. This makes cov(X) the best unbiased estimate of the covariance matrix if the observations are from a normal distribution.For N=1, cov normalizes by N They don’t normalize for ease of next step (so just sum, not average)

9 Normalization Taking the average But… we want to find the true variance. Note that our sample mean is not exactly the true mean. By definition, our data is closer to the sample mean than the true mean Thus the numerator is too small So we reduce the denominator to compensate

10 Common Covariance Matrix How are the features related between all the examples? Top = non normalize total covariance Bottom = normalization factor = total number of examples – total number of shapes = 26*14

11 Weights W cj = weight for the j th feature of the c th shape Sum for each feature –Common Covariance Matrix inverted* ij –Average feature value for the i th feature for the c th gesture

12 Initial Weight Initial gesture weight = Sum for each feature in class: –Feature weight * average feature value

13 Rubine Classification Evaluate each gesture 0 <= c <= C. V c = value = goodness of fit for that gesture c. Pick the largest V c, and return gesture c

14 Rubine Classification W c0 = initial weight of gesture W ci = weight for the I’th feature F i = i th feature value Sum the features together

15 Eliminate Jiggle Any input point within 3 pixels of the previous point is discarded

16 Rejection Technique 1 If the top two gestures are near to each other, reject. V i > V j for all j != i Reject if less than.95

17 Rejection Technique 2 Mahalanobis distance Number of standard deviations g is from the mean of its chosen class i.

18 Syllabus http://www.cs.tamu.edu/faculty/hammond/ courses/SR/2006http://www.cs.tamu.edu/faculty/hammond/ courses/SR/2006

19 Homework Fix covariance matrix Implement trainer –Data: 26 gestures; 15 examples –E ij = Compute common covariance matrix (13*13) –W ci = Compute weights for each feature (26*13) –Wc0 = Compute initial weights for each class (26) Build Classifier –Data: 2 gestures for each letter + 8 random = 60 examples –V c = Compute value for each gesture –Classify with highest gesture number Turn in: Code & classification and value for highest value For Friday: Build option jitter reducer, rerun your data on the jitter reducer. Comment on any differences. For Friday: Implement rejection For Friday: Read Chris Long paper For Monday: Come up with your own features. Compare your results.


Download ppt "Learn how to make your drawings come alive…  NEW COURSE: SKETCH RECOGNITION Analysis, implementation, and comparison of sketch recognition algorithms,"

Similar presentations


Ads by Google