Paper
10 February 2011 Trading-off performance and complexity in identification problem
Taras Holotyak, Svyatoslav Voloshynovskiy, Oleksiy Koval, Fokko Beekhof
Author Affiliations +
Proceedings Volume 7880, Media Watermarking, Security, and Forensics III; 78800O (2011) https://doi.org/10.1117/12.872583
Event: IS&T/SPIE Electronic Imaging, 2011, San Francisco Airport, California, United States
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.
© (2011) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Taras Holotyak, Svyatoslav Voloshynovskiy, Oleksiy Koval, and Fokko Beekhof "Trading-off performance and complexity in identification problem", Proc. SPIE 7880, Media Watermarking, Security, and Forensics III, 78800O (10 February 2011); https://doi.org/10.1117/12.872583
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Signal to noise ratio

Binary data

Databases

Lead

System identification

Polarization

Multimedia

RELATED CONTENT


Back to Top