P. Moulin and A. Ivanovic. The watermark selection game. In Proc. Conf. on Info. Sciences and Systems, Mar. 2001. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Perceptual Watermarking Of Non I.i.d. Signals Based.. - Le Guelvouit.. (2002) (Correct)
....theory, this problem can be seen as reliably transmiting a message over a noisy channel, noise being due to modification or attacks of the host document. The attacks are often modeled as the addition of white Gaussian noise (AWGN channel) 1, 2] or as linear filtering plus additive noise [3, 4]. The perceptual sensitivity of the host signal is often taken into account for choosing embedding sites and strength. After presenting the watermarking general scheme in Sec. 2, we introduce side information principles in Sec. 3. Then digital watermarking is revisited in light of a general ....
....induced by the attack is independent of the watermarked signal, hence can hardly apply to attacks such as filtering and compression. More accurate models assuming that the distortion depends on the watermarked signal and based on linear filtering plus additive noise have been considered in [3, 4]. Here, we consider that the attacked signal Y can be expressed as F F I: H , P 4RQ ,S T 4 : 2) is an attenuation factor on each watermarked site. This amounts to consider the attack channel as an SAWGN channel (amplitude scaling by the ....
P. Moulin and A. Ivanovic, "The watermark selection game," in Proc. Conf. on Info. Sciences and Systems, Mar. 2001.
Information-theoretic resolution of perceptual WSS.. - Le Guelvouit.. (2002) (Correct)
....various forms of channel characterizations. The perceptual sensitivity of the host signal is often taken into account for choos ing embedding sites and strength [1, 7] The attacks are often modelled as the addition of White Gaussian noise (AWGN) 8, 4] or as linear filtering plus additive noise [9, 3]. The authors in [10] show that the optimum attack is obtained by Wiener filtering and that to be maximally robust, the watermark should have a power spectrum matching the one of the original signal. The problem of robust embedding and extraction based on spread spectrum is revisited here in ....
....induced by the attack is independent of the watermarked signal, hence can hardly apply to attacks such as filtering and compression. More accurate models assuming that the distortion depends on the watermarked signal and based on linear filtering plus additive noise have been considered in [9, 3]. liere, we consider that the attacked signal y can be expressed as y , 7,u, 7,x, 3 , Y] a, b , 2) j=l where 3 , is an attenuation factor on each watermarked site. This amounts to consider the attack channel as a SAWGN channel (amplitude scaling by the factor 3 , and ....
P. Moulin and A. Ivanovic. The watermark selection game. In Proc. Conf. on Info. Sciences and Systems, Mar. 2001.
Game-Theoretic Analysis Of Watermark Detection - Pierre Moulin And (2001) Self-citation (Moulin Ivanovic) (Correct)
No context found.
P. Moulin and A. Ivanovic, "The Watermark Selection Game," Proc. Conf. on Info. Syst. and Sci., Baltimore, MD, March 2001. Available from www.ifp.uiuc.edu/moulin.
Game-Theoretic Analysis Of Watermark Detection - Moulin, Ivanovic (2001) Self-citation (Moulin Ivanovic) (Correct)
.... 1 0, 1, N 2 1 denote the original N 1 N 2 digital image (or a rectangular section thereof) to be marked, taking values in a set V (e.g. R or 0, 255 ) and modeled as a V valued random vector whose components are indexed by n # ## (A similar analysis applies to random processes [2]. A watermark is inserted in s, resulting in a marked image x that is made publicly available. The watermark depends on a secret key k shared with the decoder, but not on the host image itself. We assume that an adversary (attacker) takes x and produces a degraded image y. Both x and y are V ....
....distortion constraint: E[d(S, #(S, 1, K) # E, 3) where E # 0 is the distortion tolerance level. An additional requirement might be unbiasedness: E[#(S, 1, K) S] S. 4) The minmax problem (1) can be simplified if the number of keys is large. If # is specified by (3) 4) we have [2] min ### max A#A P e (#, A) # min p X S #PX S max A#A P e (p X S , A) 5) where PX S = p X S : E[d(S, X) # E and E[X S] S . 6) 4. RELATED WORK The role of game theory in watermarking appears in the capacity analysis of data hiding systems by O Sullivan et al. 4, 5] ....
[Article contains additional citation context not shown here]
P. Moulin and A. Ivanovic, "The Watermark Selection Game," Proc. Conf. on Info. Syst. and Sci., Baltimore, MD, March 2001. Available from www.ifp.uiuc.edu/moulin.
Information-theoretic resolution of perceptual WSS.. - Le Guelvouit.. (2002) (Correct)
No context found.
P. Moulin and A. Ivanovic. The watermark selection game. In Proc. Conf. on Info. Sciences and Systems, Mar. 2001.
Practical Watermarking Scheme Based on Wide Spread.. - Pateux, Le Guelvouit (2002) (Correct)
No context found.
P. Moulin, A. Ivanovic, The watermark selection game, in: Proc. Conf. on Info. Sciences and Systems, 2001. URL http://www.ifp.uiuc.edu/ moulin/Papers/verify-ciss01.ps
Information Hiding Codes and Their Applications to Images and Audio - Mihcak (2002) (Correct)
No context found.
P. Moulin and A. Ivanovic, "The watermark selection game," presented at the 37th Annual Conference on Information Sciences and Systems, Baltimore, MD, 2001. 166
Wide Spread Spectrum Watermarking with Side Information.. - Le Guelvouit, Pateux (2003) (Correct)
No context found.
P. Moulin and A. Ivanovic, "The watermark selection game," in Proc. Conf. on Info. Sciences and Systems, Mar. 2001.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC