Fast identification algorithms for forensic applications

Beekhof, Fokko Pieter; Voloshynovskyy, Svyatoslav; Koval, Oleksiy; Holotyak, Taras

doi:10.1109/WIFS.2009.5386480

Proceedings chapter

English

Fast identification algorithms for forensic applications

ContributorsBeekhof, Fokko Pieter; Voloshynovskyy, Svyatoslav; Koval, Oleksiy; Holotyak, Taras

Presented atLondon (UK), 6-9 Dec. 2009

Published inFirst IEEE International Workshop on Information Forensics and Security, WIFS 2009, p. 76-80

PublisherInstitute of Electrical and Electronics Engineers (IEEE)

Publication date2009

Abstract

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.

Keywords

Watermarking
computer forensics

Affiliation entities

Research groups

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

Proceedings chapter (Published version)

Identifiers

PID : unige:47640
DOI : 10.1109/WIFS.2009.5386480

Additional URL for this publicationhttp://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=5386480

506views

300downloads

Creation06/03/2015 18:12:04

First validation06/03/2015 18:12:04

Update time14/03/2023 23:58:18

Status update14/03/2023 23:58:17

Last indexation31/10/2024 00:16:34

Archive ouverte UNIGE

Fast identification algorithms for forensic applications

Technical informations