No Cover Image

Journal article 602 views

COVER: A Secure Blind Image Watermarking Scheme

Yuling Luo, Fangxiao Wang, Junxiu Liu Orcid Logo, Liangjia Li, Scott Yang Orcid Logo, Shunsheng Zhang

Circuits, Systems, and Signal Processing, Volume: 41, Issue: 12, Pages: 6931 - 6959

Swansea University Author: Scott Yang Orcid Logo

Full text not available from this repository: check for access using links below.

Check full text

DOI (Published version): 10.1007/s00034-022-02099-z

Abstract

The robustness and imperceptibility of the watermarking algorithm are a pair of contradictory properties. When the robustness increases, the imperceptibility decreases. Most strategies proposed in the literature usually concentrate on improving robustness, but few consider the relationship between r...

Full description

Published in: Circuits, Systems, and Signal Processing
ISSN: 0278-081X 1531-5878
Published: Springer Science and Business Media LLC 2022
Online Access: Check full text

URI: https://cronfa.swan.ac.uk/Record/cronfa60689
Tags: Add Tag
No Tags, Be the first to tag this record!
first_indexed 2022-08-26T16:52:35Z
last_indexed 2023-03-14T04:20:28Z
id cronfa60689
recordtype SURis
fullrecord <?xml version="1.0" encoding="utf-8"?><rfc1807 xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:xsd="http://www.w3.org/2001/XMLSchema"><bib-version>v2</bib-version><id>60689</id><entry>2022-08-01</entry><title>COVER: A Secure Blind Image Watermarking Scheme</title><swanseaauthors><author><sid>81dc663ca0e68c60908d35b1d2ec3a9b</sid><ORCID>0000-0002-6618-7483</ORCID><firstname>Scott</firstname><surname>Yang</surname><name>Scott Yang</name><active>true</active><ethesisStudent>false</ethesisStudent></author></swanseaauthors><date>2022-08-01</date><deptcode>SCS</deptcode><abstract>The robustness and imperceptibility of the watermarking algorithm are a pair of contradictory properties. When the robustness increases, the imperceptibility decreases. Most strategies proposed in the literature usually concentrate on improving robustness, but few consider the relationship between robustness and imperceptibility. To deal with this problem, a robust blind image watermarking method is proposed in this work, which is composed of a logistic-sine-COupling map, discrete waVElet transform, and appRoximate maximum eigenvalue of Schur decomposition, namely COVER. In the proposed COVER, an objective function and a two-stage search method are designed to determine the optimal embedding coefficient, thus balancing the imperceptibility and robustness of this work. Specifically, the host image is transformed into four sub-bands by discrete wavelet transform, and the low-low sub-band is further separated into non-overlapping blocks which can be calculated to get the approximate maximum eigenvalues (AMEs) of Schur decomposition. Especially, each AME is not contained in the real Schur decomposition, which effectively reduces the computational complexity. Then, the original AMEs of the host image are updated to complete the embedding process according to the binary feature of encrypted watermark and the proposed embedding method. Finally, the watermarked image is obtained. The experimental results show that all peak signal noise ratio values are above 42 dB, structural similarity index measure values are above 0.98, normalized correlation values are above 0.9, and all bit errors rates are less than 0.14. Compared with six state-of-the-art schemes, the proposed COVER has strong robustness, good imperceptibility, large capacity, and low computational complexity.</abstract><type>Journal Article</type><journal>Circuits, Systems, and Signal Processing</journal><volume>41</volume><journalNumber>12</journalNumber><paginationStart>6931</paginationStart><paginationEnd>6959</paginationEnd><publisher>Springer Science and Business Media LLC</publisher><placeOfPublication/><isbnPrint/><isbnElectronic/><issnPrint>0278-081X</issnPrint><issnElectronic>1531-5878</issnElectronic><keywords>Image watermarking; DWT; Approximate maximum eigenvalue; Objective function</keywords><publishedDay>1</publishedDay><publishedMonth>12</publishedMonth><publishedYear>2022</publishedYear><publishedDate>2022-12-01</publishedDate><doi>10.1007/s00034-022-02099-z</doi><url>http://dx.doi.org/10.1007/s00034-022-02099-z</url><notes/><college>COLLEGE NANME</college><department>Computer Science</department><CollegeCode>COLLEGE CODE</CollegeCode><DepartmentCode>SCS</DepartmentCode><institution>Swansea University</institution><apcterm/><funders>This research was supported by the National Natural Science Foundation of China under Grant 61801131 and the Guangxi Natural Science Foundation under Grant 2022GXNSFAA035632.</funders><projectreference/><lastEdited>2023-10-16T12:19:56.4081543</lastEdited><Created>2022-08-01T10:24:10.8234654</Created><path><level id="1">Faculty of Science and Engineering</level><level id="2">School of Mathematics and Computer Science - Computer Science</level></path><authors><author><firstname>Yuling</firstname><surname>Luo</surname><order>1</order></author><author><firstname>Fangxiao</firstname><surname>Wang</surname><order>2</order></author><author><firstname>Junxiu</firstname><surname>Liu</surname><orcid>0000-0002-9790-1571</orcid><order>3</order></author><author><firstname>Liangjia</firstname><surname>Li</surname><order>4</order></author><author><firstname>Scott</firstname><surname>Yang</surname><orcid>0000-0002-6618-7483</orcid><order>5</order></author><author><firstname>Shunsheng</firstname><surname>Zhang</surname><order>6</order></author></authors><documents/><OutputDurs/></rfc1807>
spelling v2 60689 2022-08-01 COVER: A Secure Blind Image Watermarking Scheme 81dc663ca0e68c60908d35b1d2ec3a9b 0000-0002-6618-7483 Scott Yang Scott Yang true false 2022-08-01 SCS The robustness and imperceptibility of the watermarking algorithm are a pair of contradictory properties. When the robustness increases, the imperceptibility decreases. Most strategies proposed in the literature usually concentrate on improving robustness, but few consider the relationship between robustness and imperceptibility. To deal with this problem, a robust blind image watermarking method is proposed in this work, which is composed of a logistic-sine-COupling map, discrete waVElet transform, and appRoximate maximum eigenvalue of Schur decomposition, namely COVER. In the proposed COVER, an objective function and a two-stage search method are designed to determine the optimal embedding coefficient, thus balancing the imperceptibility and robustness of this work. Specifically, the host image is transformed into four sub-bands by discrete wavelet transform, and the low-low sub-band is further separated into non-overlapping blocks which can be calculated to get the approximate maximum eigenvalues (AMEs) of Schur decomposition. Especially, each AME is not contained in the real Schur decomposition, which effectively reduces the computational complexity. Then, the original AMEs of the host image are updated to complete the embedding process according to the binary feature of encrypted watermark and the proposed embedding method. Finally, the watermarked image is obtained. The experimental results show that all peak signal noise ratio values are above 42 dB, structural similarity index measure values are above 0.98, normalized correlation values are above 0.9, and all bit errors rates are less than 0.14. Compared with six state-of-the-art schemes, the proposed COVER has strong robustness, good imperceptibility, large capacity, and low computational complexity. Journal Article Circuits, Systems, and Signal Processing 41 12 6931 6959 Springer Science and Business Media LLC 0278-081X 1531-5878 Image watermarking; DWT; Approximate maximum eigenvalue; Objective function 1 12 2022 2022-12-01 10.1007/s00034-022-02099-z http://dx.doi.org/10.1007/s00034-022-02099-z COLLEGE NANME Computer Science COLLEGE CODE SCS Swansea University This research was supported by the National Natural Science Foundation of China under Grant 61801131 and the Guangxi Natural Science Foundation under Grant 2022GXNSFAA035632. 2023-10-16T12:19:56.4081543 2022-08-01T10:24:10.8234654 Faculty of Science and Engineering School of Mathematics and Computer Science - Computer Science Yuling Luo 1 Fangxiao Wang 2 Junxiu Liu 0000-0002-9790-1571 3 Liangjia Li 4 Scott Yang 0000-0002-6618-7483 5 Shunsheng Zhang 6
title COVER: A Secure Blind Image Watermarking Scheme
spellingShingle COVER: A Secure Blind Image Watermarking Scheme
Scott Yang
title_short COVER: A Secure Blind Image Watermarking Scheme
title_full COVER: A Secure Blind Image Watermarking Scheme
title_fullStr COVER: A Secure Blind Image Watermarking Scheme
title_full_unstemmed COVER: A Secure Blind Image Watermarking Scheme
title_sort COVER: A Secure Blind Image Watermarking Scheme
author_id_str_mv 81dc663ca0e68c60908d35b1d2ec3a9b
author_id_fullname_str_mv 81dc663ca0e68c60908d35b1d2ec3a9b_***_Scott Yang
author Scott Yang
author2 Yuling Luo
Fangxiao Wang
Junxiu Liu
Liangjia Li
Scott Yang
Shunsheng Zhang
format Journal article
container_title Circuits, Systems, and Signal Processing
container_volume 41
container_issue 12
container_start_page 6931
publishDate 2022
institution Swansea University
issn 0278-081X
1531-5878
doi_str_mv 10.1007/s00034-022-02099-z
publisher Springer Science and Business Media LLC
college_str Faculty of Science and Engineering
hierarchytype
hierarchy_top_id facultyofscienceandengineering
hierarchy_top_title Faculty of Science and Engineering
hierarchy_parent_id facultyofscienceandengineering
hierarchy_parent_title Faculty of Science and Engineering
department_str School of Mathematics and Computer Science - Computer Science{{{_:::_}}}Faculty of Science and Engineering{{{_:::_}}}School of Mathematics and Computer Science - Computer Science
url http://dx.doi.org/10.1007/s00034-022-02099-z
document_store_str 0
active_str 0
description The robustness and imperceptibility of the watermarking algorithm are a pair of contradictory properties. When the robustness increases, the imperceptibility decreases. Most strategies proposed in the literature usually concentrate on improving robustness, but few consider the relationship between robustness and imperceptibility. To deal with this problem, a robust blind image watermarking method is proposed in this work, which is composed of a logistic-sine-COupling map, discrete waVElet transform, and appRoximate maximum eigenvalue of Schur decomposition, namely COVER. In the proposed COVER, an objective function and a two-stage search method are designed to determine the optimal embedding coefficient, thus balancing the imperceptibility and robustness of this work. Specifically, the host image is transformed into four sub-bands by discrete wavelet transform, and the low-low sub-band is further separated into non-overlapping blocks which can be calculated to get the approximate maximum eigenvalues (AMEs) of Schur decomposition. Especially, each AME is not contained in the real Schur decomposition, which effectively reduces the computational complexity. Then, the original AMEs of the host image are updated to complete the embedding process according to the binary feature of encrypted watermark and the proposed embedding method. Finally, the watermarked image is obtained. The experimental results show that all peak signal noise ratio values are above 42 dB, structural similarity index measure values are above 0.98, normalized correlation values are above 0.9, and all bit errors rates are less than 0.14. Compared with six state-of-the-art schemes, the proposed COVER has strong robustness, good imperceptibility, large capacity, and low computational complexity.
published_date 2022-12-01T12:19:57Z
_version_ 1779910781561733120
score 11.037056

Similar Items