REAL TIME BRAILLE TRANSLATION. Andrew Petersen, Logan Schuelke, Marcus Turner
|
|
- Alexis Byrd
- 6 years ago
- Views:
Transcription
1 REAL TIME BRAILLE TRANSLATION Andrew Petersen, Logan Schuelke, Marcus Turner
2 INTRODUCTION Motivations Increasing Accessibility (ADAAG) Harnessing Technological Advances Methods Dots Vs. Words Font Recognition
3 PREVIOUS WORK Dot identification: Compute feature vectors and find peaks Laplacian of a gaussian, find circles Braille Point Translation J. Mennens, L. Van Tichelen, G. Francois, Optical recognition of Braille writing using standard equipment Kanagawa Univ., Yokohama A Braille Recognition System by the Mobile Phone with Embedded Camera
4 METHODOLOGY 1. Identifying braille dots from images 2. Group the dots into lines and words 3. Translating identified points into text
5 Steps to identify candidate points: POINT DETECTION / IDENTIFICATION 1. Convert image to binary (Otsu s algorithm) 2. Filter image (open/close) to eliminate small regions 3. Look at only regions that are a certain size with respect to the image Steps to filter out non-braille candidates 1. Find the minimum distance between region centroids 2. For every candidate, count how many other candidate regions there are within a given scaled version of that minimum distance. 3. If there are at least three others, good chance it is a braille dot
6 EXAMPLE: CLASSROOM NAMEPLATE finddotcoordinates
7 LIMITATIONS 1. Does NOT track points from frame to frame, has to start fresh every time. 2. Has to look for both black and white dots: adds a little extra computing time a. Hopefully, this gets filtered out at the beginning, because only small regions will be compared 3. Can pick up reflections that do not get filtered out:
8 GROUP SEPARATION/ ITERATIONS Hierarchical (non- Euclidian) Connected Components Cluster Estimation K-Means Clustering
9 groupdots GROUPING: EXAMPLE
10 ORGANIZING DOTS Order 1 3
11 POINT TRANSLATION Objective: Output from point identification step is an Nx2 array of points. Goal is to take set of points (of arbitrary order), and translate to text Minimum distance between braille dots (defining the grid) passed in from previous step Ideally orthorectification performed for robustness of algorithm (not implemented)
12 POINT TRANSLATION - STEP 1 Character Identification Braille characters are 3 rows by 2 columns, this is used to our advantage Braille characters, except for special characters and punctuation, always have a dot in the upper left corner, or two dots forming a 45 degree angle in the upper left
13 POINT TRANSLATION - STEP 2 Finding the sums (a given point s X + Y coordinates) of the input points gives easy and fast way to get upper left corner and special character patterns Example: if mindist = 1, upper (141,234) (sorted by ascending): Left Side Right Side
14 POINT TRANSLATION - STEP 2 Minimum sum corresponds to upper left point (the next greatest sums are >= sum + mindist) 45 degree gives two sums approximately the same (within small % of mindist) Left Side Right Side
15 POINT TRANSLATION - STEP 3 If 45 degree angle, virtual point created in upper left Corner Virtual Point (if 45 degree) Upper left corner used to create an occupancy grid, based off the X and Y coordinate of the upper left corner Iterate over point set to see where they fall within the grid Store, and remove from point set. Repeat until no more points
16 POINT TRANSLATION - STEP 4 Load in dictionary of braille characters Each stored occupancy grid corresponds to an entry in the dictionary Iterate over stored grids and find the respective entries; output translated string
17 POINT TRANSLATION ASSUMPTIONS AND LIMITATIONS Algorithm assumes points come from a single word or line Can handle letters, and numbers. Special symbols such as punctuation and capitalization currently unsupported Points orthorectified for best results
18 EXPERIMENT AND RESULTS
19 CONCLUSION Difficulties and limitations Slight offset could make letters untranslateable. Future work Orthorectification of the image Track points by frame instead of starting fresh every single time Find location of finger and read aloud as the person progresses
20 Questions?
6. Applications - Text recognition in videos - Semantic video analysis
6. Applications - Text recognition in videos - Semantic video analysis Stephan Kopf 1 Motivation Goal: Segmentation and classification of characters Only few significant features are visible in these simple
More informationSeminar. Topic: Object and character Recognition
Seminar Topic: Object and character Recognition Tse Ngang Akumawah Lehrstuhl für Praktische Informatik 3 Table of content What's OCR? Areas covered in OCR Procedure Where does clustering come in Neural
More informationEE368 Project: Visual Code Marker Detection
EE368 Project: Visual Code Marker Detection Kahye Song Group Number: 42 Email: kahye@stanford.edu Abstract A visual marker detection algorithm has been implemented and tested with twelve training images.
More information(Refer Slide Time: 00:02:00)
Computer Graphics Prof. Sukhendu Das Dept. of Computer Science and Engineering Indian Institute of Technology, Madras Lecture - 18 Polyfill - Scan Conversion of a Polygon Today we will discuss the concepts
More information3D Face and Hand Tracking for American Sign Language Recognition
3D Face and Hand Tracking for American Sign Language Recognition NSF-ITR (2004-2008) D. Metaxas, A. Elgammal, V. Pavlovic (Rutgers Univ.) C. Neidle (Boston Univ.) C. Vogler (Gallaudet) The need for automated
More informationSensor Fusion-Based Parking Assist System
Sensor Fusion-Based Parking Assist System 2014-01-0327 Jaeseob Choi, Eugene Chang, Daejoong Yoon, and Seongsook Ryu Hyundai & Kia Corp. Hogi Jung and Jaekyu Suhr Hanyang Univ. Published 04/01/2014 CITATION:
More informationFIDUCIAL BASED POSE ESTIMATION ADEWOLE AYOADE ALEX YEARSLEY
FIDUCIAL BASED POSE ESTIMATION ADEWOLE AYOADE ALEX YEARSLEY OVERVIEW Objective Motivation Previous Work Methods Target Recognition Target Identification Pose Estimation Testing Results Demonstration Conclusion
More informationChapter 3 Image Registration. Chapter 3 Image Registration
Chapter 3 Image Registration Distributed Algorithms for Introduction (1) Definition: Image Registration Input: 2 images of the same scene but taken from different perspectives Goal: Identify transformation
More informationComparative Study of ROI Extraction of Palmprint
251 Comparative Study of ROI Extraction of Palmprint 1 Milind E. Rane, 2 Umesh S Bhadade 1,2 SSBT COE&T, North Maharashtra University Jalgaon, India Abstract - The Palmprint region segmentation is an important
More informationRegion-based Segmentation
Region-based Segmentation Image Segmentation Group similar components (such as, pixels in an image, image frames in a video) to obtain a compact representation. Applications: Finding tumors, veins, etc.
More informationSchedule for Rest of Semester
Schedule for Rest of Semester Date Lecture Topic 11/20 24 Texture 11/27 25 Review of Statistics & Linear Algebra, Eigenvectors 11/29 26 Eigenvector expansions, Pattern Recognition 12/4 27 Cameras & calibration
More informationImplementing the Scale Invariant Feature Transform(SIFT) Method
Implementing the Scale Invariant Feature Transform(SIFT) Method YU MENG and Dr. Bernard Tiddeman(supervisor) Department of Computer Science University of St. Andrews yumeng@dcs.st-and.ac.uk Abstract The
More informationMotion Estimation and Optical Flow Tracking
Image Matching Image Retrieval Object Recognition Motion Estimation and Optical Flow Tracking Example: Mosiacing (Panorama) M. Brown and D. G. Lowe. Recognising Panoramas. ICCV 2003 Example 3D Reconstruction
More informationFitting: The Hough transform
Fitting: The Hough transform Voting schemes Let each feature vote for all the models that are compatible with it Hopefully the noise features will not vote consistently for any single model Missing data
More informationUsing Mean Shift Algorithm in the Recognition of Industrial Data Matrix Codes
Using Mean Shift Algorithm in the Recognition of Industrial Data Matrix Codes ION-COSMIN DITA, VASILE GUI, MARIUS OTESTEANU Politehnica University of Timisoara Faculty of Electronics and Telecommunications
More informationVK Multimedia Information Systems
VK Multimedia Information Systems Mathias Lux, mlux@itec.uni-klu.ac.at Dienstags, 16.oo Uhr This work is licensed under the Creative Commons Attribution-NonCommercial-ShareAlike 3.0 Agenda Evaluations
More informationCS Introduction to Data Mining Instructor: Abdullah Mueen
CS 591.03 Introduction to Data Mining Instructor: Abdullah Mueen LECTURE 8: ADVANCED CLUSTERING (FUZZY AND CO -CLUSTERING) Review: Basic Cluster Analysis Methods (Chap. 10) Cluster Analysis: Basic Concepts
More informationLinescan System Design for Robust Web Inspection
Linescan System Design for Robust Web Inspection Vision Systems Design Webinar, December 2011 Engineered Excellence 1 Introduction to PVI Systems Automated Test & Measurement Equipment PC and Real-Time
More informationCluster Analysis (b) Lijun Zhang
Cluster Analysis (b) Lijun Zhang zlj@nju.edu.cn http://cs.nju.edu.cn/zlj Outline Grid-Based and Density-Based Algorithms Graph-Based Algorithms Non-negative Matrix Factorization Cluster Validation Summary
More information6. Object Identification L AK S H M O U. E D U
6. Object Identification L AK S H M AN @ O U. E D U Objects Information extracted from spatial grids often need to be associated with objects not just an individual pixel Group of pixels that form a real-world
More informationApplications. Foreground / background segmentation Finding skin-colored regions. Finding the moving objects. Intelligent scissors
Segmentation I Goal Separate image into coherent regions Berkeley segmentation database: http://www.eecs.berkeley.edu/research/projects/cs/vision/grouping/segbench/ Slide by L. Lazebnik Applications Intelligent
More information3. Data Structures for Image Analysis L AK S H M O U. E D U
3. Data Structures for Image Analysis L AK S H M AN @ O U. E D U Different formulations Can be advantageous to treat a spatial grid as a: Levelset Matrix Markov chain Topographic map Relational structure
More informationCS231A Section 6: Problem Set 3
CS231A Section 6: Problem Set 3 Kevin Wong Review 6 -! 1 11/09/2012 Announcements PS3 Due 2:15pm Tuesday, Nov 13 Extra Office Hours: Friday 6 8pm Huang Common Area, Basement Level. Review 6 -! 2 Topics
More informationTools of Design Select Mode vs. Text Mode Select Mode allows you to alter the position and size of both text and clipart Text Mode allows you change text size, font and characters but you CANNOT
More informationA System of Image Matching and 3D Reconstruction
A System of Image Matching and 3D Reconstruction CS231A Project Report 1. Introduction Xianfeng Rui Given thousands of unordered images of photos with a variety of scenes in your gallery, you will find
More informationSolving Word Jumbles
Solving Word Jumbles Debabrata Sengupta, Abhishek Sharma Department of Electrical Engineering, Stanford University { dsgupta, abhisheksharma }@stanford.edu Abstract In this report we propose an algorithm
More informationCamera Calibration Utility Description
Camera Calibration Utility Description Robert Bryll, Xinfeng Ma, Francis Quek Vision Interfaces and Systems Laboratory The university of Illinois at Chicago April 6, 1999 1 Introduction To calibrate our
More informationClustering Part 4 DBSCAN
Clustering Part 4 Dr. Sanjay Ranka Professor Computer and Information Science and Engineering University of Florida, Gainesville DBSCAN DBSCAN is a density based clustering algorithm Density = number of
More informationAuto-Digitizer for Fast Graph-to-Data Conversion
Auto-Digitizer for Fast Graph-to-Data Conversion EE 368 Final Project Report, Winter 2018 Deepti Sanjay Mahajan dmahaj@stanford.edu Sarah Pao Radzihovsky sradzi13@stanford.edu Ching-Hua (Fiona) Wang chwang9@stanford.edu
More informationCS 2750 Machine Learning. Lecture 19. Clustering. CS 2750 Machine Learning. Clustering. Groups together similar instances in the data sample
Lecture 9 Clustering Milos Hauskrecht milos@cs.pitt.edu 539 Sennott Square Clustering Groups together similar instances in the data sample Basic clustering problem: distribute data into k different groups
More informationTypes of image feature and segmentation
COMP3204/COMP6223: Computer Vision Types of image feature and segmentation Jonathon Hare jsh2@ecs.soton.ac.uk Image Feature Morphology Recap: Feature Extractors image goes in Feature Extractor featurevector(s)
More informationELEC Dr Reji Mathew Electrical Engineering UNSW
ELEC 4622 Dr Reji Mathew Electrical Engineering UNSW Review of Motion Modelling and Estimation Introduction to Motion Modelling & Estimation Forward Motion Backward Motion Block Motion Estimation Motion
More information1. (10 pts) Order the following three images by how much memory they occupy:
CS 47 Prelim Tuesday, February 25, 2003 Problem : Raster images (5 pts). (0 pts) Order the following three images by how much memory they occupy: A. a 2048 by 2048 binary image B. a 024 by 024 grayscale
More informationLecture 9: Hough Transform and Thresholding base Segmentation
#1 Lecture 9: Hough Transform and Thresholding base Segmentation Saad Bedros sbedros@umn.edu Hough Transform Robust method to find a shape in an image Shape can be described in parametric form A voting
More informationScene Text Detection Using Machine Learning Classifiers
601 Scene Text Detection Using Machine Learning Classifiers Nafla C.N. 1, Sneha K. 2, Divya K.P. 3 1 (Department of CSE, RCET, Akkikkvu, Thrissur) 2 (Department of CSE, RCET, Akkikkvu, Thrissur) 3 (Department
More informationUNDERSTANDING CALCULATION LEVEL AND ITERATIVE DECONVOLUTION
UNDERSTANDING CALCULATION LEVEL AND ITERATIVE DECONVOLUTION Laser diffraction particle size analyzers use advanced mathematical algorithms to convert a measured scattered light intensity distribution into
More informationCS 378: Autonomous Intelligent Robotics. Instructor: Jivko Sinapov
CS 378: Autonomous Intelligent Robotics Instructor: Jivko Sinapov http://www.cs.utexas.edu/~jsinapov/teaching/cs378/ Visual Registration and Recognition Announcements Homework 6 is out, due 4/5 4/7 Installing
More informationQuick Start Guide MAC Operating System Built-In Accessibility
Quick Start Guide MAC Operating System Built-In Accessibility Overview The MAC Operating System X has many helpful universal access built-in options for users of varying abilities. In this quickstart,
More informationFlying Start AS Computer Science. September 2015
Flying Start AS Computer Science September 2015 Name: To your first AS Computing lesson, you will need to bring: 1. A folder with dividers An A4 ring binder with labelled A4 dividers would be ideal. The
More informationSimulation of Zhang Suen Algorithm using Feed- Forward Neural Networks
Simulation of Zhang Suen Algorithm using Feed- Forward Neural Networks Ritika Luthra Research Scholar Chandigarh University Gulshan Goyal Associate Professor Chandigarh University ABSTRACT Image Skeletonization
More informationUniversal Access features ipad incorporates numerous accessibility features, including: VoiceOver screen reader
Accessibility 24 Universal Access features ipad incorporates numerous accessibility features, including: VoiceOver screen reader Zoom magnification Large Text White on Black Speak Selection Speak Auto-text
More informationClustering. Stat 430 Fall 2011
Clustering Stat 430 Fall 2011 Outline Distance Measures Linkage Hierachical Clustering KMeans Data set: Letters from the UCI repository: Letters Data 20,000 instances of letters Variables: 1. lettr capital
More informationWhy is computer vision difficult?
Why is computer vision difficult? Viewpoint variation Illumination Scale Why is computer vision difficult? Intra-class variation Motion (Source: S. Lazebnik) Background clutter Occlusion Challenges: local
More informationCSE 5243 INTRO. TO DATA MINING
CSE 5243 INTRO. TO DATA MINING Cluster Analysis: Basic Concepts and Methods Huan Sun, CSE@The Ohio State University Slides adapted from UIUC CS412, Fall 2017, by Prof. Jiawei Han 2 Chapter 10. Cluster
More information1 Introduction to Excel Databases April 09
1 Introduction to Excel Databases April 09 Contents INTRODUCTION TO DATABASES... 3 CREATING A DATABASE... 3 SORTING DATA... 4 DATA FORMS... 5 Data Form options... 5 Using Criteria... 6 FILTERING DATA...
More informationProject 1 : Dead Reckoning and Tracking
CS3630 Spring 2012 Project 1 : Dead Reckoning and Tracking Group : Wayward Sons Sameer Ansari, David Bernal, Tommy Kazenstein 2/8/2012 Wayward Sons CS3630 Spring 12 Project 1 Page 2 of 12 CS 3630 (Spring
More informationPARALLELIZATION OF THE NELDER-MEAD SIMPLEX ALGORITHM
PARALLELIZATION OF THE NELDER-MEAD SIMPLEX ALGORITHM Scott Wu Montgomery Blair High School Silver Spring, Maryland Paul Kienzle Center for Neutron Research, National Institute of Standards and Technology
More informationIMPLEMENTING ON OPTICAL CHARACTER RECOGNITION USING MEDICAL TABLET FOR BLIND PEOPLE
Impact Factor (SJIF): 5.301 International Journal of Advance Research in Engineering, Science & Technology e-issn: 2393-9877, p-issn: 2394-2444 Volume 5, Issue 3, March-2018 IMPLEMENTING ON OPTICAL CHARACTER
More informationUnit 9: Excel Page( )
Unit 9: Excel Page( 496-499) Lab: A. Font B. Fill color C. Font color D. View buttons E. Numeric entry F. Row G. Cell H. Column I. Workbook window J. Active sheet K. Status bar L. Range M. Column labels
More informationMicrosoft Excel Basics Ben Johnson
Microsoft Excel Basics Ben Johnson Topic...page # Basics...1 Workbook and worksheets...1 Sizing columns and rows...2 Auto Fill...2 Sort...2 Formatting Cells...3 Formulas...3 Percentage Button...4 Sum function...4
More informationCreating Accessible Documents in Adobe Acrobat Pro 9
Creating Accessible Documents in Adobe Acrobat Pro 9 Create an Electronic Copy of the Book 1. Remove the binding from the book so it can be placed in an automatic document feeder. This requires a fairly
More informationUnsupervised Learning I: K-Means Clustering
Unsupervised Learning I: K-Means Clustering Reading: Chapter 8 from Introduction to Data Mining by Tan, Steinbach, and Kumar, pp. 487-515, 532-541, 546-552 (http://www-users.cs.umn.edu/~kumar/dmbook/ch8.pdf)
More informationEECS490: Digital Image Processing. Lecture #23
Lecture #23 Motion segmentation & motion tracking Boundary tracking Chain codes Minimum perimeter polygons Signatures Motion Segmentation P k Accumulative Difference Image Positive ADI Negative ADI (ADI)
More informationRobust PDF Table Locator
Robust PDF Table Locator December 17, 2016 1 Introduction Data scientists rely on an abundance of tabular data stored in easy-to-machine-read formats like.csv files. Unfortunately, most government records
More informationOrdered Indices To gain fast random access to records in a file, we can use an index structure. Each index structure is associated with a particular search key. Just like index of a book, library catalog,
More informationApproximate Nearest Neighbors. CS 510 Lecture #24 April 18 th, 2014
Approximate Nearest Neighbors CS 510 Lecture #24 April 18 th, 2014 How is the assignment going? 2 hcp://breckon.eu/toby/demos/videovolumes/ Review: Video as Data Cube Mathematically, the cube can be viewed
More informationHOUGH TRANSFORM CS 6350 C V
HOUGH TRANSFORM CS 6350 C V HOUGH TRANSFORM The problem: Given a set of points in 2-D, find if a sub-set of these points, fall on a LINE. Hough Transform One powerful global method for detecting edges
More informationScanner Parameter Estimation Using Bilevel Scans of Star Charts
ICDAR, Seattle WA September Scanner Parameter Estimation Using Bilevel Scans of Star Charts Elisa H. Barney Smith Electrical and Computer Engineering Department Boise State University, Boise, Idaho 8375
More informationCAP 5415 Computer Vision Fall 2012
CAP 5415 Computer Vision Fall 01 Dr. Mubarak Shah Univ. of Central Florida Office 47-F HEC Lecture-5 SIFT: David Lowe, UBC SIFT - Key Point Extraction Stands for scale invariant feature transform Patented
More informationOCR For Handwritten Marathi Script
International Journal of Scientific & Engineering Research Volume 3, Issue 8, August-2012 1 OCR For Handwritten Marathi Script Mrs.Vinaya. S. Tapkir 1, Mrs.Sushma.D.Shelke 2 1 Maharashtra Academy Of Engineering,
More informationExam 2 Study Guide. Denny Hood Computer Science 101
Exam 2 Study Guide Denny Hood denny.hood@mail.wvu.edu Computer Science 101 A Brief Word About Your Exam Your exam will be MONDAY, APRIL 10. You will have 50 minutes to complete Exam 2. 1. If you arrive
More information[10] Industrial DataMatrix barcodes recognition with a random tilt and rotating the camera
[10] Industrial DataMatrix barcodes recognition with a random tilt and rotating the camera Image processing, pattern recognition 865 Kruchinin A.Yu. Orenburg State University IntBuSoft Ltd Abstract The
More informationHuman Body Recognition and Tracking: How the Kinect Works. Kinect RGB-D Camera. What the Kinect Does. How Kinect Works: Overview
Human Body Recognition and Tracking: How the Kinect Works Kinect RGB-D Camera Microsoft Kinect (Nov. 2010) Color video camera + laser-projected IR dot pattern + IR camera $120 (April 2012) Kinect 1.5 due
More informationToward Part-based Document Image Decoding
2012 10th IAPR International Workshop on Document Analysis Systems Toward Part-based Document Image Decoding Wang Song, Seiichi Uchida Kyushu University, Fukuoka, Japan wangsong@human.ait.kyushu-u.ac.jp,
More informationA Vision System for Automatic State Determination of Grid Based Board Games
A Vision System for Automatic State Determination of Grid Based Board Games Michael Bryson Computer Science and Engineering, University of South Carolina, 29208 Abstract. Numerous programs have been written
More informationNumbers Basics Website:
Website: http://etc.usf.edu/te/ Numbers is Apple's new spreadsheet application. It is installed as part of the iwork suite, which also includes the word processing program Pages and the presentation program
More informationHarder case. Image matching. Even harder case. Harder still? by Diva Sian. by swashford
Image matching Harder case by Diva Sian by Diva Sian by scgbt by swashford Even harder case Harder still? How the Afghan Girl was Identified by Her Iris Patterns Read the story NASA Mars Rover images Answer
More informationCS231A Course Project Final Report Sign Language Recognition with Unsupervised Feature Learning
CS231A Course Project Final Report Sign Language Recognition with Unsupervised Feature Learning Justin Chen Stanford University justinkchen@stanford.edu Abstract This paper focuses on experimenting with
More informationA Visualization Tool to Improve the Performance of a Classifier Based on Hidden Markov Models
A Visualization Tool to Improve the Performance of a Classifier Based on Hidden Markov Models Gleidson Pegoretti da Silva, Masaki Nakagawa Department of Computer and Information Sciences Tokyo University
More informationProcessing of binary images
Binary Image Processing Tuesday, 14/02/2017 ntonis rgyros e-mail: argyros@csd.uoc.gr 1 Today From gray level to binary images Processing of binary images Mathematical morphology 2 Computer Vision, Spring
More informationLocating 1-D Bar Codes in DCT-Domain
Edith Cowan University Research Online ECU Publications Pre. 2011 2006 Locating 1-D Bar Codes in DCT-Domain Alexander Tropf Edith Cowan University Douglas Chai Edith Cowan University 10.1109/ICASSP.2006.1660449
More informationPLC Papers Created For:
PLC Papers Created For: Year 10 Topic Practice Papers: Polygons Polygons 1 Grade 4 Look at the shapes below A B C Shape A, B and C are polygons Write down the mathematical name for each of the polygons
More informationK-means and Hierarchical Clustering
K-means and Hierarchical Clustering Note to other teachers and users of these slides. Andrew would be delighted if you found this source material useful in giving your own lectures. Feel free to use these
More informationSchools of thoughts on texture
Cameras Images Images Edges Talked about images being continuous (if you blur them, then you can compute derivatives and such). Two paths: Edges something useful Or Images something besides edges. Images
More informationCSE/EE-576, Final Project
1 CSE/EE-576, Final Project Torso tracking Ke-Yu Chen Introduction Human 3D modeling and reconstruction from 2D sequences has been researcher s interests for years. Torso is the main part of the human
More informationRobbery Detection Camera
Robbery Detection Camera Vincenzo Caglioti Simone Gasparini Giacomo Boracchi Pierluigi Taddei Alessandro Giusti Camera and DSP 2 Camera used VGA camera (640x480) [Y, Cb, Cr] color coding, chroma interlaced
More informationMobile Camera Based Calculator
Mobile Camera Based Calculator Liwei Wang Jingyi Dai Li Du Department of Electrical Engineering Department of Electrical Engineering Department of Electrical Engineering Stanford University Stanford University
More informationUniversity of Florida CISE department Gator Engineering. Clustering Part 4
Clustering Part 4 Dr. Sanjay Ranka Professor Computer and Information Science and Engineering University of Florida, Gainesville DBSCAN DBSCAN is a density based clustering algorithm Density = number of
More informationCSC148 Week 7. Larry Zhang
CSC148 Week 7 Larry Zhang 1 Announcements Test 1 can be picked up in DH-3008 A1 due this Saturday Next week is reading week no lecture, no labs no office hours 2 Recap Last week, learned about binary trees
More informationThe Fundamentals. Document Basics
3 The Fundamentals Opening a Program... 3 Similarities in All Programs... 3 It's On Now What?...4 Making things easier to see.. 4 Adjusting Text Size.....4 My Computer. 4 Control Panel... 5 Accessibility
More informationEE795: Computer Vision and Intelligent Systems
EE795: Computer Vision and Intelligent Systems Spring 2012 TTh 17:30-18:45 FDH 204 Lecture 14 130307 http://www.ee.unlv.edu/~b1morris/ecg795/ 2 Outline Review Stereo Dense Motion Estimation Translational
More informationLab 4 Projectile Motion
b Lab 4 Projectile Motion What You Need To Know: x = x v = v v o ox = v + v ox ox + at 1 t + at + a x FIGURE 1 Linear Motion Equations The Physics So far in lab you ve dealt with an object moving horizontally
More informationACT-R 6.0 AGI Manual Working Draft. Dan Bothell
ACT-R 6.0 AGI Manual Working Draft Dan Bothell Table of Contents Table of Contents...2 Introduction...3 Background...4 A Device...4 The UWI...5 The AGI...6 Typical Experiment Design...7 Window Control
More informationThe HOME Tab: Cut Copy Vertical Alignments
The HOME Tab: Cut Copy Vertical Alignments Text Direction Wrap Text Paste Format Painter Borders Cell Color Text Color Horizontal Alignments Merge and Center Highlighting a cell, a column, a row, or the
More informationKey properties of local features
Key properties of local features Locality, robust against occlusions Must be highly distinctive, a good feature should allow for correct object identification with low probability of mismatch Easy to etract
More informationRecommended GUI Design Standards
Recommended GUI Design Standards Page 1 Layout and Organization of Your User Interface Organize the user interface so that the information follows either vertically or horizontally, with the most important
More informationEECS150 - Digital Design Lecture 14 FIFO 2 and SIFT. Recap and Outline
EECS150 - Digital Design Lecture 14 FIFO 2 and SIFT Oct. 15, 2013 Prof. Ronald Fearing Electrical Engineering and Computer Sciences University of California, Berkeley (slides courtesy of Prof. John Wawrzynek)
More informationSCALE INVARIANT FEATURE TRANSFORM (SIFT)
1 SCALE INVARIANT FEATURE TRANSFORM (SIFT) OUTLINE SIFT Background SIFT Extraction Application in Content Based Image Search Conclusion 2 SIFT BACKGROUND Scale-invariant feature transform SIFT: to detect
More informationCharacter Recognition
Character Recognition 5.1 INTRODUCTION Recognition is one of the important steps in image processing. There are different methods such as Histogram method, Hough transformation, Neural computing approaches
More informationDigital Image Processing (CS/ECE 545) Lecture 5: Edge Detection (Part 2) & Corner Detection
Digital Image Processing (CS/ECE 545) Lecture 5: Edge Detection (Part 2) & Corner Detection Prof Emmanuel Agu Computer Science Dept. Worcester Polytechnic Institute (WPI) Recall: Edge Detection Image processing
More informationComputer Vision 2. SS 18 Dr. Benjamin Guthier Professur für Bildverarbeitung. Computer Vision 2 Dr. Benjamin Guthier
Computer Vision 2 SS 18 Dr. Benjamin Guthier Professur für Bildverarbeitung Computer Vision 2 Dr. Benjamin Guthier 1. IMAGE PROCESSING Computer Vision 2 Dr. Benjamin Guthier Content of this Chapter Non-linear
More informationCS 490: Computer Vision Image Segmentation: Thresholding. Fall 2015 Dr. Michael J. Reale
CS 490: Computer Vision Image Segmentation: Thresholding Fall 205 Dr. Michael J. Reale FUNDAMENTALS Introduction Before we talked about edge-based segmentation Now, we will discuss a form of regionbased
More informationUniversity of Manitoba Open Programming Contest September 22, General Instructions:
University of Manitoba Open Programming Contest September 22, 2012 General Instructions: 1. Submit solutions using the PC^2 software. 2. The questions are not listed in order of difficulty. Some questions
More informationCS664 Lecture #21: SIFT, object recognition, dynamic programming
CS664 Lecture #21: SIFT, object recognition, dynamic programming Some material taken from: Sebastian Thrun, Stanford http://cs223b.stanford.edu/ Yuri Boykov, Western Ontario David Lowe, UBC http://www.cs.ubc.ca/~lowe/keypoints/
More informationClustering and Dimensionality Reduction. Stony Brook University CSE545, Fall 2017
Clustering and Dimensionality Reduction Stony Brook University CSE545, Fall 2017 Goal: Generalize to new data Model New Data? Original Data Does the model accurately reflect new data? Supervised vs. Unsupervised
More informationUsing Spreadsheets, Selection Sets, and COGO Controls SPECTRA PRECISION SURVEY OFFICE TUTORIAL
Using Spreadsheets, Selection Sets, and COGO Controls SPECTRA PRECISION SURVEY OFFICE TUTORIAL Corporate office: Spectra Precision 10355 Westmoor Drive Suite #100 Westminster, CO 80021 USA Phone: +1-720-587-4700
More informationDATA EMBEDDING IN TEXT FOR A COPIER SYSTEM
DATA EMBEDDING IN TEXT FOR A COPIER SYSTEM Anoop K. Bhattacharjya and Hakan Ancin Epson Palo Alto Laboratory 3145 Porter Drive, Suite 104 Palo Alto, CA 94304 e-mail: {anoop, ancin}@erd.epson.com Abstract
More informationKathleen Durant PhD Northeastern University CS Indexes
Kathleen Durant PhD Northeastern University CS 3200 Indexes Outline for the day Index definition Types of indexes B+ trees ISAM Hash index Choosing indexed fields Indexes in InnoDB 2 Indexes A typical
More informationAutonomous Guidance System for Weeding Robot in Wet Rice Paddy
Closing Ceremony 214 Autonomous Guidance System for Weeding Robot in Wet Rice Paddy 14. 8. 22 Choi, Keun Ha (14R5558) Department of Mechanical Engineering Korea Advanced Institute of Science and Technology
More informationIntroduction. Introduction. Related Research. SIFT method. SIFT method. Distinctive Image Features from Scale-Invariant. Scale.
Distinctive Image Features from Scale-Invariant Keypoints David G. Lowe presented by, Sudheendra Invariance Intensity Scale Rotation Affine View point Introduction Introduction SIFT (Scale Invariant Feature
More information