Lambert Schomaker KI2 - 2 Kunstmatige Intelligentie / RuG.

Slides:



Advertisements
Similar presentations
Chapter 11 user support. Issues –different types of support at different times –implementation and presentation both important –all need careful design.
Advertisements

Image Analysis Phases Image pre-processing –Noise suppression, linear and non-linear filters, deconvolution, etc. Image segmentation –Detection of objects.
Intelligent systems Lecture 6 Rules, Semantic nets.
Markov Logic Networks Instructor: Pedro Domingos.
Uncertainty Representation. Gaussian Distribution variance Standard deviation.
Quadtrees, Octrees and their Applications in Digital Image Processing
James Tam Introduction To CPSC 231 And Computer Science James Tam.
Multi-Touch Navigation Engine Presented by Team Extra Touch: Chris Jones Shuopeng Yuan Nathan Wiedeback Detailed Design Review 1.
Computational Learning Theory PAC IID VC Dimension SVM Kunstmatige Intelligentie / RuG KI2 - 5 Marius Bulacu & prof. dr. Lambert Schomaker.
Lambert Schomaker KI2 - 1 Kunstmatige Intelligentie / RuG.
Overview of Computer Vision CS491E/791E. What is Computer Vision? Deals with the development of the theoretical and algorithmic basis by which useful.
Chapter 13 Artificial Intelligence. Introduction Artificial intelligence (AI) is the part of computer science that attempts to make computers act like.
Quadtrees, Octrees and their Applications in Digital Image Processing
KI2 - 1 Kunstmatige Intelligentie / RuG Structural Pattern Recognition Marius Bulacu & prof. dr. Lambert Schomaker.
CSE 574: Artificial Intelligence II Statistical Relational Learning Instructor: Pedro Domingos.
Data Structures Introduction. What is data? (Latin) Plural of datum = something given.
Highlights Lecture on the image part (10) Automatic Perception 16
James Tam Introduction To CPSC 231 And Computer Science James Tam.
Smart Traveller with Visual Translator. What is Smart Traveller? Mobile Device which is convenience for a traveller to carry Mobile Device which is convenience.
1 4 questions (Revisited) What are our underlying assumptions about intelligence? What kinds of techniques will be useful for solving AI problems? At what.
Programming Logic and Design, Introductory, Fourth Edition1 Understanding Computer Components and Operations (continued) A program must be free of syntax.
19 April, 2017 Knowledge and image processing algorithms for real-life applications. Dr. Maria Athelogou Principal Scientist & Scientific Liaison Manager.
Digital Image Processing & Pattern Analysis (CSCE 563) Course Outline & Introduction Prof. Amr Goneid Department of Computer Science & Engineering The.
Introduction to AI, H. Feili 1 Introduction to Artificial Intelligence LECTURE 1: Introduction What is AI? Foundations of AI The.
 By the end of this, you should be able to state the difference between DATE and INFORMAITON.
Search Engines and Information Retrieval Chapter 1.
Introduction (Chapter 1) CPSC 386 Artificial Intelligence Ellen Walker Hiram College.
Artificial Intelligence: Its Roots and Scope
Foundations of Computer Science Computing …it is all about Data Representation, Storage, Processing, and Communication of Data 10/4/20151CS 112 – Foundations.
CS654: Digital Image Analysis Lecture 3: Data Structure for Image Analysis.
Sampletalk Technology Presentation Andrew Gleibman
Relationships Between Structures “→” ≝ “Can be defined in terms of” Programs Groups Proofs Trees Complex numbers Operators Propositions Graphs Real.
Time Series Data Analysis - I Yaji Sripada. Dept. of Computing Science, University of Aberdeen2 In this lecture you learn What are Time Series? How to.
CompSci Today’s topics Java Review Just a bunch of headings meant to trigger questions A contraction of previous notes Upcoming Midterm Exam Reading.
CAPTCHA solving Tianhui Cai Period 3. CAPTCHAs Completely Automated Public Turing tests to tell Computers and Humans Apart Determines whether a user is.
1 CSC 222: Computer Programming II Spring 2004 See online syllabus at: Course goals:
1 Digital Image Processing Dr. Saad M. Saad Darwish Associate Prof. of computer science.
Quadtrees, Octrees and their Applications in Digital Image Processing.
How Solvable Is Intelligence? A brief introduction to AI Dr. Richard Fox Department of Computer Science Northern Kentucky University.
School of Engineering and Computer Science Victoria University of Wellington Copyright: Peter Andreae, VUW Image Recognition COMP # 18.
Theory of Programming Languages Introduction. What is a Programming Language? John von Neumann (1940’s) –Stored program concept –CPU actions determined.
Artificial Intelligence: Research and Collaborative Possibilities a presentation by: Dr. Ernest L. McDuffie, Assistant Professor Department of Computer.
Quiz Week 8 Topical. Topical Quiz (Section 2) What is the difference between Computer Vision and Computer Graphics What is the difference between Computer.
Onlinedeeneislam.blogspot.com1 Design and Analysis of Algorithms Slide # 1 Download From
Digital Image Processing Lecture 17: Segmentation: Canny Edge Detector & Hough Transform Prof. Charlene Tsai.
Handwriting Recognition
Pattern Recognition. What is Pattern Recognition? Pattern recognition is a sub-topic of machine learning. PR is the science that concerns the description.
Introduction to Artificial Intelligence Revision Session.
Neural networks (2) Reminder Avoiding overfitting Deep neural network Brief summary of supervised learning methods.
Optical Character Recognition
Chapter 13 Artificial Intelligence. Artificial Intelligence – Figure 13.1 The Turing Test.
Artificial Intelligence
Lecture 1 Data Structures Aamir Zia. Introduction Course outline Rules and regulations Course contents Good Programming Practices Data Types and Data.
Trends in NL Analysis Jim Critz University of New York in Prague EurOpen.CZ 12 December 2008.
Brief Intro to Machine Learning CS539
Human Computer Interaction Lecture 21 User Support
Knowledge Representation & Logic
CSCI-235 Micro-Computer Applications
School of Computer Science & Engineering
Supervised Learning Seminar Social Media Mining University UC3M
APPLICATIONS OF MATRICES APPLICATION OF MATRICES IN COMPUTERS Rabab Maqsood (069)
Design and Analysis of Computer Algorithm (CS575-01)
Introduction into Knowledge and information
Overview of Machine Learning
3.1.1 Introduction to Machine Learning
Chapter 11 user support.
Hubs and Authorities & Learning: Perceptrons
Notes from 02_CAINE conference
Rich Model Toolkit – An Infrastructure for Reliable Computer Systems
Presentation transcript:

