Tutorial 3. Jun Xu, Teaching Asistant csjunxu/ February 16, COMP4134 Biometrics Authentication

Similar documents
Tutorial 5. Jun Xu, Teaching Asistant March 2, COMP4134 Biometrics Authentication

Image Processing. Image Features

(Refer Slide Time 00:17) Welcome to the course on Digital Image Processing. (Refer Slide Time 00:22)

CHAPTER 3. Preprocessing and Feature Extraction. Techniques

2. Basic Task of Pattern Classification

Learning to Learn: additional notes

Clustering Analysis based on Data Mining Applications Xuedong Fan

Character Recognition

Practical Image and Video Processing Using MATLAB

Digital Image Processing

Sensor Modalities. Sensor modality: Different modalities:

Big Ideas. Objects can be transferred in an infinite number of ways. Transformations can be described and analyzed mathematically.

2003/2010 ACOS MATHEMATICS CONTENT CORRELATION GRADE ACOS 2010 ACOS

Structural and Syntactic Pattern Recognition

Hierarchical Clustering

Invariant Recognition of Hand-Drawn Pictograms Using HMMs with a Rotating Feature Extraction

Arizona Academic Standards

L1 - Introduction. Contents. Introduction of CAD/CAM system Components of CAD/CAM systems Basic concepts of graphics programming

Mapping Common Core State Standard Clusters and. Ohio Grade Level Indicator. Grade 5 Mathematics

Engineering designs today are frequently

Points Lines Connected points X-Y Scatter. X-Y Matrix Star Plot Histogram Box Plot. Bar Group Bar Stacked H-Bar Grouped H-Bar Stacked

8. Automatic Content Analysis

GRADES 9/10. EALR 1: The student understands and applies the concepts and procedures of mathematics.

Geometry Sixth Grade

Introduction to Data Mining

Lesson 3: Surface Creation

CSE 573: Artificial Intelligence Autumn 2010

Intro to Artificial Intelligence

Fourth Grade Mathematics Goals

STATISTICS AND ANALYSIS OF SHAPE

3D Models and Matching

A Visualization Tool to Improve the Performance of a Classifier Based on Hidden Markov Models

SECTION SIX Teaching/ Learning Geometry. General Overview

Good Continuation of Boundary Contour

3 Nonlinear Regression

3D Models and Matching

Types of Edges. Why Edge Detection? Types of Edges. Edge Detection. Gradient. Edge Detection

Gaussian Processes for Robotics. McGill COMP 765 Oct 24 th, 2017

ELEC Dr Reji Mathew Electrical Engineering UNSW

CHAPTER 5 GLOBAL AND LOCAL FEATURES FOR FACE RECOGNITION

IMECE FUNCTIONAL INTERFACE-BASED ASSEMBLY MODELING

03 Vector Graphics. Multimedia Systems. 2D and 3D Graphics, Transformations

Houghton Mifflin MATHEMATICS Level 5 correlated to NCTM Standard

Expanding gait identification methods from straight to curved trajectories

Mathematics Grade 4 Operations and Algebraic Thinking Number and Operations in Base Ten Number and Operations- Fractions Measurement and Data

Multiplication and Division

Presents. The Common Core State Standards Checklist Grades 3-5

Facial Expression Detection Using Implemented (PCA) Algorithm

Ansoft HFSS Solids Menu

APS Sixth Grade Math District Benchmark Assessment NM Math Standards Alignment

Face Recognition using Eigenfaces SMAI Course Project

Classification. Vladimir Curic. Centre for Image Analysis Swedish University of Agricultural Sciences Uppsala University

PO 2. Identify irrational numbers. SE/TE: 4-8: Exploring Square Roots and Irrational Numbers, TECH: itext; PH Presentation Pro CD-ROM;

Roswell Independent School District Grade Level Targets Summer 2010

Improving the Discrimination Capability with an Adaptive Synthetic Discriminant Function Filter

Kinematics Fundamentals CREATING OF KINEMATIC CHAINS

PCA and KPCA algorithms for Face Recognition A Survey

