R. L. Lagendijk G. C. Langelaar, J. C. A. van der Lubbe. Robust Labeling Methods for Copy Protection of Images. In Proceedings of the SPIE Conference on Storage and Retrieval for Image and Video Databases V, volume 3022, pages 298--309, San Jose, CA, February 1997.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....(called the screen) with a certain halftone pattern is overlaid on a printed version of the watermarked image. Upon sliding the testing sheet into alignment with the printed image, a visible watermark appears. The mark is invisible in the printed image itself. One perceptual spatial algorithm [45] segments the image into blocks, much like VW2D. The amplitude of the mark (which originates from a pseudorandom sequence that uniquely identifies the owner) is adapted to the corresponding image block. However, the amplitude of mark is the same for all pixels in the block. 12 3.3 Perceptual ....

....Fourier Transform (DFT) of an image. A second DFT based technique uses properties of the DFT to create a watermark resistant to geometric attacks (rescaling, translation and rotation) 59] One such property is the rotation invariance of the DFT amplitude [60] The second method presented in [45] sets certain DCT coefficients to zero. This is done when the corresponding watermark bit equals 1; only higher frequency coefficients are adjusted. A different technique assigns an integer to each 8 x 8 DCT block; adding this integer to all non zero DCT coefficients in the block marks the block ....

G. C. Langelaar, J. van der Lubbe, and R. L. Lagendijk, "Robust labeling methods for copy protection of images", Proceedings of the SPIE International Conference on Storage and Retrieval for Image and Video Databases V, San Jose, CA, Feb. 13-14, 1997, vol. 3022, pp. 298-309.

....[24] Public marking (also referred to as blind marking) remains the most challenging problem since it requires neither the secret original I nor the embedded mark M. In deed such systems really extract n bits of information (the mark) from the marked image: I # K # M [25] 26] 27] [28], 29] Public marks have much more applications than the others and we will focus our benchmark on these systems. Indeed the embedding algorithms used in public systems can usually be used in private ones, improving robustness at the same time. There is also asymmetric marking (or public key ....

....is increased without any change in the average luminosity of the image. With suitable parameters, Patchwork even survives compression using JPEG. However, it embeds only one bit of information. To embed more, one can first split the image into pieces and then apply the embedding to each of them [28], 66] These statistical methods give a kind of primitive spread spectrum modulation. General spread spectrum systems encode data in the choice of a binary sequence that appears like noise to an outsider but which a legitimate receiver, furnished with an appropriate key, can recognise. Spread ....

G. C. Langelaar, J. C. A. van der Lubbe, and R. L. Lagendijk, "Robust labeling methods for copy protection of images." In Sethin and Jain [149], pp. 298--309, ISBN 0-8194-2433-1.

....set is increased without any change in the average luminosity of the image. With suitable parameters, Patchwork even survives compression using JPEG. However, it embeds only 1 bit of information. To embed more, one can first split the image into pieces and then apply the embedding to each of them [27], 66] These statistical methods give a kind of primitive spread spectrum modulation. General spread spectrum systems encode data in the choice of a binary sequence that appears like noise to an outsider but which a legitimate receiver, furnished with an appropriate key, can recognize. Spread ....

G. C. Langelaar, J. C. A. van der Lubbe, and R. L. Lagendijk, "Robust labeling methods for copy protection of images," in Storage and Retrieval for Image and Video Database V, vol. 3022, I. K. Sethin and R. C. Jain, Eds. San Jose, CA: IS&T and SPIE, pp. 298--309.

....pairs of pixels; it makes the brighter pixel brighter and the duller pixel duller and the contrast change in this pixel subset encodes one bit. To maintain reasonable robustness against filtering attacks, the bandwidth of such systems has to be limited to at most a few hundred bits per image [40, 41]. In a similar way, marks can be embedded in audio by increasing the amplitude contrast of many pairs of randomly chosen sound samples and using a suitable filter to minimise the introduction of high frequency noise. More sophisticated variants on this theme involve spread spectrum techniques. ....

