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

Scale-invariant image watermarking via optimization algorithms for quantizing randomized statistics

Published:20 September 2004Publication History

ABSTRACT

We introduce a novel approach for blind and semi-blind watermarking and apply it to images. We derive randomized robust semi-global features of images in a suitable transform domain (wavelets in case of images) and quantize them in order to embed the watermark. Quantization is carried out by embedding to the host a computed sequence via solving an optimization problem whose parameters are known to the information hider, but unknown to the attacker. The image features are rationa statistics of pseudo-random regions; these statistics are by construction invariant against scaling attacks and approximately invariant against several contrast enhancement modifications (such as histogram equalization). This scheme can be seen as an improved version of our previous image watermarking algorithm [1].

References

  1. M. K. Mihçak, R. Venkatesan, and M. Kesal, "Watermarking via optimization algorithms for quantizing randomized statistics of image regions," in Proc. 40th Annual Allerton Conf. on Communication, Control and Computing Monticello, Illinois, October 2002.]]Google ScholarGoogle Scholar
  2. F. Petitcolas, R. Anderson, and M. Kuhn. "Attacks on copyright marking systems," in Proc. 2nd Int. Workshop on Information Hiding Port and, Oregon, April 1998.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. R. Venkatesan, S. Koon, M. Jakubowski, and P. Moulin, "Robust Image Hashing," in Proc. Int. Conf. Image Processing Vancouver, Canada, September 2000.]]Google ScholarGoogle Scholar
  4. T. Liu and P. Moulin, "Error exponents for one-bit watermarking," in Proc. Int. Conf. Acoustics, Speech, and Signal Processing Hong Kong, April 2003.]]Google ScholarGoogle Scholar
  5. M. K. Mihçak and P. Moulin, "Information embedding codes matched to ocally stationary Guassian image models," in Proc. Int. Conf. Image Processing Rochester, New York, September 2002.]]Google ScholarGoogle ScholarCross RefCross Ref

Index Terms

  1. Scale-invariant image watermarking via optimization algorithms for quantizing randomized statistics

              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 '04: Proceedings of the 2004 workshop on Multimedia and security
                September 2004
                236 pages
                ISBN:1581138547
                DOI:10.1145/1022431

                Copyright © 2004 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 2004

                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