Reducing Points In a Handwritten Curve (Improvement in a Note-taking Tool)

Big Mathematical Ideas and Understandings

Tutorial 8. Jun Xu, Teaching Asistant March 30, COMP4134 Biometrics Authentication

Task analysis based on observing hands and objects by vision

Performance Level Descriptors. Mathematics

Higher National Unit Specification. General information for centres. Unit title: CAD: 3D Modelling. Unit code: DW13 34

DTU M.SC. - COURSE EXAM Revised Edition

Using the Best of Both!

A New Approach for Shape Dissimilarity Retrieval Based on Curve Evolution and Ant Colony Optimization

Visualizing Regions of Integration in 2-D Cartesian Coordinates

Research in Computational Differential Geomet

Knowledge Discovery and Data Mining 1 (VO) ( )

UNIT PLAN. Big Idea/Theme: Polygons can be identified, classified, and described.

Cluster Analysis. Mu-Chun Su. Department of Computer Science and Information Engineering National Central University 2003/3/11 1

Vector Visualization

Nearest Neighbor Classifiers

Feature Detectors and Descriptors: Corners, Lines, etc.

COMP30019 Graphics and Interaction Transformation geometry and homogeneous coordinates

This blog addresses the question: how do we determine the intersection of two circles in the Cartesian plane?

Solid Modeling: Part 1

INSTRUCTIONS FOR THE USE OF THE SUPER RULE TM

Groveport Madison Local School District Third Grade Math Content Standards. Planning Sheets

Template Matching Rigid Motion

Escher s Circle Limit Anneke Bart Saint Louis University Introduction

GTPS Curriculum Grade 6 Math

Elemental Set Methods. David Banks Duke University

Case-Based Reasoning. CS 188: Artificial Intelligence Fall Nearest-Neighbor Classification. Parametric / Non-parametric.

CS 188: Artificial Intelligence Fall 2008

3D Object Recognition using Multiclass SVM-KNN

Lecture 15: Segmentation (Edge Based, Hough Transform)

Feature Selection. CE-725: Statistical Pattern Recognition Sharif University of Technology Spring Soleymani

Short Survey on Static Hand Gesture Recognition

Digital Image Processing Fundamentals

Feature Extractors. CS 188: Artificial Intelligence Fall Some (Vague) Biology. The Binary Perceptron. Binary Decision Rule.

CSE 6242 A / CS 4803 DVA. Feb 12, Dimension Reduction. Guest Lecturer: Jaegul Choo

Mathematics Grade 5. COMMON CORE STATE STANDARDS for MATHEMATICS

Clustering CS 550: Machine Learning

Head Frontal-View Identification Using Extended LLE

Foundation Level Learning Targets Version 2.2

Unit 2: Locomotion Kinematics of Wheeled Robots: Part 3

Evaluating Classifiers

X Std. Topic Content Expected Learning Outcomes Mode of Transaction

Ubiquitous Mathematical Graphic Viewer for Visually Impaired Students

Transcription:

Tutorial 3 Jun Xu, Teaching Asistant http://www4.comp.polyu.edu.hk/ csjunxu/ COMP4134 Biometrics Authentication February 16, 2017

Table of Contents Problems Problem 1: Answer the questions Problem 2: Pattern extraction Problem 3: Minimum-error classifier Problem 4: Classify

Outline Problems Problem 1: Answer the questions Problem 2: Pattern extraction Problem 3: Minimum-error classifier Problem 4: Classify

Problem 1.a What is Pattern? According to its definition in (P4:4-7), could you list some patterns in your daily life?

Problem 1.a Introduction: What is Pattern? A pattern is the form of representation of an objectively existed event or object. For instance, voice, image and character are patterns. There are many kinds of patterns -- visual patterns, temporal patterns, logical patterns. More broadly, any natural and social phenomenon may be considered as Patterns. We need to seek classification, recognition, or description of a pattern that is INVARIANT to some (known) changes or deviation in the pattern from the ideal case Pattern is a set of measurements or observations, represented in vector or matrix notation. Biometric Authentication Lecture 4-4