....is widely used by compression algorithms. Thus when marking sound one could add a pseudorandom sequence to the excitation signal in 222 an LPC or CELP coded audio signal [45] and when marking an image one could use the DCT domain. Langelaar et al. remove certain high frequency DCT coefficients [41]; Cox et al. modulate the 1000 largest DCT coe#cients of an image with a random vector [19] Koch et al. change the quantisation of the DCT coe #cients and modify some of them in such a way that a certain property (order in size) is verified [37] while O Ruanaidh et al. modulate the DCT ....

Gerrit C. Langelaar, Jan C.A. van der Lubbe, and Reginald L. Lagendijk. Robust labeling methods for copy protection of images. In Sethin and Jain [62], pages 298--309.

....for many multimedia applications, are taken into account [51, 45, 50] The main techniques used are: This work has been made under CNRS grant: Programme T el ecommunications. It benefitted from the help of Teddy Furont and S everine Baudry ffl in the spatial domain, solutions were proposed in [24, 25, 40, 39, 47, 1, 22, 5] and many other. ffl in the DCT domain, the label is often embedded in the middle frequencies, where the robustness to washing is better [52, 53, 42, 41, 13, 3] ffl in the wavelets coefficients [20, 21] ffl by cryptographic techniques [19, 46, 44, 28, 16] ffl by fractal techniques: 14, ....

G.C. Langelaar, J.C.A. van der Lubbe, and R. L Lagendijk. Robust labeling methods for copy protection of images. In SPIE Conf, San Jose (Cal), 1997.

....of the data using techniques analogous to spread spectrum communications, hiding a narrow band signal in a wide band. The watermark consists of 1000 randomly generated numbers. The length of the watermark is variable and can be adjusted to suit the characteristics of the data. Langelaar et al. [GCL97] propose two image watermarking methods. The first one extends the existing spatial labeling technique which adds a positive integer constant k to the brightness of 50 of the pixels in an image. This constant k is called the label embedding level. By dividing the image into blocks and searching ....

R. L. Lagendijk G. C. Langelaar, J. C. A. van der Lubbe. Robust Labeling Methods for Copy Protection of Images. In Proceedings of the SPIE Conference on Storage and Retrieval for Image and Video Databases V, volume 3022, pages 298--309, San Jose, CA, February 1997.

....signatures which can be used to authenticate images. Using their methodology, signature systems can be designed which allow certain types of image modification but prevent other types from manipulation. They also propose an extension of the authentication system towards video. Langelaar et al. [15] propose two image watermarking methods. The first one extends the existing spatial labeling technique which adds a positive integer constant k to the brightness of 50 of the pixels in an image. This constant k is called the label embedding level. By dividing the image into blocks and searching ....

R. L. Lagendijk G. C. Langelaar, J. C. A. van der Lubbe. Robust Labeling Methods for Copy Protection of Images. In Proceedings of the SPIE Conference on Storage and Retrieval for Image and Video Databases V, volume 3022, pages 298--309, San Jose, CA, February 1997.

....watermark is recovered by modulating with the modulation function. Many variants of this approach exist. Only a few will be mentioned here. Bender et al. [2] and Pitas and Kaskalis [3] describe two precursors of this watermarking method, which add one watermark bit to an image. Langelaar et al. [4] extend the method described in [3] to store more watermark bits in one image and to find optimal gain factors for each pseudo random block. Hartung and Girod [5] extend method [1] for real time watermarking of MPEG video. In general, the strength of the method is determined by measuring the ....

....bit errors) and we obtain the image which is shown in Figure 7. This image hardly distorted. If the blocksize n is increased further to 128 or 256, the watermark is fully removed in smooth images, but only partially in textured images. Finally, the WRS is applied to the method of Langelaar e al [4]. This method determines the gain factor G for each watermark bit automatically. Therefore only the blocksize n can be changed. All watermarks added with this method can be removed for n=8,16,32. For n=64,128 . the watermarks are only partially removed. Some methods (e.g. 9] first subtract ....

G.C. Langelaar, J.C.A. van der Lubbe, R.L. Lagendijk, "Robust Labeling Methods for Copy Protection of Images", Proceedings of Storage and Retrieval for Image and Video Databases V, San Jose (CA), USA, February 1997

....drastically decrease the quality of the video, or increase the size of the labeled data. Therefore we need other techniques which can be applied directly on the MPEG compressed data and which do not have the mentioned drawbacks. In this paper two such techniques are proposed and evaluated [11,12]. The methods are inspired by the same concept of changing DCTblock s variable length codes (VLC s) but they differ considerably in complexity, robustness and label bit rate. The first method adds the label directly in the MPEG 2 bitstream by replacing VLC s. Since decoding and re encoding the ....

