RANK LEVEL FUSION USING FINGERPRINT AND IRIS BIOMETRICS
Journal Title: Indian Journal of Computer Science and Engineering - Year 2011, Vol 2, Issue 6
Abstract
Authentication of users is an essential and difficult to achieve in all systems. Shared secrets like Personal Identification Numbers (PIN) or Passwords and key devices such as Smart cards are not presently sufficient in few situations. The biometric improves the capability to recognize the persons. A biometric identification system is an automatic recognition system that recognizes a person based on the physiological (e.g., fingerprints, face, retina, iris, ear) or behavioral (e.g., gait, signature, voice) characteristics. In many real-world applications, unimodal biometric systems often face has significant limitations due to sensitivity to noise, intra class variability, data quality, non-universality, and other factors. Multimodal biometric systems overcome some of these limitations. Multimodal biometric system provides more accuracy when compared to unimodal biometric system. The main goal of multimodal biometric system is to develop the security system for the areas that require high level of security. The proposed system focused on developing a multimodal biometrics system, which uses biometrics such as fingerprint and iris. Fusion of biometrics is performed by means of rank level fusion. The features from the biometrics are obtained by using the FLD (Fisher Linear Discriminant). The experimental result shows the performance of the proposed multimodal biometrics system. In this paper, the decision is made using rank level fusion and the ranks of individual persons are calculated using the Borda count, and Logistic regression approaches.
Authors and Affiliations
N. Radha , A. Kavitha
Keywords
Related Articles
- EP ID EP86224
- DOI -
- Views 195
- Downloads 0
SENTIMENT CLASSIFICATION OF MOVIE REVIEWS BY SUPERVISED MACHINE LEARNING APPROACHES
Large volumes of data are available in the web. The discussion forum, review sites, blogs and news corpora are some of the opinion rich resources. The opinions obtained from those can be classified and used for gathering...
A NEW MULTI PARTY KEY AGREEMENT PROTOCOL USING SEARCH PROBLEMS IN DISCRETE HEISENBERG GROUP.
In this paper we present a multi-party Key Agreement Protocol (KAP) using some of the search problems such as Factorization Search Problem , Decomposition Search Problem Conjugacy Search Problem and Twisted Conjugacy Pro...
Visual Query in Temporal Database with Multi Dimensions
A wide range of database applications manage time-varying data. In contrast, existing database technology provides little support for managing such data. The research area of temporal databases aims to change this state...
WEB SERVICE CLASSIFICATION WITH MULTILAYER PERCEPTRON
Web services are made of software components for expressing the application information, communicating messages and for interacting with open XML and Internet technologies. Web services are software applications accessib...
SHORTEST PATH ALGORITHM FOR QUERY PROCESSING IN PEER TO PEER NETWORKS
Peer-to-Peer network implements a new environment in database by query processing system. Nowadays, a key challenging for processing the queries and query answering technique. In this paper we propose a research work on...