Problem 1.a Introduction: What is Pattern? Cloud patterns Iris patterns Animal coat patterns China pattern Biometric Authentication Lecture 4-5

Problem 1.a Introduction: What is Pattern? Biometric Authentication Lecture 4-6

Problem 1.a (a) Image pattern (b) Grid pattern (c) Character pattern (d) More extreme pattern Pattern Distortion In many situations a set of patterns from the same class may exhibit wide variations from a single exemplar of the class. Invariant features: rotated, scaled, and translated invariant. Biometric Authentication Lecture 4-7

Problem 1.b Pattern Recognition (PR) is defined in P4:8. Could you give some PR samples and tell which features you use?

Problem 1.b What is Pattern Recognition (PR)? A basic intelligent ability of human being or animal; Using a broad enough interpretation, we can find PR in every intelligent activity. For instance, you are able to recognize the number of classroom, which is the ability of number recognition, on the class you have to be able to understand what the teacher says and writes on the blackboard, this is the ability of speech and character recognition. From the system viewpoint, PR is an important component of intelligent systems. From the theoretical concept, PR is a mapping from feature space to class space. Biometric Authentication Lecture 4-8

Pattern Recognition Example Stories of the Soap Box and the Fan One very big cosmetics company in Japan received a complaint that a consumer had bought a soap box that was empty. Management of the company immediately traced the problem to the assembly line, that conveyed all the packaged boxes of soap to the delivery department. For some reason, one soap box went through the assembly line empty. Management asked its engineers to solve the problem. The engineers worked hard on the first solution that came to mind, using X-ray technology. They devised an X-ray machine with high-resolution monitors. Two workers were deployed full-time to monitor all the soap boxes that passed through the line to make sure they were not empty. They managed to solve the problem but it was an expensive solution.

Pattern Recognition Example Stories of the Soap Box and the fan Then one day, a new employee joined the company. He had previously worked in a small low-tech company. When posed with the same problem, he did not think of the X-ray machine. Instead, he bought a strong industrial electric fan and placed it facing the assembly line. He switched on the fan, and as soap boxes on the conveyor belt passed the fan, the empty ones were simply blown off the line. It was an effective and cheaper solution.

Problem 1.c In P4:11-13, a PR system is given. function in the system. Please understand each

Problem 1.c Pattern Data PR System Classification & Description Biometric Authentication Lecture 4-11

Problem 1.c PR System The design of a PR system essentially involves the following three aspects : 1) data acquisition and preprocessing; 2) data representation; 3) decision making. The problem domain dictates the choice of sensor, preprocessing technique, representation scheme, and the decision making model It is generally agreed that a well-defined and sufficiently constrained recognition problem (small intraclass variations and large interclass variations) will lead to a compact pattern representation and a simple decision making strategy. Biometric Authentication Lecture 4-12

Problem 1.c Sensor Image & Signal Processing Pattern Recognition Decision Theory Capturing Extracting Comparing Making Data Feature the features the decision PR System Biometric Authentication Lecture 4-13

Problem 1.d Understand the definitions related to PR: Classification, Recognition, Description, Pattern Class and Preprocessing (P4:14-15). Why classification and recognition require the different classes, c and c+1, respectively.

Problem 1.d Definitions Classification - Assigns input data into one of c prespecified classes based on extraction of significant features or attributes and the processing or analysis of these attributes. It is common to resort to probabilistic or grammatical models in classification. A Classifier partitions feature space into classlabeled decision regions. Recognition is the ability to classify. Often we formulate PR with a c + 1st class, corresponding to the unclassifiable or can t decide class. Description is an alternative to classification where a structural description of the input pattern is desired. It is common to resort to linguistic or structural models in description. Biometric Authentication Lecture 4-14

Problem 1.d Definitions Pattern class - A set of patterns (hopefully sharing some common attributes) known to originate from the same source. The key in many PR applications is to identify suitable attributes (e.g., features) and to form a good measure of similarity and an associating matching process. Preprocessing is the filtering or transforming of the raw input data to aid computational feasibility and feature extraction and minimize noise. Noise is a concept originating in communications theory. In PR, the concept is generalized to represent a number of non-ideal circumstances (including Distortions or errors in the input signal/pattern; Errors in preprocessing; Errors in feature extraction; Errors in training data) Biometric Authentication Lecture 4-15

