# Classification of Fingerprints. Sarat C. Dass Department of Statistics & Probability

Save this PDF as:

Size: px
Start display at page:

Download "Classification of Fingerprints. Sarat C. Dass Department of Statistics & Probability"

## Transcription

1 Classification of Fingerprints Sarat C. Dass Department of Statistics & Probability

2 Fingerprint Classification Fingerprint classification is a coarse level partitioning of a fingerprint database into smaller subsets. Fingerprint classification reduces the search space of a large database: Determine the class of the query fingerprint. Then, only search templates with the same class as the query. Illustration: Inputs are the fingerprint impressions from 10 fingers of an individual. If size of the database is N and D is the number of classes, Search space without classification: N 10 Search space with classification: (N/D) 10

3 The Henry Classification System Henry (1900) made an extensive study of occurrence of fingerprints and indexed them into 8 major classes. The 8 classes are shown above. The four different whorl classes can be combined into one class: Whorl (W).

4 The Henry Classification System (cont.) Left-loop (LL) Right-loop (RL) Whorl (W) Plain Arch (PA) Tented Arch (TA) The Henry system with five classes are shown above. The five classes can be reduced to four by combining the PA and TA classes to form the Arch (A) class. The natural frequencies of W, L, R and A (A + T) are 27.9%, 33.8%, 31.7% and 6.6%.

5 The Henry Classification System (cont.) The five main classes differ in terms of the global flow patterns of the ridge curves. They also differ in terms of the number and locations of singular points in the fingerprint image. For example, LL exactly one core and one delta; the core is to the left of the delta, RL exactly one core and one delta; the core is to the right of the delta, W two cores and two deltas, PA no singular points, and TA one core and one delta; the delta is approximately directly below the core. Problems with the Henry classification system: (i) nonuniform classification proportions, and (ii) experts classify some fingerprint images into different Henry classes.

6 Examples of such fingerprints are TA and LL TA and RL TA and PA

7 Approaches for Fingerprint Classification Approaches based on singular points: Hong and Jain (1999), Karu and Jain (1996). Structure-based approaches such as using the orientation field and geometry of ridges: Cappelli et. al (2002), Chang & Fan (2002), and Chong et. al (1997). Frequency-based approaches using Fourier spectrum: Jain et. al (1999). Syntactic or grammar-based: Moayer & Fu (1975,1976). Mathematical models: Silviu & Jain (2002), Dass & Jain (2004). Hybrid methods: Combination of at least two of the above approaches (Chang & Fan (2002) and Chong et. al (1997))

8 Singular point based approaches Karu and Jain (1996) classifies fingerprints by detecting singular points in the fingerprint image. 1. The orientation field (flow direction of the ridges at each site in the fingerprint image) is extracted and smoothed. 2. Singular points are detected using the Poincare index. The Poincare index is computed by summing the changes in the angles of flow in a small circle around the test point. It is 0, -π, π, and 2π for regular, delta, core and double core points, respectively. Core Delta Input image Orientation Field

9 Karu and Jain (1996), cont. The classification procedure is: Get singular points Determine the number of core-delta pairs, N Loop or tented arch? Arch Left-loop Right-loop Tented Arch Whorl Twin Loop 1. If N=1, consider the straight line joining the core and the delta. If N=2, consider the straight line joining the two cores. Call this line L. 2. For tented arch (whorl), the tangent direction of L is parallel to the local orientation values, but not so for loops (twin loop).

10 Structure based approaches Structure based approaches use global characteristics of the ridges to determine the fingerprint class. Chang & Fan (2002) use ridge distribution models to determine the class of the fingerprint. The 10 basic ridge patterns of Chang & Fan are given on the left.

11 Chang & Fan (2002) The fingerprint classification procedure is based on the following steps: 1. For a given fingerprint image, an algorithm for extracting the ridges is developed. This algorithm takes into account (i) ridge bifurcations, and (ii) ridge fragmentations which are not endings. (i) Handling ridge bifurcations (i) Handling ridge fragmentations (a), true ridge endings (b).

12 Chang & Fan (2002), cont. 2. Each extracted ridge is then classified into one of the 10 basic ridge patterns. Some examples of the classification are:

13 Chang & Fan (2002), cont. 3. The ridge distribution sequence is generated according to the picture below: Each of the 7 classes of the Henry system (except the accidental whorl) has a unique ridge distribution sequence associated to it. Fingerprint images whose ridge distribution sequence cannot be determined are rejected. The accidental whorl class is a subset of the rejected images. Experimental results with the NIST4 database: 93.4% with 5.1% rejection rate for 7 classes, and 94.4% for the 5 classes.

