Feature Point Detection and Curve Approximation for Early Processing of Free-Hand Sketches Tevfik Metin Sezgin and Randall Davis MIT AI Laboratory.

Slides:



Advertisements
Similar presentations
Applications of one-class classification
Advertisements

Statistical Learning of Multi-View Face Detection
Random Forest Predrag Radenković 3237/10
CSE554Cell ComplexesSlide 1 CSE 554 Lecture 3: Shape Analysis (Part II) Fall 2014.
Road-Sign Detection and Recognition Based on Support Vector Machines Saturnino, Sergio et al. Yunjia Man ECG 782 Dr. Brendan.
電腦視覺 Computer and Robot Vision I
SOFTWARE TESTING. INTRODUCTION  Software Testing is the process of executing a program or system with the intent of finding errors.  It involves any.
Freehand Drawing System based on Geometric Constraints Kaisuke Nakajima Joint work with Takeo Igarashi User Interface Research Group The University of.
Uncertainty Representation. Gaussian Distribution variance Standard deviation.
DTM Generation From Analogue Maps By Varshosaz. 2 Using cartographic data sources Data digitised mainly from contour maps Digitising contours leads to.
Object Recognition with Invariant Features n Definition: Identify objects or scenes and determine their pose and model parameters n Applications l Industrial.
Foundation Knowledge Identify The Problem Explore Interpretations & Connections Prioritize Alternatives Envision Strategic Innovation Confused Fact Finder.
EE663 Image Processing Edge Detection 5 Dr. Samir H. Abdul-Jauwad Electrical Engineering Department King Fahd University of Petroleum & Minerals.
A Study of Approaches for Object Recognition
Object Recognition with Invariant Features n Definition: Identify objects or scenes and determine their pose and model parameters n Applications l Industrial.
Foundation Knowledge Identify The Problem Explore Interpretations & Connections Prioritize Alternatives Envision Strategic Innovation Confused Fact Finder.
Robust Real-time Object Detection by Paul Viola and Michael Jones ICCV 2001 Workshop on Statistical and Computation Theories of Vision Presentation by.
Foundation Knowledge Identify The Problem Explore Interpretations & Connections Prioritize Alternatives Envision Strategic Innovation Confused Fact Finder.
Learn how to make your drawings come alive…  NEW COURSE: SKETCH RECOGNITION Analysis, implementation, and comparison of sketch recognition algorithms,
Shape Modeling International 2007 – University of Utah, School of Computing Robust Smooth Feature Extraction from Point Clouds Joel Daniels ¹ Linh Ha ¹.
MCell Usage Scenario Project #7 CSE 260 UCSD Nadya Williams
Edge Detection Phil Mlsna, Ph.D. Dept. of Electrical Engineering
SE 450 Software Processes & Product Metrics 1 Defect Removal.
Scale Invariant Feature Transform (SIFT)
Lecture 4: Edge Based Vision Dr Carole Twining Thursday 18th March 2:00pm – 2:50pm.
Sketch- and Constraint-based Design of Curves and Surfaces Yongwook Jeong CS284 Fall 2004.
Face Processing System Presented by: Harvest Jang Group meeting Fall 2002.
Foundation Knowledge Identify The Problem Explore Interpretations & Connections Prioritize Alternatives Envision Strategic Innovation Confused Fact Finder.
Learn how to make your drawings come alive…  COURSE: SKETCH RECOGNITION Analysis, implementation, and comparison of sketch recognition algorithms, including.
Multi-Scale Surface Descriptors Gregory Cipriano, George N. Phillips Jr., and Michael Gleicher.
Process Modeling SYSTEMS ANALYSIS AND DESIGN, 6 TH EDITION DENNIS, WIXOM, AND ROTH © 2015 JOHN WILEY & SONS. ALL RIGHTS RESERVED. 1 Roberta M. Roth.
כמה מהתעשייה? מבנה הקורס השתנה Computer vision.
Computer Vision Spring ,-685 Instructor: S. Narasimhan Wean Hall 5409 T-R 10:30am – 11:50am.
University of Maribor 1 CADUI' June FUNDP Namur An Interactive Constraint-Based Graphics System with Partially Constrained Form-Features.
ENDA MOLLOY, ELECTRONIC ENG. FINAL PRESENTATION, 31/03/09. Automated Image Analysis Techniques for Screening of Mammography Images.
Gwangju Institute of Science and Technology Intelligent Design and Graphics Laboratory Multi-scale tensor voting for feature extraction from unstructured.
Data Flow Diagram A method used to analyze a system in a structured way Used during: Analysis stage: to describe the current system Design stage: to describe.
Chapter 9 – Classification and Regression Trees
Analysis of algorithms Analysis of algorithms is the branch of computer science that studies the performance of algorithms, especially their run time.
Enabling Natural Interaction Randall Davis, Howard Shrobe Aaron Adler, Christine Alvarado, Mark Foltz, Tracy Hammond, Mike Oltmans, Metin Sezgin,Olga Veselova.
Combining geometry and domain knowledge to interpret hand-drawn diagrams As Presented By: Andrew Campbell Christopher Dahlberg.
Data Mining Algorithms for Large-Scale Distributed Systems Presenter: Ran Wolff Joint work with Assaf Schuster 2003.
For Wednesday No reading Homework: –Chapter 18, exercise 6.
CVPR 2003 Tutorial Recognition and Matching Based on Local Invariant Features David Lowe Computer Science Department University of British Columbia.
Fast BVH Construction on GPUs (Eurographics 2009) Park, Soonchan KAIST (Korea Advanced Institute of Science and Technology)
CS654: Digital Image Analysis Lecture 25: Hough Transform Slide credits: Guillermo Sapiro, Mubarak Shah, Derek Hoiem.
D. M. J. Tax and R. P. W. Duin. Presented by Mihajlo Grbovic Support Vector Data Description.
Distinctive Image Features from Scale-Invariant Keypoints Ronnie Bajwa Sameer Pawar * * Adapted from slides found online by Michael Kowalski, Lehigh University.
MIT 6.893; SMA 5508 Spring 2004 Larry Rudolph Lecture Introduction Sketching Interface.
Edge Detection and Geometric Primitive Extraction Jinxiang Chai.
Foundation Knowledge Identify The Problem Explore Interpretations & Connections Prioritize Alternatives Envision Strategic Innovation Confused Fact Finder.
Mobile Image Processing
Course 8 Contours. Def: edge list ---- ordered set of edge point or fragments. Def: contour ---- an edge list or expression that is used to represent.
Team Members Ming-Chun Chang Lungisa Matshoba Steven Preston Supervisors Dr James Gain Dr Patrick Marais.
FACE DETECTION : AMIT BHAMARE. WHAT IS FACE DETECTION ? Face detection is computer based technology which detect the face in digital image. Trivial task.
Gesture recognition techniques. Definitions Gesture – some type of body movement –a hand movement –Head movement, lips, eyes Depending on the capture.
Application: Multiresolution Curves Jyun-Ming Chen Spring 2001.
Image Processing A Study in Pixel Averaging Building a Resolution Pyramid With Parallel Computing Denise Runnels and Farnaz Zand.
Identifying “Best Bet” Web Search Results by Mining Past User Behavior Author: Eugene Agichtein, Zijian Zheng (Microsoft Research) Source: KDD2006 Reporter:
Multi-view Traffic Sign Detection, Recognition and 3D Localisation Radu Timofte, Karel Zimmermann, and Luc Van Gool.
Learn how to make your drawings come alive…  COURSE: SKETCH RECOGNITION Analysis, implementation, and comparison of sketch recognition algorithms, including.
Kalman Filter and Data Streaming Presented By :- Ankur Jain Department of Computer Science 7/21/03.
CircuitBoard Shane Zamora Eyrún A. Eyjólfsdóttir University of California, Santa Barbara Department of Computer Science Sketch-Based Logic Circuit Design.
From: FEAsy: A Sketch-Based Tool for Finite Element Analysis
Software Testing.
Miguel Tavares Coimbra
Session 7: Face Detection (cont.)
The SIFT (Scale Invariant Feature Transform) Detector and Descriptor
ADABOOST(Adaptative Boosting)
Professor John Canny Spring 2003 March 12
Presentation transcript:

