File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1145/1027527.1027630
- Scopus: eid_2-s2.0-13444303950
Supplementary
-
Citations:
- Scopus: 0
- Appears in Collections:
Conference Paper: Key-dependant decomposition based image watermarking
Title | Key-dependant decomposition based image watermarking |
---|---|
Authors | |
Keywords | Image watermarking Key-dependant decomposition |
Issue Date | 2004 |
Citation | ACM Multimedia 2004 - proceedings of the 12th ACM International Conference on Multimedia, 2004, p. 428-431 How to Cite? |
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. |
Persistent Identifier | http://hdl.handle.net/10722/336020 |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Hu, Shiyan | - |
dc.date.accessioned | 2024-01-15T08:22:05Z | - |
dc.date.available | 2024-01-15T08:22:05Z | - |
dc.date.issued | 2004 | - |
dc.identifier.citation | ACM Multimedia 2004 - proceedings of the 12th ACM International Conference on Multimedia, 2004, p. 428-431 | - |
dc.identifier.uri | http://hdl.handle.net/10722/336020 | - |
dc.description.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. | - |
dc.language | eng | - |
dc.relation.ispartof | ACM Multimedia 2004 - proceedings of the 12th ACM International Conference on Multimedia | - |
dc.subject | Image watermarking | - |
dc.subject | Key-dependant decomposition | - |
dc.title | Key-dependant decomposition based image watermarking | - |
dc.type | Conference_Paper | - |
dc.description.nature | link_to_subscribed_fulltext | - |
dc.identifier.doi | 10.1145/1027527.1027630 | - |
dc.identifier.scopus | eid_2-s2.0-13444303950 | - |
dc.identifier.spage | 428 | - |
dc.identifier.epage | 431 | - |