Problem 1.e What is correlation between two vectors, x and y? Please use this definition in the function x m k (P4:34). How about orthogonal or uncorrelated between two vectors?

Problem 1.e Maximum when x and y point in the same direction Inner Products (2) Thus the norm of x (using the Euclidean metric) is given by x = sqrt( x' x ). Here are some important additional properties of inner products: x' y = y' x = x y cos( angle between x and y ) x' ( y + z ) = x' y + x' z. Thus, the inner product of x and y is maximum when the angle between them is zero, i.e., when one is just a positive multiple of the other. Sometimes we say (a little loosely) that x' y is the correlation between x and y, and that the correlation is maximum when x and y point in the same direction. If x' y = 0, the vectors x and y are said to be orthogonal or uncorrelated. Biometric Authentication Lecture 4-37

Problem 1.e Minimum-Distance Classifiers Template matching can easily be expressed mathematically. Let x be the feature vector for the unknown input, and let m1, m2,..., mc be templates (i.e., perfect, noise-free feature vectors) for the c classes. Then the error in matching x against mk is given by x - mk. Here u is called the norm of the vector u. A minimum-error classifier computes x - mk for k = 1 to c and chooses the class for which this error is minimum. Since x - mk is also the distance from x to mk, we call this a minimum-distance classifier. Clearly, a template matching system is a minimum-distance classifier. Biometric Authentication Lecture 4-34

Outline Problems Problem 1: Answer the questions Problem 2: Pattern extraction Problem 3: Minimum-error classifier Problem 4: Classify

Problem 2: Pattern extraction A 3-D example for pattern extraction is defined in P4: 16-18. There are four kinds of features are extracted. Please select these features according to some guidelines (P4: 27-28) to classify the given six objects.

Problem 2: Pattern extractionterms Pattern Extraction: GC Example Feature extraction using Generalized Cylinders (GC) for 3-D object description and classification The basis of GC models is the concept of a swept volume of 2- D area along a 3-D trajectory. A GC is a solid whose axis is a 3-D space curve. Usually the axis is perpendicular to the cross section. For example, the typical cylinder or can may be described by sweeping a circle along a line. We characterize a generalized cylinder (GC) by three parameters: 1. A planar cross section; 2. A three-dimensional curve or spine ; 3. A sweeping rule. Biometric Authentication Lecture 4-16

Problem 2: Pattern extractionterms Pattern Extraction: 3-D 3 D Example 3-D objects, defining the following features 1. A qualitative descriptor of the cross section edge curvature. This may either straight (S) or curved (C). 2. The cross section degree of symmetry, defined as : -- Invariant under reflection and rotation (Symm ++) -- Invariant under reflection only (Symm +) -- Asymmetric (Asymm). 3. The change of cross section as a function of sweep, defined as -- Constant (Const) -- Expanding (Exp) -- Contracting (Contr) -- Contracting then expanding (Contr-Exp) -- Expanding then contracting (Exp-Contr) 4. The degree of curvature of the spine. This may be straight (S) or curved (C). Biometric Authentication Lecture 4-17

Problem 2: Pattern extractionterms Pattern Extraction: 3-D 3 D Example Biometric Authentication Lecture 4-18

Problem 2: Pattern extractionterms Feature Selection It is the process of choosing input to PR system and involves judgment. It is important that the extracted features be relevant to the PR task at hand. It has to be addressed at the outset of any PR system design. To choose and to extract features that : 1. are computationally feasible; 2. lead to good PR system success; 3. reduce the problem data (e.g., raw measurements) into a manageable amount of information without discarding valuable (or vital) information Biometric Authentication Lecture 4-27

Problem 2: Pattern extractionterms Feature Selection In some cases there are mathematical tools that help in feature selection. In other cases simulation may help to choose appropriate possible features. Restrictions on measurement systems may limit the set of features. The level at which features are extracted determines the amount of necessary preprocessing and may influence the amount of error that is introduced into the extracted features The measurements may be a 2-Dimensional image, a drawing, a waveform, a set of measurements, a temporal or spatial history (sequence) of events, the state of a system, the arrangement of a set of objects, and so forth. Biometric Authentication Lecture 4-28 One possible selection: Edge+Symmetry+Axis

Outline Problems Problem 1: Answer the questions Problem 2: Pattern extraction Problem 3: Minimum-error classifier Problem 4: Classify

Problem 3: Minimum-error classifier A minimum-error classifier based on x m k is defined in P4:34. How to get a linear discriminant function, g(x) = m x 0.5 m in P4:39? Which difference between the following two classifiers using the approaches mentioned above.

Problem 3: Minimum-error classifier To find a k, which will get Min( x m k ) is equivalent to get the Min( x m k 2 ) Min( x m k 2 ) =(x m k ) (x m k ) =x x x m k m k x + m k m k =x x 2m k x + m k 2 =x x 2(m k x 0.5 m k 2 ) equivalent to Max(m k x 0.5 m k 2 ) so g(x) =m x 0.5 m 2

Problem 3: Minimum-error classifier Maximum when x and y point in the same direction Inner Products (2) Thus the norm of x (using the Euclidean metric) is given by x = sqrt( x' x ). Here are some important additional properties of inner products: x' y = y' x = x y cos( angle between x and y ) x' ( y + z ) = x' y + x' z. Thus, the inner product of x and y is maximum when the angle between them is zero, i.e., when one is just a positive multiple of the other. Sometimes we say (a little loosely) that x' y is the correlation between x and y, and that the correlation is maximum when x and y point in the same direction. If x' y = 0, the vectors x and y are said to be orthogonal or uncorrelated. Biometric Authentication Lecture 4-37

Problem 3: Minimum-error classifier Minimum-Distance Classifiers Template matching can easily be expressed mathematically. Let x be the feature vector for the unknown input, and let m1, m2,..., mc be templates (i.e., perfect, noise-free feature vectors) for the c classes. Then the error in matching x against mk is given by x - mk. Here u is called the norm of the vector u. A minimum-error classifier computes x - mk for k = 1 to c and chooses the class for which this error is minimum. Since x - mk is also the distance from x to mk, we call this a minimum-distance classifier. Clearly, a template matching system is a minimum-distance classifier. Biometric Authentication Lecture 4-34

Problem 3: Minimum-error classifier Linear Discriminants (2) Let us define the linear discriminant function g(x) by g(x) = m' x - 0.5 m 2. Then we can say that a minimum-euclidean-distance classifier classifies an input feature vector x by computing c linear discriminate functions g1(x), g2(x),..., gc(x) and assigning x to the class corresponding to the maximum discriminant function. We can also think of the linear discriminant functions as measuring the correlation between x and mk, with the addition of a correction for the "template energy" represented by mk 2. With this correction included, a minimum-euclideandistance classifier is equivalent to a maximum-correlation classifier. Biometric Authentication Lecture 4-39

Outline Problems Problem 1: Answer the questions Problem 2: Pattern extraction Problem 3: Minimum-error classifier Problem 4: Classify

Problem 4: Classify In P4:33 there are two templates ( D and O ) and ten input samples, each five. Please classify the third input example in the D row by using the maximum correlation approach and minimum error approach, respectively.

Problem 4: Classify Template Matching Template matching is a natural approach to pattern classification. For example, consider the noisy "D"'s and "O"'s. The noise-free versions can be used as templates. To classify one of the noisy examples, simply compare it to the two templates. Two ways can be done: 1.Count the number of agreements (black matching black and white matching white). Pick the class that has the maximum number of agreements. This is a maximum correlation approach. 2.Count the number of disagreements (black where white should be or white where black should be). Pick the class with the minimum number of disagreements. This is a minimum error approach. Biometric Authentication Lecture 4-33

Problem 4: Classify For Maximum Correlation Approach: D -Input: 82/90=91% and O -Input: 66/90=73%)

Problems Any questions?