# An Optical Sudoku Solver

Save this PDF as:

Size: px
Start display at page:

## Transcription

1 An Optical Sudoku Solver Martin Byröd February 12, 07 Abstract In this report, a vision-based sudoku solver is described. The solver is capable of solving a sudoku directly from a photograph taken with a standard digital camera. Given a photograph of a sudoku, the software finds the sudoku, interprets it, solves it and then projects the solution onto the original photograph. The solver can handle images of sudokus of varying appearance such as different fonts and different lighting. The solver can also handle rotated sudokus and perspective distortion. 1 Introduction The sudoku is a popular number game played on a 9 by 9 grid like this The objective is to fill all the blank squares with the digits 1 to 9. The rules are simple; When the sudoku is completed, each row and 1

2 column has to contain all digits from 1 to 9 exactly one time, i.e. no row or column is allowed to contain for instace two fives. In addition, each subgrid of size 3 by 3 also has to contain all digits from 1 to 9 exactly once. Sudokus can be found in almost all newspapers and magazines these days and they have been hugely popular for a couple of years now. Some sudokus are easy to solve by hand and some are furiously difficult. The purpose of this report is to describe an automatical, visionbased sudoku solver. The solver is capable of solving a sudoku directly from a photograph taken with a standard digital camera. Given a photograph of a sudoku, the software finds the sudoku, interprets it, solves it and then projects the solution onto the original photograph. 2 An Overview of the System The sudoku solver solves the problem of optical sudokuing in a number of steps. In this section, an overview of the complete chain from JPEG sudoku-image to JPEG solved-sudoku-image is given. To perform this, the necessary steps are: Finding the sudoku grid, interpreting the numbers, solving the sudoku and projecting the solution onto the photograph. In a little more detail, the sequence is as follows (also illustrated in Figure 1): 1. Preprocessing: To make the sudoku image more computer friendly, it is first down-sampled, then filtered and finally thresholded to produce a binary image (consisting of black and white pixels only). The filtering consists of blurring, which removes noise and highpass filtering which equalizes the intenisty throughout the image. 2. Finding the squares: The interpretation part of the solver is based on finding connected components in the image. There are well known and fast algorithms for doing this which makes it an appealing approach. The idea is that most of the connected components in the image will be sudoku squares. The output of this step is a list of component centers. 3. Finding the grid: Given the list of component centers, this step tries to find the grid and estimate the transformation (rotation, translation and perspective distortion) applied to it. 4. Correcting perspective distortion: Using the transformation estimated in the previous step, the image is inverse-transformed to form an upright frontview of the sudoku with known coordinates of each square. 2

3 5. Interpreting the digits: Now that the coordinates of all the grid points are known, the sudoku is cut into 81 squares, each of which is classified as a digit between one and nine or as an empty square. The classification is done using a nearest-neighbor method based on feature extraction. 6. Solving the sudoku: In comparison to the interpretation, the step of solving the sudoku is relatively straight forward and quite similar to how most humans solve sudokus. Finally, an image of the solution is created and projected onto the original image. 3 Finding and Rectifying the Grid The interpretation part of the solver is based on finding connected components in the image. By connected components are meant regions of white pixels in the image where you can get from one part of the region to another by jumping from one white pixel to another. There are well known and fast algorithms for doing this, which makes it a fast and easy base for the grid finder. The idea is that most of the connected components in the image will be sudoku squares. Obviously, there might be lots of false components. To get as many correct and as few false components as possible, only components of plausible size are kept. The output of this step is a list of component centers. Based on the list of component centers, a ransac-like method tries to fit lines to these points. Once a given number of mutually orthogonal lines have been found, an intersection point of two of these lines is selected. Around this point four more points are selected as illustrated in Figure 3. Based on these points, a homograph map in the plane is estimated which takes these five points to the points (0, 2),(2,0),(0,2),( 2,0) and (0,0). This hopefully results in a reasonably rectified grid with respect to scale and angles but with unknown translation. Now, a grid-structure of 81 points is fitted to the rectified grid to estimate also the translation of the grid. To measure the quality of the fit, the number of inliers is counted. If this number is above a pre-specified threshold, the fit is considered succesful. In this case, all the inliers are used to re-estimate the homography map, yielding a better estimate. The mapping is constructed so that it takes the sudoku grid onto the square [ 4.5,4.5]. Using this mapping the whole sudoku image is rectified. If this was done correctly we now know exactly where the sudoku is, which means that we can cut out the 81 small sudoku squares containing the essential sudoku information we need for the next step. 3

4 Preprocessing Findingconnected components Estimatingthe 160 grid Correctingperspective 0 distortion &reprojectingthesolution. 5.Interpretingthedigits, solvingthesudoku Figure 1: An overview of the different parts of the sudoku solver. 4

5 Figure 2: Points selected to estimate the homography mapping. First a few lines are fitted to the component centers. Then two of these lines which are orthogonal are chosen and the intersection and the neighbors of the intersection (two steps away) are selected. 5

6 Figure 3: A cut out image of a digit is to be classified (left). First the image is normalized and thresholded (middle). Thereafter all connected components (of black) are found. The segment most likely to be a digit is selected (right). 4 Interpreting the Digits The cut out squares (as described in the previous section) are classified as either empty or as one of the digits 1 to 9. This is done using a nearest neighbor method with some modifications to make it more stable. The process is roughly as follows: First the image is normalized and thresholded. Thereafter all connected components (of black) are found. The segment most likely to be a digit is selected and a number of features based on this segment are calculated. Examples of features are: proportion of black pixels, number of holes in the segment, a few statistical moments, symmetry features, etc. To classify the digits, the solver has a relatively large set of example digits. The same features have been calculated for these example digits as well and the digit is classified by selecting the most similar example digit based on these features. The similarity is calculated by taking the weighted 2-norm of the difference between the unknown digit and the example digit. The weights are based on the variances of the features over the example digits. The digit in Figure 4 has features as given in Table Determining the Orientation The grid finder described above will only be able to estimate the grid up to orientation, i.e. up to rotations of 90 degrees. This is because the sudoku grid is symmetric under such rotations. In order to estimate the orientation, the digits have to be used. Therefore, each example digit is copied into four instances, one of each orientation. This means that digit and orientation can be classified at the same time. The global orientation is then chosen which gets the most votes from the individual digits. However, this means that the classification of the digits themselves is not optimal. To compensate for this, the classification is re-run once the orientation is determined. 6

7 Proportion of black pixels Maximal row sum Maximal column sum Number of alternating rows Number of alternating columns Number of holes 0.0 x 2 moment y 2 moment xy moment x 3 moment y 3 moment x symmetry y symmetry Table 1: Features for the digit shown in Figure Classifying Sixes and Nines One thing which turned out to be tricky was to tell the difference between sixes and nines. The reason for this is that they are identical (in most fonts) up to a rotation of 180 degrees. The x 3 and y 3 moments measure assymetry and are the only features which can differ between sixes and nines. Therefore, whenever a digit is classified as a six or a nine, a separate test is performed looking only at these two features. Using this trick, a reasonably accurate classification of sixes and nines was obtained. 5 Solving the Sudoku Once the sudoku has been accurately interpreted from the image, solving it is what remains. This turns out to be a pretty straight forward problem algorithmically. One approach is as follows (the pencil method full out): Start with a 9 by 9 grid where each square contains all the digits from 1 to 9. In the squares where there are given digits in the initial sudoku, cancel out all digits except the given ones. Now iteratively cancel out digits in rows, columns and subgrids until there is a single digit in all squares and the sudoku is solved. If the difficulty of the sudoku is in the higher range the described method will not always yield a complete solution and there might be uncertainties left. In this case, pick a square containing more than one digit and start a new instance of the algorithm for each possible guess. This can be done recursively many times if needed. Finally, in one branch of the 7

8 Figure 4: Two problematic digits. The nine is a bit to thick which makes the lines join in one place and form a second hole (left). The eight is to thin and breaks apart as a result of the thresholding (right). recursion tree, a unique and correct solution will be found if the initial sudoku and the optical interpretation was correct. 6 Discussion The sudoku interpreter and solver described in this report works reasonably well. The most time consuming part of the interpretation turns out to be finding the grid, but this also seems to be the easiest part. In general, the ocr part, i.e. interpreting the digits, is more sensitive. It is hard to get the interpretation stable under varying conditions such as different light, blurring, low resolution, shadows, different fonts, etc. With the features used here, especially the one which counts holes in the digits has turned out to be very important and many false classifications can be ascribed to e.g. thin eights breaking up or the lines of thick sixes or nines joining, producing two holes (see Figure 6). This indicates that the latter part is where most work should be put in to enhance the interpretation accuracy. However, the grid finder is not perfect either and fails in some cases. This is almost always due to problems in the preprocessing. With some more effort and perhaps some more computing time, it should be possible to make this part of the algorithm very stable. 7 Conclusion A functioning sudoku interpreter and solver has been designed, implemented and tested. The system works reasonably well and although it has some problems it works on a quite large number of sudokus 8

9 under varying conditions, such as different fonts, different light, different angles and different orientations. The whole process of finding the grid, interpreting the digits and solving the sudoku takes a couple of seconds, which seems acceptable. The implementation was made in matlab and it should be possible to increase the speed by a good amount by porting it to a lower level language lika java or c++. 9

### Automated Sudoku Solver. Marty Otzenberger EGGN 510 December 4, 2012

Automated Sudoku Solver Marty Otzenberger EGGN 510 December 4, 2012 Outline Goal Problem Elements Initial Testing Test Images Approaches Final Algorithm Results/Statistics Conclusions Problems/Limits Future

### Sudoku Solver. Yixin Wang

Sudoku Solver Yixin Wang wangyix@stanford.edu Abstract--- An Android app was developed that allows a Sudoku puzzle to be extracted and solved in real time using captured images from the device s camera.

### NYT crossword puzzle solver

NYT crossword puzzle solver 5. Mai 2016 1 NYT crossword puzzle solver 2 NYT crossword puzzle solver 1 Problem Description 2 Concept of Solution 3 Grid extraction 4 Box Classification 5 Solve puzzle 6 Results

### Matt Cabot Rory Taca QR CODES

Matt Cabot Rory Taca QR CODES QR codes were designed to assist in the manufacturing plants of the automotive industry. These easy to scan codes allowed for a rapid way to identify parts and made the entire

### Fourier Descriptors For Shape Recognition. Applied to Tree Leaf Identification By Tyler Karrels

Fourier Descriptors For Shape Recognition Applied to Tree Leaf Identification By Tyler Karrels Why investigate shape description? Hard drives keep getting bigger. Digital cameras allow us to capture, store,

### Chess Vision. Chua Huiyan Le Vinh Wong Lai Kuan

Chess Vision Chua Huiyan Le Vinh Wong Lai Kuan Outline Introduction Background Studies 2D Chess Vision Real-time Board Detection Extraction and Undistortion of Board Board Configuration Recognition 3D

### Sudoku, logic and proof Catherine Greenhill

Sudoku, logic and proof Catherine Greenhill As you probably know, a Sudoku puzzle is a 9 9 grid divided into nine 3 3 subgrids. Some of the cells in the grid contain a symbol: usually the symbols are the

### CVChess: Computer Vision Chess Analytics

CVChess: Computer Vision Chess Analytics Jay Hack and Prithvi Ramakrishnan Abstract We present a computer vision application and a set of associated algorithms capable of recording chess game moves fully

### WORDOKU SOLVER. Surya Chandra EENG510 December 3,2014

WORDOKU SOLVER Surya Chandra EENG510 December 3,2014 Outline Background Goal Steps to solve Algorithm used for each step Testing and Results Future work Questions Background A wordoku puzzle is similar

### ColorCrack: Identifying Cracks in Glass

ColorCrack: Identifying Cracks in Glass James Max Kanter Massachusetts Institute of Technology 77 Massachusetts Ave Cambridge, MA 02139 kanter@mit.edu Figure 1: ColorCrack automatically identifies cracks

### E27 SPRING 2013 ZUCKER PROJECT 2 PROJECT 2 AUGMENTED REALITY GAMING SYSTEM

PROJECT 2 AUGMENTED REALITY GAMING SYSTEM OVERVIEW For this project, you will implement the augmented reality gaming system that you began to design during Exam 1. The system consists of a computer, projector,

### State Spaces Graph Search Searching. Graph Search. CPSC 322 Search 2. Textbook 3.4. Graph Search CPSC 322 Search 2, Slide 1

Graph Search CPSC 322 Search 2 Textbook 3.4 Graph Search CPSC 322 Search 2, Slide 1 Lecture Overview 1 State Spaces 2 Graph Search 3 Searching Graph Search CPSC 322 Search 2, Slide 2 State Spaces Idea:

### A Chain Code Approach for Recognizing Basic Shapes

A Chain Code Approach for Recognizing Basic Shapes Dr. Azzam Talal Sleit (Previously, Azzam Ibrahim) azzam_sleit@yahoo.com Rahmeh Omar Jabay King Abdullah II for Information Technology College University

### Single Image 3D Reconstruction of Ball Motion and Spin From Motion Blur

Single Image 3D Reconstruction of Ball Motion and Spin From Motion Blur An Experiment in Motion from Blur Giacomo Boracchi, Vincenzo Caglioti, Alessandro Giusti Objective From a single image, reconstruct:

### KEEPING NOTES. Remember Sudoku is a game of logic and you shouldn t need to guess.

