1 / 37

Chapter 1: Introduction to Pattern Recognition (Sections 1.1-1.6)

Pattern Classification All materials in these slides were taken from Pattern Classification (2nd ed) by R. O. Duda, P. E. Hart and D. G. Stork, John Wiley & Sons, 2000 with the permission of the authors and the publisher. Chapter 1: Introduction to Pattern Recognition (Sections 1.1-1.6).

javen
Download Presentation

Chapter 1: Introduction to Pattern Recognition (Sections 1.1-1.6)

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Pattern ClassificationAll materials in these slides were taken fromPattern Classification (2nd ed)by R. O. Duda, P. E. Hart and D. G. Stork, John Wiley & Sons, 2000with the permission of the authors and the publisher

  2. Chapter 1: Introduction to Pattern Recognition (Sections 1.1-1.6) What is Pattern Recognition ? Machine Perception An Example Pattern Recognition Systems The Design Cycle Related fields Learning and Adaptation Conclusion

  3. What is Pattern Recognition • Pattern Recognition is: A branch of artificial intelligence concerned with the classification or description of observations. Source: The Free On-line Dictionary of Computing (2003-OCT-10) Pattern Classification, Chapter 1

  4. Machine Perception • Build a machine that can recognize patterns: • Speech recognition • Fingerprint identification • OCR (Optical Character Recognition) • DNA sequence identification Pattern Classification, Chapter 1

  5. An Example • “Sorting incoming Fish on a conveyor according to species using optical sensing” Sea bass Species Salmon Pattern Classification, Chapter 1

  6. Pattern Classification, Chapter 1

  7. Preprocessing • Use a segmentation operation to isolate fishes from one another and from the background • Information from a single fish is sent to a feature extractor whose purpose is to reduce the data by measuring certain features • The features are passed to a classifier Pattern Classification, Chapter 1

  8. Classification • Select the length of the fish as a possible feature for discrimination Pattern Classification, Chapter 1

  9. Pattern Classification, Chapter 1

  10. The length is a poor feature alone! Select the lightness as a possible feature. Pattern Classification, Chapter 1

  11. Pattern Classification, Chapter 1

  12. Threshold decision boundary and cost relationship • Move our decision boundary toward smaller values of lightness in order to minimize the cost (reduce the number of sea bass that are classified salmon!) Task of decision theory Pattern Classification, Chapter 1

  13. Adopt the lightness and add the width of the fish Fish xT = [x1, x2] Lightness Width Pattern Classification, Chapter 1

  14. Pattern Classification, Chapter 1

  15. We might add other features that are not correlated with the ones we already have. A precaution should be taken not to reduce the performance by adding such “noisy features” • Ideally, the best decision boundary should be the one which provides an optimal performance such as in the following figure: Pattern Classification, Chapter 1

  16. Pattern Classification, Chapter 1

  17. However, our satisfaction is premature because the central aim of designing a classifier is to correctly classify novel input Issue of generalization! Pattern Classification, Chapter 1

  18. Pattern Classification, Chapter 1

  19. Pattern Recognition Systems • Sensing • Use of a transducer (camera or microphone) • PR system depends of the bandwidth, the resolution sensitivity distortion of the transducer Pattern Classification, Chapter 1

  20. Pattern Classification, Chapter 1 • Segmentation and grouping • Patterns should be well separated and should not overlap • Segmentation faces some problems in • Speech recognition(nonsense words). • Recognition or grouping together(i,=). • Mereology ( i.e. the study of part/whole relationship ).

  21. Feature extraction • Discriminative features • Invariant features with respect to translation, rotation and scale. • Classification • Use a feature vector provided by a feature extractor to assign the object to a category • The difficulty of classification problem Pattern Classification, Chapter 1

  22. Pattern Classification, Chapter 1 • Post Processing • Uses the output of the classifier to decide on the recommended action. • Exploit context input dependent information other than from the target pattern itself to improve performance

  23. Pattern Classification, Chapter 1

  24. The Design Cycle • Data collection • Feature Choice • Model Choice • Training • Evaluation • Computational Complexity Pattern Classification, Chapter 1

  25. Pattern Classification, Chapter 1

  26. Data Collection • How do we know when we have collected an adequately large and representative set of examples for training and testing the system? Pattern Classification, Chapter 1

  27. Feature Choice • Depends on the characteristics of the problem domain. Simple to extract, invariant to irrelevant transformation insensitive to noise. • Prior knowledge plays major rule in this phase Pattern Classification, Chapter 1

  28. Model Choice • Unsatisfied with the performance of our fish classifier and want to jump to another class of model Pattern Classification, Chapter 1

  29. Training • Use data to determine the classifier. Many different procedures for training classifiers and choosing models Pattern Classification, Chapter 1

  30. Evaluation • Measure the error rate (or performance and switch from one set of features to another one Pattern Classification, Chapter 1

  31. Computational Complexity • What is the trade-off between computational ease and performance? • (How an algorithm scales as a function of the number of features, patterns or categories?) Pattern Classification, Chapter 1

  32. Related Fields • Regression : the concept of varying feature linearly with another one(age & length). • Interpolation: to classify an object to certain category if it nearly like it. • Density estimation: estimating the probability that member of certain category will be found to have a particular feature. Pattern Classification, Chapter 1

  33. Learning and Adaptation • Supervised learning • A teacher provides a category label or cost for each pattern in the training set • Unsupervised learning • The system forms clusters or “natural groupings” of the input patterns Pattern Classification, Chapter 1

  34. Conclusion • Reader seems to be overwhelmed by the number, complexity and magnitude of the sub-problems of Pattern Recognition • Many of these sub-problems can indeed be solved • Many fascinating unsolved problems still remain Pattern Classification, Chapter 1

  35. References • Pattern Classification (2nd ed ) by R. O. Duda, P. E. Hart and D. G. Stork, John Wiley & Sons, 2000 • http://dictionary.die.net/pattern%20recognition Pattern Classification, Chapter 1

  36. Questions! Pattern Classification, Chapter 1

  37. Thanks  Pattern Classification, Chapter 1

More Related