By Topic

Performance Analysis of Content-Based Identification Using Constrained List-Based Decoding

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Farzad Farhadzadeh ; Department of Computer Science, University of Geneva, Geneva, Switzerland ; Sviatoslav Voloshynovskiy ; Oleksiy Koval

This paper is dedicated to the performance analysis of content-based identification using binary fingerprints and constrained list-based decoding. We formulate content-based identification as a multiple hypothesis test and develop analytical models of its performance in terms of probabilities of correct detection/miss and false acceptance for a class of statistical models, which captures the correlation between elements of either the content or its extracted features. Furthermore, in order to determine the block/codeword length impact on the identification's accuracy, we analyze exponents of these probabilities of errors. Finally, we develop a probabilistic model, justifying the accuracy of identification based on list decoding by evaluating the position of the queried entry on the output list. The obtained results make it possible to characterize the performance of traditional unique decoding, based on the maximum likelihood for the situations when the decoder fails to produce the correct index. This paper also contains experimental results that confirm theoretical findings.

Published in:

IEEE Transactions on Information Forensics and Security  (Volume:7 ,  Issue: 5 )