Iterative Methods for Searching Optimal Classifier Combination Function

Similar documents
Pattern Recognition. Approximating class densities, Bayesian classifier, Errors in Biometric Systems

Fingerprint Verification Using Genetic Algorithms

Digital Access of Handwritten Documents

Improvements on Waring s Problem

Introduction. Modeling Data. Approach. Quality of Fit. Likelihood. Probabilistic Approach

Additional File 1 - Detailed explanation of the expression level CPD

Bayesian Decision Theory

Design of Recursive Digital Filters IIR

a new crytoytem baed on the dea of Shmuley and roved t rovably ecure baed on ntractablty of factorng [Mc88] After that n 999 El Bham, Dan Boneh and Om

BULLETIN OF MATHEMATICS AND STATISTICS RESEARCH

Logistic Regression. CAP 5610: Machine Learning Instructor: Guo-Jun QI

MULTISTART OPTIMIZATION WITH A TRAINABLE DECISION MAKER FOR AVOIDING HIGH-VALUED LOCAL MINIMA

A Simple Heuristic for Reducing the Number of Scenarios in Two-stage Stochastic Programming

Improvements on Waring s Problem

7. Algorithms for Massive Data Problems

MACHINE APPLIED MACHINE LEARNING LEARNING. Gaussian Mixture Regression

A New Approach Based on Particle Filter for Target Tracking with Glint Noise

Scattering of two identical particles in the center-of. of-mass frame. (b)

Pythagorean triples. Leen Noordzij.

PAPER A General Framework and Algorithms for Score Level Indexing and Fusion in Biometric Identification

A method to Boost Naïve Bayesian Classifiers

Classification (klasifikácia) Feedforward Multi-Layer Perceptron (Dopredná viacvrstvová sieť) 14/11/2016. Perceptron (Frank Rosenblatt, 1957)

Hidden Markov Model Cheat Sheet

Logistic Regression Maximum Likelihood Estimation

MiniBooNE Event Reconstruction and Particle Identification

Robust Combining of Disparate Classifiers through Order Statistics

A Multimodal Fusion Algorithm Based on FRR and FAR Using SVM

Dr. Shalabh Department of Mathematics and Statistics Indian Institute of Technology Kanpur

728. Mechanical and electrical elements in reduction of vibrations

Segmentation Method of MRI Using Fuzzy Gaussian Basis Neural Network

A total variation approach

Valores propios de la matriz de truncamiento asociados al operador de transición de la máquina sumadora en la base 2

The multivariate Gaussian probability density function for random vector X (X 1,,X ) T. diagonal term of, denoted

Team. Outline. Statistics and Art: Sampling, Response Error, Mixed Models, Missing Data, and Inference

On the SO 2 Problem in Thermal Power Plants. 2.Two-steps chemical absorption modeling

Using Genetic Algorithms in System Identification

Determination Method of Evolution Type of Service-oriented Entity

Joint Source Coding and Higher-Dimension Modulation

Detection and Estimation Theory

Using Immune Genetic Algorithm to Optimize BP Neural Network and Its Application Peng-fei LIU1,Qun-tai SHEN1 and Jun ZHI2,*

Control Systems. Root locus.

A New Quadratic Classifier Applied to Biometric Recognition

Bayesian classification CISC 5800 Professor Daniel Leeds

Collision Resolution Based on Independent Component Analysis

Pattern Classification

Multilayer Perceptrons and Backpropagation. Perceptrons. Recap: Perceptrons. Informatics 1 CG: Lecture 6. Mirella Lapata

Generalized Linear Methods

A Kernel Particle Filter Algorithm for Joint Tracking and Classification

UNIT 7. THE FUNDAMENTAL EQUATIONS OF HYPERSURFACE THEORY

Machine Learning. Classification. Theory of Classification and Nonparametric Classifier. Representing data: Hypothesis (classifier) Eric Xing

A Complexity-Based Approach in Image Compression using Neural Networks

Control Systems. Root locus.

INF 5860 Machine learning for image classification. Lecture 3 : Image classification and regression part II Anne Solberg January 31, 2018

CIS526: Machine Learning Lecture 3 (Sept 16, 2003) Linear Regression. Preparation help: Xiaoying Huang. x 1 θ 1 output... θ M x M

j=0 s t t+1 + q t are vectors of length equal to the number of assets (c t+1 ) q t +1 + d i t+1 (1) (c t+1 ) R t+1 1= E t β u0 (c t+1 ) R u 0 (c t )

Model Reference Adaptive Temperature Control of the Electromagnetic Oven Process in Manufacturing Process

Matching Dyadic Distributions to Channels

Optimal inference of sameness Supporting information

A NOVEL FAMILY OF WEIGHTED AVERAGE VOTERS FOR FAULT-TOLERANT COMPUTER CONTROL SYSTEMS

EECE 301 Signals & Systems Prof. Mark Fowler

CHAPTER X PHASE-CHANGE PROBLEMS

Full-Duplex Cooperative Cognitive Radio Networks

