An introduction to signal detection and estimation (2nd ed.)
An introduction to signal detection and estimation (2nd ed.)
Discrete-time signal processing (2nd ed.)
Discrete-time signal processing (2nd ed.)
Toeplitz and circulant matrices: a review
Communications and Information Theory
Scalar Costa scheme for information embedding
IEEE Transactions on Signal Processing
Rational dither modulation: a high-rate data-hiding method invariant to gain attacks
IEEE Transactions on Signal Processing - Part II
Watermarking security: theory and practice
IEEE Transactions on Signal Processing - Part II
Joint iterative decoding and estimation for side-informed data hiding
IEEE Transactions on Signal Processing - Part II
Amplitude Scale Estimation for Quantization-Based Watermarking
IEEE Transactions on Signal Processing
Quantization-Based Data Hiding Robust to Linear-Time-Invariant Filtering
IEEE Transactions on Information Forensics and Security
Universal decoding for channels with memory
IEEE Transactions on Information Theory
Information-theoretic analysis of information hiding
IEEE Transactions on Information Theory
Robust template matching for affine resistant image watermarks
IEEE Transactions on Image Processing
Rotation, scale, and translation resilient watermarking for images
IEEE Transactions on Image Processing
Combating desynchronization attacks on blind watermarking systems: a message passing approach
ICIP'09 Proceedings of the 16th IEEE international conference on Image processing
| Hi-index | 0.00 |
In this paper, we study some fundamental performance limits of blind data hiding against desynchronization attacks. These attacks are modeled in addition to independent Gaussian noise to the marked signal, followed by linear, time-invariant filtering. We study a joint estimator-decoder which estimates the desynchronization attack parameters and uses these estimates in the decoding step. We propose a coding scheme based on distortion-compensated quantization index modulation and derive the estimation accuracy of the attack parameters via Fisher information and a Cramér-Rao type bound. For illustration purposes, we report estimation and decoding results on several attacks, including classical ones (scaling and fractional shifts) and some new ones. The results are in close agreement with our bounds and tightly quantify the performance loss due to desynchronization and the influence of code block length. Thus our results demonstrate the high performance of a joint estimation-decoding approach.