Results 1 
4 of
4
Trellis Coded Modulation to Improve Dirty Paper Trellis Watermarking
"... Lattice codes and quantizationbased techniques have received considerable attention as a method of digital watermarking with side information. However, these algorithms are also recognized to be highly sensitive to common signal processing primitives such as valuemetric scaling, e.g. changes in vol ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
Lattice codes and quantizationbased techniques have received considerable attention as a method of digital watermarking with side information. However, these algorithms are also recognized to be highly sensitive to common signal processing primitives such as valuemetric scaling, e.g. changes in volume of a song, or requantization, e.g. JPEG compression. Hence, it is reasonable to investigate alternative codes which may offer the potential for superior performance. In previous work, we designed a new class of codes, called dirty paper trellis codes (DPTC), which are by construction immune to valuemetric scaling. Although DPTC have shown themselves to be resistant to certain classes attacks, the trellises were generated randomly, thus leading to suboptimal codes. In this paper, Ungerboeck’s work on trellis coded modulation (TCM) is exploited to significantly improve the performance of the DPTC. Experimental results show that the resulting trellises significantly outperform the original design.
Spread transform dither modulation using a perceptual model
 In Proc. of International Workshop on Multimedia Signal Processing
, 2006
"... Abstract — In previous work, we demonstrated how perceptual modeling can be applied to dither modulated quantization index modulation and rational dither modulation, to improve both robustness and fidelity. These algorithms were shown to be significantly more robust to valumetric scaling. However, t ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
(Show Context)
Abstract — In previous work, we demonstrated how perceptual modeling can be applied to dither modulated quantization index modulation and rational dither modulation, to improve both robustness and fidelity. These algorithms were shown to be significantly more robust to valumetric scaling. However, they, and their predecessors, remain extremely sensitive to requantization which commonly occurs due to JPEG compression, numerical rounding and analogtodigital conversion. It is well known that spread transform dither modulation (STDM) is more robust to requantization. In this paper we describe how to incorporate a perceptual model into this framework and present two algorithms based on Watson’s perceptual model. Experimental results of robustness to JPEG compression are reported for 1000 images at embedding rates of 1/32 and 1/320. At the high embedding rate, the robustness of the two algorithms is the same as STDM but the perceptual distortion is reduced from 23 to about 4, based on Watson’s perceptual distance. At the lower embedding rate, we simultaneously observed superior robustness to STDM as well as improved fidelity. If the perceptual distance rather than the documenttowatermark ratio (DWR) is held fixed, then the two adaptive spread transform methods exhibit significant improvements in robustness to JPEG compression. I.
IMPROVED BINARY DITHERMODULATION WITH PERCEPTUAL CONSTRAINTS
"... The binary Distortion Compensated DitherModulation (DCDM), which can be regarded to as a baseline for quantizationbased datahiding methods, is rigorously analyzed. An accurate procedure for computing the exact probability of bit error is given, as well as the optimal weights in a newly proposed d ..."
Abstract
 Add to MetaCart
(Show Context)
The binary Distortion Compensated DitherModulation (DCDM), which can be regarded to as a baseline for quantizationbased datahiding methods, is rigorously analyzed. An accurate procedure for computing the exact probability of bit error is given, as well as the optimal weights in a newly proposed decoding structure, for significant improvements on performance. The results are particularized for a JPEG compression scenario which allows to show their usefulness. Also a comparison between squared error and perceptual distorsion measurements is done. Experimental results validating the proposed theory are presented. 1. INTRODUCTION. Although quantizationbased methods have been presented since the beginnings of watermarking, it was not until very
Optimal DataHiding Strategies for Games with
"... Abstract. We analyze three different data hiding methods from a gametheoretic point of view, using the probability of bit error as the payoff. Those data hiding schemes can be regarded to as representatives of three families of methods: spreadspectrum, informedembedding and hybrid. In all cases, w ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract. We analyze three different data hiding methods from a gametheoretic point of view, using the probability of bit error as the payoff. Those data hiding schemes can be regarded to as representatives of three families of methods: spreadspectrum, informedembedding and hybrid. In all cases, we have obtained theoretical expressions for the BER which are then optimized to derive the strategies for both the attacker and the decoder, assuming that the embedder simply follows pointbypoint constraints given by the perceptual mask. Experimental results supporting our analyses are also shown, with examples of watermarking in the spatial domain as well as the DCT domain. 1