Share Email Print
cover

Proceedings Paper

On accuracy, privacy, and complexity in the identification problem
Author(s): F. Beekhof; S. Voloshynovskiy; O. Koval; T. Holotyak
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper 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.

Paper Details

Date Published: 10 February 2010
PDF: 8 pages
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
Show Author Affiliations
F. Beekhof, Univ. of Geneva (Switzerland)
S. Voloshynovskiy, Univ. of Geneva (Switzerland)
O. Koval, Univ. of Geneva (Switzerland)
T. Holotyak, Univ. of Geneva (Switzerland)


Published in SPIE Proceedings Vol. 7540:
Imaging and Printing in a Web 2.0 World; and Multimedia Content Access: Algorithms and Systems IV
Theo Gevers; Qian Lin; Raimondo Schettini; Zhigang Fan; Cees Snoek, Editor(s)

© SPIE. Terms of Use
Back to Top