Article

Key-dependant decomposition based image watermarking

Author:

Shiyan HuAuthors Info & Claims

MULTIMEDIA '04: Proceedings of the 12th annual ACM international conference on Multimedia

Pages 428 - 431

https://doi.org/10.1145/1027527.1027630

Published: 10 October 2004 Publication History

Get Access

Abstract

In this paper, we propose a novel image watermarking algorithm, which is based on the scheme where the watermark is embedded into projection of an image onto the secret set of key-dependant basis functions. We propose a key-dependant image decomposition method, which involves solving a bottleneck hamiltonian path problem by an ant colony optimization technique. Combined with the decomposition technique, the original scheme is significantly improved on the aspects of speed, capacity and security. In particular, our algorithm usually shortens the running time of the original scheme by a factor of several hundred.

References

[1]

M. Dorigo and L.M. Gambardella. Ant colony system: A cooperative learning approach to the traveling salesman problem. IEEE Transactions on Evolutionary Computation, 1(1):53--66, 1997.]]

Digital Library

Google Scholar

[2]

J. Fridrich, L. Arnold, C. Baldoza, and R.J. Simard. Robust digital watermarking based on key-dependent basis functions. Proc. 2nd Information Hiding Workshop, LNCS vol. 1525, Springer-Verlag, New York, pages 143--157, 1998.]]

Crossref

Google Scholar

[3]

P. Kumar and P.I. Rockett. Triplet geometric representation: A novel scale, translation and rotation invariant feature representation based on geometric constraints for recognition of 2D object features. Image and Vision Computing, 15(3):235--249, 1997.]]

Crossref

Google Scholar

[4]

C-Y. Lin, M. Wu, J.A. Bloom, M.L. Miller, I.J. Cox, and Y-M. Lui. Rotation, scale, and translation resilient public watermarking for images. IEEE Transactions on Image Processing, 10(5):767--782, 2001.]]

Digital Library

Google Scholar

[5]

V. Maniezzo and A. Colorni. The ant system applied to the quadratic assignment problem. IEEE Transactions on Knowledge and Data Engineering, 11(5):769--778, 1999.]]

Digital Library

Google Scholar

[6]

V. Maniezzo, L.M. Gambardella, and F. de~Luigi. Ant colony optimization. New Optimization Techniques in Engineering, by G.C. Onwubolu and B.V. Babu, Springer-Verlag Berlin Heidelberg, pages 101--117, 2004.]]

Google Scholar

[7]

J. Mayer and R.A. Silva. Efficient informed embedding of multi-bit watermark. International Conference on Acoustics, Speech, and Signal Processing (ICASSP), III:399--402, 2004.]]

Crossref

Google Scholar

[8]

X. Qi and J. Qi. Improved affine resistant watermarking by using robust templates. International Conference on Acoustics, Speech, and Signal Processing (ICASSP), III:405--408, 2004.]]

Google Scholar

[9]

M. Russell, J.A. Clark, and S. Stepney. Using ants to attack a classical cipher. GECCO, pages 146--147, 2003.]]

Digital Library

Google Scholar

Cited By

View all

Arora MKhurana M(2020)Secure image encryption technique based on jigsaw transform and chaotic scrambling using digital image watermarkingOptical and Quantum Electronics10.1007/s11082-019-2130-352:2Online publication date: 20-Jan-2020
https://doi.org/10.1007/s11082-019-2130-3
Wei JLin YWu Y(2019)A patch analysis method to detect seam carved imagesPattern Recognition Letters10.1016/j.patrec.2013.09.02636(100-106)Online publication date: 6-Jan-2019
https://dl.acm.org/doi/10.1016/j.patrec.2013.09.026
Surapathi RDatta KSengupta I(2012)Key Dependent Feature Point Based Image Watermaking SchemeAdvances in Computer Science and Information Technology. Computer Science and Engineering10.1007/978-3-642-27308-7_53(498-507)Online publication date: 2012
https://doi.org/10.1007/978-3-642-27308-7_53

Index Terms

Key-dependant decomposition based image watermarking
1. Computing methodologies
  1. Artificial intelligence
    1. Computer vision
  2. Computer graphics
    1. Image manipulation
      1. Image processing

Recommendations

Color image blind watermarking scheme based on QR decomposition

Most of the existing color image watermarking schemes use binary or gray-level image as watermark, and many of them belong to non-blind watermarking methods. It is a challenging problem to design a blind color image watermarking scheme. Based on QR ...
A blind double color image watermarking algorithm based on QR decomposition

In this paper, a novel blind image watermarking scheme based on QR decomposition is proposed to embed color watermark image into color host image, which is significantly different from using the binary or gray image as watermark. When embedding ...
Robust image watermarking scheme using bit-plane of hadamard coefficients

Nowadays, due to widespread usage of the Internet, digital contents are distributed quickly and inexpensively throughout the world. Watermarking techniques can help protect authenticity of digital contents by identifying their owners. In a watermarking ...

Comments

Information & Contributors

Information

Published In

MULTIMEDIA '04: Proceedings of the 12th annual ACM international conference on Multimedia

October 2004

1028 pages

ISBN:1581138938

DOI:10.1145/1027527

General Chairs:
Henning Schulzrinne
Columbia University
,
Nevenka Dimitrova
Philips Research
,
Program Chairs:
Angela Sasse
UCL
,
Sue Moon
KAIST
,
Rainer Lienhart
U Augsburg

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: 10 October 2004

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

MM04

Sponsor:

MM04: 2004 12th Annual ACM International Conference on Multimedia

October 10 - 16, 2004

NY, New York, USA

Acceptance Rates

Overall Acceptance Rate 995 of 4,171 submissions, 24%

Upcoming Conference

MM '24

Sponsor:
sigmm

The 32nd ACM International Conference on Multimedia

October 28 - November 1, 2024

Melbourne , VIC , Australia

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

3
Total Citations
View Citations
289
Total Downloads

Downloads (Last 12 months)2
Downloads (Last 6 weeks)0

Reflects downloads up to 22 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Arora MKhurana M(2020)Secure image encryption technique based on jigsaw transform and chaotic scrambling using digital image watermarkingOptical and Quantum Electronics10.1007/s11082-019-2130-352:2Online publication date: 20-Jan-2020
https://doi.org/10.1007/s11082-019-2130-3
Wei JLin YWu Y(2019)A patch analysis method to detect seam carved imagesPattern Recognition Letters10.1016/j.patrec.2013.09.02636(100-106)Online publication date: 6-Jan-2019
https://dl.acm.org/doi/10.1016/j.patrec.2013.09.026
Surapathi RDatta KSengupta I(2012)Key Dependent Feature Point Based Image Watermaking SchemeAdvances in Computer Science and Information Technology. Computer Science and Engineering10.1007/978-3-642-27308-7_53(498-507)Online publication date: 2012
https://doi.org/10.1007/978-3-642-27308-7_53

View Options

Get Access

Login options

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

Cited By

Index Terms

Recommendations

Color image blind watermarking scheme based on QR decomposition

A blind double color image watermarking algorithm based on QR decomposition

Robust image watermarking scheme using bit-plane of hadamard coefficients