14 Structural based approach - Chong & Ngee (1997) 1. The fingerprint classification procedure is based on determining the global geometric structure of the extracted ridges using B- splines. 2. The B-splines provide a compact representation of the ridges and contain enough information to determine their geometric structure. 3. The main drawback of this method is that it was not tested on a large number of fingerprints. Frequency based method Jain et. al (1999) 1. Frequency based approached covert the fingerprint image into the frequency space and perform the classification in that space. 2. In Jain et. al (1999), Gabor filters at 16 different orientation values are applied to different sectors of the fingerprint image. The Gabor coefficients form the feature for classification.

15 Fingerprint as Oriented Texture (a) Ridges in local region (b) Fourier spectrum of (a)

16 Fingerprint Classification Algorithm A. K. Jain, S. Prabhakar and L. Hong, " A Multichannel Approach to Fingerprint Classification", IEEE Transactions on PAMI, Vol.21, No.4, pp , April 1999.

17 192-dimensional Feature Vector

18 Two-stage classifier K-nearest neighbor classifier Neural Network classifier Input Data A K-NN Classifier Neural Network Classifier

19 Classification Results Five-class classification error is 10%; error is 4% with 30.8% rejection rate. Four-class classification error is 5.2%; error is 2.2% with 30.8% rejection rate. True Class Assigned Class Whorl Right Loop Left Loop Arch Tented Arch Whorl Right Loop Left Loop Arch Tented Arch class Error Rate 10% 9% 8% 7% 6% 5% 4% 3% 2% 1% 0% 0% 7% 18% 31% Reject Rate

20 Approaches based on mathematical models Silviu & Jain, 2002 Class-specific kernels are defined: the kernel for the whorl class is the unit circle, and for the other classes, the kernels are defined via splines. (a) (b) (c) (d) Figure: Kernels for (a) arch, (b) left-loop, (c) right-loop, and (d) whorl. For a fingerprint image, the energy functional is minimized to determine the best fitting kernel.

21 Results of the fitting algorithm: Silviu & Jain (cont.) The best fitting kernel (the one that minimizes the energy functional below a certain threshold) is taken to be the class of the fingerprint image. Experimental results based on the NIST4 database yields a classification accuracy of 91.25% for the 4 class problem.

22 Why Another Fingerprint Classifier? Dass & Jain (2004) Limitations of the existing approaches: Ridges are subject to breaks and discontinuities due to noise Singular points may be missed in some fingerprint images Mathematical models are too rigid to represent all possible ridge variations Requirements of a fingerprint classifier: Robust detection of global ridge characteristics Classification invariance under affine transformations and mild non-linear deformations of the fingerprint

23 Orientation Field Flow Curves Fingerprint Image Orientation Field Flow Curves Orientation field : local flow directions of the ridges and valleys Opposite flow directions are equivalent, angle [-π/2, π/2] Orientation field flow curve (OFFC) is a curve whose tangent direction at each point is parallel to the orientation field direction This is not ridge tracing; OFFCs are pseudoridges

24 Schematic Diagram of Classification Input Fingerprint Estimate Orientation Field Generate OFFCs Fingerprint class A, L, R, or W Determine fingerprint class Determine labels of OFFCs

25 Estimation of Orientation Field * A block-wise squared gradient approach with smoothness prior is used to obtain a smooth and robust estimate of orientation field Input image Orientation Field * S. C. Dass, Markov Random Field Models for Directional Field and Singularity Extraction in Fingerprint Images, IEEE Transactions on Image Processing, October 2004

