ACM Home Page
Please provide us with feedback. Feedback
Key-dependant decomposition based image watermarking
Full text PdfPdf (214 KB)
Source International Multimedia Conference archive
Proceedings of the 12th annual ACM international conference on Multimedia table of contents
New York, NY, USA
POSTER SESSION: Technical poster session 3: multimedia tools, end-systems, and applications table of contents
Pages: 428 - 431  
Year of Publication: 2004
ISBN:1-58113-893-8
Author
Shiyan Hu  Polytechnic University, Brooklyn, NY
Sponsors
SIGMULTIMEDIA: ACM Special Interest Group on Multimedia
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 3,   Downloads (12 Months): 13,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1027527.1027630
What is a DOI?

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

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked 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.
 
2
 
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.
 
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.
 
5
 
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.
 
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.
 
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.
 
9
M. Russell, J.A. Clark, and S. Stepney. Using ants to attack a classical cipher. GECCO, pages 146--147, 2003.