Voyatzis, G., Pitas, I.: Applications of toral automorphisms in image watermarking. In: Proc. IEEE Int. Conf. Image Processing. Volume 2., Laussane, Switzerland (1996) 237--240  Home/Search   Document Not in Database   Summary   Related Articles   Check

....(see soundness in Section 3.3) we chose the phrase fair . Previous Work Since the invention of digital watermarks the problem of proving authorship for digital works has been the subject of intense research and has undergone considerable development. Early publications, such as [1, 2, 3], focused on developing robust watermarking schemes and treated authorship proofs in a rather informal and simplistic way. The common belief was that embedding the author s identity as a watermark into all his works prior to publication and proving the presence of this watermark later in some work ....

I. Pitas and G. Voyatzis, "Applications of toral automorphisms in image watermarking." IEEE Signal Processing Society, 1996.

....To increase the security of the watermark, Matsui and Tanaka [5] have proposed a method that uses a secret key to select the locations where a watermark is embedded, e.g. the use of a pseudo random number generator to determine the sequence of locations on the image plane. Voyatzis and Pitas [2] have used a total automorphism approach to scramble the digital watermark before a watermark is inserted into an image. Bruyndonckx [9] has proposed a scheme based on pixel region classification. Pixels are classified as pertaining to regions of hard, progressive or noise contrast. Then, the ....

G. Voyatzis and I. Pitas, "Applications of toral automorphisms in image watermarking", Proceedings of IEEE International Conference on Image Processing, Vol. 2, 1996.

....zones are split into two categories A and B, defined by a grid generated by the coder. The code is embedded by modifying the luminance values in the blocks in such a way that some given relationships among the luminance mean values of each zone and category are satisfied. Also, Voyatzis et al.: [18] embed a watermark which is assumed to be a bitmap binary logo of size S 1 Theta S 2 ; a spatial transformation called toral automorphism is iteratively applied, producing a watermark of size M 1 Theta M 2 presenting a chaotic reallocation of the logo binary pixels. The watermark is embedded ....

Voyatzis, G and Pitas, I, Applications of Toral Automorphisms in Image Watermarking, IEEE International Conference on Image Processing (ICIP'96), Lausanne, Switzerland, 16-19 September 1996, vol. II, 237--240.

....against attacks to modify both the signal and the verification data. In the next section we discuss the digital watermarking problem. 2. 2 The Digital Watermarking Approach Traditionally, digital watermarking has been used to embed author and copyright identification into a multimedia signal [6, 7, 8, 9, 10, 11]. The watermark must be retained in the signal even under intentional signal distortion attacks to remove it. In contrast, fragile watermarking refers to the process of marking a signal such that any modification causes the extracted mark to be different than the original which indicates that ....

G. Voyatzis and I. Pitas, "Applications of toral automorphisms in image watermarking," in Proc. IEEE Int. Conference on Image Processing, vol. 2, pp. 237--240, 1996.

....2 WATERMARK LITERATURE OVERVIEW A variety of watermarking techniques has been proposed by various authors in the last three years. The proposed algorithms can be classified in two main classes on the basis of the utilisation of the original image during the detection phase. Algorithms proposed in [11, 12, 9, 10, 20, 13] do not require the original image whereas in those presented in [17, 18, 16, 7] the original image is input in the detection algorithm along with the watermarked image. Detectors of the second type have the advantage to detect the watermarks in images that have been extensively modified in ....

....4.3 Watermark detection Watermark detection is the most important part in a watermarking algorithm. We denote this procedure by the function D. The detector output may be either a binary (yes no) decision [11, 12] on the existence of a watermark or a longer bitstream carrying various information [8, 9, 10]. When the watermark is image dependent, the associated key K 2 K is first input in F , W is created and inserted in D. Note that F should be robust to changes in the image because otherwise it would produce a wrong key when applied on an image that has been manipulated. By taking under ....

G.Voyatzis and I.Pitas, "Applications of Toral automorphisms in image watermarking", Proceedings of ICIP'96, vol II, pp. 237-240, 1996.

....copyright protection of images is still in its early stages and none of the existing methods is totally effective against attacks. The techniques proposed so far can be classified in two broad categories : i) methods that embed the watermark by directly modifying the intensity of certain pixels [2, 9, 6, 10, 5, 11]. ii) methods that act upon selected coefficients of a properly chosen transform domain (DCT domain, DFT domain etc) 20, 21, 16, 7, 8, 17, 18, 12, 13] Watermarking techniques can be alternatively split into two distinct classes depending on whether the original image is necessary for the ....