Lambert Schomaker KI2 - 2 Kunstmatige Intelligentie / RuG

2 Outline Date1 st hour2 nd hour 6 nov Planning, N&R #11-13 (LS) idem 13 nov Knowledge-based symbolic methods (LS) #19.6, #21 Example: geometric modeling & matching (MB) 20 nov Statistical symbolic methods 1 (LS) #17 Example: spam filter 27 nov Statistical symbolic methods 2 (LS) Example: autoclass 4 dec Heterogeneous-information integration Example: writer identification, sat. images 11 dec Grammar inductionArticles 18 dec Misc. topicsMisc. applications jan(exam)

3 Knowledge-based symbolic methods  Assumption: the Turing / Von Neumann computer is a universal computation engine…  …therefore it can be used at all levels of information processing:  provided an appropriate algorithm can be designed  which operates on appropriate representations

4 Knowledge-based symbolic methods  provided an appropriate algorithm can be designed…  which operates on appropriate representations…

5 Knowledge-based symbolic methods  …provided an appropriate algorithm can be designed…  mechanisms: recursion, hierarchic procedures  search algorithms  parsers  matching algorithms  string manipulation.  numerical computing  signal processing  image processing  statistical processing

6 Knowledge-based symbolic methods  …which operates on appropriate representations…  stacks  linear strings and arrays  matrices  linked lists  trees

7 Knowledge-based symbolic methods  …which operates on appropriate representations…  stacks  linear strings and arrays  matrices  linked lists  trees  is indeed succesful in many information processing problems

Example: double spiral problem in inner or outer spiral?

Example: double spiral problem in inner or outer spiral?  difficult for, e.g., neural nets

Example: double spiral problem in inner or outer spiral? Answer: outside  difficult for, e.g., neural nets

Example: double spiral problem in inner or outer spiral? How? -flood fill algorithm? -other?

Example: double spiral problem in inner or outer spiral? -Find the right representation!  odd/even count  is not sensitive to shape variations of the spiral: a general solution = Outside count edges

Example: double spiral problem in inner or outer spiral? Outside

14 Culture  If it doesn’t work, you didn’t think hard enough  You have to know what you do  You have to prove that & why it works  Even neural networks work on top of the Turing/von Neumann engine (it will always win)  If you’re smart, you can often avoid NP-completeness  Use of probabilities is a sign of weakness

15 Strong points  Scalability is often possible  Convenience: little context dependence, no training  Reusability  Transformability (compilation)  Algorithmic refinement once it is known how to do a trick (e.g., graphics cards and DSPs in mobile phones: ugly code but highly efficient)

16 Challenges  Knowledge dependence is expensive –not a problem in “ IT ” application design –a challenge to AI  Uncertainty  Noise  Brittleness

17 Solutions  More and more representational weight: (UML, Semantic Web, XML solves everything)  Symbolic learning mechanisms: –induction: version spaces grammar inference –decision tree learning –rewriting formalisms  Active hypothesis testing (what if…, assume X…)

18 Example  In Reading Systems (optical character recognition), only a small part of the algorithm concerns problems of image processing and character classification  Most of the code is concerned with the structure of the text image: –where are the blobs? –are these blobs text, photo or graphics? –how to segment into meaningful chunks: characters, words? –what is the logical organization (reading order) in the physical organization of pixels?  Knowledge-based approaches are a necessity!

Name of conference Programme committee Brief description of conference Submission details

23 Example of layout analysis  Knowing the type of a text block strongly reduces the number of possible interpretations Example: “address block”  Address: –name of person –street, number –postal code, city

prof dr. L.R.B. Schomaker Grote Appelstraat TS Groningen Nederland Amsterdam 7/7/2003

address prof dr. L.R.B. Schomaker Grote Appelstraat TS Groningen Nederland

address person name street codes+city country prof dr. L.R.B. Schomaker Grote Appelstraat TS Groningen Nederland

address titles initials surname street street,,, digits 4 digits 2 upper case city name country name prof dr. L.R.B. Schomaker Grote Appelstraat TS Groningen Nederland

…. (address (title is-left-of initials is-left-of surname) is-above (street name is-left-of number) is-above (city) is-above (country)) Content Layout prof dr. L.R.B. Schomaker Grote Appelstraat TS Groningen Nederland etc.

…. (address (title is-left-of initials is-left-of surname) is-above (street name is-left-of number) is-above (city) is-above (country)) Content Layout prof dr. L.R.B. Schomaker Grote Appelstraat TS Groningen Nederland etc. HELPS TEXT CLASSIFICATION HELPS TEXT SEGMENTATION