Proceedings chapter
Open access

On Accuracy, Privacy and Complexity in the Identification Problem

Presented at San Jose (USA), January 17, 2010
  • Conference Volume; 7540
Publication date2010

This paper presents recent advances in the identification problem taking into account the accuracy, complexity and privacy leak of different decoding algorithms. Using a model of different actors from literature, we show that it is possible to use more accurate decoding algorithms using reliability information without increasing the privacy leak relative to algorithms that only use binary information. Existing algorithms from literature have been modified to take advantage of reliability information, and we show that a proposed branch-and-bound algorithm can outperform existing work, including the enhanced variants.

  • Watermarking
  • Algorithms
  • Reliability
Citation (ISO format)
BEEKHOF, Fokko Pieter et al. On Accuracy, Privacy and Complexity in the Identification Problem. In: Proceedings of SPIE / Imaging and Printing in a Web 2.0 World; and Multimedia Content Access: Algorithms and Systems IV. San Jose (USA). [s.l.] : SPIE, 2010. (Conference Volume) doi: 10.1117/12.838915
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:17 PM
Status update03/14/2023 10:58:17 PM
Last indexation01/16/2024 5:07:15 PM
All rights reserved by Archive ouverte UNIGE and the University of GenevaunigeBlack