Feature Point Detection and Curve Approximation for Early Processing of Free-Hand Sketches Tevfik Metin Sezgin and Randall Davis MIT AI Laboratory

Metin Sezgin Outline Motivation and problem statement Feature point detection -Curvature and speed as information sources -Average based filtering; Scale space filtering -Hybrid fit generation -Handling strokes with curves Evaluation Related work Future work

Metin Sezgin Terminology Sketch: Informal, messy diagrams consisting of several strokes Stroke: Array of timestamped points Feature Point: Corners of a stroke (vertices)

Metin Sezgin Task Given a freehand stroke, generate a description of the stroke in terms of geometric primitives such as circles, lines, and curves

Metin Sezgin Lifecycle of a stroke Data Collection Data Collection Vertex Detection Vertex Detection Polyline Fit Polyline Fit Oval Fit Curve Detection Curve Detection Line Fit Line Fit Complex Fit (lines and curves) Complex Fit (lines and curves) Best Fit Selection Best Fit Selection Output

Metin Sezgin Lifecycle of a stroke Data Collection Data Collection Vertex Detection Vertex Detection Polyline Fit Polyline Fit Oval Fit Curve Detection Curve Detection Line Fit Line Fit Complex Fit (lines and curves) Complex Fit (lines and curves) Best Fit Selection Best Fit Selection Output

