A Systematic Framework for Combination of Biometric Matchers in Identification Systems

نویسندگان

  • Sergey Tulyakov
  • Venu Govindaraju
چکیده

Combination functions typically used in biometric identification systems consider as input parameters only the matching scores related to a single person in order to derive a combined score for that person. We present a systematic framework to use all scores received by all persons as input to a single combination function when sufficient training data is available. More fundamentally, we identify four types of classifier combination methods determined by number of combining functions that must be trained and the number of input parameters. We investigate in detail combination methods, which consider all available matching scores as input parameters to a single trainable combination function. We describe how such methods account for dependencies between scores output by any single participating classifier. Our experiments demonstrate the advantage of using such combination methods when dealing with large number of classes, as in the case with biometric person identification systems.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Use of Identification Trial Statistics for Combination of Biometric Matchers

Combination functions typically used in biometric identification systems consider as input parameters only those matching scores which are related to a single person in order to derive a combined score for that person. We discuss how such methods can be extended to utilize the matching scores corresponding to all persons. The proposed combination methods account for dependencies between scores ...

متن کامل

On the Difference between Optimal Combination Functions for Verification and Identification Systems

We have investigated di®erent scenarios of combining pattern matchers. The combination problem can be viewed as a construction of a postprocessing classi ̄er operating on the matching scores of the combined matchers. The optimal combination algorithm for veri ̄cation systems corresponds to the likelihood ratio combination function. It can be implemented by the direct reconstruction of this functi...

متن کامل

Neural Network Optimization for Combinations in Identification Systems

In this paper we investigate the construction of combination functions in identification systems. In contrast to verification systems, the optimal combination functions for identification systems are not known. In this paper we represent the combination function by means of a neural network and explore different methods of its training, so that the identification system performance is optimized...

متن کامل

Utilizing Independence of Multimodal Biometric Matchers

The problem of combining biometric matchers for person verification can be viewed as a pattern classification problem, and any trainable pattern classification algorithm can be used for score combination. But biometric matchers of different modalities possess a property of the statistical independence of their output scores. In this work we investigate if utilizing this independence knowledge r...

متن کامل

On the Stability of Ranks to Low Image Quality in Biometric Identification Systems

The goal of a biometric identification system is to determine the identity of the input biometric probe. This is accomplished using a matcher which compares the input probe data against each labeled biometric data present in the gallery database. The output is a set of similarity scores that are ranked in decreasing order. The identity of the gallery entry corresponding to the highest similarit...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007