IEEE Journal on Selected Areas in Communications, Special Issue on Copyright and Privacy Protection, Vol. 16, No. 4, May 1998.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....NSF grants MIP 97 07633, CCR 00 81268, and CDA 96 24396. iCorresponding Author: Tel ] 1 217 244 8366, fax t 1 217 244 8371, emaih moulinifp. uiuc. edu. Introduction Data hiding refers to the nearly invisible embedding of information within a host data set such as text, audio, image, or video [1, 2, 3, 4, 5, 6, 7]. There is a broad variety of data one may want to hide in such data sets. In watermarking applications, the hidden data represent authorship information, a time stamp, or copyright information. In steganographic applications, the hidden data are a secret message whose mere presence within the ....

....that a very limited amount of data is to be hidden within the data set; whereas our focus is on communicating significant amounts of information to a decoder. Most research papers in the watermarking and data hiding literature have focused on novel ways to hide data and to remove hidden data [1, 8, 2, 3, 4, 5, 6, 7]. However, the information theoretic analysis that describes the fundamental limits of any watermarking or data hiding system and can ultimately guide the design of efficient watermarking algorithms has been emerging only recently [9, 10, 11, 12] Information theory yields results that are ....

IEEE Journal on Selected Areas in Communications, Special Issue on Copyright and Privacy Protection, Vol. 16, No. 4, May 1998.

....supported by NSF grants MIP 97 07633 and CDA 96 24396. Corresponding Author: Tel 1 217 244 8366, fax 1 217 244 8371, email: moulin ifp.uiuc.edu. 1 1 Introduction Data hiding refers to the nearly invisible embedding of information within a host data set such as text, audio, image, or video [3, 16, 22, 39, 41, 46, 48]. There is a broad variety of data one may want to hide in such data sets. In watermarking applications, the hidden data represent authorship information, a time stamp, or copyright information. In steganographic applications, the hidden data are a secret message whose mere presence within the ....

....that a very limited amount of data is to be hidden within the data set; whereas our focus is on communicating significant amounts of information to a decoder. Most research papers in the watermarking and data hiding literature have focused on novel ways to hide data and to remove hidden data [3, 10, 16, 22, 39, 41, 46, 48]. However, the informationtheoretic analysis that describes the fundamental limits of any watermarking or data hiding system and can ultimately guide the design of e#cient watermarking algorithms has been emerging only recently [5, 28, 31, 37] Information theory yields results that are ....

IEEE Journal on Selected Areas in Communications, Special Issue on Copyright and Privacy Protection, Vol. 16, No. 4, May 1998. 21

....and security issues that can be addressed using watermarking and data 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 ....

....result to the case of Type S constraints) to each channel, and the third is because d # 1 , d # 2 are optimal under p # S . #. 6 Stationary Gaussian Processes Assume now that S is a d dimensional stationary Gaussian process in Z d with zero mean and continuous spectral density #(f) f ## = [ 1 2 , 1 2 ] d . It is assumed that # is bounded away from zero and infinity: # = min f## #(f) 0, and # = max f## #(f) #. First we define the watermarking game with maximum distortion levels D 1 and D 2 , and then derive its solution. 6.1 Blockwise Memoryless Approximation The spectral ....

IEEE Journal on Selected Areas in Communications, Special Issue on Copyright and Privacy Protection, Vol. 16, No. 4, May 1998.

....compute data hiding capacity for compressed and uncompressed host image sources. Closedform expressions are obtained under sparse model approximations. 1. INTRODUCTION Data hiding refers to the nearly invisible embedding of information within a host data set such as text, audio, image, or video [1, 2, 3, 4]. Applications include watermarking, steganography, image databases, and in band captioning. Most watermarking research to date has focused on novel ways to hide information and to detect and or remove hidden information [2, 5] However, a rigorous theory describing the fundamental limits of any ....

