Vision: Scene Labelling

Slides:



Advertisements
Similar presentations
Investigating Angles Drawing an Angle
Advertisements

1 Constraint Satisfaction Problems. 2 Intro Example: 8-Queens Generate-and-test: 8 8 combinations.
CIS Intro to AI 1 Interpreting Line Drawings & Constraint Satisfaction II Mitch Marcus CIS 391 – Fall 2008.
Map Overlay Algorithm. Birch forest Wolves Map 1: Vegetation Map 2: Animals.
Lecture 18 – Recognition 1. Visual Recognition 1)Contours 2)Objects 3)Faces 4)Scenes.
Data Structure and Algorithms (BCS 1223) GRAPH. Introduction of Graph A graph G consists of two things: 1.A set V of elements called nodes(or points or.
Lesson 1.6 Classify Polygons. Objective Classify Polygons.
1Ellen L. Walker Segmentation Separating “content” from background Separating image into parts corresponding to “real” objects Complete segmentation Each.
Contents Description of the big picture Theoretical background on this work The Algorithm Examples.
1 Introduction to 3D Imaging: Perceiving 3D from 2D Images How can we derive 3D information from one or more 2D images? There have been 2 approaches: 1.
MSU CSE 803 Stockman1 CV: Perceiving 3D from 2D Many cues from 2D images enable interpretation of the structure of the 3D world producing them.
CSE (c) S. Tanimoto, 2008 Image Understanding II 1 Image Understanding 2 Outline: Guzman Scene Analysis Local and Global Consistency Edge Detection.
Constraint Propagation (Where a better exploitation of the constraints further reduces the need to make decisions) R&N: Chap. 5 + Chap. 24, p
Inflating an Artist’s Sketch Chapter 2: Hoffman Nicole J., Victor W., and Nicole T.
1 Chapter 21 Machine Vision. 2 Chapter 21 Contents (1) l Human Vision l Image Processing l Edge Detection l Convolution and the Canny Edge Detector l.
CSE (c) S. Tanimoto, 2007 Segmentation and Labeling 1 Segmentation and Labeling Outline: Edge detection Chain coding of curves Segmentation into.
1 Pertemuan 20 Understanding Continued Matakuliah: T0264/Intelijensia Semu Tahun: Juli 2006 Versi: 2/1.
1 Perceiving 3D from 2D Images How can we derive 3D information from one or more 2D images? There have been 2 approaches: 1. intrinsic images: a 2D representation.
3D Scene Models Object recognition and scene understanding Krista Ehinger.
Computer Vision Spring ,-685 Instructor: S. Narasimhan Wean 5403 T-R 3:00pm – 4:20pm Lecture #18.
Recap Low Level Vision –Input: pixel values from the imaging device –Data structure: 2D array, homogeneous –Processing: 2D neighborhood operations Histogram.
Team Linear By Marks Speight, Taylor Bishop. Linear Programming Problem : Optimize a linear function subject to linear constraints. Constraints Linear.
Properties of Special Triangles 4-5 Objective: To use and apply properties of isosceles and equilateral triangles.
Objectives Classify polygons based on their sides and angles.
Shape from Contour Recover 3D information. Muller-Lyer illusion.
Vertex – A point at which two or more edges meet Edge – A line segment at which two faces intersect Face – A flat surface Vertices, Edges, Faces.
Collision handling: detection and response
Computer Animation Rick Parent Computer Animation Algorithms and Techniques Collisions & Contact.
Geometry: From Triangles to Quadrilaterals and Polygons.
1 CS B551: Elements of Artificial Intelligence Instructor: Kris Hauser
3D Shape Inference Computer Vision No.2-1. Pinhole Camera Model the camera center Principal axis the image plane.
Vertices, Edges and Faces By Jordan Diamond. Vertices In geometry, a vertices is a special kind of point which describes the corners or intersections.
Distributing Chemical Compounds in Refrigerators using interval graphs
(c) 2000, 2001 SNU CSE Biointelligence Lab Finding Region Another method for processing image  to find “regions” Finding regions  Finding outlines.
12.1 Exploring Solids.
1 Converting Celsius to Fahrenheit C 1.8  32 + F
G51IAI Introduction to Artificial Intelligence
Autonomous Robots Robot Path Planning (3) © Manfred Huber 2008.
Graphs Basic properties.
1Ellen L. Walker 3D Vision Why? The world is 3D Not all useful information is readily available in 2D Why so hard? “Inverse problem”: one image = many.
1.6 Objective: Classify Polygons. Lingo Polygon: Closed 2 dimensional figure formed by three or more line segments. Each segment connects to exactly two.
CLASSIFYING POLYGONS UNIT 1 LESSON 6. Classifying Polygons In geometry, a figure that lies in a plane is called a plane figure. A polygon is a closed.
Constraint Propagation Artificial Intelligence CMSC January 22, 2002.
CIS Intro to AI 1 Interpreting Line Drawings (An Introduction to Constraint Satisfaction) Mitch Marcus CIS 391 Fall 2008.
Lecture 8CSE Intro to Cognitive Science1 Interpreting Line Drawings II.
Today we will… Identify the vertices and edges on a given shape.
Computer Vision Computer Vision based Hole Filling Chad Hantak COMP December 9, 2003.
Measuring and Drawing Angles with a Protractor. Protractor Center Hole.
{ Constructions Duplicating and Line and an Angle.
Warm Up [On back counter]
working with constraints
Sum of Interior and Exterior Angles in Polygons
Polyhedra and Prisms.
Learn about relations and their basic properties
Advanced Higher Computing Based on Heriot-Watt University Scholar Materials Applications of AI – Vision and Languages 1.
5 Construction 6 Division of a Line Segment into Three Equal Segments, Without Measuring From point A (or B), draw a ray at an acute angle to the given.
CS B551: Elements of Artificial Intelligence
Two parameters: k and a. would like to know how they affect poles
The root locus technique
4.4 Concave and Convex Mirrors
I. The Problem of Molding
Two parameters: k and a. would like to know how they affect poles
Authors: Barry Smyth, Mark T. Keane, Padraig Cunningham
Computer Animation Algorithms and Techniques
3D Shape Inference Computer Vision No.2-1.
Introduction to Artificial Intelligence Lecture 24: Computer Vision IV
Vision: Scene Labelling
Polygons A polygon is a 2-D shape made when line segments enclose a region. A The end points are called vertices. One of these is called a vertex. B The.
Overlay of Two Subdivisions
Three-Dimensional Figures
Presentation transcript:

Vision: Scene Labelling Structure in the world allows us to interpret complex situations by propagating constraints. This is conveniently demonstrated in computer vision, using a technique known as Guzman labelling. CSE 415 -- (c) S. Tanimoto, 2004 Scene Labelling

Blocks-World Vision Problem Given: A 2-D line drawing representing a collection of polyhedral blocks on a table. Determine: Which faces (bounded regions in the drawing) go together as parts of the same objects. Which edges (line segments) are internal to objects and which are “occluding” edges. CSE 415 -- (c) S. Tanimoto, 2004 Scene Labelling

Example Scene Analysis Problem CSE 415 -- (c) S. Tanimoto, 2004 Scene Labelling

Guzman’s Vertex Labels Ell Arrow Fork Tee Arrow: There is an angle of more than 180 deg. Fork: Each of the 3 angles is of less than 180 deg. Tee: There is one angle of exactly 180 deg., and 2 smaller ones. CSE 415 -- (c) S. Tanimoto, 2004 Scene Labelling

Guzman’s Labelling Technique 1. Classify each vertex into one of the categories: ell, arrow, fork, tee, or other. 2. At each vertex, mark each incoming edge according to the role it plays at the vertex (e.g., shank of an arrow, stem of a tee). 3. Create single links between neighboring regions each time: a. they are divided by a line segment at a fork, b. they are divided by the shank of an arrow, c. they are in corresponding positions of a configuration of two opposing tees with colinear stems. 4. Create a “node” for each region. Whenever two regions are doubly linked, connect their nodes with a “same object” link. CSE 415 -- (c) S. Tanimoto, 2004 Scene Labelling

Example with Vertex Labels F L T A T F T L L L A A CSE 415 -- (c) S. Tanimoto, 2004 Scene Labelling

Example with Region Links CSE 415 -- (c) S. Tanimoto, 2004 Scene Labelling

Example with Object Links CSE 415 -- (c) S. Tanimoto, 2004 Scene Labelling

Example with Internal and Occluding Edges Identified CSE 415 -- (c) S. Tanimoto, 2004 Scene Labelling

CSE 415 -- (c) S. Tanimoto, 2004 Scene Labelling Discussion The work of Guzman was refined by D. Huffman, M. Clowes, and D. Waltz to take into account additional kinds of edges, including crack edges, oriented occluding edges, and concave and convex internal edges. A key point of this research was to show that constraints imposed by the real world could make seemingly intractable combinatorial interpretation problems actually solvable. CSE 415 -- (c) S. Tanimoto, 2004 Scene Labelling