Identification algorithm using a matching score matrix

Citation
T. Maeda et al., Identification algorithm using a matching score matrix, IEICE T INF, E84D(7), 2001, pp. 819-824
Citations number
8
Language
INGLESE
art.tipo
Article
Categorie Soggetti
Information Tecnology & Communication Systems
Journal title
IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS
ISSN journal
0916-8532 → ACNP
Volume
E84D
Issue
7
Year of publication
2001
Pages
819 - 824
Database
ISI
SICI code
0916-8532(200107)E84D:7<819:IAUAMS>2.0.ZU;2-7
Abstract
Recently , biometrics such as: a person's fingerprint, face, and voice has come to be used for personal authentication. At present, most biometrics: a uthentication systems depend on verification (one-to-one matching) because such verification takes a short period Of time and is expected to provide a quick response. In these systems, however, every single user has to enter an ID number for each authentication session and might feel inconvenienced as a result. To improve the operation efficiency, identification (one-to-ma ny matching) is required, but identification is currently assumed to requir e much more time than verification (i.e., the response time is not practica l). After probing these problems. we developed a new method to achieve iden tification in a short period of time. This method shortens the response tim e by using a matching score matrix, which is constructed in the enrollment phase. The proposed method is shown to need only about 45 one-to-one matchi ngs to identify data in a database with two thousand fingerprints, a count much less than by conventional methods.