26 Generation of Orientation Field Flow Curves (OFFCs( OFFCs) Continuous Orientation Field Orientation Field Flow Curves From a starting point s 0, an OFFC is generated by tracing the paths from s 0 that is tangential to orientation field

27 Detecting OFFC Type using Tangent Space Isometric Maps For each OFFC, we wish to determine whether it is a loop, arch or whorl The curve type can be identified using the tangent space isometric map of the OFFC Denote one end of the OFFC by s e. Obtain the tangent plane at s e, T e For an intermediate point s on the OFFC, obtain the tangent plane at s, T s Rotate T e to match T s ; say, the angle of rotation is θ s The tangent space isometric map is the plot of cos(θ s ) versus d s, the distance of s from s e along the OFFC

28 Tangent Space Maps of Left-Loop Loop Isometric map plot Isometric map plot cos γ 0 cos γ j j

29 Tangent Space Maps of Right-Loop Isometric map plot Isometric map plot cos γ 0 cos γ j j

30 Tangent Space Maps of Whorl Isometric map plot Isometric map plot cos γ 0 cos γ j j

31 Tangent Space Maps of Arch Isometric map plot Isometric map plot cos γ 0 cos γ j j

32 Tangent Space Isometries of OFFCs The number of zero crossings, and values of local maxima and minima between zero crossings are the salient features Left- and right-loops are differentiated based on sign changes U x * U y of the tangent vector (U x,u y ) Left-loops are characterized by sign transitions of from +1 to -1 and back to +1. Right-loops are characterized by sign transitions of from -1 to +1 and back to -1 Note that these features are invariant to rotation, translation and scale

33 Fingerprint Classification Rules Classify each OFFC as whorl, left-loop, right-loop or arch using the tangent space isometric maps Let N w, N l, N r and N a denote the number of OFFCs classified as whorl, left-loop, right-loop and arch Select thresholds λ w, λ l, and λ r. The classification rule is If N w > λ w, classify as Whorl; Else: If N l > λ l and N r λ r, classify as Left-loop; If N l λ l and N r > λ r, classify as Right-loop; If N l λ l and N r λ r, classify as Arch

34 Classification Results Experiments were conducted on the NIST 4 fingerprint database containing 4,000 8-bit gray scale fingerprint images Select λ w = 2, λ l = 2 and λ r = 1 Classification into 4 classes yielded an accuracy of 94.4% Assigned Class True class A L R W A T total accuracy % % L % R % W %

35 Examples of Correct Classifications

36 Sources of Classification Errors Oversmoothing of the orientation field True class: L; Assigned class: A

37 Sources of Classification Errors Detection of spurious loops True class: A; Assigned class: L

38 Summary and Future Work We have proposed a fingerprint classification scheme based on the flow curves derived from the orientation field Performance of the proposed approach is comparable with the other state-of-the-art methods We plan to extend the 4-class classification to the 5- and 7- class problems by including other features of OFFCs into our classification procedure Other indexing techniques, besides the Henry system, will be investigated based on relevant features of the OFFCs

Fingerprint s Core Point Detection using Gradient Field Mask Ashish Mishra Assistant Professor Dept. of Computer Science, GGCT, Jabalpur, [M.P.], Dr.Madhu Shandilya Associate Professor Dept. of Electronics.MANIT,Bhopal[M.P.]

### A responsive Fingerprint Matching system for a scalable functional agent

A responsive Fingerprint Matching system for a scalable functional agent N. Nagaraju Research Scholar, PACE Institute of Technology & Sciences Ongole. ABSTRACT The Fingerprint Matching is that the most

### Fingerprint recognition using fingerprint model

International Journal of Engineering and Technical Research (IJETR) Fingerprint recognition using fingerprint model Suman Sankhla, Sunil Sharma, Naveen Jain Abstract Nowadays, fingerprint recognisation

### Fingerprint recognition using standardized fingerprint model

ISSN (Online): 1694-0784 ISSN (Print): 1694-0814 11 Fingerprint recognition using standardized fingerprint model Le Hoang Thai 1 and Ha Nhat Tam 2 1 Faculty of Information Technology, University of Science

### Fingerprint Recognition

IIT Kanpur Fingerprint Recognition CS676: Image Processing and Computer Vision Written By- Vinay Gupta Y6534, & Rohit Singh Y6400 Fingerprint recognition Introduction Fingerprint recognition or fingerprint

### Cross-correlation Based Algorithm for Fingerprint recognition Using MATLAB

International Journal of Engineering and Technical Research (IJETR) ISSN: 2321-0869, Volume-2, Issue-3, March 2014 Cross-correlation Based Algorithm for Fingerprint recognition Using MATLAB Miss.Arti Sandbhor,

### Isometries of the Plane Teacher s Notes

Isometries of the Plane Teacher s Notes Henri Picciotto This unit is intended to be consistent with the Common Core State Standards for Mathematics (CCSSM), but it does go quite a bit further than is required

### 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,

### High Resolution Fingerprint Matching Using Level 3 Features

High Resolution Fingerprint Matching Using Level 3 Features Anil K. Jain and Yi Chen Michigan State University Fingerprint Features Latent print examiners use Level 3 all the time We do not just count

### SWGFAST. Defining Level Three Detail

SWGFAST Defining Level Three Detail ANSI / NIST Workshop Data Format for the Interchange of Fingerprint, Facial, & Scar Mark & Tattoo (SMT) Information April 26-28,2005 28,2005 Defining Level Three Detail

### Palmprint Recognition. By Sree Rama Murthy kora Praveen Verma Yashwant Kashyap

Palmprint Recognition By Sree Rama Murthy kora Praveen Verma Yashwant Kashyap Palm print Palm Patterns are utilized in many applications: 1. To correlate palm patterns with medical disorders, e.g. genetic

### Interactive Math Glossary Terms and Definitions

Terms and Definitions Absolute Value the magnitude of a number, or the distance from 0 on a real number line Additive Property of Area the process of finding an the area of a shape by totaling the areas

### jorge s. marques image processing

image processing images images: what are they? what is shown in this image? What is this? what is an image images describe the evolution of physical variables (intensity, color, reflectance, condutivity)

### Centroid Distance Function and the Fourier Descriptor with Applications to Cancer Cell Clustering

Centroid Distance Function and the Fourier Descriptor with Applications to Cancer Cell Clustering By, Swati Bhonsle Alissa Klinzmann Mentors Fred Park Department of Mathematics Ernie Esser Department of

### Map Patterns and Finding the Strike and Dip from a Mapped Outcrop of a Planar Surface

Map Patterns and Finding the Strike and Dip from a Mapped Outcrop of a Planar Surface Topographic maps represent the complex curves of earth s surface with contour lines that represent the intersection

### Part-Based Recognition

Part-Based Recognition Benedict Brown CS597D, Fall 2003 Princeton University CS 597D, Part-Based Recognition p. 1/32 Introduction Many objects are made up of parts It s presumably easier to identify simple

### Fingerprint Verification Using SIFT Features

Fingerprint Verification Using SIFT Features Unsang Park* a, Sharath Pankanti a, A. K. Jain b a IBM T. J. Watson Research Center, Hawthorne, NY, USA 10532; b Dept. of Computer Science & Engineering, Michigan

### J. P. Oakley and R. T. Shann. Department of Electrical Engineering University of Manchester Manchester M13 9PL U.K. Abstract

A CURVATURE SENSITIVE FILTER AND ITS APPLICATION IN MICROFOSSIL IMAGE CHARACTERISATION J. P. Oakley and R. T. Shann Department of Electrical Engineering University of Manchester Manchester M13 9PL U.K.

### GEOMETRY COMMON CORE STANDARDS

1st Nine Weeks Experiment with transformations in the plane G-CO.1 Know precise definitions of angle, circle, perpendicular line, parallel line, and line segment, based on the undefined notions of point,

### Physics 235 Chapter 1. Chapter 1 Matrices, Vectors, and Vector Calculus

Chapter 1 Matrices, Vectors, and Vector Calculus In this chapter, we will focus on the mathematical tools required for the course. The main concepts that will be covered are: Coordinate transformations

### REVISED GCSE Scheme of Work Mathematics Higher Unit 6. For First Teaching September 2010 For First Examination Summer 2011 This Unit Summer 2012

REVISED GCSE Scheme of Work Mathematics Higher Unit 6 For First Teaching September 2010 For First Examination Summer 2011 This Unit Summer 2012 Version 1: 28 April 10 Version 1: 28 April 10 Unit T6 Unit

### PARTIAL FINGERPRINT REGISTRATION FOR FORENSICS USING MINUTIAE-GENERATED ORIENTATION FIELDS

PARTIAL FINGERPRINT REGISTRATION FOR FORENSICS USING MINUTIAE-GENERATED ORIENTATION FIELDS Ram P. Krish 1, Julian Fierrez 1, Daniel Ramos 1, Javier Ortega-Garcia 1, Josef Bigun 2 1 Biometric Recognition

### Solving Simultaneous Equations and Matrices

Solving Simultaneous Equations and Matrices The following represents a systematic investigation for the steps used to solve two simultaneous linear equations in two unknowns. The motivation for considering

### Automatic 3D Reconstruction via Object Detection and 3D Transformable Model Matching CS 269 Class Project Report

Automatic 3D Reconstruction via Object Detection and 3D Transformable Model Matching CS 69 Class Project Report Junhua Mao and Lunbo Xu University of California, Los Angeles mjhustc@ucla.edu and lunbo

### 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

### 2D Geometric Transformations. COMP 770 Fall 2011

2D Geometric Transformations COMP 770 Fall 2011 1 A little quick math background Notation for sets, functions, mappings Linear transformations Matrices Matrix-vector multiplication Matrix-matrix multiplication

### 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

### Chapter 17. Orthogonal Matrices and Symmetries of Space

Chapter 17. Orthogonal Matrices and Symmetries of Space Take a random matrix, say 1 3 A = 4 5 6, 7 8 9 and compare the lengths of e 1 and Ae 1. The vector e 1 has length 1, while Ae 1 = (1, 4, 7) has length

### REVISED GCSE Scheme of Work Mathematics Higher Unit T3. For First Teaching September 2010 For First Examination Summer 2011

REVISED GCSE Scheme of Work Mathematics Higher Unit T3 For First Teaching September 2010 For First Examination Summer 2011 Version 1: 28 April 10 Version 1: 28 April 10 Unit T3 Unit T3 This is a working

### Lecture L3 - Vectors, Matrices and Coordinate Transformations

S. Widnall 16.07 Dynamics Fall 2009 Lecture notes based on J. Peraire Version 2.0 Lecture L3 - Vectors, Matrices and Coordinate Transformations By using vectors and defining appropriate operations between

### Polygonal Approximation of Closed Curves across Multiple Views

Polygonal Approximation of Closed Curves across Multiple Views M. Pawan Kumar Saurabh Goyal C. V. Jawahar P. J. Narayanan Centre for Visual Information Technology International Institute of Information

### THREE APPROACHES FOR FACE RECOGNITION

THREE APPROACHES FOR FACE RECOGNITION V.V. Starovoitov 1, D.I Samal 1, D.V. Briliuk 1 The face recognition problem is studied. Face normalization procedure is presented. Methods of face recognition such

### 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

### SWGFAST Glossary - Classification

SWGFAST Glossary - Classification APPENDAGE An attachment or connection within friction ridges. ARCH - PLAIN A fingerprint pattern in which the ridges enter on one side of the impression, and flow, or

### Reflection and Refraction

Equipment Reflection and Refraction Acrylic block set, plane-concave-convex universal mirror, cork board, cork board stand, pins, flashlight, protractor, ruler, mirror worksheet, rectangular block worksheet,

### Computer Graphics. Geometric Modeling. Page 1. Copyright Gotsman, Elber, Barequet, Karni, Sheffer Computer Science - Technion. An Example.

An Example 2 3 4 Outline Objective: Develop methods and algorithms to mathematically model shape of real world objects Categories: Wire-Frame Representation Object is represented as as a set of points

### Senior Secondary Australian Curriculum

Senior Secondary Australian Curriculum Mathematical Methods Glossary Unit 1 Functions and graphs Asymptote A line is an asymptote to a curve if the distance between the line and the curve approaches zero

### Computer Graphics Prof. Sukhendu Das Dept. of Computer Science and Engineering Indian Institute of Technology, Madras Lecture 7 Transformations in 2-D

Computer Graphics Prof. Sukhendu Das Dept. of Computer Science and Engineering Indian Institute of Technology, Madras Lecture 7 Transformations in 2-D Welcome everybody. We continue the discussion on 2D

### SbLRS: Shape based Leaf Retrieval System

SbLRS: Shape based Leaf Retrieval System Komal Asrani Department of Information Technology B.B.D.E.C., Lucknow, India Renu Jain Deptt. of C.S.E University Institute of Engineering and Technology, Kanpur,

### Introduction to Pattern Recognition

Introduction to Pattern Recognition Selim Aksoy Department of Computer Engineering Bilkent University saksoy@cs.bilkent.edu.tr CS 551, Spring 2009 CS 551, Spring 2009 c 2009, Selim Aksoy (Bilkent University)

### INTRODUCTION TO NEURAL NETWORKS

INTRODUCTION TO NEURAL NETWORKS Pictures are taken from http://www.cs.cmu.edu/~tom/mlbook-chapter-slides.html http://research.microsoft.com/~cmbishop/prml/index.htm By Nobel Khandaker Neural Networks An

### Signature Segmentation from Machine Printed Documents using Conditional Random Field

2011 International Conference on Document Analysis and Recognition Signature Segmentation from Machine Printed Documents using Conditional Random Field Ranju Mandal Computer Vision and Pattern Recognition

### Depth from a single camera

Depth from a single camera Fundamental Matrix Essential Matrix Active Sensing Methods School of Computer Science & Statistics Trinity College Dublin Dublin 2 Ireland www.scss.tcd.ie 1 1 Geometry of two

### Intrinsic Geometry. 2 + g 22. du dt. 2 du. Thus, very short distances ds on the surface can be approximated by

Intrinsic Geometry The Fundamental Form of a Surface Properties of a curve or surface which depend on the coordinate space that curve or surface is embedded in are called extrinsic properties of the curve.

### Comparison of Non-linear Dimensionality Reduction Techniques for Classification with Gene Expression Microarray Data

CMPE 59H Comparison of Non-linear Dimensionality Reduction Techniques for Classification with Gene Expression Microarray Data Term Project Report Fatma Güney, Kübra Kalkan 1/15/2013 Keywords: Non-linear

### Efficient on-line Signature Verification System

International Journal of Engineering & Technology IJET-IJENS Vol:10 No:04 42 Efficient on-line Signature Verification System Dr. S.A Daramola 1 and Prof. T.S Ibiyemi 2 1 Department of Electrical and Information

### MULTIMODAL BIOMETRICS IN IDENTITY MANAGEMENT

International Journal of Information Technology and Knowledge Management January-June 2012, Volume 5, No. 1, pp. 111-115 MULTIMODAL BIOMETRICS IN IDENTITY MANAGEMENT A. Jaya Lakshmi 1, I. Ramesh Babu 2,

### with functions, expressions and equations which follow in units 3 and 4.

Grade 8 Overview View unit yearlong overview here The unit design was created in line with the areas of focus for grade 8 Mathematics as identified by the Common Core State Standards and the PARCC Model

### Chapter 5 Polar Coordinates; Vectors 5.1 Polar coordinates 1. Pole and polar axis

Chapter 5 Polar Coordinates; Vectors 5.1 Polar coordinates 1. Pole and polar axis 2. Polar coordinates A point P in a polar coordinate system is represented by an ordered pair of numbers (r, θ). If r >

### Signal Processing for Speech Recognition

Signal Processing for Speech Recognition Once a signal has been sampled, we have huge amounts of data, often 20,000 16 bit numbers a second! We need to find ways to concisely capture the properties of

### A QUICK GUIDE TO THE FORMULAS OF MULTIVARIABLE CALCULUS

A QUIK GUIDE TO THE FOMULAS OF MULTIVAIABLE ALULUS ontents 1. Analytic Geometry 2 1.1. Definition of a Vector 2 1.2. Scalar Product 2 1.3. Properties of the Scalar Product 2 1.4. Length and Unit Vectors

### Modelling, Extraction and Description of Intrinsic Cues of High Resolution Satellite Images: Independent Component Analysis based approaches

Modelling, Extraction and Description of Intrinsic Cues of High Resolution Satellite Images: Independent Component Analysis based approaches PhD Thesis by Payam Birjandi Director: Prof. Mihai Datcu Problematic

### Computer Vision: Filtering

Computer Vision: Filtering Raquel Urtasun TTI Chicago Jan 10, 2013 Raquel Urtasun (TTI-C) Computer Vision Jan 10, 2013 1 / 82 Today s lecture... Image formation Image Filtering Raquel Urtasun (TTI-C) Computer

### 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

### Towards Online Recognition of Handwritten Mathematics

Towards Online Recognition of Handwritten Mathematics Vadim Mazalov, joint work with Oleg Golubitsky and Stephen M. Watt Ontario Research Centre for Computer Algebra Department of Computer Science Western

### 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.

### Simultaneous Gamma Correction and Registration in the Frequency Domain

Simultaneous Gamma Correction and Registration in the Frequency Domain Alexander Wong a28wong@uwaterloo.ca William Bishop wdbishop@uwaterloo.ca Department of Electrical and Computer Engineering University

### DIFFERENTIAL GEOMETRY HW 2

DIFFERENTIAL GEOMETRY HW 2 CLAY SHONKWILER 2 Prove that the only orientation-reversing isometries of R 2 are glide reflections, that any two glide-reflections through the same distance are conjugate by

Academic Content Standards Grade Eight and Grade Nine Ohio Algebra 1 2008 Grade Eight STANDARDS Number, Number Sense and Operations Standard Number and Number Systems 1. Use scientific notation to express

### MA 323 Geometric Modelling Course Notes: Day 02 Model Construction Problem

MA 323 Geometric Modelling Course Notes: Day 02 Model Construction Problem David L. Finn November 30th, 2004 In the next few days, we will introduce some of the basic problems in geometric modelling, and

### Chapter 10 Rotational Motion. Copyright 2009 Pearson Education, Inc.

Chapter 10 Rotational Motion Angular Quantities Units of Chapter 10 Vector Nature of Angular Quantities Constant Angular Acceleration Torque Rotational Dynamics; Torque and Rotational Inertia Solving Problems

### Digital Imaging and Multimedia. Filters. Ahmed Elgammal Dept. of Computer Science Rutgers University

Digital Imaging and Multimedia Filters Ahmed Elgammal Dept. of Computer Science Rutgers University Outlines What are Filters Linear Filters Convolution operation Properties of Linear Filters Application

### Multimodal Biometric Recognition Security System

Multimodal Biometric Recognition Security System Anju.M.I, G.Sheeba, G.Sivakami, Monica.J, Savithri.M Department of ECE, New Prince Shri Bhavani College of Engg. & Tech., Chennai, India ABSTRACT: Security

### Section 9.1 Vectors in Two Dimensions

Section 9.1 Vectors in Two Dimensions Geometric Description of Vectors A vector in the plane is a line segment with an assigned direction. We sketch a vector as shown in the first Figure below with an

### 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

### Recognition of Handwritten Digits using Structural Information

Recognition of Handwritten Digits using Structural Information Sven Behnke Martin-Luther University, Halle-Wittenberg' Institute of Computer Science 06099 Halle, Germany { behnke Irojas} @ informatik.uni-halle.de

### The calibration problem was discussed in details during lecture 3.

1 2 The calibration problem was discussed in details during lecture 3. 3 Once the camera is calibrated (intrinsics are known) and the transformation from the world reference system to the camera reference

### Modified Sift Algorithm for Appearance Based Recognition of American Sign Language

Modified Sift Algorithm for Appearance Based Recognition of American Sign Language Jaspreet Kaur,Navjot Kaur Electronics and Communication Engineering Department I.E.T. Bhaddal, Ropar, Punjab,India. Abstract:

### Lecture 14. Point Spread Function (PSF)

Lecture 14 Point Spread Function (PSF), Modulation Transfer Function (MTF), Signal-to-noise Ratio (SNR), Contrast-to-noise Ratio (CNR), and Receiver Operating Curves (ROC) Point Spread Function (PSF) Recollect

### KEANSBURG SCHOOL DISTRICT KEANSBURG HIGH SCHOOL Mathematics Department. HSPA 10 Curriculum. September 2007

KEANSBURG HIGH SCHOOL Mathematics Department HSPA 10 Curriculum September 2007 Written by: Karen Egan Mathematics Supervisor: Ann Gagliardi 7 days Sample and Display Data (Chapter 1 pp. 4-47) Surveys and

### APPLYING COMPUTER VISION TECHNIQUES TO TOPOGRAPHIC OBJECTS

APPLYING COMPUTER VISION TECHNIQUES TO TOPOGRAPHIC OBJECTS Laura Keyes, Adam Winstanley Department of Computer Science National University of Ireland Maynooth Co. Kildare, Ireland lkeyes@cs.may.ie, Adam.Winstanley@may.ie

### An Implementation of Leaf Recognition System using Leaf Vein and Shape

An Implementation of Leaf Recognition System using Leaf Vein and Shape Kue-Bum Lee and Kwang-Seok Hong College of Information and Communication Engineering, Sungkyunkwan University, 300, Chunchun-dong,

### A Complete Gradient Clustering Algorithm for Features Analysis of X-ray Images

A Complete Gradient Clustering Algorithm for Features Analysis of X-ray Images Małgorzata Charytanowicz, Jerzy Niewczas, Piotr A. Kowalski, Piotr Kulczycki, Szymon Łukasik, and Sławomir Żak Abstract Methods

### parametric spline curves

parametric spline curves 1 curves used in many contexts fonts (2D) animation paths (3D) shape modeling (3D) different representation implicit curves parametric curves (mostly used) 2D and 3D curves are

### Supervised Feature Selection & Unsupervised Dimensionality Reduction

Supervised Feature Selection & Unsupervised Dimensionality Reduction Feature Subset Selection Supervised: class labels are given Select a subset of the problem features Why? Redundant features much or

### Subspace Analysis and Optimization for AAM Based Face Alignment

Subspace Analysis and Optimization for AAM Based Face Alignment Ming Zhao Chun Chen College of Computer Science Zhejiang University Hangzhou, 310027, P.R.China zhaoming1999@zju.edu.cn Stan Z. Li Microsoft

### Section 12.1 Translations and Rotations

Section 12.1 Translations and Rotations Any rigid motion that preserves length or distance is an isometry (meaning equal measure ). In this section, we will investigate two types of isometries: translations

### Leaf recognition for plant classification using GLCM and PCA methods

Oriental Journal of Computer Science & Technology Vol. 3(1), 31-36 (2010) Leaf recognition for plant classification using GLCM and PCA methods ABDOLVAHAB EHSANIRAD and SHARATH KUMAR Y. H. Department of

### 11. Rotation Translational Motion: Rotational Motion:

11. Rotation Translational Motion: Motion of the center of mass of an object from one position to another. All the motion discussed so far belongs to this category, except uniform circular motion. Rotational

### Digital image processing

Digital image processing The two-dimensional discrete Fourier transform and applications: image filtering in the frequency domain Introduction Frequency domain filtering modifies the brightness values

### PSS 27.2 The Electric Field of a Continuous Distribution of Charge

Chapter 27 Solutions PSS 27.2 The Electric Field of a Continuous Distribution of Charge Description: Knight Problem-Solving Strategy 27.2 The Electric Field of a Continuous Distribution of Charge is illustrated.

### Name Geometry Exam Review #1: Constructions and Vocab

Name Geometry Exam Review #1: Constructions and Vocab Copy an angle: 1. Place your compass on A, make any arc. Label the intersections of the arc and the sides of the angle B and C. 2. Compass on A, make

### Neural Networks. CAP5610 Machine Learning Instructor: Guo-Jun Qi

Neural Networks CAP5610 Machine Learning Instructor: Guo-Jun Qi Recap: linear classifier Logistic regression Maximizing the posterior distribution of class Y conditional on the input vector X Support vector

### CALIBRATION OF A ROBUST 2 DOF PATH MONITORING TOOL FOR INDUSTRIAL ROBOTS AND MACHINE TOOLS BASED ON PARALLEL KINEMATICS

CALIBRATION OF A ROBUST 2 DOF PATH MONITORING TOOL FOR INDUSTRIAL ROBOTS AND MACHINE TOOLS BASED ON PARALLEL KINEMATICS E. Batzies 1, M. Kreutzer 1, D. Leucht 2, V. Welker 2, O. Zirn 1 1 Mechatronics Research

### THREE DIMENSIONAL GEOMETRY

Chapter 8 THREE DIMENSIONAL GEOMETRY 8.1 Introduction In this chapter we present a vector algebra approach to three dimensional geometry. The aim is to present standard properties of lines and planes,

### 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.

### The Not-Formula Book for C1

Not The Not-Formula Book for C1 Everything you need to know for Core 1 that won t be in the formula book Examination Board: AQA Brief This document is intended as an aid for revision. Although it includes

### Electrical Resonance

Electrical Resonance (R-L-C series circuit) APPARATUS 1. R-L-C Circuit board 2. Signal generator 3. Oscilloscope Tektronix TDS1002 with two sets of leads (see Introduction to the Oscilloscope ) INTRODUCTION

### 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

### CSE 167: Lecture 13: Bézier Curves. Jürgen P. Schulze, Ph.D. University of California, San Diego Fall Quarter 2011

CSE 167: Introduction to Computer Graphics Lecture 13: Bézier Curves Jürgen P. Schulze, Ph.D. University of California, San Diego Fall Quarter 2011 Announcements Homework project #6 due Friday, Nov 18

### Position, Velocity, and Acceleration

Chapter 2 Position, Velocity, and Acceleration In this section, we will define the first set of quantities (position, velocity, and acceleration) that will form a foundation for most of what we do in this

### 13.4 THE CROSS PRODUCT

710 Chapter Thirteen A FUNDAMENTAL TOOL: VECTORS 62. Use the following steps and the results of Problems 59 60 to show (without trigonometry) that the geometric and algebraic definitions of the dot product

### A Simple Feature Extraction Technique of a Pattern By Hopfield Network

A Simple Feature Extraction Technique of a Pattern By Hopfield Network A.Nag!, S. Biswas *, D. Sarkar *, P.P. Sarkar *, B. Gupta **! Academy of Technology, Hoogly - 722 *USIC, University of Kalyani, Kalyani

### Structural Axial, Shear and Bending Moments

Structural Axial, Shear and Bending Moments Positive Internal Forces Acting Recall from mechanics of materials that the internal forces P (generic axial), V (shear) and M (moment) represent resultants

### Students will understand 1. use numerical bases and the laws of exponents

Grade 8 Expressions and Equations Essential Questions: 1. How do you use patterns to understand mathematics and model situations? 2. What is algebra? 3. How are the horizontal and vertical axes related?

### Common Core Unit Summary Grades 6 to 8

Common Core Unit Summary Grades 6 to 8 Grade 8: Unit 1: Congruence and Similarity- 8G1-8G5 rotations reflections and translations,( RRT=congruence) understand congruence of 2 d figures after RRT Dilations

### Metrics on SO(3) and Inverse Kinematics

Mathematical Foundations of Computer Graphics and Vision Metrics on SO(3) and Inverse Kinematics Luca Ballan Institute of Visual Computing Optimization on Manifolds Descent approach d is a ascent direction

### Edge detection. (Trucco, Chapt 4 AND Jain et al., Chapt 5) -Edges are significant local changes of intensity in an image.

Edge detection (Trucco, Chapt 4 AND Jain et al., Chapt 5) Definition of edges -Edges are significant local changes of intensity in an image. -Edges typically occur on the boundary between two different