Share Email Print

Proceedings Paper

Trading-off performance and complexity in identification problem
Author(s): Taras Holotyak; Svyatoslav Voloshynovskiy; Oleksiy Koval; Fokko Beekhof
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

In this paper, we consider an information-theoretic formulation of the content identification under search complexity constrain. The proposed framework is based on soft fingerprinting, i.e., joint consideration of sign and magnitude of fingerprint coefficients. The fingerprint magnitude is analyzed in the scope of communications with side information that results in channel decomposition, where all bits of fingerprints are classified to be communicated via several channels with distinctive characteristics. We demonstrate that under certain conditions the channels with low identification capacity can be neglected without considerable rate loss. This is a basis for the analysis of fast identification techniques trading-off theoretical performance in terms of achievable rate and search complexity.

Paper Details

Date Published: 10 February 2011
PDF: 14 pages
Proc. SPIE 7880, Media Watermarking, Security, and Forensics III, 78800O (10 February 2011); doi: 10.1117/12.872583
Show Author Affiliations
Taras Holotyak, Univ. of Geneva (Switzerland)
Svyatoslav Voloshynovskiy, Univ. of Geneva (Switzerland)
Oleksiy Koval, Univ. of Geneva (Switzerland)
Fokko Beekhof, Univ. of Geneva (Switzerland)

Published in SPIE Proceedings Vol. 7880:
Media Watermarking, Security, and Forensics III
Nasir D. Memon; Jana Dittmann; Adnan M. Alattar; Edward J. Delp, Editor(s)

© SPIE. Terms of Use
Back to Top