An LSB Data Hiding Technique Using Natural Numbers

FEEDDBACK CONTROL OF PIEZO-LAMINATE COMPOSITE PLATE. Hafez Ave, Tehran 15914, Iran

Property-based Integration for Sustainable Development

An Effective Feature Selection Scheme via Genetic Algorithm Using Mutual Information 1

Linear Form of the Radiative Transfer Equation Revisited. Bormin Huang

Chapter 6 The Effect of the GPS Systematic Errors on Deformation Parameters

Primer on High-Order Moment Estimators

Lecture Notes on Linear Regression

Integrating Neural Networks and PCA for Fast Covert Surveillance

Priority Queuing with Finite Buffer Size and Randomized Push-out Mechanism

290 IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS I: FUNDAMENTAL THEORY AND APPLICATIONS, VOL. 45, NO. 3, MARCH H d (e j! ;e j!

Web-Mining Agents Probabilistic Information Retrieval

Discrete MRF Inference of Marginal Densities for Non-uniformly Discretized Variable Space

Clustering gene expression data & the EM algorithm

arxiv: v2 [cs.lg] 16 Jan 2018

Chapter 11. Supplemental Text Material. The method of steepest ascent can be derived as follows. Suppose that we have fit a firstorder

CSC 411 / CSC D11 / CSC C11

Submodular Maximization Over Multiple Matroids via Generalized Exchange Properties

1 Convex Optimization

Specification -- Assumptions of the Simple Classical Linear Regression Model (CLRM) 1. Introduction

Extended Prigogine Theorem: Method for Universal Characterization of Complex System Evolution

INTRODUCTION TO MACHINE LEARNING 3RD EDITION

ReaxFF potential functions

Root Locus Techniques

Lecture 23: Artificial neural networks

Dr. Shalabh Department of Mathematics and Statistics Indian Institute of Technology Kanpur

Cluster Validation Determining Number of Clusters. Umut ORHAN, PhD.

Journal of Multivariate Analysis

SPE Copyright 2008, Society of Petroleum Engineers

Figure 1 Siemens PSSE Web Site

Supervised Learning. Neural Networks and Back-Propagation Learning. Credit Assignment Problem. Feedforward Network. Adaptive System.

Given the following circuit with unknown initial capacitor voltage v(0): X(s) Immediately, we know that the transfer function H(s) is

Topology optimization of plate structures subject to initial excitations for minimum dynamic performance index

This is a repository copy of An iterative orthogonal forward regression algorithm.

Uncertainty models for modal parameters of flexible structures: A complex-rational to real-rational controller design strategy.

A Preliminary Study on Material Utilization of Stiffened Cylindrical Shells

Understanding the Relationship Between the Optimization Criteria in Two-View Motion Analysis

Module 3 LOSSY IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur

Transcription:

htt://www.cub.buffalo.edu Iteratve Method for Searchng Otmal Clafer Combnaton Functon Sergey Tulyakov Chaohong Wu Venu Govndaraju Unverty at Buffalo

Identfcaton ytem: Alce Bob htt://www.cub.buffalo.edu Bometrc Alcaton Fngerrnt matchng 6 Face matchng.35.57 f S f S arg max =... Verfcaton ytem: Alce 6.35 f S > θ Accet Reject f f f f Queton: f we fnd otmal and t necearly?

htt://www.cub.buffalo.edu Handwrtten Word Recognton Identfcaton ytem: Amhert Buffalo WMR 5.6 7.4 CMR.5.8 f S f S arg max =... Verfcaton ytem: Amhert 5.6.5 f S > θ Accet Reject f f f f Queton: f we fnd otmal and t necearly?

htt://www.cub.buffalo.edu Verfcaton Sytem Pattern clafcaton aroach clae genune and motor verfcaton attemt Bometrc core Imotor Genune Bometrc core Mnmum rk mnmzaton crtera: otmal decon boundare concde wth the contour of lkelhood rato functon: f gen lr = m f = The roblem eay can drectly recontruct dente or ue multle attern clafcaton algorthm SVM etc. f lr

htt://www.cub.buffalo.edu Lkelhood Rato Combnaton Functon for Identfcaton Sytem Mnmzng mclafcaton cot:...... j ω ω > Clafy a rather than ω ω j Aume that core agned to dfferent clae are ndeendent:............... m gen m = = ω ω ω ω The nequalty become:............ m j j gen m m gen m >

htt://www.cub.buffalo.edu Lkelhood Rato Combnaton Functon for Identfcaton Sytem Or: gen m > gen m j j j j Thu obtaned lkelhood rato combnaton rule: The nut hould be clafed a arg max =... f lr If core agned by clafer to dfferent clae are ndeendent then lkelhood rato combnaton rule the otmal combnaton rule for dentfcaton ytem

Exerment htt://www.cub.buffalo.edu Handwrtten word recognzer: CMR WMR; lexcon of ze 680 word Bometrc matcher: fngerrnt l\v and face G from IST BSSR et; 988 enrolled eron Total Tral t Matcher Correct nd Matcher Correct Both Correct Ether Correct Lkelhood Rato Weghted Sum CMR & WMR 647 3366 4744 3005 505 493 505 l & C 598 4870 4856 3937 5789 587 586 l & G 598 4870 4635 3774 573 5737 57 Exermental error? - The erformance of lkelhood rato combnaton rule for handwrtten word recognzer wore than the erformance of a ngle WMR recognzer

htt://www.cub.buffalo.edu Verfcaton Sytem: WMR & CMR

htt://www.cub.buffalo.edu Verfcaton Sytem: bometrc l & C

htt://www.cub.buffalo.edu Verfcaton Sytem: bometrc l & G

htt://www.cub.buffalo.edu Deendence of Identfcaton Tral Score Lkelhood rato combnaton fal for dentfcaton ytem Thu we can not aume that dentfcaton tral core agned to dfferent clae are ndeendent Correlaton of genune core wth ome tattc of motor core dentfcaton tral et: t Im nd Im 3 rd Im mean CMR.4359.4755.477.45 WMR.7885.785.7673.5685 l.364.3400.3389.96 C.49.53.56.440 G.339.800.87.593

htt://www.cub.buffalo.edu Obervaton of Score Deendence T.K. Ho PhD the 993: mage qualty nfluence OCR core and rank rovde more nformaton durng combnaton OCR A.95 B.89 C.76 OCR A.80 B.54 C.43 convert core to rank ue to core

Hyothetcal dente of genune and motor core: htt://www.cub.buffalo.edu Examle How uch dtrbuton were generated? Cae : genune and motor core are amled ndeendently from correondng dente Cae : n every dentfcaton tral: m = gen Verfcaton ytem : both cae have ame erformance Identfcaton ytem : econd cae ha erfect erformance genune core alway on to Concluon: erformance of a matcher n dentfcaton ytem can be dfferent from t erformance n verfcaton ytem

htt://www.cub.buffalo.edu Examle Combne two matcher: one a n cae another a n cae Lkelhood rato combnaton rule: Incorrectly clafed dentfcaton tral: ω Cae matcher Cae matcher f + ω lr = = 0. 0. Wnner Concluon: the lkelhood rato combnaton rule mght have wore erformance n dentfcaton ytem than ngle matcher a n CMR&WMR ex

Genune core Imotor core Examle 3 = x y gen gen + m = xm + y htt://www.cub.buffalo.edu xgen ~ X gen xm ~ X m y ~ gen X m Y - ndeendent dtrbuton X - gauan y - the ame for dentfcaton tral Can rove: the otmal combnaton functon for dentfcaton ytem wth uch dtrbuton f + lr =

Examle 3 htt://www.cub.buffalo.edu Deendng on the dtrbuton of the otmal combnaton functon can dffer gnfcantly from the one of dentfcaton ytem. Y E.g.: Y unformly dtrbuted on [ 0 ] Concluon: genune and motor core dtrbuton mght not have enough nformaton to deduce the otmal combnaton functon for dentfcaton ytem.

htt://www.cub.buffalo.edu Tranng Ung Identfcaton Tral Score Set Bometrc core Imotor Genune Bometrc core Imotor Genune Bometrc core Bometrc core o! Bometrc core Imotor Bometrc core Genune The tranng of the dentfcaton ytem combnaton hould roce core from one dentfcaton tral a a ngle tranng amle.

htt://www.cub.buffalo.edu Aroxmatng Otmal Combnaton Functon n Identfcaton Sytem Algorthm: Intalze ome combnaton functon Do for all dentfcaton tral: Get core from ame dentfcaton tral Adjut combnaton functon Crtera for adjutng combnaton functon: genune core hould be obly better than any motor core of the ame dentfcaton tral et

htt://www.cub.buffalo.edu Condered Algorthm Bet Imotor Lkelhood Rato: where motor denty traned ung the et of bet motor determned teratvely Sum of logtc functon Combnaton functon hould be monotonc o aroxmate t a a um of monotonc logtc functon The coeffcent are choen o that the genune core earated from the bet motor core n current dentfcaton tral teratve algorthm M f ' M m M gen M f = 0 + = + + + + + j M M M M e l α α α α α

htt://www.cub.buffalo.edu Identfcaton Sytem Performance Lkelhood Rato Weghted um Bet Imotor Lkelhood Rato Logtc Sum Weghted Sum + Identfcaton Model CMR&WMR 493 505 49 5005.5 505.5 l & C 587 586 5803 583 586 l & G 5737 57 574 5753 5760

htt://www.cub.buffalo.edu Bg Pcture Preented combnaton rule are of low comlexty combnaton tye. Ung other tye medum II dentfcaton model can gnfcantly mrove erformance. Identfcaton model nherently account for core deendence.

htt://www.cub.buffalo.edu Identfcaton Model for l&c

htt://www.cub.buffalo.edu Identfcaton Model for l&g

htt://www.cub.buffalo.edu Identfcaton Model for WMR&CMR Verfcaton Sytem