skip to main content
10.1145/1288869.1288893acmconferencesArticle/Chapter ViewAbstractPublication Pagesih-n-mmsecConference Proceedingsconference-collections
Article

Geometric warping watermarking extended concerning geometric attacks and embedding artifacts

Published:20 September 2007Publication History

ABSTRACT

In this paper, we present a non-blind uncompressed domain geometric warping-based video watermarking approach with high robustness to strong lossy compression. We use the approved idea of changing the geometric video structure to embed the watermark bits. In this paper, the parameterization of the geometric structure and the basic embedding process is described. The resulting video quality and the possibility of re-synchronization after geometric attacks are two main issues of this work. We propose a solution which divides the 3-dimensional video space (two spatial and one temporal dimension) into different regions. In this way, we can parameterize and control the resulting video quality and suitability for re-synchronization. The resulting watermark is very robust to strong lossy compression. For example, a H.264/AVC compression which degrades the video quality down to a PSNR of 25 dB induces a watermark bit error rate of only 0.16%. The proposed approach prevents visible artifacts and flicker effects. The average resulting capacity (round about 2 bits per frame) is sufficient for applications such as fingerprinting.

References

  1. Pröfrock D., Schlauweg M. and Müller E. Video Watermarking by Using Geometric Warping Without Visible Artifacts. Proc. of Information Hiding (8th IH 2006), Alexandria, USA, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Perez-Gonzales F. and Hernandez J. R. A tutorial on digital watermarking. Proc. of International Carnahan Conference on Security Technology, pp. 286--292, Madrid Spain, 1999.Google ScholarGoogle ScholarCross RefCross Ref
  3. Voloshynovski S., Pereira S., Pun T., Eggers J. J. and Su J. K. Attacks on Digital Watermarks: Classification, Estimation-based Attacks and Benchmarks. In IEEE Communications Magazine, vol. 39, issue 8, pp. 118--126, 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Maes M. J. J. J. B. and van Overveld C. W. A. M. Digital watermarking by geometric warping. Proc. of International Conference on Image Processing (ICIP), vol. 2, pp. 424--426, Cicago, Il, USA, 1989.Google ScholarGoogle Scholar
  5. Schürmann A. Dense Ellipsoid Packings. Journal of Discrete Mathematics, vol. 247, n. 1-3, pp. 243--249, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. Pfender F. and Ziegler M. G. Kissing Numbers, Sphere Packings, and Some Unexpected Proofs. Notices Amer. Math. Soc. 51, no. 8, pp. 873--883, 2004.Google ScholarGoogle Scholar
  7. Lichtenauer J. F., Setyawan I., Kalker T. and Lagendijk, R. L Exhaustive geometrical search and the false positive watermark detection probability. In Security and Watermarking of Multimedia Contents V, Proc. SPIE Vol. 5020, pp. 203--214, 2003.Google ScholarGoogle Scholar
  8. Loo P. and Kingsbury N. Motion-estimation-based registration of geometrically distorted images for watermark recovery. In Security and Watermarking of Multimedia Contents III, Proc. SPIE Vol. 4314, pp. 606--617, 2001.Google ScholarGoogle Scholar

Index Terms

  1. Geometric warping watermarking extended concerning geometric attacks and embedding artifacts

            Recommendations

            Comments

            Login options

            Check if you have access through your login credentials or your institution to get full access on this article.

            Sign in
            • Published in

              cover image ACM Conferences
              MM&Sec '07: Proceedings of the 9th workshop on Multimedia & security
              September 2007
              260 pages
              ISBN:9781595938572
              DOI:10.1145/1288869

              Copyright © 2007 ACM

              Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

              Publisher

              Association for Computing Machinery

              New York, NY, United States

              Publication History

              • Published: 20 September 2007

              Permissions

              Request permissions about this article.

              Request Permissions

              Check for updates

              Qualifiers

              • Article

              Acceptance Rates

              Overall Acceptance Rate128of318submissions,40%

            PDF Format

            View or Download as a PDF file.

            PDF

            eReader

            View online with eReader.

            eReader