Blind Image Watermarking Based on Adaptive Data Spreading in n-Level DWT Subbands
This paper proposes a new adaptive watermarking scheme for digital images, which has the properties of blind extraction, invisibility, and robustness against attacks. The typical scheme for invisibility and robustness consisted of two main techniques: finding local positions to be watermarked and mi...
Main Authors: | , , |
---|---|
Format: | Article |
Language: | English |
Published: |
Hindawi-Wiley
2019-01-01
|
Series: | Security and Communication Networks |
Online Access: | http://dx.doi.org/10.1155/2019/8357251 |
id |
doaj-8e55f6b0620e477eb277d8481582d023 |
---|---|
record_format |
Article |
spelling |
doaj-8e55f6b0620e477eb277d8481582d0232020-11-25T00:19:34ZengHindawi-WileySecurity and Communication Networks1939-01141939-01222019-01-01201910.1155/2019/83572518357251Blind Image Watermarking Based on Adaptive Data Spreading in n-Level DWT SubbandsYong-Seok Lee0Young-Ho Seo1Dong-Wook Kim2Kwangwoon University, 913 Chambit Bld., 20 Kwangwoon-ro, Nowon-Gu, Seoul 01897, Republic of KoreaKwangwoon University, 913 Chambit Bld., 20 Kwangwoon-ro, Nowon-Gu, Seoul 01897, Republic of KoreaKwangwoon University, 913 Chambit Bld., 20 Kwangwoon-ro, Nowon-Gu, Seoul 01897, Republic of KoreaThis paper proposes a new adaptive watermarking scheme for digital images, which has the properties of blind extraction, invisibility, and robustness against attacks. The typical scheme for invisibility and robustness consisted of two main techniques: finding local positions to be watermarked and mixing or embedding the watermark into the pixels of the locations. In finding the location, however, our scheme uses a global space such that the multiple watermarking data is spread out over all four lowest-frequency subbands, resulting from n-level Mallat-tree 2D (dimensional) DWT, where n depends on the amount of watermarking data and the resolution of the host image, without any further process to find the watermarking locations. To embed the watermark data into the subband coefficients, weighting factors are used according to the type and energy of each subband to adjust the strength of the watermark, so we call this an adaptive scheme. To examine the ability of the proposed scheme, images with various resolutions are tested for various attacks, both pixel-value changing attacks and geometric attacks. With experimental results and comparison to the existing works we show that the proposed scheme has better performance than the previous works, except those which specialize in certain types of attacks.http://dx.doi.org/10.1155/2019/8357251 |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Yong-Seok Lee Young-Ho Seo Dong-Wook Kim |
spellingShingle |
Yong-Seok Lee Young-Ho Seo Dong-Wook Kim Blind Image Watermarking Based on Adaptive Data Spreading in n-Level DWT Subbands Security and Communication Networks |
author_facet |
Yong-Seok Lee Young-Ho Seo Dong-Wook Kim |
author_sort |
Yong-Seok Lee |
title |
Blind Image Watermarking Based on Adaptive Data Spreading in n-Level DWT Subbands |
title_short |
Blind Image Watermarking Based on Adaptive Data Spreading in n-Level DWT Subbands |
title_full |
Blind Image Watermarking Based on Adaptive Data Spreading in n-Level DWT Subbands |
title_fullStr |
Blind Image Watermarking Based on Adaptive Data Spreading in n-Level DWT Subbands |
title_full_unstemmed |
Blind Image Watermarking Based on Adaptive Data Spreading in n-Level DWT Subbands |
title_sort |
blind image watermarking based on adaptive data spreading in n-level dwt subbands |
publisher |
Hindawi-Wiley |
series |
Security and Communication Networks |
issn |
1939-0114 1939-0122 |
publishDate |
2019-01-01 |
description |
This paper proposes a new adaptive watermarking scheme for digital images, which has the properties of blind extraction, invisibility, and robustness against attacks. The typical scheme for invisibility and robustness consisted of two main techniques: finding local positions to be watermarked and mixing or embedding the watermark into the pixels of the locations. In finding the location, however, our scheme uses a global space such that the multiple watermarking data is spread out over all four lowest-frequency subbands, resulting from n-level Mallat-tree 2D (dimensional) DWT, where n depends on the amount of watermarking data and the resolution of the host image, without any further process to find the watermarking locations. To embed the watermark data into the subband coefficients, weighting factors are used according to the type and energy of each subband to adjust the strength of the watermark, so we call this an adaptive scheme. To examine the ability of the proposed scheme, images with various resolutions are tested for various attacks, both pixel-value changing attacks and geometric attacks. With experimental results and comparison to the existing works we show that the proposed scheme has better performance than the previous works, except those which specialize in certain types of attacks. |
url |
http://dx.doi.org/10.1155/2019/8357251 |
work_keys_str_mv |
AT yongseoklee blindimagewatermarkingbasedonadaptivedataspreadinginnleveldwtsubbands AT younghoseo blindimagewatermarkingbasedonadaptivedataspreadinginnleveldwtsubbands AT dongwookkim blindimagewatermarkingbasedonadaptivedataspreadinginnleveldwtsubbands |
_version_ |
1725371207488897024 |