10 February 2010 On accuracy, privacy, and complexity in the identification problem
Author Affiliations +
Abstract
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.
© (2010) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
F. Beekhof, F. Beekhof, S. Voloshynovskiy, S. Voloshynovskiy, O. Koval, O. Koval, T. Holotyak, T. Holotyak, } "On accuracy, privacy, and complexity in the identification problem", Proc. SPIE 7540, Imaging and Printing in a Web 2.0 World; and Multimedia Content Access: Algorithms and Systems IV, 754017 (10 February 2010); doi: 10.1117/12.838915; https://doi.org/10.1117/12.838915
PROCEEDINGS
8 PAGES


SHARE
RELATED CONTENT


Back to Top