J. Fridrich, "Visual hash for oblivious watermarking", in Proc. of SPIE Photonic Wes Electronic Imaging 2000, Security and Watermarking of Multimedia Con tents . San Jose CA: January 24-26, 2000. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Hybrid Robust Watermarking Resistant Against Copy Attack - Deguillaume.. (2002) (Correct)
....watermark, achieved by a robust image hashing. Unlike previous hash functions, the hash value of robust hashing changes continously with the input, bychanging only a small number of bits for a perceptually slight modification of the input. Robust hashing, for example based on a low pass transform [2], can be used. Secondly,wehave to replace the LSB approachby a robust embedding. The hash codes can then be embedded as a payload within the robust watermark, maybe with a weaker strength, and or within the reference watermark# positions independent from the robust payload can still be chosen. ....
J. Fridrich. Visual hash for oblivious watermarking. In IS&T/SPIE Proceedings,volume 3971, San Jose, California, USA, January 2000.
Robust Hash Functions for Digital Watermarkin - Fridrich, Goljan Self-citation (Fridrich) (Correct)
....modifications, such as rotation, shift, and change of scale, also lead to a failure to extract the correct bits. Detailed evaluation of experiments can be found in our previous paper [7] Modification of the scheme that should exhibit robustness to scaling and rotation has been described in [10]. 5. Robustness to intentional attacks The security of the hash is in the secrecy of the smooth patterns. An attacker who does not know the key cannot purposelymodify the projections. The best he can do is to introduce noise hoping that the projections will change. In this section, we look at ....
....key K, two images that can be matched after applying gra scale operations, such as lossy compression, recoloring, filtering, noise adding, gamma correction, and simple geometrical operations including rotation and scaling, the extracted N tuple will be almost the same except fo a few bits. In [7,10], it is explained how the extracted N tuple can be further utilized for synthesizing a Gaussian sequence that gradually changes with increasing number of errors in the extracted bits. Thus the robust hash function can be used for generating pseudo random watermark sequences that depend sensitively ....
J. Fridrich, "Visual Hash for Oblivious Watermarking", Proc. SPIE Photonic West Electronic Imaging 2000.
Spatial-Domain Image Watermarking Robust against.. - Sebe, Domingo-Ferrer, .. (Correct)
No context found.
J. Fridrich, "Visual hash for oblivious watermarking", in Proc. of SPIE Photonic Wes Electronic Imaging 2000, Security and Watermarking of Multimedia Con tents . San Jose CA: January 24-26, 2000.
Watermarking for Multilevel Access to Statistical.. - Domingo-Ferrer.. (2001) (Correct)
No context found.
J. Fridrich. Visual hash for oblivious watermarking. In Proc. of SPIE Photonic West Electronic Imaging 2000.
Robust Hash Functions for Visual Data: An Experimental Comparison - Skrepth, Uhl (2003) (Correct)
No context found.
Jiri Fridrich. Visual hash for oblivious watermarking. In Ping Wah Wong and Edward J. Delp, editors, Proceedings of IS&T/SPIE's 12th Annual Symposium, Electronic Imaging 2000.
Information-Theoretic Data-Hiding for Public.. - Voloshynovskiy.. (2003) (Correct)
No context found.
J. Fridrich, "Visual hash for oblivious watermarking," in IS&T/SPIE Proceedings, vol. 3971, San Jose, California, USA, January 2000.
Robust Authentication Of The Jpeg 2000 Bitstream - Roland Norcen And (2004) (Correct)
No context found.
Jiri Fridrich. Visual hash for oblivious watermarking. In Ping Wah Wong and Edward J. Delp, editors, Proceedings of IS&T/SPIE's 12th Annual Symposium, Electronic Imaging 2000.
Resistance of Anti-Disclosure Image Watermark to Collusion and.. - Lu, Hsu (2003) (Correct)
No context found.
J. Fridrich, "Visual Hash for Oblivious Watermarking," Proc. SPIE: Security and Watermarking of Multimedia Contents II ,Vol. 3971, 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