Biometric ROC Curves Methods of Deriving Biometric Receiver Operating Characteristic Curves from the Nearest Neighbor Classifier Robert Zack dissertation.

Slides:



Advertisements
Similar presentations
Principles of Density Estimation
Advertisements

Parametric measures to estimate and predict performance of identification techniques Amos Y. Johnson & Aaron Bobick STATISTICAL METHODS FOR COMPUTATIONAL.
Overview of biometric technology. Contents: 1. What is Biometrics The term “biometrics” is derived from the Greek words “bio” (life) and “metrics” (to.
K-NEAREST NEIGHBORS AND DECISION TREE Nonparametric Supervised Learning.
© Tan,Steinbach, Kumar Introduction to Data Mining 4/18/ Other Classification Techniques 1.Nearest Neighbor Classifiers 2.Support Vector Machines.
Chapter 9 Creating and Maintaining Database Presented by Zhiming Liu Instructor: Dr. Bebis.
Lecture 3 Nonparametric density estimation and classification
Biometrics & Security Tutorial 7. 1 (a) Please compare two different kinds of biometrics technologies: Retina and Iris. (P8:2-3)
Pattern Classification All materials in these slides were taken from Pattern Classification (2nd ed) by R. O. Duda, P. E. Hart and D. G. Stork, John Wiley.
Robert S. Zack May 8, 2010 METHODS OF DERIVING BIOMETRIC ROC CURVES FROM THE k-NN CLASSIFIER.
Keystroke Biometric : ROC Experiments Team Abhishek Kanchan Priyanka Ranadive Sagar Desai Pooja Malhotra Ning Wang.
CS Team 5 Alex Wong Raheel Khan Rumeiz Hasseem Swati Bharati Biometric Authentication System.
Pattern Classification All materials in these slides were taken from Pattern Classification (2nd ed) by R. O. Duda, P. E. Hart and D. G. Stork, John Wiley.
Generic Object Detection using Feature Maps Oscar Danielsson Stefan Carlsson
Keystroke Biometric Studies Security Research at Pace Keystroke Biometric Drs. Charles Tappert and Allen Stix Seidenberg School of CSIS.
Keystroke Biometric Studies Assignment 2 – Review of the Literature Case Study – Keystroke Biometric Describe problem investigated (intro + abstract) Developed.
Statistical Decision Theory, Bayes Classifier
CSE803 Fall Pattern Recognition Concepts Chapter 4: Shapiro and Stockman How should objects be represented? Algorithms for recognition/matching.
Keystroke Biometrics Test Taker Setup and Data Collection Fall 2009.
Keystroke Biometric Studies Keystroke Biometric Identification and Authentication on Long-Text Input Book chapter in Behavioral Biometrics for Human Identification.
Chapter 11 Integration Information Instructor: Prof. G. Bebis Represented by Reza Fall 2005.
Robert S. Zack, Charles C. Tappert, and Sung-Hyuk Cha Pace University, New York Performance of a Long-Text-Input Keystroke Biometric Authentication System.
ICASSP'06 1 S. Y. Kung 1 and M. W. Mak 2 1 Dept. of Electrical Engineering, Princeton University 2 Dept. of Electronic and Information Engineering, The.
05/06/2005CSIS © M. Gibbons On Evaluating Open Biometric Identification Systems Spring 2005 Michael Gibbons School of Computer Science & Information Systems.
Stockman CSE803 Fall Pattern Recognition Concepts Chapter 4: Shapiro and Stockman How should objects be represented? Algorithms for recognition/matching.
METU Informatics Institute Min 720 Pattern Classification with Bio-Medical Applications PART 2: Statistical Pattern Classification: Optimal Classification.
Pattern Recognition: Baysian Decision Theory Charles Tappert Seidenberg School of CSIS, Pace University.
CPSC 601 Lecture Week 5 Hand Geometry. Outline: 1.Hand Geometry as Biometrics 2.Methods Used for Recognition 3.Illustrations and Examples 4.Some Useful.
Introduction to Biometrics Charles Tappert Seidenberg School of CSIS, Pace University.
COMMON EVALUATION FINAL PROJECT Vira Oleksyuk ECE 8110: Introduction to machine Learning and Pattern Recognition.
Keystroke Biometric System Client: Dr. Mary Villani Instructor: Dr. Charles Tappert Team 4 Members: Michael Wuench ; Mingfei Bi ; Evelin Urbaez ; Shaji.
Keystroke Biometrics Studies on a Variety of Short and Long Text and Numeric Input Ned Bakelman, DPS Candidate Charles C. Tappert, PhD, Advisor Seidenberg.
1 Pattern Recognition Concepts How should objects be represented? Algorithms for recognition/matching * nearest neighbors * decision tree * decision functions.
User Authentication Using Keystroke Dynamics Jeff Hieb & Kunal Pharas ECE 614 Spring 2005 University of Louisville.
Nearest Neighbor (NN) Rule & k-Nearest Neighbor (k-NN) Rule Non-parametric : Can be used with arbitrary distributions, No need to assume that the form.
Selim Akyokus AIA /2/ AIA 2007 ENHANCED PASSWORD AUTENTICATION THROUGH KEYSTROKE TYPING CHARACTERISTICS Ozlem Guven(1), Selim Akyokus(1),
Keystroke Biometrics Studies on a Variety of Short and Long Text and Numeric Input Ned Bakelman, DPS Candidate Charles C. Tappert, PhD, Advisor Seidenberg.
Learning Theory Reza Shadmehr Linear and quadratic decision boundaries Kernel estimates of density Missing data.
Detection, Classification and Tracking in a Distributed Wireless Sensor Network Presenter: Hui Cao.
1 E. Fatemizadeh Statistical Pattern Recognition.
1 Pattern Recognition Pattern recognition is: 1. A research area in which patterns in data are found, recognized, discovered, …whatever. 2. A catchall.
A Bootstrap Interval Estimator for Bayes’ Classification Error Chad M. Hawes a,b, Carey E. Priebe a a The Johns Hopkins University, Dept of Applied Mathematics.
Speaker Verification Speaker verification uses voice as a biometric to determine the authenticity of a user. Speaker verification systems consist of two.
Designing multiple biometric systems: Measure of ensemble effectiveness Allen Tang NTUIM.
1 Iris Recognition Ying Sun AICIP Group Meeting November 3, 2006.
ECE 471/571 – Lecture 6 Dimensionality Reduction – Fisher’s Linear Discriminant 09/08/15.
Pattern Classification All materials in these slides were taken from Pattern Classification (2nd ed) by R. O. Duda, P. E. Hart and D. G. Stork, John Wiley.
Biometric for Network Security. Finger Biometrics.
Chapter 20 Classification and Estimation Classification – Feature selection Good feature have four characteristics: –Discrimination. Features.
Chapter 13 (Prototype Methods and Nearest-Neighbors )
I can be You: Questioning the use of Keystroke Dynamics as Biometrics Tey Chee Meng, Payas Gupta, Debin Gao Ke Chen.
Machine Learning ICS 178 Instructor: Max Welling Supervised Learning.
Eick: kNN kNN: A Non-parametric Classification and Prediction Technique Goals of this set of transparencies: 1.Introduce kNN---a popular non-parameric.
Debrup Chakraborty Non Parametric Methods Pattern Recognition and Machine Learning.
13 Nonparametric Methods Introduction So far the underlying probability distribution functions (pdf) are assumed to be known, such as SND, t-distribution,
Classification Methods
Keystroke Biometric Studies
Nonparametric Density Estimation – k-nearest neighbor (kNN) 02/20/17
MIRA, SVM, k-NN Lirong Xia. MIRA, SVM, k-NN Lirong Xia.
Performance Evaluation 02/15/17
Pattern Classification All materials in these slides were taken from Pattern Classification (2nd ed) by R. O. Duda, P. E. Hart and D. G. Stork, John.
Performance Measures II
CSSE463: Image Recognition Day 11
Pattern Classification All materials in these slides were taken from Pattern Classification (2nd ed) by R. O. Duda, P. E. Hart and D. G. Stork, John.
Evaluation of a Stylometry System on Various Length Portions of Books
Multi-Biometrics: Fusing At The Classification Output Level Using Keystroke and Mouse Motion Features Todd Breuer, Paola Garcia Cardenas, Anu George, Hung.
ROC Curves Receiver Operating Characteristic (ROC) curves are used to determine the appropriate operating point of a system, the tradeoff between False.
Generally Discriminant Analysis
Mathematical Foundations of BME
MIRA, SVM, k-NN Lirong Xia. MIRA, SVM, k-NN Lirong Xia.
Presentation transcript:

Biometric ROC Curves Methods of Deriving Biometric Receiver Operating Characteristic Curves from the Nearest Neighbor Classifier Robert Zack dissertation work Also see Pace University CSIS Technical Report No. 268, November 2009 PDF Version

Biometric ROC Curves Receiver Operating Characteristic (ROC) Curves – A Quick Review Used for binary decisions Signal detection – signal / no signal Medical diagnosis – disease / no disease Biometric authentication – you are the person you claim to be / you are not In biometrics the ROC curve varies from FAR=1 & FRR=0 at one end to FAR=0 & FRR=1 at other FAR = False Accept Rate – the rate an imposter is falsely accepted FRR = False Reject Rate – the rate the correct person is falsely rejected

Biometric ROC Curves Standard Biometric ROC Curve

Biometric ROC Curves ROC curves easily obtained from parametric classification techniques As t varies from 0 to infinity. For a specific t, you get a specific point on the ROC. FAR varies from 0 to 1 and FRR from 1 to 0

Biometric ROC Curves Nearest Neighbor Non-Parametric Classification Technique Makes no assumptions about the data Data are not drawn from or fitted to probability distributions Test samples are classified based on distances to training samples No standard method of obtaining ROC curves

Biometric ROC Curves Nonparametric - k Nearest Neighbor (kNN) Pattern Classification Procedure Underlying prob. density function is: unknown and no form assumed Go directly to decision a function here k=5 Use odd numbers and take the majority Now, how can we get ROC curve?

Biometric ROC Curves Vector Difference Authentication Model Transforms biometric samples from a many-class problem feature space into a two- class problem in feature-distance space

Biometric ROC Curves ROC Curve Derivation from m-matching, k Nearest Neighbors Two procedures: vary m from 0 to infinity Unweighted m-match kNN (m-kNN) equal weight on all within-class matches Weighted m-match kNN (wm-kNN) heavier weights applied to closer matches first investigated linear weighting k, k-1, k-2, …, 1

Biometric ROC Curves ROC Curve Derivation from unweighted m-matching, k Nearest Neighbors W=Within B=Between Authenticate if m of the kNN within-class. m varies from 0 to k for points on ROC curve. All W’s are equal in weight. If m=0, all users accepted (FAR=1,FRR=0) If m=7, few users accepted (FAR=small, FRR=large).

Biometric ROC Curves ROC Curve Derivation from weighted m-matching, k Nearest Neighbors Authenticate if W choices > weighted match (m) m varies from 0 to n n= k(k+1)/2. Here, =28 weights of m vary from 7 to 1, with the closest having the highest weight. For every m, you have a FAR/FRR pair on ROC curve If n=0, all users accepted (FAR=1,FRR=0) If n=28, few users accepted FAR=small and FRR=large

Biometric ROC Curves FAR and FRR versus threshold m for unweighted m-kNN procedure for k = 10 DeskCopy (left) and LapFree (right) plots of FAR and FRR versus the threshold m for the unweighted m-kNN procedure for k = 10.

Biometric ROC Curves Keystroke Biometric ROC curves: unweighted and weighted methods for k = 10, 15, 20

Biometric ROC Curves ROC Curve Derivation using Distance Threshold from Questioned Sample When t = 0, no user authenticated, at ∞ all users authenticated Threshold t starts at 0, increments by 0.1, data exhausted at t=5 EER is about 15 at t=2 Key Finding: threshold method performs poorly

Biometric ROC Curves ROC Curve Derivation using Distance Threshold from Questioned Sample

Biometric ROC Curves Future Work Investigate two types of enrollment Weak enrollment (for which the system was designed) – the individuals being tested are not part of the training (initial enrollment) group, although reference enrollment samples are used in the authentication process Strong enrollment – the individuals being tested are part of the training (initial enrollment) group, and additional reference (enrollment) samples are used in the authentication process