A new incremental watermarking based on dual-tree complex wavelet transform
This paper proposes a new incremental watermarking technique, which is robust for affine transformation and time-varying according to the degree of distortion, using Dual-Tree Complex Wavelet Transform (DT-CWT). At the embedding step, the proposed algorithm inserts a given watermark into the phase c...
Gespeichert in:
| Veröffentlicht in: | The Journal of supercomputing 2005-07, Vol.33 (1-2), p.133-140 |
|---|---|
| Hauptverfasser: | , , , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 140 |
|---|---|
| container_issue | 1-2 |
| container_start_page | 133 |
| container_title | The Journal of supercomputing |
| container_volume | 33 |
| creator | Lee, Joong-Jae Kim, Won Lee, NA-Young Kim, Gye-Young |
| description | This paper proposes a new incremental watermarking technique, which is robust for affine transformation and time-varying according to the degree of distortion, using Dual-Tree Complex Wavelet Transform (DT-CWT). At the embedding step, the proposed algorithm inserts a given watermark into the phase components of a transformed image by DT-CWT. At the extracting step, the algorithm incrementally compares the extracted with the original watermark using correlation from lowest to highest level. The proposed technique through performance evaluation displays that it was more robust in geometric distortions than a conventional CWT-based watermarking. |
| doi_str_mv | 10.1007/BF02764146 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_2786545839</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2786545839</sourcerecordid><originalsourceid>FETCH-LOGICAL-c325t-460166b89e85da4f7f34c42e3b6a5b3489a8ad616eda14f5209c71e2e6d32c953</originalsourceid><addsrcrecordid>eNpFkE1LAzEURYMoWKsbf0HAnTD68p1Z1mJVLLjR9ZDJvJHWmUxNUmv_vSMVXN3N4V7uIeSSwQ0DMLd3C-BGSyb1EZkwZUQB0spjMoGSQ2GV5KfkLKU1AEhhxIQ8z2jAHV0FH7HHkF1Hdy5j7F38WIV3WruEDR0CbbauK3JEpH7oNx1-j9wXdphpji6kdoj9OTlpXZfw4i-n5G1x_zp_LJYvD0_z2bLwgqtcSA1M69qWaFXjZGtaIb3kKGrtVC2kLZ11jWYaG8dkqziU3jDkqBvBfanElFwdejdx-NxiytV62MYwTlbcWK2ksqIcqesD5eOQUsS22sTVeGtfMah-ZVX_ssQPmahbdw</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2786545839</pqid></control><display><type>article</type><title>A new incremental watermarking based on dual-tree complex wavelet transform</title><source>SpringerLink Journals - AutoHoldings</source><creator>Lee, Joong-Jae ; Kim, Won ; Lee, NA-Young ; Kim, Gye-Young</creator><creatorcontrib>Lee, Joong-Jae ; Kim, Won ; Lee, NA-Young ; Kim, Gye-Young</creatorcontrib><description>This paper proposes a new incremental watermarking technique, which is robust for affine transformation and time-varying according to the degree of distortion, using Dual-Tree Complex Wavelet Transform (DT-CWT). At the embedding step, the proposed algorithm inserts a given watermark into the phase components of a transformed image by DT-CWT. At the extracting step, the algorithm incrementally compares the extracted with the original watermark using correlation from lowest to highest level. The proposed technique through performance evaluation displays that it was more robust in geometric distortions than a conventional CWT-based watermarking.</description><identifier>ISSN: 0920-8542</identifier><identifier>EISSN: 1573-0484</identifier><identifier>DOI: 10.1007/BF02764146</identifier><language>eng</language><publisher>New York: Springer Nature B.V</publisher><subject>Affine transformations ; Algorithms ; Inserts ; Performance evaluation ; Robustness ; Watermarking ; Wavelet transforms</subject><ispartof>The Journal of supercomputing, 2005-07, Vol.33 (1-2), p.133-140</ispartof><rights>Springer Science + Business Media, Inc 2005.</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c325t-460166b89e85da4f7f34c42e3b6a5b3489a8ad616eda14f5209c71e2e6d32c953</citedby><cites>FETCH-LOGICAL-c325t-460166b89e85da4f7f34c42e3b6a5b3489a8ad616eda14f5209c71e2e6d32c953</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,780,784,27923,27924</link.rule.ids></links><search><creatorcontrib>Lee, Joong-Jae</creatorcontrib><creatorcontrib>Kim, Won</creatorcontrib><creatorcontrib>Lee, NA-Young</creatorcontrib><creatorcontrib>Kim, Gye-Young</creatorcontrib><title>A new incremental watermarking based on dual-tree complex wavelet transform</title><title>The Journal of supercomputing</title><description>This paper proposes a new incremental watermarking technique, which is robust for affine transformation and time-varying according to the degree of distortion, using Dual-Tree Complex Wavelet Transform (DT-CWT). At the embedding step, the proposed algorithm inserts a given watermark into the phase components of a transformed image by DT-CWT. At the extracting step, the algorithm incrementally compares the extracted with the original watermark using correlation from lowest to highest level. The proposed technique through performance evaluation displays that it was more robust in geometric distortions than a conventional CWT-based watermarking.</description><subject>Affine transformations</subject><subject>Algorithms</subject><subject>Inserts</subject><subject>Performance evaluation</subject><subject>Robustness</subject><subject>Watermarking</subject><subject>Wavelet transforms</subject><issn>0920-8542</issn><issn>1573-0484</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2005</creationdate><recordtype>article</recordtype><recordid>eNpFkE1LAzEURYMoWKsbf0HAnTD68p1Z1mJVLLjR9ZDJvJHWmUxNUmv_vSMVXN3N4V7uIeSSwQ0DMLd3C-BGSyb1EZkwZUQB0spjMoGSQ2GV5KfkLKU1AEhhxIQ8z2jAHV0FH7HHkF1Hdy5j7F38WIV3WruEDR0CbbauK3JEpH7oNx1-j9wXdphpji6kdoj9OTlpXZfw4i-n5G1x_zp_LJYvD0_z2bLwgqtcSA1M69qWaFXjZGtaIb3kKGrtVC2kLZ11jWYaG8dkqziU3jDkqBvBfanElFwdejdx-NxiytV62MYwTlbcWK2ksqIcqesD5eOQUsS22sTVeGtfMah-ZVX_ssQPmahbdw</recordid><startdate>20050701</startdate><enddate>20050701</enddate><creator>Lee, Joong-Jae</creator><creator>Kim, Won</creator><creator>Lee, NA-Young</creator><creator>Kim, Gye-Young</creator><general>Springer Nature B.V</general><scope>AAYXX</scope><scope>CITATION</scope></search><sort><creationdate>20050701</creationdate><title>A new incremental watermarking based on dual-tree complex wavelet transform</title><author>Lee, Joong-Jae ; Kim, Won ; Lee, NA-Young ; Kim, Gye-Young</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c325t-460166b89e85da4f7f34c42e3b6a5b3489a8ad616eda14f5209c71e2e6d32c953</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2005</creationdate><topic>Affine transformations</topic><topic>Algorithms</topic><topic>Inserts</topic><topic>Performance evaluation</topic><topic>Robustness</topic><topic>Watermarking</topic><topic>Wavelet transforms</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Lee, Joong-Jae</creatorcontrib><creatorcontrib>Kim, Won</creatorcontrib><creatorcontrib>Lee, NA-Young</creatorcontrib><creatorcontrib>Kim, Gye-Young</creatorcontrib><collection>CrossRef</collection><jtitle>The Journal of supercomputing</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Lee, Joong-Jae</au><au>Kim, Won</au><au>Lee, NA-Young</au><au>Kim, Gye-Young</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A new incremental watermarking based on dual-tree complex wavelet transform</atitle><jtitle>The Journal of supercomputing</jtitle><date>2005-07-01</date><risdate>2005</risdate><volume>33</volume><issue>1-2</issue><spage>133</spage><epage>140</epage><pages>133-140</pages><issn>0920-8542</issn><eissn>1573-0484</eissn><abstract>This paper proposes a new incremental watermarking technique, which is robust for affine transformation and time-varying according to the degree of distortion, using Dual-Tree Complex Wavelet Transform (DT-CWT). At the embedding step, the proposed algorithm inserts a given watermark into the phase components of a transformed image by DT-CWT. At the extracting step, the algorithm incrementally compares the extracted with the original watermark using correlation from lowest to highest level. The proposed technique through performance evaluation displays that it was more robust in geometric distortions than a conventional CWT-based watermarking.</abstract><cop>New York</cop><pub>Springer Nature B.V</pub><doi>10.1007/BF02764146</doi><tpages>8</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0920-8542 |
| ispartof | The Journal of supercomputing, 2005-07, Vol.33 (1-2), p.133-140 |
| issn | 0920-8542 1573-0484 |
| language | eng |
| recordid | cdi_proquest_journals_2786545839 |
| source | SpringerLink Journals - AutoHoldings |
| subjects | Affine transformations Algorithms Inserts Performance evaluation Robustness Watermarking Wavelet transforms |
| title | A new incremental watermarking based on dual-tree complex wavelet transform |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-12T09%3A41%3A57IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=A%20new%20incremental%20watermarking%20based%20on%20dual-tree%20complex%20wavelet%20transform&rft.jtitle=The%20Journal%20of%20supercomputing&rft.au=Lee,%20Joong-Jae&rft.date=2005-07-01&rft.volume=33&rft.issue=1-2&rft.spage=133&rft.epage=140&rft.pages=133-140&rft.issn=0920-8542&rft.eissn=1573-0484&rft_id=info:doi/10.1007/BF02764146&rft_dat=%3Cproquest_cross%3E2786545839%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2786545839&rft_id=info:pmid/&rfr_iscdi=true |