A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
Fast identification algorithms for forensic applications
2009
2009 First IEEE International Workshop on Information Forensics and Security (WIFS)
In this work a novel fast search algorithm is proposed that is designed to offer improved performance in terms of identification accuracy whilst maintaining acceptable speed for forensic applications involving biometrics and Physically Unclonable Functions. A framework for forensic applications is presented, followed by a review of optimal and existing fast algorithms. We show why the new algorithm has the power to outperform the other algorithms with a theoretic analysis and confirm this using simulations on a large database.
doi:10.1109/wifs.2009.5386480
dblp:conf/wifs/BeekhofVKH09
fatcat:ccu4rgwz6zc4hfnis7xvoy27sa