....2 k D1 , D2 , and those with low variance, # 2 k D1 , D2 . The signal components are independent. Assume that # 2 k D1 , D2 for 1 # k # K # and # 2 k D1 , D2 for K # k # K. Then we have C = 1 2 r # log # 1 D1 D2 D1 # , 2) where r # = # K # k=1 rk # [0, 1] is the fraction of strong signal components. In conclusion, for spike models: P1 The optimal power allocations by the data hider and the attacker are independent of the signal variances # 2 k in the strong channels, provided that these variances are large relative to D1 and D2 . P2 The ....

IEEE Journal on Selected Areas in Communications, Special Issue on Copyright and Privacy Protection, Vol. 16, No. 4, May 1998.

....on individual signal power. We shows that to achieve the capacity the shifts should be normally distributed, have maximum power, and adjacent shifts should be negatively correlated. I. Introduction Many image watermarking methods have been proposed to protect motion and still pictures (see e.g. [5], 6] and references therein) Most of these works, however, are suitable for images with rich greyscale. For text documents, whose image is often binary, marks placed by some of these methods can be easily removed by binarization. We have proposed in [1] 7] 2] a different approach for marking ....

IEEE. Journal on Selected Areas in Communications, volume 16(4). IEEE Communications Society, May 1998. Special issue on Copyright and Privacy Protection.

....products are already being developed. The first three International Workshops on Information Hiding were held in 1996, 1998, and 1999. Special issues of the IEEE Journal on Selected Areas in Communications and of the Proceedings of IEEE were recently devoted to copyright and privacy protection [1, 2]. An excellent review of the current state of the art appears in [3] and comprehensive surveys of image and multimedia watermarking techniques are available from [4, 5] The majority of the papers to date have focused on novel ways to hide information and to detect and or remove hidden ....

....and to detect and or remove hidden information. However, these papers have lacked a guiding theory describing the fundamental limits of any information hiding system. The need for practitioners and system designers to understand the nature of these fundamental limits has been recognized [1, 3, 5, 6, 7]. We help to close this gap by providing a theoretical 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 ....

[Article contains additional citation context not shown here]

IEEE Journal on Selected Areas in Communications, Special Issue on Copyright and Privacy Protection, Vol. 16, No. 4, May 1998.

....of severe distortions introduced by such processes. This paper presents one of the two detection techniques used in our system. Watermarking methods have been proposed to discourage illicit reproduction of picture and video images in [23] 1] 15] 24] 9] 10] 5] 14] 7] 22] 21] [8]. But these techniques either are not directly applicable to or do not exploit the regular structure of text documents. Moreover most image marking techniques are ideal to mark images with rich greyscale and may not be well suited for binary images, such as an text image, since slight perturbation ....

IEEE. Journal on Selected Areas in Communications. IEEE Communications Society, 1998. Special issue on Copyright and Privacy Protection.

.... Research, Florham Park, NJ 07932, Email: nfm research.att.com. down to encode a 0 by 1 pixel, or 1 300th inch, at 300 dot per inch (dpi) resolution. This contrasts with other interesting image marking approaches, 20] 1] 15] 22] 9] 10] 5] 14] 7] see also papers in this issue [8]) that do not exploit the regular structure of text documents. The two approaches may be combined to encode more information: general image marking techniques can be applied to a document image that has already been marked by our techniques (but see comment below on binarization attack on marking ....

IEEE. Journal on Selected Areas in Communications. IEEE Communications Society, 1998. Special issue on Copyright and Privacy Protection.

No context found.

IEEE Journal on Selected Areas in Communications, Special Issue on Copyright and Privacy Protection, Vol. 16, No. 4, May 1998.

No context found.

IEEE Journal on Selected Areas in Communications. Special Issue on Copyright and Privacy Protection, vol. 16, no. 4, May 1998.

No context found.

IEEE Journal on Selected Areas in Communications, Special Issue on Copyright and Privacy Protection, Vol. 16, No. 4, May 1998.

No context found.

IEEE Journal on Selected Areas in Communications, Special Issue on Copyright and Privacy Protection, Vol. 16, No. 4, May 1998.

No context found.

IEEE Journal on Selected Areas of Communications, IEEE Communications Society, 1998. Special Issue on Copyright and Privacy Protection.

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