Improving the Testing Rate of Electronic Circuit Boards

Similar documents
CS5670: Computer Vision

Introduction to Machine Learning Prof. Sudeshna Sarkar Department of Computer Science and Engineering Indian Institute of Technology, Kharagpur

Properties of detectors Edge detectors Harris DoG Properties of descriptors SIFT HOG Shape context

Overview. Harris interest points. Comparing interest points (SSD, ZNCC, SIFT) Scale & affine invariant interest points

Single pyro altimeter AltiUno SMT operating instructions

Detectors part II Descriptors

Overview. Introduction to local features. Harris interest points + SSD, ZNCC, SIFT. Evaluation and comparison of different detectors

SIFT: SCALE INVARIANT FEATURE TRANSFORM BY DAVID LOWE

Orientation Map Based Palmprint Recognition

Bananagrams Tile Extraction and Letter Recognition for Rapid Word Suggestion

Given a feature in I 1, how to find the best match in I 2?

Graphical User Interfaces for Emittance and Correlation Plot. Henrik Loos

What is Image Deblurring?

Measuring Keepers S E S S I O N 1. 5 A

Overview. Introduction to local features. Harris interest points + SSD, ZNCC, SIFT. Evaluation and comparison of different detectors

Alpha spectrometry systems. A users perspective. George Ham. 26 th May Date Month Year

Blob Detection CSC 767

Edges and Scale. Image Features. Detecting edges. Origin of Edges. Solution: smooth first. Effects of noise

11+ MATHS SAMPLE EXAMINATION PAPER

Fibonacci mod k. In this section, we examine the question of which terms of the Fibonacci sequence have a given divisor k.

Lesson 04. KAZE, Non-linear diffusion filtering, ORB, MSER. Ing. Marek Hrúz, Ph.D.

Corners, Blobs & Descriptors. With slides from S. Lazebnik & S. Seitz, D. Lowe, A. Efros

AS 102 Lab The Luminosity of the Sun

Image matching. by Diva Sian. by swashford

Rel: Estimating Digital System Reliability

Scale & Affine Invariant Interest Point Detectors

Clojure Concurrency Constructs, Part Two. CSCI 5828: Foundations of Software Engineering Lecture 13 10/07/2014

SIFT keypoint detection. D. Lowe, Distinctive image features from scale-invariant keypoints, IJCV 60 (2), pp , 2004.

CSE 473/573 Computer Vision and Image Processing (CVIP)

Feature extraction: Corners and blobs

Probability and Stochastic Processes: A Friendly Introduction for Electrical and Computer Engineers Roy D. Yates and David J.

Advances in Computer Vision. Prof. Bill Freeman. Image and shape descriptors. Readings: Mikolajczyk and Schmid; Belongie et al.

Electricity Grudge Ball

HOW TO THINK ABOUT POINTS AND VECTORS WITHOUT COORDINATES. Math 225

LIMS Stock Control for ISO 15189

SYMMETRIES AND COUNTING

Extract useful building blocks: blobs. the same image like for the corners

Solving and Graphing Inequalities

Statistical Reliability Modeling of Field Failures Works!

SURF Features. Jacky Baltes Dept. of Computer Science University of Manitoba WWW:

Face detection and recognition. Detection Recognition Sally

B: Know Circuit Vocabulary: Multiple Choice Level 1 Prerequisites: None Points to: Know Circuit Vocabulary (Short Answer)

Introduction to Artificial Intelligence Midterm 2. CS 188 Spring You have approximately 2 hours and 50 minutes.

INTEREST POINTS AT DIFFERENT SCALES

SIFT: Scale Invariant Feature Transform

Ergodicity in data assimilation methods

Introduction to AI Learning Bayesian networks. Vibhav Gogate

MITOCW MIT18_02SCF10Rec_50_300k

Blobs & Scale Invariance

Physics 2020 Lab 5 Intro to Circuits

Scale-space image processing

A Course in Machine Learning

Does Air Have Mass? 1.3 Investigate

Chapter 3: The Derivative in Graphing and Applications

Week 1: Number Theory - Euler Phi Function, Order and Primitive Roots. 1 Greatest Common Divisor and the Euler Phi Function

average speed instantaneous origin resultant average velocity position particle model scalar

Theory and Problems of Signals and Systems

Numbers and symbols WHOLE NUMBERS: 1, 2, 3, 4, 5, 6, 7, 8, 9... INTEGERS: -4, -3, -2, -1, 0, 1, 2, 3, 4...

PHYS208 RECITATIONS PROBLEMS: Week 2. Gauss s Law

Solar Cells. Steven Thedford Redan High School. Objective. Student will be able to determine the maximum powerpoint and efficiency of a solar. cell.

Lecture 6 April

1 Review of the dot product

LAB 2 - ONE DIMENSIONAL MOTION

Lecture Notes in Computer Science

Experiment #2 Lab Electrostatics Pre-lab Questions

Midterm: CS 6375 Spring 2015 Solutions

Fundamentals of Circuits I: Current Models, Batteries & Bulbs

Voltage, Current, Resistance, and Ohm's Law

On The Center for Superconductivity Research The Scanning Near-Field Microwave Microscope

CS 125 Section #12 (More) Probability and Randomized Algorithms 11/24/14. For random numbers X which only take on nonnegative integer values, E(X) =

Linear Independence Reading: Lay 1.7

POWER DISTRIBUTION SYSTEM Calculating PDS Impedance Douglas Brooks Ultracad Design, Inc