G.C. Langelaar, J.C.A. van der Lubbe, R.L. Lagendijk: "Robust Labeling Methods for Copy Protection of Images", Proc. Storage and Retrieval for Image and Video Databases V, San Jose (CA), USA, February 1997

....watermark is recovered by demodulating with the modulation function. Many variants of this approach exist. Only a few will be mentioned here. Bender et al. [2] and Pitas and Kaskalis [3] describe two precursors of this watermarking method, which add one watermark bit to an image. Langelaar et al. [4] extend the method described in [3] to store more watermark bits in one image and to find optimal gain factors for each pseudo random block. Hartung and Girod [5] extend method [1] for real time watermarking of MPEG video. In general, the strength of the method is determined by measuring the ....

....7. If higher gain factors are used the watermark becomes visible. If the parameter n is increased further to 128 or 256, the watermark is fully removed in smooth images, but only partially in textured images. Finally, the watermark removing algorithm is applied to the method of Langelaar et al. [4]. This method determines the gain factor G for each watermark bit automatically. Therefore only the parameter n can be changed. All watermarks added with this method can be removed for n=8,16,32. For n=64,128, the watermarks are only partially removed. Some methods (e.g. 9] first subtract ....

G.C. Langelaar, J.C.A. van der Lubbe, R.L. Lagendijk, "Robust Labeling Methods for Copy Protection of Images", Proceedings of Storage and Retrieval for Image and Video Databases V, San Jose (CA), USA, February 1997

.... or watermarking technique is being considered as a viable alternative [And98,Bra97,Lan99,Smi96,Zha95] By embedding an invisible and robust watermark into the image or video data, unauthorized copies can be traced [Cox97,Mac95,Kal99,Nik96,Wol99] and copy protection schemes can be implemented [Lan97,Lan98]. There are several approaches to embed a watermark into an image or video frame. First generation watermarking techniques typically embed a secret message or label bit string into an image via characteristic pseudo random noise patterns. These noise patterns can be generated and added in the ....

G.C. Langelaar, J.C.A. van der Lubbe, R.L. Lagendijk, "Robust Labeling Methods for Copy Protection of Images", Proceedings of SPIE Electronic Imaging '97, Storage and Retrieval for Image and Video Databases V, February 1997, San Jose (CA), USA 21

No context found.

R. L. Lagendijk G. C. Langelaar, J. C. A. van der Lubbe. Robust Labeling Methods for Copy Protection of Images. In Proceedings of the SPIE Conference on Storage and Retrieval for Image and Video Databases V, volume 3022, pages 298--309, San Jose, CA, February 1997.

No context found.

G. C. Langelaar, J. C. A. van der Lubbe, and R. L. Lagendijk, "Robust labeling methods for copy protection of images," in Proc. SPIE Conf. Electronic Imaging, San Jose, CA, Feb. 1997.

No context found.

Gerrit C. Langelaar, Reginald L. Lagendijk, and Jan Biemond. Robust labeling methods for copy protection of images. In Ishwar K. Sethi and Ramesh C. Jain, editors, Proceedings of the SPIE Storage and Retrieval for Image and Video Databases V, volume 3022, San Jose, California, 1997.

No context found.

C. Langelaar, J. C. A. ven der Lubbe, and R. L. Lagendijk, "Robust labeling methods for copy protection of images," in Proc. Electronic Imaging, San Jose, CA, Feb. 1997, vol. 3022, pp. 298--309. [Online]. Available WWW: http://wwwit. et.tudelft.nl/gerhard/home.html.

No context found.

G. C. Langelaar, J. C. A. van der Lubbe, and R. L. Lagendijk, "Robust labeling methods for copy protection of images", In Sethin and Jain [50], pp. 298--309.

No context found.

R. L. Lagendijk G. C. Langelaar, J. C. A. van der Lubbe, "Robust Labeling Methods for Copy Protection of Images", Proc. of the SPIE Conference on Storage and Retrieval for Image and Video Databases V, vol. 3022, pp. 298--309, San Jose, CA, February 1997.

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