Abstract
We define transparent watermarking algorithms as those whose expected distortions of input images are at most c log l, as measured under the average absolute difference metric (l is the range of possible pixel values, and c is a positive constant.) Our definition is based on asymptotic analyses of the expected distortions caused by two prototypical watermarking methods generally considered as transparent: the Patchwork and NEC methods. We also propose some shift-resistant variants of these distortion metrics that incorporate alignment techniques used in DNA string comparisons. Experiments show that these new distortion metrics yield much smaller values when a small number of columns are deleted.
This research is partially supported by the US Air Force Office of Scientific Research under Grant F49620-00-1-03 and matching support from the Kansas Technology Enterprise Corporation.
Our proposal is patterned after historical developments in the field of analysis of algorithms. In the early days, the performance of an algorithm was often reported
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
W. Bender, D. Gruhl, N. Morimoto, and A. Lu. Techniques for data hiding. IBM Systems Journal, 35(3-4):313–336, 1996.
I. Cox, J. Kilian, F. Leighton, and T. Shamoon. Secure spread spectrum watermarking for multimedia. IEEE Transactions on Image Processing, 6(12):1673–1687, Dec 1997.
S. Craver, N. Memon, B.-L. Yeo, and M. Yeung. On the invertibility of invisible watermarking techniques. In Proceedings of International Conference on Image Processing, pages 540–543, 1997.
B. Girod. The information theoretical significance of spatial and temporal masking in video signals. In Proceedings of SPIE Human Vision, Visual Processing, and Digital Display, volume 1007, pages 178–187, 1989.
D. Hankerson, G. A. Harris, and P. D. Johnson, Jr. Introduction to Information Theory and Data Compression. CRC Press, 1998.
C. J. v. B. Lambrecht, editor. Vision Models and Applications to Image and Video Processing. Kluwer Academic Publishers, 2001.
E. W. Myers and W. Miller. Optimal alignments in linear space. Computer Applications in the Biosciences, 4(1):11–17, 1988.
F. A. P. Petitcolas, R. J. Anderson, and M. G. Kuhn. Attacks on copyright marking systems. In Proceedings of the 2nd International Workshop on Information Hiding, pages 218–238, 1998.
Y. Rubner and C. Tomasi. Perceptual Metrics for Image Database Navigation. Kluwer Academic Publishers, 2000.
N. Tran. Hiding functions and computational security of image watermarking systems. In Proceedings of the 15th IEEE Computer Security Foundations Workshop, 2002.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tran, N., Wang, L. (2002). Asymptotic Analyses of Visual Distortions: A New Approach to Defining Transparency. In: Chen, YC., Chang, LW., Hsu, CT. (eds) Advances in Multimedia Information Processing — PCM 2002. PCM 2002. Lecture Notes in Computer Science, vol 2532. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36228-2_56
Download citation
DOI: https://doi.org/10.1007/3-540-36228-2_56
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00262-8
Online ISBN: 978-3-540-36228-9
eBook Packages: Springer Book Archive