Biometric identification systems typically require one-to-many comparisons by evaluating the biometric similarity between an input query and the database records. With increasing data volume and access demand, it is necessary to develop effective and efficient methods that can help to narrow the search range and reduce the matching complexity for computationally intensive tasks such as identity de-duplication and identification based on secured templates. Biometric indexing is designed to address the problem by assigning an index vector to every identity in the database, with the aim of fast retrieving a small number of candidate identities for matching. This talk will discuss problems and recent developments of biometric indexing from three aspects, namely, accuracy, efficiency and privacy. In particular, examples of hash-based indexing methods will be provided for biometric identification. [Go to the full record in the library's catalogue]
This video is presented here with the permission of the speakers.
Any downloading, storage, reproduction, and redistribution are strictly prohibited
without the prior permission of the respective speakers.
Go to Full Disclaimer.
This video is archived and disseminated for educational purposes only. It is presented here with the permission of the speakers, who have mandated the means of dissemination.
Statements of fact and opinions expressed are those of the inditextual participants. The HKBU and its Library assume no responsibility for the accuracy, validity, or completeness of the information presented.
Any downloading, storage, reproduction, and redistribution, in part or in whole, are strictly prohibited without the prior permission of the respective speakers. Please strictly observe the copyright law.