M. M. Yeung and F. C. Mintzer, "Invisible watermarking for image verification," in Proc. International Conference on Image Processing, vol. 2, (Washington, DC), pp. 680--683, October 1997.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....approach to eliminate these artifacts is known as improved gray scale (IGS) quantization [16] This concept is similar to the error diffusion method that is commonly used in 9 Figure 8: Result of applying MER component on Fig. 6. conversion of true color images to palette based color ones[17, 18]. One advantage of error diffusion is that the average image intensity values can be preserved. In our IGSC component, the embedding error is evenly spread to the bottom and right neighboring pixels (the white neighboring pixels shown in Fig. 5) Let e(x# y) denote the embedding error of pixel p ....

YEUNG, M.M., and MINTZER F.C.: 'Invisible watermarking for image verification ', J. Electron. Imaging, 1998, 7(3), pp. 578-591 17

....is in the area of robust techniques. Many important applications could benefit from the use of fragile watermarks. 3. Fragile Marking Applications A fragile watermark is a mark that is readily altered or destroyed when the host image is modified through a linear or nonlinear transformation [3]. Fragile marks are not suited for enforcing copyright ownership of digital images; an attacker would attempt to destroy the embedded mark and fragile marks are, by definition, easily destroyed. The sensitivity of fragile marks to modification leads to their use in image authentication. That is, ....

....in the spatial domain of an image, such as techniques described in Walton [16] and van Schyndel et al. 17] These techniques embed the mark in the least significant bit plane for perceptual transparency. Their significant disadvantages include the ease of bypassing the security they provide [3][18] and the inability to lossy compress the image without damaging the mark. Wolfgang and Delp [11] extended van Schyndel s work to improve robustness and localization in their VW2D technique. The mark is embedded by adding a bipolar Msequence in the spatial domain. Detection is via a modified ....

[Article contains additional citation context not shown here]

M. Yeung and F. Mintzer, "Invisible watermarking for image verification," Journal of Electronic Imaging, vol. 7, no. 3, pp. 578-591, July 1998.

....and distinguished from areas where the watermarked image has not been modified. Early fragile watermarking systems embedded checksums [5] or pseudo random sequences [6, 7] in the least significant bit (LSB) plane of an image while more recent systems apply more sophisticated embedding mechanisms [8], including the use of cryptographic hash functions [9] to detect changes to a watermarked image. Robust and fragile watermarks are not ideal when considering information preserving transformations (such as compression) which preserve the meaning or expression of the content and information ....

M. Yeung and F. Mintzer, "Invisible watermarking for image verification," Journal of Electronic Imaging, vol. 7, no. 3, pp. 578-591, July 1998.

....will not represent the smooth area of an image well. An efficient approach to eliminate these artifacts is known as improved gray scale (IGS) quantization [16] This concept is similar to the error diffusion method that is commonly used in conversion of true color images to palette based color ones[17, 18]. One advantage of error diffusion is that the average image intensity values can be preserved. In our IGSC component, the embedding error is evenly spread to the bottom and right neighboring pixels (the white neighboring pixels shown in Fig. 5) Let e(x# y) denote the embedding error of pixel p ....

YEUNG, M.M., and MINTZER F.C.: 'Invisible watermarking for image verification ', J. of Electronic Imaging, 1998, 7(3), pp. 578-591 15 (a) (b)

....extracting) authentication codes in digital signals by means of an appropriate watermark. There has been little attention paid to cryptanalysis of proposed authentication techniques. In this paper we cryptanalyze one such proposed technique, namely the Yeung Mintzer fragile watermarking technique [14,15], and show that it has a significant weakness and is subject to substitution and impersonation attacks. Although we focus mainly on the Yeung Mintzer technique, they also apply to some of the attacks we develop are also applicable to other techniques based on the Yeung Mintzer approach (for ....

....of superior quality by means of a sophisticated dithering process. In section 5 we then conclude with a discussion on how the Yeung Mintzer technique needs to be used and or modified to make our attacks difficult. 2. THE YEUNG MINTZER AUTHENTICATION WATERMARK The Yeung Mintzer technique [14, 15] is perhaps one of the earliest and most cited fragile watermarking technique in the literature. In this technique, a watermark image W(usually a binary logo image) is embedded into a source image X to obtain a watermarked image X . IV is of the same dimensions as the image X. If the watermarked ....

[Article contains additional citation context not shown here]

M.-Yeung and F.-Mintzer, "Invisible watermarking for image verification," Journal of Electronic Imaging, 7(3), 576-591 (1998).

....Watermarks to verify that object content A second application cluster uses watermarks to determine whether a media object has been altered since some earlier time when it was watermarked. Some applications scenarios for this cluster are also given in [2] Some example techniques are described in [9,10,11]. In a typical image application, an image is watermarked at the time it is loaded into a digital library. At some later time, the watermark is extracted. If the extracted watermark matches the inserted watermark, the object is judged to be unchanged; if it does not match the inserted watermark, ....

....until the extracted watermark matched the watermark inserted in the true image. To prevent such a false insertion, a watermark key is also often used with fragile watermarks. Fragile watermarks do not require redundancy. Consequently, they often convey very large amounts of data. The technique of [11], for example, embeds one bit of watermark data for each pixel in the marked image; this can be millions of bits. 1.3 Watermarks to convey captions The third application cluster uses watermarks to convey objectspecific information, called captions, to a community of willing recipients. With ....

Minerva M. Yeung and Frederick C. Mintzer, "Invisible Watermarking for Image Verification, Journal of Electronic Imaging, March 1998, pages 578-591.

No context found.

M. M. Yeung and F. C. Mintzer, "Invisible watermarking for image verification," in Proc. International Conference on Image Processing, vol. 2, (Washington, DC), pp. 680--683, October 1997.

No context found.

M. Yeung and F. Mintez, "Invisible watermarking for image verification," Journal of Electronic Imaging, vol. 7, no. 3, pp. 578-591, 1988.

No context found.

M. M. Yeung and F. C. Mintzer, "Invisible watermarking for image verification," J. Electron. Imaging 7#3#, 578 --591 #July 1998#.

No context found.

M. M. Yeung and F. C. Mintzer. Invisible watermarking for image verification. Journal of Electronic Imaging, 7(3):578--591, July 1998.

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