G. Voyatzis and I. Pitas, "Applications of toral automorphisms in image watermarking", Proc. 1996 IEEE Int. Conference on Image Processing (ICIP 96), vol II, pp 237-240.

....2 WATERMARK LITERATURE OVERVIEW A variety of watermarking techniques has been proposed by various authors in the last three years. The proposed algorithms can be classified in two main classes on the basis of the utilisation of the original image during the detection phase. Algorithms proposed in [11, 12, 9, 10, 20, 13] do not require the original image whereas in those presented in [17, 18, 16, 7] the original image is input in the detection algorithm along with the watermarked image. Detectors of the second type have the advantage to detect the watermarks in images that have been extensively modified in ....

....4.3 Watermark detection Watermark detection is the most important part in a watermarking algorithm. We denote this procedure by the function D. The detector output may be either a binary (yes no) decision [11, 12] on the existence of a watermark or a longer bitstream carrying various information [8, 9, 10]. When the watermark is image dependent, the associated key K 2 K is first input in F , W is created and inserted in D. Note that F should be robust to changes in the image because otherwise it would produce a wrong key when applied on an image that has been manipulated. By taking under ....

G.Voyatzis and I.Pitas, "Applications of Toral automorphisms in image watermarking", Proceedings of ICIP'96, vol II, pp. 237-240, 1996.

.... [1, 2] However, better performance can be achieved when (p) is calculated by using masking models based on the human visual system [12, 16] The contribution of the intensity value of all the pixels in B p , for watermarking the pixel p, is necessary in order to produce resistant alterations [17, 18]. As it becomes clear in Sections 3.3 and 4, the detection function should be positive or negative when the embedding function g 1 or g 0 are used respectively. Therefore, watermark robustness is succeeded when D p preserves its sign when image modifications take place. 3.3 Detection of the ....

G.Voyatzis and I.Pitas, Applications of Toral automorphisms in image watermarking, Proceedings of ICIP'96, vol II, 237-240 (1996).

No context found.

Voyatzis, G., Pitas, I.: Applications of toral automorphisms in image watermarking. In: Proc. IEEE Int. Conf. Image Processing. Volume 2., Laussane, Switzerland (1996) 237--240

No context found.

G. Voyatzis and Ioannis Pitas. Application of toral automorphisms in image watermarking. In Proceedings of the IEEE International Conference on Image Processing, ICIP '96, volume 2, pages 237-240, Lausanne, Switzerland, September 1996.

No context found.

Voy96 G. Voyatzis and I. Pitas, Applications of Toral Automorphisms In Image Watermarking, ICIP 1996, Vol II. pp. 237-240.

No context found.

Ioannis Pitas and George Voyatzis. Applications of toral automorphisms in image watermarking. IEEE Signal Processing Society, 1996.

No context found.

G. Voyatzis and I. Pitas, "Applications of toral automorphisms in image watermarking," in Proc. Int. Conf. Image Processing (ICIP), vol. 3, Lausanne, Switzerland, Sept. 1996, pp. 237--240.

No context found.

G. Voyatzis and I. Pitas, "Application of Toral Automorphism in Image Watermarking", Proc. IEEE International Conf. on Image Processing, ICIP-96, Vol.2, pp.237-240.

No context found.

G. Voyatzis and I. Pitas, "Applications of Toral Automorphisms in Image Watermarking", Proceedings ICIP-96, IEEE International Conference on Image Processing, Volume II pp 237-240, Lausanne, Switzerland, 16-19 September 1996

No context found.

G. Voyatzis and I. Pitas, "Applications of toral automorphisms in image watermarking," in Proc. IEEE Int. Conf. Image Processing, 1996, vol. 2, pp. 237--240.

No context found.

G. Voyatzis and I. Pitas, "Applications of Toral Automorphisms in Image Watermarking", Proceedings

No context found.

G. Voyatzis and I. Pitas, "Applications of toral automorphisms in image watermaking", Proceedings of IEEE International Conference on Image Processing, Vol. 2, 1996, pp. 237-240.

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