1. System Architecture Intelligently controlling image processing systems

2. Image Processing and Computer Vision: 72 Introduction So far Presented methods of achieving goals Integration of methods? Controlling execution Incorporating knowledge

3. Image Processing and Computer Vision: 73 What knowledge? What do algorithms achieve? What is known about the problem being solved? Relationship between problem and algorithm?

4. Image Processing and Computer Vision: 74 Knowledge representation Implied Feature vectors Relational structures Hierarchical structures Rules Frames

5. Image Processing and Computer Vision: 75 Implied knowledge Knowledge encoded in software Usually inflexible in Execution Reuse Simple to design and implement Systems often unreliable

6. Image Processing and Computer Vision: 76 Feature vectors As seen in statistical representations Vector elements can be Numerical Symbolic coded numerically

7. Image Processing and Computer Vision: 77 Example: strokes3 loops1 w-h ratio1 A N strokes3 loops0 w-h ratio1

8. Image Processing and Computer Vision: 78 Relational structures Encodes relationships between Objects Parts of objects Can become unwieldy for Large scenes Complex objects

9. Image Processing and Computer Vision: 79 Follow natural division of Hierarchical structures scene objects parts of object

10. Image Processing and Computer Vision: 710 Example: scene roadwaybuilding grassland grasstreeroadjunction edges

11. Image Processing and Computer Vision: 711 Uses Structure defines possible appearance of objects Structure guides processing

12. Image Processing and Computer Vision: 712 Rules Rules code quanta of knowledge Interpretation Forwards Backwards 

13. Image Processing and Computer Vision: 713 Forward chaining If is TRUE Execute Antecedent will be a test on some data Action might modify the data Suitable for low level processing

14. Image Processing and Computer Vision: 714 Backward chaining Action is some goal to achieve Antecedent defines how it should be achieved Suitable for high level processing Guides focus of system

15. Image Processing and Computer Vision: 715 System architecture DatabaseRulebase Inference engine

16. Image Processing and Computer Vision: 716 Frames A “data-structure for representing a stereotyped situation” Slot (attribute) Filler (value: atomic, link to another frame, default or empty, call to a function to fill the slot)

17. Image Processing and Computer Vision: 717 Methods of control How to control how the system’s knowledge is used. Hierarchical Heterarchical

18. Image Processing and Computer Vision: 718 Hierarchical control “Algorithm” defines control Compare other software: Main programme calls subroutines Achieve a predefined sequence of tasks Two extreme variants Bottom-up Top-down

19. Image Processing and Computer Vision: 719 Bottom-up control Object recognition Extracted features, Attributes, Relationships Image Decision making Feature extraction

20. Image Processing and Computer Vision: 720 Top-down control Hypothesised object Predicted features, Attributes, Relationships Features in image that Support or refute the hypothesis Prediction Directed feature extraction

21. Image Processing and Computer Vision: 721 Critique Inflexible methods Errors propagate Hybrid control Can make predictions Verify Modify predictions

22. Image Processing and Computer Vision: 722 Hybrid control Object recognition Image Decision making Feature extraction Extracted features, Attributes, Relationships Predicted features, Attributes, Relationships Prediction Direciction

23. Image Processing and Computer Vision: 723 Heterarchical control “Data” defines control via knowledge sources KSs contribute to process image KS fires in response to presence of data Creates new data Modifies existing data Can be chaotic Blackboard

24. Image Processing and Computer Vision: 724 Blackboard architecture KS Blackboard scheduler

25. Image Processing and Computer Vision: 725 Information integration Hypotheses boolean True or false Facts are real valued True  certainty = 1.0 False  certainty = 0.0 Unsure  0.0 < certainty < 1.0 How is this represented?

26. Image Processing and Computer Vision: 726 Example Recognising cars Shape analyser- certainty = 0.56 Position analyser- certainty = 0.78 Texture analyser- certainty = 0.40 How to combine evidence?

27. Image Processing and Computer Vision: 727 Bayesian methods Define a belief network A tree structure Reflects evidential support of a fact F1F2F3

28. Image Processing and Computer Vision: 728 Propagation of certainty Leaf nodes Certainty given by basic operations Non-leaf nodes Combine child nodes’ certainties Results propagate to root node

29. Image Processing and Computer Vision: 729 Dempster-Shafer Bayesian theory has confidence in belief only No measure of disbelief D-S attempts to define this

30. Image Processing and Computer Vision: 730 Certainty interval 0.. A = measures of belief A.. B = measures of uncertainty B.. 1 = measures of disbelief [A,B] starts large. As evidence accumulates to support or refute a hypothesis, A and B change

31. Image Processing and Computer Vision: 731 Other formalisms Belief calculi exist Not yet widely used A result is important Confidence in result is not quantified

32. Image Processing and Computer Vision: 732 Summary Intelligent (vision) systems Knowledge representation Control strategies Integration of belief

33. Image Processing and Computer Vision: 733 Everything that can be invented has been invented Charles Duell, Commissioner U.S. Office of Patents, 1899