Diagram Recognition  Tuan Van  Tony Vigil  Jack Herbert  Beau Crawford.

Slides:



Advertisements
Similar presentations
Interval Heaps Complete binary tree. Each node (except possibly last one) has 2 elements. Last node has 1 or 2 elements. Let a and b be the elements in.
Advertisements

Carry Lookahead Homework
Edited by Malak Abdullah Jordan University of Science and Technology Data Structures Using C++ 2E Chapter 12 Graphs.
Web Voucher Demo Version 8.4 Web Voucher Demo WELCOME Presenters Kim Kelley, Ron Reed.
Report on Intrusion Detection and Data Fusion By Ganesh Godavari.
CS511 - Spring 2006 Final Presentation Project 3 - Team 1 Ching Chang Panagiotis Papapetrou Raymond Sweha.
Relations Diagram (or Interrelationship Digraph).
T,  e  T c(e) = 50 G = (V, E), c(e) Minimum Spanning Tree.
Презентація за розділом “Гумористичні твори”
Центр атестації педагогічних працівників 2014
Галактики і квазари.
Характеристика ІНДІЇ.
Процюк Н.В. вчитель початкових класів Боярської ЗОШ І – ІІІ ст №4
Variations of Linked Lists CS 308 – Data Structures.
Instant Recognition of Numbers TEENS base 10 Student instantly recognizes the 10 and the one. Then add the two to make the teen. For example the.
Lecture 12: Network Visualization Slides are modified from Lada Adamic, Adam Perer, Ben Shneiderman, and Aleks Aris.
GUI & Optimizer for the Virtual Pipeline Simulation Testbed Walamitien Oyenan November 10, 2003 MSE Presentation (Phase 2)
Advanced Project Plan Formatting Lesson 14. Skills Matrix SkillsMatrix Skill Customize the calendar view Format bar styles for tasks in the Calendar view.
S EGMENTATION FOR H ANDWRITTEN D OCUMENTS Omar Alaql Fab. 20, 2014.
Chapter 19 Implementing Trees and Priority Queues Fundamentals of Java.
Report on Intrusion Detection and Data Fusion By Ganesh Godavari.
RecoDS Tuan Van Jack Herbert Anthony Vigil Beau Crawford.
NoteSearch - Find what you’re looking for. Prototype Team B.
Basic Drafting Skills Lettering
MUSICBLOX Flash Prototype Presentation. MUSICBLOX TEAM MEMBERS Anika Talapatra Mayank Mehta Nicolas Gaumond Zeid Al-Hammami.
Periodic Table How to Draw Bohr Diagrams.
Visual C++ Programming: Concepts and Projects Chapter 12B: Linked List (Tutorial)
Diagram Recognition  Tuan Van  Tony Vigil  Jack Herbert  Beau Crawford.
Духовні символи Голосіївського району
TOPIC LEARNING KEYWORDS My Phone ALL- understand how a mobile works D Grade- explain simply what a mobile phone network and coverage is C Grade- Understand.
Authentication Presenter Meteor Advisory Team Member Version 1.1.
TOPIC LEARNING KEYWORDS My Phone ALL- understand how a mobile works D Grade- explain simply what a mobile phone network and coverage is C Grade- Understand.
Exercise 28 - Skills Vector tools enable you to create perfectly formed shapes and lines of all sorts. What’s more the vector objects keep their shape.
Microsoft Office Illustrated Introductory, Windows XP Edition
Проф. д-р Васил Цанов, Институт за икономически изследвания при БАН
ЗУТ ПРОЕКТ на Закон за изменение и допълнение на ЗУТ
О Б Щ И Н А С И Л И С Т Р А П р о е к т Б ю д ж е т г.
Електронни услуги на НАП
Боряна Георгиева – директор на
РАЙОНЕН СЪД - БУРГАС РАБОТНА СРЕЩА СЪС СЪДЕБНИТЕ ЗАСЕДАТЕЛИ ПРИ РАЙОНЕН СЪД – БУРГАС 21 ОКТОМВРИ 2016 г.
Сътрудничество между полицията и другите специалисти в България
Съобщение Ръководството на НУ “Христо Ботев“ – гр. Елин Пелин
НАЦИОНАЛНА АГЕНЦИЯ ЗА ПРИХОДИТЕ
ДОБРОВОЛЕН РЕЗЕРВ НА ВЪОРЪЖЕНИТЕ СИЛИ НА РЕПУБЛИКА БЪЛГАРИЯ
Съвременни софтуерни решения
ПО ПЧЕЛАРСТВО ЗА ТРИГОДИШНИЯ
от проучване на общественото мнение,
Васил Големански Ноември, 2006
Програма за развитие на селските райони
ОПЕРАТИВНА ПРОГРАМА “АДМИНИСТРАТИВЕН КАПАЦИТЕТ”
БАЛИСТИКА НА ТЯЛО ПРИ СВОБОДНО ПАДАНЕ В ЗЕМНАТА АТМОСФЕРА
МЕДИЦИНСКИ УНИВЕРСИТЕТ – ПЛЕВЕН
Стратегия за развитие на клъстера 2015
Моето наследствено призвание
Правна кантора “Джингов, Гугински, Кючуков & Величков”
Безопасност на движението
How to Make a Bohr Model.
5 × 7 = × 7 = 70 9 × 7 = CONNECTIONS IN 7 × TABLE
5 × 8 = 40 4 × 8 = 32 9 × 8 = CONNECTIONS IN 8 × TABLE
4 × 6 = 24 8 × 6 = 48 7 × 6 = CONNECTIONS IN 6 × TABLE
5 × 6 = 30 2 × 6 = 12 7 × 6 = CONNECTIONS IN 6 × TABLE
Scribbles Prototype Tablet PC Capstone
Mixed Up Multiplication Challenge
Technical Drawing 6 problems page 78.
10 × 8 = 80 5 × 8 = 40 6 × 8 = CONNECTIONS IN 8 × TABLE MULTIPLICATION.
3 × 12 = 36 6 × 12 = 72 7 × 12 = CONNECTIONS IN 12 × TABLE
5 × 12 = × 12 = × 12 = CONNECTIONS IN 12 × TABLE MULTIPLICATION.
Diagram Recognition Tuan Van Tony Vigil Jack Herbert Beau Crawford.
5 × 9 = 45 6 × 9 = 54 7 × 9 = CONNECTIONS IN 9 × TABLE
3 × 7 = 21 6 × 7 = 42 7 × 7 = CONNECTIONS IN 7 × TABLE
Presentation transcript:

Diagram Recognition  Tuan Van  Tony Vigil  Jack Herbert  Beau Crawford

Presentation Outline Project Status Update Prototype Demo Limiting Assumptions Technical Challenges

Project Status Update Arrays Recognized well using our initial model Linked Lists Are recognized and drawn well

Project Status Update (cont) Trees Need to improve detection of node elements Connecting Data Structures Need to recognize multiple data structures

Prototype Demo

Prototype Demo (cont)

Limiting Assumptions Arrays: Data inside each cell must be fully contained within that cell and not inside another cell Currently, arrays must be drawn in a very non-common way – one cell at a time

Limiting Assumptions (L L) Nodes must be drawn in one stroke: This way:Not this way: Arrows which point to the next cell must be drawn: This way:Not this way:

Limiting Assumption (Trees) Edges must be drawn between the nodes they connect: This:Not this:

Enhancements Would like to add ability to draw arrays more traditionally: Would allow for various drawings:

Enhancements (cont) Allowing tree elements to be drawn in various orders:

Enhancements (cont) Allowing re-recognition after corrections are made Requires: no dependence on Stroke ID or erasing assigns next drawn stroke same ID