N. Merhav, "On Random Coding Error Exponents of Watermarking Codes," IEEE Trans. Info Thy, Vol. 46, No. 2, pp. 420---430, Mar. 2000.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....hiding techniques. Other applications of data hiding include close captioning and embedding of text and audio in images and video. These areas have seen the development of a plethora of algorithms in the last five years [2, 3] but an information theoretic treatment of the problem is just emerging [4, 5, 6, 7, 8, 9]. In particular, a theory has recently been developed to establish the fundamental limits of the watermarking (data hiding) problem depicted in Fig. 1 [4, 5] In this framework, a message M is to be embedded in a length N sequence S N = S 1 , SN ) termed host data set, typically data from ....

N. Merhav, "On Random Coding Error Exponents of Watermarking Codes," IEEE Trans. Info Thy, Vol. 46, No. 2, pp. 420---430, Mar. 2000.

....basis for a generic version of the information hiding problem. We formulate the information hiding problem as a communication problem and seek the maximum rate of reliable communication through the communication system. Related aspects of this problem have also been recently explored by Merhav [8] and Chen and Wornell [9] Also see the recent study by Hernandez and Perez Gonzalez on decision theoretic aspects of the watermarking problem [10] In our generic information hiding problem, a message M is to be embedded in a host data set X , and the resulting data set X may be subject to ....

....Our analysis has outlined the potential benefits of using randomized codes. Other practical problems include the choice of a suitable distortion measure, which is a holy grail in audio, image and video processing. Theoretical problems include computation of error exponents and reliability function [8], and design of universal decoders that perform well for a broad class of attack channels. Acknowledgments We are deeply indebted to several colleagues who helped us at di#erent stages during the preparation of this paper. In particular, we would like to thank J. Mark Ettinger and Tamer Basar for ....

N. Merhav, "On Random Coding Error Exponents of Watermarking Codes," preprint, Sep. 1998.

.... have in mind the watermarking application, as discussed in the Introduction, then W can be naturally de ned as a subclass of M state channels for which the expected distortion between the input and output sequences is less than some prescribed level D, for some distortion measure (see, also [8] [6]) As explained earlier, this re ects the fact that the attacker would like to destory the watermark without causing noticeable degradation in quality. 2. We have forumlated the problem as a binary hypothesis testing problem only for the sake of simplicity. As mentioned in the Introduction and as ....

N. Merhav, \On random coding error exponents of watermarking codes," submitted for publication to IEEE Trans. on Inform. Theory.

....from the information theoretic perspective. In the few information theoretic papers that do exist in this context, attempts were made to characterize capacity and or error exponents of watermarking systems by viewing them as coded communication systems with side information [6] 7] 14] 13] [12], 15] In general, the system model that has been studied is essentially as follows: A secret message, encoded with a rate R block code of length n, is hidden in a memoryless covertext message (an image) within small degradation of quality, symbolized by distortion level D 1 with respect to ....

....are involved. While the assumption that the attack channel is memoryless might appear somewhat limited, we adopt it here for reasons of simplicity. It should also be noted that memoryless attack channels are worst case channels in certain communication situations in the contexts of watermarking [12], 13] 14] and the jamming game [17] 18] In addition, as it will turn out, at least for the case of covertext available at both sides, memoryless channels are indeed worst case channels from the viewpoint of identi cation capacity. 2 Side Information at Transmitter and Receiver A De nitions ....

N. Merhav, \On random coding error exponents of watermarking codes," to appear in IEEE Trans. Inform. Theory , March 2000.

No context found.

N. Merhav, "On Random Coding Error Exponents of Watermarking Codes," IEEE Trans. Info Thy, Vol. 46, No. 2, pp. 420---430, Mar. 2000.

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