Number puzzles and games have been around for a very long time, perhaps ancient cave-dwellers even played puzzles with rocks and sticks! Sudoku (which means single number in Japanese) probably has it s

### Kenken For Teachers. Tom Davis tomrdavis@earthlink.net http://www.geometer.org/mathcircles June 27, 2010. Abstract

Kenken For Teachers Tom Davis tomrdavis@earthlink.net http://www.geometer.org/mathcircles June 7, 00 Abstract Kenken is a puzzle whose solution requires a combination of logic and simple arithmetic skills.

### A Sudoku Solver. CSC 242: Artificial Intelligence. Mike Schermerhorn

A Sudoku Solver CSC 242: Artificial Intelligence Mike Schermerhorn Introduction The standard Sudoku puzzle consists of a nine by nine grid, broken into nine three by three boxes. Each of the eighty one

### Augmented Reality Tic-Tac-Toe

Augmented Reality Tic-Tac-Toe Joe Maguire, David Saltzman Department of Electrical Engineering jmaguire@stanford.edu, dsaltz@stanford.edu Abstract: This project implements an augmented reality version

### A Matlab Project in Optical Character Recognition (OCR)

A Matlab Project in Optical Character Recognition (OCR) Jesse Hansen Introduction: What is OCR? The goal of Optical Character Recognition (OCR) is to classify optical patterns (often contained in a digital

### D-optimal plans in observational studies

D-optimal plans in observational studies Constanze Pumplün Stefan Rüping Katharina Morik Claus Weihs October 11, 2005 Abstract This paper investigates the use of Design of Experiments in observational

### Creating Sudoku Puzzles

Page 1 of 15 Control # 2883 Creating Sudoku Puzzles Control # 2883 February 19, 2008 Abstract We consider the problem of generating well-formed Sudoku puzzles. Weighing the benefits of constructing a problem

### Sudoku an alternative history

Sudoku an alternative history Peter J. Cameron p.j.cameron@qmul.ac.uk Talk to the Archimedeans, February 2007 Sudoku There s no mathematics involved. Use logic and reasoning to solve the puzzle. Instructions

### Arrowsmith: Automatic Archery Scorer Chanh Nguyen and Irving Lin

Arrowsmith: Automatic Archery Scorer Chanh Nguyen and Irving Lin Department of Computer Science, Stanford University ABSTRACT We present a method for automatically determining the score of a round of arrows

### Robust Panoramic Image Stitching

Robust Panoramic Image Stitching CS231A Final Report Harrison Chau Department of Aeronautics and Astronautics Stanford University Stanford, CA, USA hwchau@stanford.edu Robert Karol Department of Aeronautics

### Image Projection. Goal: Introduce the basic concepts and mathematics for image projection.

Image Projection Goal: Introduce the basic concepts and mathematics for image projection. Motivation: The mathematics of image projection allow us to answer two questions: Given a 3D scene, how does it

### Handwritten Character Recognition from Bank Cheque

International Journal of Computer Sciences and Engineering Open Access Research Paper Volume-4, Special Issue-1 E-ISSN: 2347-2693 Handwritten Character Recognition from Bank Cheque Siddhartha Banerjee*

### Theorem 5. The composition of any two symmetries in a point is a translation. More precisely, S B S A = T 2

Isometries. Congruence mappings as isometries. The notion of isometry is a general notion commonly accepted in mathematics. It means a mapping which preserves distances. The word metric is a synonym to

### Data Mining Practical Machine Learning Tools and Techniques

Ensemble learning Data Mining Practical Machine Learning Tools and Techniques Slides for Chapter 8 of Data Mining by I. H. Witten, E. Frank and M. A. Hall Combining multiple models Bagging The basic idea

### Video-Rate Stereo Vision on a Reconfigurable Hardware. Ahmad Darabiha Department of Electrical and Computer Engineering University of Toronto

Video-Rate Stereo Vision on a Reconfigurable Hardware Ahmad Darabiha Department of Electrical and Computer Engineering University of Toronto Introduction What is Stereo Vision? The ability of finding the

### Data Clustering. Dec 2nd, 2013 Kyrylo Bessonov

Data Clustering Dec 2nd, 2013 Kyrylo Bessonov Talk outline Introduction to clustering Types of clustering Supervised Unsupervised Similarity measures Main clustering algorithms k-means Hierarchical Main

### Bachelor Graduation Project SOLVING JIGSAW PUZZLES USING COMPUTER VISION

SOLVING JIGSAW PUZZLES USING COMPUTER VISION AUTHOR : AREEJ MAHDI SUPERVISOR : REIN VAN DEN BOOMGAARD DATE : JUNE 22, 2005 SIGNED BY : Bachelor Graduation Project Solving Jigsaw Puzzles Using Computer

### Morphological segmentation of histology cell images

Morphological segmentation of histology cell images A.Nedzved, S.Ablameyko, I.Pitas Institute of Engineering Cybernetics of the National Academy of Sciences Surganova, 6, 00 Minsk, Belarus E-mail abl@newman.bas-net.by

### Signature Region of Interest using Auto cropping

ISSN (Online): 1694-0784 ISSN (Print): 1694-0814 1 Signature Region of Interest using Auto cropping Bassam Al-Mahadeen 1, Mokhled S. AlTarawneh 2 and Islam H. AlTarawneh 2 1 Math. And Computer Department,

### Prime Sensor NITE 1.3 Algorithms notes

Giving Devices a Prime Sense Prime Sensor NITE 1.3 Algorithms notes Version 1.0 COPYRIGHT 2010. PrimeSense Inc. ALL RIGHTS RESERVED. NO PART OF THIS DOCUMENT MAY REPRODUCED, PHOTOCOPIED, STORED ON A RETRIEVAL

### ECE 533 Project Report Ashish Dhawan Aditi R. Ganesan

Handwritten Signature Verification ECE 533 Project Report by Ashish Dhawan Aditi R. Ganesan Contents 1. Abstract 3. 2. Introduction 4. 3. Approach 6. 4. Pre-processing 8. 5. Feature Extraction 9. 6. Verification

### 3 Drawing 2D shapes. Launch form Z.

3 Drawing 2D shapes Launch form Z. If you have followed our instructions to this point, five icons will be displayed in the upper left corner of your screen. You can tear the three shown below off, to

### Render your tests with your master camera at low-res and do your lighting, posing, texturing as usual.

Render your tests with your master camera at low-res and do your lighting, posing, texturing as usual. For all of you Lightwave users that need to find an easier way of rendering those high resolution

### Constellation Detection

Constellation Detection Suyao Ji, Jinzhi Wang, Xiaoge Liu* *To whom correspondence should be addressed. Electronic mail:liuxg@stanford.edu Abstract In the night with clear sky, the beautiful star patterns

### Map Scanning and Automated Conversion

Objectives (Entry) Map Scanning and Automated Conversion This unit will introduce quick and less costly method of data capture - map scanning and automated conversion. This unit will briefly discuss about

### suggestive contours and abstracted shading Daniel Arias

suggestive contours and abstracted shading Daniel Arias LINES AND SHADES Shape, volume, shades and texture in drawing lines as nonphotorealistic rendering technique Luis Caballero Suggestive contours Many

### Image Estimation Algorithm for Out of Focus and Blur Images to Retrieve the Barcode Value

IJSTE - International Journal of Science Technology & Engineering Volume 1 Issue 10 April 2015 ISSN (online): 2349-784X Image Estimation Algorithm for Out of Focus and Blur Images to Retrieve the Barcode

### Picture Perfect: The Mathematics of JPEG Compression

Picture Perfect: The Mathematics of JPEG Compression May 19, 2011 1 2 3 in 2D Sampling and the DCT in 2D 2D Compression Images Outline A typical color image might be 600 by 800 pixels. Images Outline A

### Computer Vision - part II

Computer Vision - part II Review of main parts of Section B of the course School of Computer Science & Statistics Trinity College Dublin Dublin 2 Ireland www.scss.tcd.ie Lecture Name Course Name 1 1 2

### Unit Descriptions USER GUIDE

LEARNING Unit Descriptions USER GUIDE Pre-K - KINDERGARTEN UNITS Counting Build 1 to 10 Optimally. Students build and identify numbers from static and flashed sets of 1 to 10 objects using the least number

### Each value (1 through 9) must appear exactly once in each row. Each value (1 through 9) must appear exactly once in each column.

INTRODUCTION TO COMPUTER SCIENCE I PROJECT 6 Sudoku! 1 The game of Sudoku Sudoku is a popular game giving crossword puzzles a run for their money in newspapers. 1 It s a game well suited for computers

### Distinguishing Photographs and Graphics on the World Wide Web

Distinguishing Photographs and Graphics on the World Wide Web Vassilis Athitsos, Michael J. Swain and Charles Frankel Department of Computer Science The University of Chicago Chicago, Illinois 60637 f

### Localization of mobile robots using machine vision and QR codes

INFOTEH-JAHORINA Vol. 15, March 016. Localization of mobile robots using machine vision and QR codes Svetislav Ćirić, Nemanja Janković, Nenad Jovičić Department of Electronics School of Electrical Engineering,

### Least-Squares Intersection of Lines

Least-Squares Intersection of Lines Johannes Traa - UIUC 2013 This write-up derives the least-squares solution for the intersection of lines. In the general case, a set of lines will not intersect at a

### Lecture 9: Shape Description (Regions)

Lecture 9: Shape Description (Regions) c Bryan S. Morse, Brigham Young University, 1998 2000 Last modified on February 16, 2000 at 4:00 PM Contents 9.1 What Are Descriptors?.........................................

### Binary Image Analysis

Binary Image Analysis Segmentation produces homogenous regions each region has uniform gray-level each region is a binary image (0: background, 1: object or the reverse) more intensity values for overlapping

### Perfection V19/V39 User's Guide

Perfection V19/V39 User's Guide Contents Perfection V19/V39 User's Guide... 7 Scanner Basics... 8 Scanner Parts... 8 Scanner Buttons and Lights... 11 Using the Scanner Stand... 11 Placing Originals on

### Visual Structure Analysis of Flow Charts in Patent Images

Visual Structure Analysis of Flow Charts in Patent Images Roland Mörzinger, René Schuster, András Horti, and Georg Thallinger JOANNEUM RESEARCH Forschungsgesellschaft mbh DIGITAL - Institute for Information

### Chapter 1: Machine Vision Systems & Image Processing

Chapter 1: Machine Vision Systems & Image Processing 1.0 Introduction While other sensors, such as proximity, touch, and force sensing play a significant role in the improvement of intelligent systems,

### NUMB3RS Activity: Sudoku Puzzles. Episode: All s Fair

Teacher Page 1 NUMBRS Activity: Sudoku Puzzles Topic: Sudoku Puzzles Grade Level: 8-10 Objective: Explore sudoku puzzles and Latin squares Time: 60-90 minutes Introduction In All s Fair, Alan, Larry, and

### IMPROVED VIRTUAL MOUSE POINTER USING KALMAN FILTER BASED GESTURE TRACKING TECHNIQUE

39 IMPROVED VIRTUAL MOUSE POINTER USING KALMAN FILTER BASED GESTURE TRACKING TECHNIQUE D.R.A.M. Dissanayake, U.K.R.M.H. Rajapaksha 2 and M.B Dissanayake 3 Department of Electrical and Electronic Engineering,

### The Trimmed Iterative Closest Point Algorithm

Image and Pattern Analysis (IPAN) Group Computer and Automation Research Institute, HAS Budapest, Hungary The Trimmed Iterative Closest Point Algorithm Dmitry Chetverikov and Dmitry Stepanov http://visual.ipan.sztaki.hu

### 21-110: Problem Solving in Recreational Mathematics

-0: Problem Solving in Recreational Mathematics Homework assignment solutions Problem. An urn contains five red balls and three yellow balls. Two balls are drawn from the urn at random, without replacement.

### Grade 6 Grade-Level Goals. Equivalent names for fractions, decimals, and percents. Comparing and ordering numbers

Content Strand: Number and Numeration Understand the Meanings, Uses, and Representations of Numbers Understand Equivalent Names for Numbers Understand Common Numerical Relations Place value and notation

### Using a Sudoku Lab to Motivate Students in an Introductory Course

Using a Sudoku Lab 1 Using a Sudoku Lab to Motivate Students in an Introductory Course Melanie Butler Mount St. Mary s University 1 Fred Butler University of Baltimore 2 Abstract: This paper describes

### Canny Edge Detection

Canny Edge Detection 09gr820 March 23, 2009 1 Introduction The purpose of edge detection in general is to significantly reduce the amount of data in an image, while preserving the structural properties

### Churn problem in retail banking Current methods in churn prediction models Fuzzy c-means clustering algorithm vs. classical k-means clustering

CHURN PREDICTION MODEL IN RETAIL BANKING USING FUZZY C- MEANS CLUSTERING Džulijana Popović Consumer Finance, Zagrebačka banka d.d. Bojana Dalbelo Bašić Faculty of Electrical Engineering and Computing University

### Object Recognition and Template Matching

Object Recognition and Template Matching Template Matching A template is a small image (sub-image) The goal is to find occurrences of this template in a larger image That is, you want to find matches of

### Using Neural Networks for Pattern Classification Problems

Using Neural Networks for Pattern Classification Problems Converting an Image Camera captures an image Image needs to be converted to a form that can be processed by the Neural Network Converting an Image

Table of Contents Getting Started...3 Bristol Village Computer Room Users...3 BVRES.ORG Web Site Users...3 The Paint Shop Pro Workspace... 3 Basic Drawing...4 Drawing Lines...4 Changing Paint Brush Colors...5

### Shapes Puzzle 1. Shapes Puzzle 2. Shapes Puzzle 3

Shapes Puzzle The twelve pentominoes are shown on the left. On the right, they have been placed together in pairs. Can you show which two pentominoes have been used to make each shape? (Each pentomino

### Cloud tracking with optical flow for short-term solar forecasting

Cloud tracking with optical flow for short-term solar forecasting Philip Wood-Bradley, José Zapata, John Pye Solar Thermal Group, Australian National University, Canberra, Australia Corresponding author:

### The Scientific Data Mining Process

Chapter 4 The Scientific Data Mining Process When I use a word, Humpty Dumpty said, in rather a scornful tone, it means just what I choose it to mean neither more nor less. Lewis Carroll [87, p. 214] In

### Combinatorial Concepts With Sudoku I: Symmetry

ombinatorial oncepts With Sudoku I: Symmetry Gordon Royle March 29, 2006 (Version 0.2) bstract The immensely popular logic game Sudoku incorporates a significant number of combinatorial concepts. In this

### Genetic Algorithms and Sudoku

Genetic Algorithms and Sudoku Dr. John M. Weiss Department of Mathematics and Computer Science South Dakota School of Mines and Technology (SDSM&T) Rapid City, SD 57701-3995 john.weiss@sdsmt.edu MICS 2009

### E190Q Lecture 5 Autonomous Robot Navigation

E190Q Lecture 5 Autonomous Robot Navigation Instructor: Chris Clark Semester: Spring 2014 1 Figures courtesy of Siegwart & Nourbakhsh Control Structures Planning Based Control Prior Knowledge Operator

### GESTURE RECOGNITION SYSTEM

GESTURE RECOGNITION SYSTEM Mrs Ayesha Butalia Ms Divya Shah Dr. R.V Dharaskar MIT-College of Engineering MIT-College of Engineering GHRCE, Nagpur Abstract Gestures are a major form of human communication.

### Introduction. www.imagesystems.se

Product information Image Systems AB Main office: Ågatan 40, SE-582 22 Linköping Phone +46 13 200 100, fax +46 13 200 150 info@imagesystems.se, Introduction Motion is the world leading software for advanced

### Game set include: 40 wooden pieces The game board Instructions

Japanese Chess Game set include: 40 wooden pieces The game board Instructions www.shogi.cz info@shogi.cz /Shogicz Online Instructions: http://www.shogi.cz/instructions.pdf EN Detailed instructions to the

### T O B C A T C A S E G E O V I S A T DETECTIE E N B L U R R I N G V A N P E R S O N E N IN P A N O R A MISCHE BEELDEN

T O B C A T C A S E G E O V I S A T DETECTIE E N B L U R R I N G V A N P E R S O N E N IN P A N O R A MISCHE BEELDEN Goal is to process 360 degree images and detect two object categories 1. Pedestrians,

### Plant Identification Using Leaf Images

Plant Identification Using Leaf Images Sachin D. Chothe 1, V.R.Ratnaparkhe 2 P.G. Student, Department of EE, Government College of Engineering, Aurangabad, Maharashtra, India 1 Assistant Professor, Department

### How Difficult Is A Sudoku? Hang Chen and Curtis Cooper University of Central Missouri. April 18, 2008

University of Central Missouri April 18, 2008 1 Introduction 2 Commonly Used Rules 3 Rectangle Rule 4 Difficulty Levels 5 Uniqueness 6 Beyond Daily Sudoku Easiest Sudoku Puzzle Very Hard Sudoku Puzzle,

### Face Recognition using SIFT Features

Face Recognition using SIFT Features Mohamed Aly CNS186 Term Project Winter 2006 Abstract Face recognition has many important practical applications, like surveillance and access control.

### CS 585 Computer Vision Final Report Puzzle Solving Mobile App

CS 585 Computer Vision Final Report Puzzle Solving Mobile App Developed by Timothy Chong and Patrick W. Crawford December 9, 2014 Introduction and Motivation This project s aim is to create a mobile application

### Solving Sudoku with Dancing Links

Solving Sudoku with Dancing Links Rob Beezer beezer@pugetsound.edu Department of Mathematics and Computer Science University of Puget Sound Tacoma, Washington USA Stellenbosch University October 8, 2010

### Compression and Image Formats

Compression Compression and Image Formats Reduce amount of data used to represent an image/video Bit rate and quality requirements Necessary to facilitate transmission and storage Required quality is application

### Job Aid. MS Paint. ICT Training. Contents. Prepared by Oksana Maibroda

MS Paint ICT Training May 2002 Job Aid Prepared by Oksana Maibroda Introduction Images can be brought into the computer environment in two ways; created as an artist creates a picture or as a photographer

### Automatic Labeling of Lane Markings for Autonomous Vehicles

Automatic Labeling of Lane Markings for Autonomous Vehicles Jeffrey Kiske Stanford University 450 Serra Mall, Stanford, CA 94305 jkiske@stanford.edu 1. Introduction As autonomous vehicles become more popular,

### Environmental Remote Sensing GEOG 2021

Environmental Remote Sensing GEOG 2021 Lecture 4 Image classification 2 Purpose categorising data data abstraction / simplification data interpretation mapping for land cover mapping use land cover class

### Social Media Mining. Data Mining Essentials

Introduction Data production rate has been increased dramatically (Big Data) and we are able store much more data than before E.g., purchase data, social media data, mobile phone data Businesses and customers

### Path Tracking for a Miniature Robot

Path Tracking for a Miniature Robot By Martin Lundgren Excerpt from Master s thesis 003 Supervisor: Thomas Hellström Department of Computing Science Umeå University Sweden 1 Path Tracking Path tracking

### Bored MUMSians. Is it possible that he is left with the number 1?

Sam Chow One Player Games Bored MUMSians Han writes the numbers 1, 2,..., 100 on the whiteboard. He picks two of these numbers, erases them, and replaces them with their difference (so at some point in

### Multiples and factors quiz

Level A 1. 18, 27 and 36 are all multiples of nine. 2. 500 is a multiple of 200. 3. Which list is made up of multiples of 12? A) 1, 12, 48 B) 12, 24, 36 C) 12, 22, 32 4. The digit sums (the one digit answer

### Convolution. 1D Formula: 2D Formula: Example on the web: http://www.jhu.edu/~signals/convolve/

Basic Filters (7) Convolution/correlation/Linear filtering Gaussian filters Smoothing and noise reduction First derivatives of Gaussian Second derivative of Gaussian: Laplacian Oriented Gaussian filters

### Model-based Chart Image Recognition

Model-based Chart Image Recognition Weihua Huang, Chew Lim Tan and Wee Kheng Leow SOC, National University of Singapore, 3 Science Drive 2, Singapore 117543 E-mail: {huangwh,tancl, leowwk@comp.nus.edu.sg}

### Machine vision systems - 2

Machine vision systems Problem definition Image acquisition Image segmentation Connected component analysis Machine vision systems - 1 Problem definition Design a vision system to see a flat world Page

### Analysis of structural features and classification of Gujarati consonants for offline character recognition

International Journal of Scientific and Research Publications, Volume 4, Issue 8, August 2014 1 Analysis of structural features and classification of Gujarati consonants for offline character recognition

### Lecture 4: Thresholding

Lecture 4: Thresholding c Bryan S. Morse, Brigham Young University, 1998 2000 Last modified on Wednesday, January 12, 2000 at 10:00 AM. Reading SH&B, Section 5.1 4.1 Introduction Segmentation involves

### More Quality Control for Weather Station Networks. Vesa Hasu

More Quality Control for Weather Station Networks Vesa Hasu Contents Introduction The quality control motivation Some basic vocabulary Quality control overview Quality control details Further quality control

### Face detection is a process of localizing and extracting the face region from the

Chapter 4 FACE NORMALIZATION 4.1 INTRODUCTION Face detection is a process of localizing and extracting the face region from the background. The detected face varies in rotation, brightness, size, etc.

### Adding a Realistic Water Reflection to a Photo

Adding a Realistic Water Reflection to a Photo Open the photo you want to add a water reflection to. I am using the photo below: Duplicate the photo so that you have two photos of the same image open in

### Gerry Hobbs, Department of Statistics, West Virginia University

Decision Trees as a Predictive Modeling Method Gerry Hobbs, Department of Statistics, West Virginia University Abstract Predictive modeling has become an important area of interest in tasks such as credit

### Statistical Considerations for Experimental Design and Data Analysis

1 Statistical Considerations for Experimental Design and Data Analysis Stephen D. Kachman Department of Statistics University of Nebraska Lincoln 2 Introduction Hypothesis Design Processing Analysis Introduction

### (Refer Slide Time: 00:01:23 min)

Computer Aided Design Prof. Anoop Chalwa Department of Mechanical Engineering Indian Institute of Technology, Delhi Lecture No. # 02 Input Output Devices, Raster Graphics Today we will be talking about