Identification Algorithm Using a Matching Score Matrix

Takuji MAEDA; Masahito MATSUSHITA; Koichi SASAKAWA

Identification Algorithm Using a Matching Score Matrix

Takuji MAEDA, Masahito MATSUSHITA, Koichi SASAKAWA

Full Text Views

0

Cite this

Summary :

Recently, biometrics such as a person's fingerprint, face, and voice has come to be used for personal authentication. At present, most biometrics authentication 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 incovenienced as a result. To improve the operation efficiency, identification (one-to-many matching) is required, but identification is currently assumed to require much more time than verification (i.e., the response time is not practical). After probing these problems, we developed a new method to achieve identification in a short period of time. This method shortens the response time 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 matchings to identify data in a database with two thousand fingerprints, a count much less than by conventional methods.

Publication: IEICE TRANSACTIONS on Information Vol.E84-D No.7 pp.819-824

Publication Date: 2001/07/01

Publicized

Online ISSN

DOI

Type of Manuscript: Special Section PAPER (Special Issue on Biometric Person Authentication)

Category

Cite this

Copy

Takuji MAEDA, Masahito MATSUSHITA, Koichi SASAKAWA, "Identification Algorithm Using a Matching Score Matrix" in IEICE TRANSACTIONS on Information, vol. E84-D, no. 7, pp. 819-824, July 2001, doi: .
Abstract: Recently, biometrics such as a person's fingerprint, face, and voice has come to be used for personal authentication. At present, most biometrics authentication 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 incovenienced as a result. To improve the operation efficiency, identification (one-to-many matching) is required, but identification is currently assumed to require much more time than verification (i.e., the response time is not practical). After probing these problems, we developed a new method to achieve identification in a short period of time. This method shortens the response time 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 matchings to identify data in a database with two thousand fingerprints, a count much less than by conventional methods.
URL: https://global.ieice.org/en_transactions/information/10.1587/e84-d_7_819/_p

Copy

@ARTICLE{e84-d_7_819,
author={Takuji MAEDA, Masahito MATSUSHITA, Koichi SASAKAWA, },
journal={IEICE TRANSACTIONS on Information},
title={Identification Algorithm Using a Matching Score Matrix},
year={2001},
volume={E84-D},
number={7},
pages={819-824},
abstract={Recently, biometrics such as a person's fingerprint, face, and voice has come to be used for personal authentication. At present, most biometrics authentication 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 incovenienced as a result. To improve the operation efficiency, identification (one-to-many matching) is required, but identification is currently assumed to require much more time than verification (i.e., the response time is not practical). After probing these problems, we developed a new method to achieve identification in a short period of time. This method shortens the response time 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 matchings to identify data in a database with two thousand fingerprints, a count much less than by conventional methods.},
keywords={},
doi={},
ISSN={},
month={July},}

Copy

TY - JOUR
TI - Identification Algorithm Using a Matching Score Matrix
T2 - IEICE TRANSACTIONS on Information
SP - 819
EP - 824
AU - Takuji MAEDA
AU - Masahito MATSUSHITA
AU - Koichi SASAKAWA
PY - 2001
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E84-D
IS - 7
JA - IEICE TRANSACTIONS on Information
Y1 - July 2001
AB - Recently, biometrics such as a person's fingerprint, face, and voice has come to be used for personal authentication. At present, most biometrics authentication 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 incovenienced as a result. To improve the operation efficiency, identification (one-to-many matching) is required, but identification is currently assumed to require much more time than verification (i.e., the response time is not practical). After probing these problems, we developed a new method to achieve identification in a short period of time. This method shortens the response time 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 matchings to identify data in a database with two thousand fingerprints, a count much less than by conventional methods.
ER -