Active content fingerprinting: Shrinkage and lattice based modulations

In this paper, we extend a new framework introduced as active content fingerprinting in [1] 1 that takes the best from the two worlds of content fingerprinting and digital watermarking to overcome some of the fundamental restrictions of these techniques in terms of performance and complexity. In the proposed framework, contents are modified in a way similar to watermarking to extract more robust fingerprints in contrast to conventional content fingerprinting. We investigate the performance of two modulation techniques based on unidimensional shrinkage and multidimensional lattice quantization. The simulation results on real images demonstrate the high efficiency of the proposed methods facing low-quality compression and additive noise.

[1]  Gregory Poltyrev,et al.  Bounds on the decoding error probability of binary linear codes via their spectra , 1994, IEEE Trans. Inf. Theory.

[2]  Jiri Fridrich,et al.  Robust bit extraction from images , 1999, Proceedings IEEE International Conference on Multimedia Computing and Systems.

[3]  Ton Kalker,et al.  A Highly Robust Audio Fingerprinting System With an Efficient Search Strategy , 2003 .

[4]  Eero P. Simoncelli,et al.  Image quality assessment: from error visibility to structural similarity , 2004, IEEE Transactions on Image Processing.

[5]  Sviatoslav Voloshynovskiy,et al.  Active content fingerprinting: A marriage of digital watermarking and content fingerprinting , 2012, 2012 IEEE International Workshop on Information Forensics and Security (WIFS).

[6]  P. Vaidyanathan,et al.  Results on lattice vector quantization with dithering , 1996 .

[7]  Ton Kalker,et al.  A Highly Robust Audio Fingerprinting System , 2002, ISMIR.

[8]  Gerald Schaefer,et al.  UCID: an uncompressed color image database , 2003, IS&T/SPIE Electronic Imaging.

[9]  Alexander Vardy.  Even more efficient bounded-distance decoding of the hexacode, the Golay code, and the Leech lattice , 1995, IEEE Trans. Inf. Theory.

[10]  Ofer Amrani,et al.  The Leech lattice and the Golay code: bounded-distance decoding and multilevel constructions , 1994, IEEE Trans. Inf. Theory.

[11]  Sviatoslav Voloshynovskiy,et al.  Performance Analysis of Content-Based Identification Using Constrained List-Based Decoding , 2012, IEEE Transactions on Information Forensics and Security.

[12]  J. Leech.  Notes on Sphere Packings , 1967, Canadian Journal of Mathematics.