introduction to pattern recognition chapter 1 duda et al n.
Download
Skip this Video
Loading SlideShow in 5 Seconds..
Introduction to Pattern Recognition Chapter 1 ( Duda et al.) PowerPoint Presentation
Download Presentation
Introduction to Pattern Recognition Chapter 1 ( Duda et al.)

play fullscreen
1 / 67

Introduction to Pattern Recognition Chapter 1 ( Duda et al.)

615 Views Download Presentation
Download Presentation

Introduction to Pattern Recognition Chapter 1 ( Duda et al.)

- - - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - - -
Presentation Transcript

  1. Introduction to Pattern RecognitionChapter 1 (Duda et al.) CS479/679 Pattern RecognitionDr. George Bebis

  2. What is Pattern Recognition? • Assign a pattern to one of several pre-specified categories (or classes). Male or Female?

  3. What is Pattern Recognition? (cont’d) Photograph or not?

  4. What is Pattern Recognition? (cont’d) Character Recognition Classes: All characters

  5. What is Pattern Recognition? (cont’d) Speech Understanding Classes: phonemes

  6. Classification vsClustering • Classification (known categories) • Clustering (creation of new categories) Category “A” Category “B” Clustering (Unsupervised Classification) Classification (Recognition) (Supervised Classification)

  7. What is a Pattern? • A pattern could be an object or event. biometric patterns hand gesture patterns

  8. What is a Pattern? (con’t) • Loan/Credit card applications • Income, # of dependents, mortgage amount, credit worthiness • Dating services • Age, hobbies, income, etc. establish your “desirability” • Web documents • Key-word based descriptions (e.g., documents containing “terrorism”, “Osama” are different from those containing “football”, “NFL”).

  9. Pattern Class • A collection of “similar” objects • Challenges in modeling classes: • Intra-class variability • Inter-class variability The letter “T” in different typefaces Letters/Numbers that look similar

  10. Modeling Pattern Classes • A description of the class, typically expressed in terms of a statistical model. • e.g., probability density function (Gaussian) gender classification male female

  11. Key PR Objectives • Hypothesize the models that describe each pattern class (e.g., recover the process that generated the patterns). • Given a novel pattern, choose the best-fitting model for it and then assign it to the pattern class associated with the model.

  12. Pattern Recognition Applications

  13. Handwriting Recognition

  14. License Plate Recognition

  15. Face Detection Unbalanced classes: faces vs non-faces

  16. Gender Classification Balanced classes: male vs female

  17. Biometric Recognition

  18. Fingerprint Classification

  19. Autonomous Navigation

  20. Land Cover Classification(from aerial or satellite images)

  21. “Hot” Pattern Recognition Applications • Recommendation systems • Amazon, Netflix • Targeted advertising

  22. The Netflix Prize • Movie recommendation system • Predict how much someone is going to enjoy a movie based on their movie preferences • $1M awarded in Sept. 2009 • Can software recommend movies to customers? • Not Rambo to Woody Allen fans • Not Saw VI if you’ve seen all previous Saw movies

  23. Main PR Areas • Template matching • The pattern to be recognized is matched against a stored template while taking into account all allowable pose (translation and rotation) and scale changes. • Statistical pattern recognition • Focuses on the statistical properties of the patterns (i.e., probability densities). • Syntactic pattern recognition • Describe complicated objects in terms of simple primitives; decisions consist of logical rules or grammars. • Artificial Neural Networks • Inspired by biological neural network models.

  24. Template Matching Template Input scene

  25. Deformable Template (Corpus Callosum Segmentation) Prototype registration to the low-level segmented image Prototype and variation learning Shape training set Prototype warping

  26. Statistical Pattern Recognition • Patterns are represented in some feature space. • Each class is modeled using a statistical model.

  27. Syntactic Pattern Recognition • Represent patterns in terms of simple primitives. • Describe patterns using deterministic grammars or formal languages.

  28. Artificial Neural Networks (ANNS) Human take only a few hundred ms for most cognitive tasks. Suggests that massive parallelism is essential for complex pattern recognition tasks (e.g., speech and image recognition) Biological networks attempt to achieve good performance via dense interconnection of simple computational elements (neurons) Number of neurons  1010 – 1012 Number of interconnections/neuron  103 – 104 Total number of interconnections  1014

  29. Artificial Neural Nodes Nodes in neural networks are nonlinear: where is an internal threshold x1 w1 x2 Y (output) xd wd

  30. Multilayer ANNs • Feed-forward nets with one or more layers (hidden) between the input and output nodes. • A three-layer net can generate arbitrary complex decision regions. • These nets can be trained by the back-propagation training algorithm. . . . . . . . . . c outputs d inputs First hidden layer NH1 input units Second hidden layer NH2 input units

  31. Comparing DifferentPattern Recognition Approaches • Template Matching • Assumes small intra-class variability. • Learning is difficult for deformable templates. • Statistical • Assumption of statistical model for each class. • Syntactic • Primitive extraction is sensitive to noise. • Describing patterns in terms of primitives is difficult. • Artificial Neural Network • Parameter tuning and local minima in learning.

  32. Complexity of PR – An Example Problem: Sorting incoming fish on a conveyor belt. Assumption: Two kind of fish: (1) sea bass (2) salmon

  33. Pre-processing (1) image enhancement (2) separating touching or occluding fish (3) finding the boundary of each fish

  34. Feature Extraction • Assume a fisherman told us that a sea bass is generally longer than a salmon. • We can use length as a feature and decide between sea bass and salmon according to a threshold on length. • How can we choose this threshold?

  35. Decision Using Length • Histograms of “length” for two types of fish in training samples. • How can we choose the threshold l* to make a reliable decision?

  36. Feature Extraction (cont’d) • Even though sea bass is longer than salmon on the average, there are many examples of fish where this observation does not hold. • Maybe use average lightness.

  37. Decision Using Average Lightness • Histograms of the lightness feature for two types of fish in training samples. • It seems easier to choose the threshold x* but we still cannot make a perfect decision.

  38. Cost of Error (Miss-classification) • There are two possible classification errors. (1) Deciding the fish was a sea bass when it was a salmon. (2) Deciding the fish was a salmon when it was a sea bass. • Which error is more important ?

  39. Cost of Error (Miss-classification) • It depends; e.g., if the fish packing company knows that: • Customers who buy salmon will object vigorously if they see sea bass in their cans. • Customers who buy sea bass will not be unhappy if they occasionally see some expensive salmon in their cans. • How does this knowledge affect our decision?

  40. Decision Using Multiple Features • To improve recognition, we might have to use more than one feature at a time. • Single features might not yield the best performance. • Combinations of features might yield better performance.

  41. Decision Boundary • Scatter plot of lightness and width features for training samples. • We can partition the feature space into two regions by finding the decision boundary that minimizes the error.

  42. How Many Features and Which? • Does adding more features always improve performance? • It might be difficult and computationally expensive to extract certain features. • Correlated features do not improve performance. • “Curse” of dimensionality …

  43. Curse of Dimensionality • Adding too many features can, paradoxically, lead to a worsening of performance. • Divide each of the input features into a number of intervals, so that the value of a feature can be specified approximately by saying in which interval it lies. • If each input feature is divided into M divisions, then the total number of cells is Md (d: # of features) which grows exponentially with d. • Since each cell must contain at least one point, the number of training data grows exponentially!

  44. Decision Boundary (Model) Complexity • We can get perfect classification performance on the training data by choosing complex models. • Complex models are tuned to the particular training samples, rather than on the characteristics of the true model. overfitting How well can we generalize to unknown samples?

  45. Generalization • The ability of a classifier to produce correct results on novel patterns. • How can we improve generalization performance ? • More training examples (i.e., better model estimates). • Simpler models usually yield better performance. simpler model complex model

  46. More on model complexity Regression example: plot of 10 sample points for the input variable x along with the corresponding target variable t (assuming some noise). Green curve is the true function that generated the data.

  47. More on model complexity (cont’d) Polynomial curve fitting: plots of polynomials having various orders, shown as red curves, fitted to the set of 10 sample points.

  48. More on complexity (cont’d) Polynomial curve fitting: plots of 9’th order polynomials fitted to 15 and 100 sample points. 9’th order polynomials

  49. PR System Test Phase Training Phase

  50. PR System (cont’d) • Sensing: • Use a sensor (camera or microphone) • PR depends on bandwidth, resolution, sensitivity, distortion of the sensor. • Pre-processing: • Removal of noise in data. • Segmentation (i.e., isolation of patterns of interest from background).