Use mathematical induction in Exercises 3 17 to prove summation formulae. Be sure to identify where you use the inductive hypothesis.

ARTIFICIAL INTELLIGENCE. Artificial Neural Networks

Calibration of the Modular Neutron Array (MoNA)

Expected Value II. 1 The Expected Number of Events that Happen

Designing Information Devices and Systems I Spring 2018 Homework 13

Distributive property and its connection to areas

Measuring Motion. Day 1

CS5112: Algorithms and Data Structures for Applications

Analog Computing: a different way to think about building a (quantum) computer

The result is; distances are contracted in the direction of motion.

Section 2.1. Increasing, Decreasing, and Piecewise Functions; Applications

Visual Anomaly Detection from Small Samples for Mobile Robots. *The University of Tokyo, Japan Graduate School of Information Science and Technology

Lecture 14, Thurs March 2: Nonlocal Games

Gravitational Energy using Gizmos

Day 2 and 3 Graphing Linear Inequalities in Two Variables.notebook. Formative Quiz. 1) Sketch the graph of the following linear equation.

Activity 4. Life (and Death) before Seat Belts. What Do You Think? For You To Do GOALS

M E 345 Professor John M. Cimbala Lecture 42

Final Exam, Fall 2002

Introduction To Artificial Neural Networks

Reference number: Worksheet/Receipt. Owners name: - Telephone: Description of item(s) received, including accessories:

MATH 223 REVIEW PROBLEMS

A Gentle Introduction to Reinforcement Learning

Verification of Pharmaceutical Raw Materials Using the Spectrum Two N FT-NIR Spectrometer

the time it takes until a radioactive substance undergoes a decay

Review (11.1) 1. A sequence is an infinite list of numbers {a n } n=1 = a 1, a 2, a 3, The sequence is said to converge if lim

Exercises. Template for Proofs by Mathematical Induction

PHY 221 Lab 7 Work and Energy

Transcription:

Electronic Circuit August 19, 2011

Problem statement Acculogic Inc. manufactures systems for testing (ECBs). The systems are almost entirely automatic but require some human input. The clients of Acculogic Inc. use those systems to test batches of ECBs, and testing an ECB requires the system to carry out thousands of tests. To carry out a test, the system must locate the test points on an actual board. When carrying out the tests, the system may produce false negatives, i.e., report a failure where there is none. A false negative occurs because a probe does not hit the required test point.

Flying Probe Systems

Problem statement (continued) Acculogic s systems must be improved in order to minimize the number of false negatives. Although the boards are made after a pattern stored in the computer, the precise location of a given test point varies from board to board. Finding the locations of test points will become more challenging as the electronic devices become smaller. In what follows ideal point will refer to a point stored in the computer and actual point to a point of the board being tested. We are looking for a mapping (or matching) between the set of ideal points and the set of actual points.

The current procedure: fiducial training Three fiducial points are chosen; their ideal coordinates are known. An expert looks for (and finds) the corresponding fiducial marks on the first board of the batch. An actual fiducial point is at the center of its fiducial mark. Reference pictures (i.e., pictures of the fiducial marks) are taken.

The current procedure: fiducial finding Once the fiducial training has been completed, every board (including the first one) is processed in turn automatically. Pictures of fiducial points are taken (their approximate locations being known through ideal coordinates). The actual coordinates of the fiducial points are obtained by making corrections after comparing the above pictures with the reference pictures. The mapping between the ideal fiducial points and the actual points can be extended (in a unique way) to an affine transformation between the ideal board and the current board. All the tests on the current board are carried out and the failed tests are recorded.

Assumption Printing errors on the board are spatially correlated, so that we can define local maps between the ideal and actual boards. This assumption cannot be tested yet.

How to improve fiducial training We are proposing a new algorithm for selecting the fiducial points. 1. Four fiducial points are identified in the four corners of the board, respectively. 2. Each subgroup of three fiducial points gives rise to an affine transformation. This gives us a first group of affine transformations. 3. Construct local maps using this group of transformations. 4. Use the Next Best Pose (NBP) algorithm to select an additional fiducial point. 5. If the new fiducial point is correctly predicted by the local maps, the algorithm stops. If not, go to Step 3.

How to improve fiducial finding 1. Select the next fiducial point (following the same order as for the first board). 2. Take a picture and compare it with the reference picture. 3. Compute the needed correction to hit the test mark and update the local maps. 4. Go back to Step 1. Currently, the image comparison is performed with a black-box least squares method. We think it can be improved.

The Ideal Circuit Board The following is the output from autocad. A real circuit board isn t so nice.

A possible approach: feature detection 1. Create grayscale image. 2. Apply a threshold filter to obtain an image of 0s and 1s. 3. Identify the connected components and extract geometric properties for each component like centroid, area, Euler number, etc.

First example: A bunch of circles

Second example: a close-up of that circuit board

Third example: a real close-up of a real board

Second Approach: the Scale-Invariant Feature Transform (SIFT) An All-Canadian Product! From UBC! Thank you David Lowe for inventing it! We gratefully thank Professor Sébastien Roy for a crash course on SIFT and the affiliated Speeded Up Robust Feature (SURF).

A second, less blurry example

General idea Identify key points in the image in such a way that two images of the same thing will have the same key points even if the images are taken from different angles, different illuminations, different distances, etc. 1. For each image, identify the image s key points. 2. For each key point in the first image, try to find a corresponding key point in the second image.