Metin Sezgin Collecting Strokes

Metin Sezgin Vertex detection

Metin Sezgin Vertex detection Curvature

Metin Sezgin Vertex detection Curvature Speed

Metin Sezgin Problems with local extrema Input is noisy -Digitization noise -Hand jittering (tremor) Picking all local extrema introduces many false positives Picking the global extremum gives us a single point Picking the n-best extrema doesn’t help either

Metin Sezgin Solutions Average-based filtering -Compute threshold based on data average -Partition using this threshold -Select global extremum in each partition

Metin Sezgin Average-based filtering Curvature Speed

Metin Sezgin Average-based filtering Pros -Reliable (when data isn’t too noisy) -Fast: O(n) -False positives easy to filter out Cons -Still false positives -Need pre-set constant for scaling

Metin Sezgin Scale-space filtering Real world data has features at many scales Represent the data multiple different scales Selecting scale(s) at which data is meaningful

Metin Sezgin Deriving the scale space Convolve the original signal with Gaussian signals of increasing width Feature points in the curvature scale space

Metin Sezgin Selecting a scale

Metin Sezgin Selecting a scale

Metin Sezgin Scale selected by the algorithm The original stroke Output generated at the scale chosen by our algorithm

Metin Sezgin Handling extremely noisy strokes (cont.) Curvature fit using SSF, 9 fpsSpeed fit using SSF, 7 fps

Metin Sezgin Combining information sources Individual detection methods may miss points Speed fit missing a point Curvature fit missing a point Need a way to combine information provided by each method Generate a series of hybrid fits and pick the best

Metin Sezgin Hybrid fit generation Given N fits generated using N different methods -Within each fit, compute vertex certainties and sort by certainty Initial fit contains points common to all methods Generate N new fits by adding best candidate from each method. Select the one of these with the least error Terminate when error smaller than preset error bound

Metin Sezgin Data Collection Data Collection Vertex Detection Vertex Detection Polyline Fit Polyline Fit Oval Fit Curve Detection Curve Detection Line Fit Line Fit Complex Fit (lines and curves) Complex Fit (lines and curves) Best Fit Selection Best Fit Selection Output

Metin Sezgin Curve approximation c2c2 c1c1 u v

Metin Sezgin Results

Metin Sezgin Results

Metin Sezgin User study results All users except one perceived the system as more natural. Overall it took users much less time to specify geometries. All subjects except one indicated they would prefer an interface that feels like our system for specifying shapes in a sketchy fashion. Strokes classified correctly 96% of the time

Metin Sezgin Related work Existing systems lack -Support for arbitrary shape creation with a single stroke -Automatic feature point detection -Modeless drawing -Natural feel

Metin Sezgin Future work Integration with the new sketch recognition architecture Support for over-tracing Further investigation of sketching behavior to enhance/aid feature point detection and stroke classification