Proceedings chapter
Open access

Fast identification algorithms for forensic applications

Presented at London (UK), 6-9 Dec. 2009
PublisherInstitute of Electrical and Electronics Engineers (IEEE)
Publication date2009

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.

  • Watermarking
  • computer forensics
Citation (ISO format)
BEEKHOF, Fokko Pieter et al. Fast identification algorithms for forensic applications. In: First IEEE International Workshop on Information Forensics and Security, WIFS 2009. London (UK). [s.l.] : Institute of Electrical and Electronics Engineers (IEEE), 2009. p. 76–80. doi: 10.1109/WIFS.2009.5386480
Main files (1)
Proceedings chapter (Published version)

Technical informations

Creation03/06/2015 5:12:04 PM
First validation03/06/2015 5:12:04 PM
Update time03/14/2023 10:58:18 PM
Status update03/14/2023 10:58:17 PM
Last indexation01/16/2024 5:07:16 PM
All rights reserved by Archive ouverte UNIGE and the University of GenevaunigeBlack