Skip to Main content Skip to Navigation
Conference papers

A Data Structure for Efficient Biometric Identification

Abstract : This paper proposes an efficient algorithm for personal identification with biometric images. In identification based on image comparison, the number of comparisons is an important factor to estimate the total processing time in addition to the processing time of a single comparison. Maeda et al. proposed an identification algorithm that reduces the number of comparisons from the linear search algorithm, however the processing time of each comparison is proportional to the number of registered images. The algorithm in this paper is an improvement of the algorithm by Maeda et al. with constant-time image comparisons. This paper evaluates the algorithms in terms of the processing time and the accuracy with practical palmprint images, and proves that the novel algorithm can reduce the number of image comparisons from the linear search algorithm as the algorithm by Maeda et al. without loss of the accuracy.
Document type :
Conference papers
Complete list of metadata

Cited literature [6 references]  Display  Hide  Download

https://hal.inria.fr/hal-01480259
Contributor : Hal Ifip <>
Submitted on : Wednesday, March 1, 2017 - 11:30:59 AM
Last modification on : Wednesday, March 1, 2017 - 11:36:36 AM
Long-term archiving on: : Tuesday, May 30, 2017 - 3:51:34 PM

File

978-3-642-36818-9_61_Chapter.p...
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

Kensuke Baba, Serina Egawa. A Data Structure for Efficient Biometric Identification. 1st International Conference on Information and Communication Technology (ICT-EurAsia), Mar 2013, Yogyakarta, Indonesia. pp.528-533, ⟨10.1007/978-3-642-36818-9_61⟩. ⟨hal-01480259⟩

Share

Metrics

Record views

128

Files downloads

324