CN109829846B - Digital image blind watermarking method based on two-dimensional discrete cosine transform - Google Patents

Digital image blind watermarking method based on two-dimensional discrete cosine transform Download PDF

Info

Publication number
CN109829846B
CN109829846B CN201910085504.0A CN201910085504A CN109829846B CN 109829846 B CN109829846 B CN 109829846B CN 201910085504 A CN201910085504 A CN 201910085504A CN 109829846 B CN109829846 B CN 109829846B
Authority
CN
China
Prior art keywords
watermark
image
intermediate frequency
sequence
discrete cosine
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN201910085504.0A
Other languages
Chinese (zh)
Other versions
CN109829846A (en
Inventor
王环英
袁子涵
刘得成
苏庆堂
王刚
邓冠龙
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Ludong University
Original Assignee
Ludong University
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Ludong University filed Critical Ludong University
Priority to CN201910085504.0A priority Critical patent/CN109829846B/en
Publication of CN109829846A publication Critical patent/CN109829846A/en
Application granted granted Critical
Publication of CN109829846B publication Critical patent/CN109829846B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Landscapes

  • Editing Of Facsimile Originals (AREA)
  • Image Processing (AREA)

Abstract

The invention discloses a digital image blind watermarking method based on two-dimensional discrete cosine transform by utilizing the advantage of strong robustness of a frequency domain digital watermarking algorithm. The invention selects partial intermediate frequency coefficients of the image block after two-dimensional discrete cosine transformation in the transformation domain, and completes the embedding and blind extraction of the digital watermark by modifying the magnitude relation between the selected intermediate frequency coefficients. The invention embeds the digital image watermark into the host image, which not only has better watermark invisibility, but also has stronger robustness, and is suitable for occasions of digital image copyright protection.

Description

Digital image blind watermarking method based on two-dimensional discrete cosine transform
Technical Field
The invention belongs to the technical field of information security, and relates to digital watermark copyright protection with high invisibility and strong robustness of a digital image.
Background
With the rapid development of the Internet and multimedia technology, the Internet permeates into the aspects of daily life, so that the required information can be obtained more accurately and efficiently, and a series of serious problems such as piracy, infringement, tampering and the like are generated. Accordingly, protection of intellectual property and copyright is urgent, and digital watermarking technology has been developed. The successful embedding and extraction of the digital image watermark can effectively protect the copyright of the digital image watermark, thereby solving the difficult problem. In the research of digital watermarking in recent years, a digital watermarking algorithm with better watermark invisibility and stronger robustness is gradually becoming the mainstream of digital watermarking technology development. Therefore, how to design a digital watermarking algorithm with high invisibility and strong robustness is one of the difficulties of the current digital watermarking technology.
Disclosure of Invention
The invention aims to provide a digital image blind watermarking method based on two-dimensional discrete cosine transform, which is characterized in that the realization of watermarking is divided into two processes of watermarking embedding and watermarking extracting, and the watermarking embedding process is described as follows:
the first step: host imagePreprocessing of watermark images: dividing a gray host image H with the size of MxM into non-overlapped pixel blocks with the size of Mxm; the method comprises the steps of carrying out private key Ka-based on a gray watermark image W with the size of N multiplied by N i To improve the security of the watermark and to convert each decimal pixel value in the watermark image W into an 8-bit binary sequence, connected in turn to a length of 8N 2 Watermark bit sequence SW of (a);
and a second step of: selecting an embedded block of the host image: selecting a pixel block A from the host image H by using a pseudo-random sequence generated by a random function;
and a third step of: according to formula (1), performing two-dimensional Discrete Cosine Transform (DCT) on the selected pixel block A to obtain a transformation matrix dctA, and selecting 4 pairs of DCT intermediate frequency coefficients (c i1, c i2 ) Where i=1, 2,3,4, respectively represent the i-th pair of DCT intermediate frequency coefficients;
dctA=dct2(A) (1)
wherein dct2 ()' is a two-dimensional discrete cosine transform function;
fourth step: sequentially selecting 4 watermark bits w from the watermark sequence SW according to the sequence i The method comprises the steps of carrying out a first treatment on the surface of the Using equations (2), (3), the DCT intermediate frequency coefficient pair (c) is modified i1, c i2 ) The size relationship between them to embed watermark bits w i ,i=1,2,3,4;
Figure GDA0004187469920000021
Figure GDA0004187469920000022
The definition rule of the custom function sign () is as follows:
Figure GDA0004187469920000023
where sign () is a signed function, avg= (abs (c) i1 )+abs(c i2 ) The step of quantization is known as) 2, TLong;
fifth step: with modified DCT intermediate frequency coefficient pair (c i1 * ,c i2 * ) Replacing the original DCT intermediate frequency coefficient pair (c i1 ,c i2 ) Obtaining a transformation matrix dctA containing watermarks * Where i=1, 2,3,4, respectively represent the i-th pair of DCT intermediate frequency coefficients;
sixth step: for the transformation matrix dctA according to equation (5) * Performing inverse two-dimensional discrete cosine transform to obtain a pixel block A containing watermark * And pixel block A containing watermark * Updating into the host image H;
A * =idct2(dctA * ) (5)
wherein idct2 ()'s are inverse two-dimensional discrete cosine transform functions;
seventh step: repeating the second to sixth steps until all watermark information is embedded, thereby obtaining a watermark-containing host image H *
The watermark extraction process is described as follows:
the first step: preprocessing of the watermark-containing host image: will contain the watermark host image H * Dividing into non-overlapping pixel blocks with the size of m multiplied by m;
and a second step of: selecting an extraction block containing a watermark host image: pseudo-random sequence generated using randperm function from watermark-containing host image H * Selecting a pixel block A containing a watermark *
And a third step of: for selected blocks A of pixels containing ink * Performing two-dimensional discrete cosine transform to obtain a transformation matrix dctA * And selecting a transformation matrix dctA according to the Z shape * 4 pairs of DCT intermediate frequency coefficients (c) i1 * , c i2 * ) Where i=1, 2,3,4, respectively represent the i-th pair of DCT intermediate frequency coefficients;
fourth step: based on the DCT intermediate frequency coefficient pair (c i1 * , c i2 * ) The size relationship between the pixel blocks A is printed from the water by using the formula (6) * Extracting watermark bits from a watermark
Figure GDA0004187469920000024
Figure GDA0004187469920000031
Where abs (, i=1, 2,3, 4) is an absolute function;
fifth step: repeating the second to fourth steps to obtain the binary watermark sequence SW of the extracted watermark-containing image * Watermark sequence SW * Dividing each 8 bits of binary information into a group and converting the group into decimal pixel values to obtain a decimal number column;
sixth step: the decimal number sequence is based on the private key Ka i Is transformed by the inverse Arnold to obtain the final extracted watermark W *
The method utilizes the size relation between DCT intermediate frequency coefficients in two-dimensional discrete cosine transformation to finish the embedding and blind extraction of the digital watermark; the method has better watermark invisibility and stronger watermark robustness.
Drawings
Fig. 1 (a), 1 (b) are two original gray scale host images.
Fig. 2 (a), 2 (b) are two original grayscale watermark images.
Fig. 3 (a) and 3 (b) are watermark images obtained by embedding the watermark shown in fig. 2 (a) into the host image in sequence in fig. 1 (a) and 1 (b), wherein the structural similarity SSIM values are 0.9283 and 0.9696 in sequence, and the peak signal to noise ratio PSNR values are 42.8192dB and 41.3844dB in sequence.
Fig. 4 (a) and 4 (b) are watermarks extracted from fig. 3 (a) and 3 (b) in order, and normalized cross-correlation coefficient NC values thereof are 1.0000 and 1.0000, respectively.
Fig. 5 (a), 5 (b), 5 (c), 5 (d), 5 (e), and 5 (f) are watermarks extracted by sequentially subjecting the watermark image shown in fig. 3 (a) to attacks such as JPEG2000 compression (6:1), salt and pepper noise (0.2%), JPEG compression (60), low-pass filtering (100, 4), scaling (75%), and shearing (12.5%), and the normalized cross-correlation coefficient NC values thereof are 0.9959, 0.9623, 0.9799, 0.9740, 1.0000, and 0.9865, respectively.
Fig. 6 (a) and 6 (b) show watermark images obtained by embedding the watermark shown in fig. 2 (b) into the host image in sequence in fig. 1 (a) and 1 (b), wherein the structural similarity SSIM values are 0.9303 and 0.9689 in sequence, and the peak signal-to-noise ratio PSNR values are 42.9986dB and 41.0945dB in sequence.
Fig. 7 (a) and 7 (b) are watermarks extracted from fig. 6 (a) and 6 (b) in order, and normalized cross-correlation coefficient NC values thereof are 1.0000 and 1.0000, respectively.
Fig. 8 (a), 8 (b), 8 (c), 8 (d), 8 (e), and 8 (f) are watermarks extracted by sequentially subjecting the watermark image shown in fig. 6 (a) to attacks such as JPEG2000 compression (6:1), salt and pepper noise (0.2%), JPEG compression (60), low-pass filtering (100, 4), scaling (75%), and shearing (12.5%), and the normalized cross-correlation coefficient NC values thereof are 0.9967, 0.9693, 0.9810, 0.9750, 0.9999, 0.9885, respectively.
Detailed Description
The invention aims to provide a digital image blind watermarking method based on two-dimensional discrete cosine transform, which is characterized in that the realization of watermarking is divided into two processes of watermarking embedding and watermarking extracting, and the watermarking embedding process is described as follows:
the first step: preprocessing a host image and a watermark image: dividing a gray host image H with the size of 512 multiplied by 512 into non-overlapped pixel blocks with the size of 8 multiplied by 8; the method comprises the steps of carrying out private key Ka-based on a gray watermark image W with the size of 32 multiplied by 32 i To increase the security of the watermark and to convert each decimal pixel value in the watermark image W into an 8-bit binary sequence (e.g., decimal number 214 may be converted into binary sequence '11010110'), which in turn are connected into a watermark bit sequence SW of length 8 x 32 2 =8192;
And a second step of: selecting an embedded block of the host image: selecting a pixel block A from the host image H by using a pseudo-random sequence generated by a random function, wherein the selected pixel block A is set as
Figure GDA0004187469920000041
And a third step of: according to formula (1), performing two-dimensional Discrete Cosine Transform (DCT) on the selected pixel block A to obtain a transformation matrix dctA, and selecting 4 pairs of DCT intermediate frequency coefficients (c i1, c i2 ) Wherein i=1, 2,3,4, respectively represent the i-th pair of DCT intermediate frequency coefficients;
dctA=dct2(A) (1)
wherein dct2 ()' is a two-dimensional discrete cosine transform function; at this time, a transform matrix dctA obtained by performing two-dimensional discrete cosine transform on the pixel block a is
Figure GDA0004187469920000042
4 pairs of DCT intermediate frequency coefficients (c) of the transformation matrix dctA are selected according to zigzags i1, c i2 ) (-9.4018,11.4220), (15.9976, -5.8750), (-9.0920,13.1825), (4.7516,3.8495), respectively;
fourth step: sequentially selecting 4 watermark bits w from the watermark sequence SW according to the sequence i The method comprises the steps of carrying out a first treatment on the surface of the Using equations (2), (3), the DCT intermediate frequency coefficient pair (c) is modified i1, c i2 ) The size relationship between them to embed watermark bits w i ,i=1,2,3,4;
Figure GDA0004187469920000051
Figure GDA0004187469920000052
The definition rule of the custom function sign () is as follows:
Figure GDA0004187469920000053
where sign () is a signed function, avg= (abs (c) i1 )+abs(c i2 ) T is the quantization step size,/2; at this time, 4 watermark bits selected from the watermark sequence SWw i Is '0', '0'; modified DCT intermediate frequency coefficient pair (c i1 * , c i2 * ) (-27.2119,3.2119), (15.9976, -5.8750), (-27.9372,3.9372), (21.1005, -2.8995);
fifth step: with modified DCT intermediate frequency coefficient pair (c i1 * , c i2 * ) Replacing the original DCT intermediate frequency coefficient pair (c i1, c i2 ) Obtaining a transformation matrix dctA containing watermarks * Wherein i=1, 2,3,4, respectively represent the i-th pair of DCT intermediate frequency coefficients; at this time, the transformation matrix dctA containing the watermark * Is that
Figure GDA0004187469920000054
Sixth step: for the transformation matrix dctA according to equation (5) * Performing inverse two-dimensional discrete cosine transform to obtain a pixel block A containing watermark * And pixel block A containing watermark * Updating into the host image H;
A * =idct2(dctA * ) (5)
wherein idct2 ()'s are inverse two-dimensional discrete cosine transform functions; at this time, pixel block A containing watermark * Is that
Figure GDA0004187469920000061
Seventh step: repeating the second to sixth steps until all watermark information is embedded, thereby obtaining a watermark-containing host image H *
The watermark extraction process is described as follows:
the first step: preprocessing of the watermark-containing host image: will contain the watermark host image H * Dividing into non-overlapping pixel blocks with the size of 8 multiplied by 8;
and a second step of: selecting a block of pixels containing a watermark host image: pseudo-random sequence generated using randperm function from watermark-containing host image H * Selecting a pixel block A containing a watermark * The method comprises the steps of carrying out a first treatment on the surface of the At this time, a pixel block A containing a watermark is provided * Is that
Figure GDA0004187469920000062
And a third step of: for selected blocks A of pixels containing ink * Performing two-dimensional discrete cosine transform to obtain a transformation matrix dctA * And selecting a transformation matrix dctA according to the Z shape * 4 pairs of DCT intermediate frequency coefficients (c) i1 * , c i2 * ) Where i=1, 2,3,4, respectively represent the i-th pair of DCT intermediate frequency coefficients; at this time, a transformation matrix dctA obtained after two-dimensional discrete cosine transformation * Is that
Figure GDA0004187469920000063
Selected 4 pairs of DCT intermediate frequency coefficients (c i1 * , c i2 * ) (-27.1567,3.2463), (15.8511, -5.5000), (-27.7883,4.2891), (21.0825, -2.2370), respectively;
fourth step: based on the DCT intermediate frequency coefficient pair (c i1 * , c i2 * ) The size relationship between the pixel blocks A is printed from the water by using the formula (6) * Extracting watermark bits from a watermark
Figure GDA0004187469920000071
Figure GDA0004187469920000072
Where abs (, i=1, 2,3, 4) is an absolute function; at this time, the extracted watermark bits
Figure GDA0004187469920000073
Respectively '0', '0';
fifth step: repeating the second to fourth steps to obtain the binary system of the extracted watermark-containing imageWatermark sequence SW * Watermark sequence SW * Dividing each 8 bits of binary information into a group and converting the group into decimal pixel values to obtain a decimal number column;
sixth step: the decimal number sequence is based on the private key Ka i Is transformed by the inverse Arnold to obtain the final extracted watermark W *
The method is simple and quick, strong in robustness, good in watermark invisibility and suitable for copyright protection of the digital image serving as the watermark.
The invention has the effect of verification
To prove the effectiveness of the present invention, two standard images of 24 bits of 512×512 size as shown in fig. 1 (a) and 1 (b) were selected as host images, and two gray-scale images of 24 bits of 32×32 size as shown in fig. 2 (a) and 2 (b) were used as digital watermarks, respectively, for verification.
Fig. 3 (a) and 3 (b) are watermark images obtained by embedding the watermarks shown in fig. 2 (a) into the host images in sequence in fig. 1 (a) and 1 (b), wherein the structural similarity SSIM values are 0.9283 and 0.9696 in sequence, and the peak signal-to-noise ratio PSNR values are 42.8192dB and 41.3844dB in sequence; fig. 4 (a) and 4 (b) are watermarks extracted from fig. 3 (a) and 3 (b) in sequence, and normalized cross-correlation coefficient NC values thereof are 1.0000 and 1.0000, respectively; fig. 5 (a), 5 (b), 5 (c), 5 (d), and 5 (e) are watermarks extracted after the watermark image shown in fig. 3 (a) is subjected to attacks such as JPEG2000 compression (6:1), salt and pepper noise (0.2%), JPEG compression (60), low-pass filtering (100, 4), scaling (75%), and shearing (12.5%), and the normalized cross-correlation coefficient NC values thereof are 0.9959, 0.9623, 0.9799, 0.9740, 1.0000, 0.9865, respectively.
Fig. 6 (a) and 6 (b) are watermark images obtained by embedding the watermarks shown in fig. 2 (b) into the host images in sequence in fig. 1 (a) and 1 (b), wherein the structural similarity SSIM values are 0.9303 and 0.9689 in sequence, and the peak signal-to-noise ratio PSNR values are 42.9986dB and 41.0945dB in sequence; fig. 7 (a) and 7 (b) are watermarks extracted from fig. 6 (a) and 6 (b) in order, and normalized cross-correlation coefficient NC values thereof are 1.0000 and 1.0000, respectively; fig. 8 (a), 8 (b), 8 (c), 8 (d), 8 (e), and 8 (f) are watermarks extracted by sequentially subjecting the watermark image shown in fig. 6 (a) to attacks such as JPEG2000 compression (6:1), salt and pepper noise (0.2%), JPEG compression (60), low-pass filtering (100, 4), scaling (75%), and shearing (12.5%), and the normalized cross-correlation coefficient NC values thereof are 0.9967, 0.9693, 0.9810, 0.9750, 0.9999, 0.9885, respectively.
In summary, the embedded digital image watermark has better invisibility, and meets the invisibility requirement of a watermark algorithm; meanwhile, the digital image watermark extracted from various attacked images has better authenticability and higher NC value, which indicates that the method has stronger robustness and meets the requirement of digital image copyright protection.

Claims (1)

1. A digital image blind watermarking method based on two-dimensional discrete cosine transform is characterized in that the realization of watermarking is divided into two processes of watermarking embedding and watermarking extracting, and the watermarking embedding process is described as follows:
the first step: preprocessing a host image and a watermark image: dividing a gray host image H with the size of MxM into non-overlapped pixel blocks with the size of Mxm; the method comprises the steps of carrying out private key Ka-based on a gray watermark image W with the size of N multiplied by N i To improve the security of the watermark and to convert each decimal pixel value in the watermark image W into an 8-bit binary sequence, connected in turn to a length of 8N 2 Watermark bit sequence SW of (a);
and a second step of: selecting an embedded block of the host image: selecting a pixel block A from the host image H by using a pseudo-random sequence generated by a random function;
and a third step of: according to formula (1), performing two-dimensional Discrete Cosine Transform (DCT) on the selected pixel block A to obtain a transformation matrix dctA, and selecting 4 pairs of DCT intermediate frequency coefficients (c i1 ,c i2 ) Where i=1, 2,3,4, respectively represent the i-th pair of DCT intermediate frequency coefficients;
dctA=dct2(A) (1)
wherein dct2 ()' is a two-dimensional discrete cosine transform function;
fourth step: sequentially selecting 4 watermark bits w from the watermark sequence SW according to the sequence i The method comprises the steps of carrying out a first treatment on the surface of the Using equations (2), (3), the DCT intermediate frequency coefficient pair (c) is modified i1 ,c i2 ) The size relationship between them to embed watermark bits w i ,i=1,2,3,4;
Figure FDA0004187469910000011
Figure FDA0004187469910000012
The definition rule of the custom function sign () is as follows:
Figure FDA0004187469910000013
where sign () is a signed function, avg= (abs (c) i1 )+abs(c i2 ) T is the quantization step size,/2;
fifth step: with modified DCT intermediate frequency coefficient pair (c i1 * ,c i2 * ) Replacing the original DCT intermediate frequency coefficient pair (c i1 ,c i2 ) Obtaining a transformation matrix dctA containing watermarks * Where i=1, 2,3,4, respectively represent the i-th pair of DCT intermediate frequency coefficients;
sixth step: for the transformation matrix dctA according to equation (5) * Performing inverse two-dimensional discrete cosine transform to obtain a pixel block A containing watermark * And pixel block A containing watermark * Updating into the host image H;
A * =idct2(dctA * ) (5)
wherein idct2 ()'s are inverse two-dimensional discrete cosine transform functions;
seventh step: repeating the second to sixth steps until all watermark information is embedded, thereby obtaining a watermark-containing host image H *
The watermark extraction process is described as follows:
the first step: containing watermarksPretreatment of a host image: will contain the watermark host image H * Dividing into non-overlapping pixel blocks with the size of m multiplied by m;
and a second step of: selecting an extraction block containing a watermark host image: pseudo-random sequence generated using randperm function from watermark-containing host image H * Selecting a pixel block A containing a watermark *
And a third step of: for selected blocks A of pixels containing ink * Performing two-dimensional discrete cosine transform to obtain a transformation matrix dctA * And selecting a transformation matrix dctA according to the Z shape * 4 pairs of DCT intermediate frequency coefficients (c) i1 * ,c i2 * ) Where i=1, 2,3,4, respectively represent the i-th pair of DCT intermediate frequency coefficients;
fourth step: based on the DCT intermediate frequency coefficient pair (c i1 * ,c i2 * ) The size relationship between the pixel blocks A is printed from the water by using the formula (6) * Extracting watermark bits from a watermark
Figure FDA0004187469910000021
Figure FDA0004187469910000022
Where abs (, i=1, 2,3, 4) is an absolute function;
fifth step: repeating the second to fourth steps to obtain the binary watermark sequence SW of the extracted watermark-containing image * Watermark sequence SW * Dividing each 8 bits of binary information into a group and converting the group into decimal pixel values to obtain a decimal number column;
sixth step: the decimal number sequence is based on the private key Ka i Is transformed by the inverse Arnold to obtain the final extracted watermark W *
CN201910085504.0A 2019-01-29 2019-01-29 Digital image blind watermarking method based on two-dimensional discrete cosine transform Active CN109829846B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201910085504.0A CN109829846B (en) 2019-01-29 2019-01-29 Digital image blind watermarking method based on two-dimensional discrete cosine transform

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201910085504.0A CN109829846B (en) 2019-01-29 2019-01-29 Digital image blind watermarking method based on two-dimensional discrete cosine transform

Publications (2)

Publication Number Publication Date
CN109829846A CN109829846A (en) 2019-05-31
CN109829846B true CN109829846B (en) 2023-07-07

Family

ID=66862847

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201910085504.0A Active CN109829846B (en) 2019-01-29 2019-01-29 Digital image blind watermarking method based on two-dimensional discrete cosine transform

Country Status (1)

Country Link
CN (1) CN109829846B (en)

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110766593B (en) * 2019-09-03 2023-05-09 杭州安存网络科技有限公司 Digital watermarking method, digital watermarking device, electronic equipment and computer readable medium for image
CN112862654B (en) * 2021-01-26 2022-08-30 合肥工业大学 Blind watermark embedding and extracting method based on combination of relational interpolation and linear interpolation

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102664013A (en) * 2012-04-18 2012-09-12 南京邮电大学 Audio digital watermark method of discrete cosine transform domain based on energy selection
WO2016114950A1 (en) * 2015-01-15 2016-07-21 Gopro, Inc. Watermarking digital images to increase bit dept
CN107633476A (en) * 2017-09-25 2018-01-26 河南师范大学 A kind of watermark insertion and extracting method based on LWT SVD DCT algorithms
CN109035129A (en) * 2018-08-15 2018-12-18 鲁东大学 A kind of color digital image blind watermark method based on two-dimensional discrete sine transform

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101699508B (en) * 2009-09-03 2012-01-11 中兴通讯股份有限公司 Image digital watermark embedding and extracting method and system

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102664013A (en) * 2012-04-18 2012-09-12 南京邮电大学 Audio digital watermark method of discrete cosine transform domain based on energy selection
WO2016114950A1 (en) * 2015-01-15 2016-07-21 Gopro, Inc. Watermarking digital images to increase bit dept
CN107633476A (en) * 2017-09-25 2018-01-26 河南师范大学 A kind of watermark insertion and extracting method based on LWT SVD DCT algorithms
CN109035129A (en) * 2018-08-15 2018-12-18 鲁东大学 A kind of color digital image blind watermark method based on two-dimensional discrete sine transform

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
一种鲁棒性较强的DCT图像水印算法;张国良;;嘉兴学院学报(第03期);全文 *
基于DWT及DCT的数字图像水印综述;赵红;王丽萍;温文雅;崔永瑞;;微计算机应用(第01期);全文 *

Also Published As

Publication number Publication date
CN109829846A (en) 2019-05-31

Similar Documents

Publication Publication Date Title
CN109035129B (en) Color digital image blind watermarking method based on two-dimensional discrete sine transformation
Lou et al. A copyright protection scheme for digital images using visual cryptography technique
CN110390621B (en) DCT domain color digital image blind watermarking method based on variable step length
CN108648134B (en) Spatial domain color digital image blind watermarking method fusing discrete wavelet transform
CN111199508B (en) Spatial domain color digital image blind watermarking method fusing DCT and DHT
CN110349073B (en) Four-system color digital image blind watermarking method based on Schur decomposition
CN106204410B (en) A kind of novel digital watermark method decomposed based on matrix Schur
CN104050622B (en) The coloured image blind watermark method encoded based on ternary
Huai-bin et al. A new watermarking algorithm based on DCT and DWT fusion
CN109829846B (en) Digital image blind watermarking method based on two-dimensional discrete cosine transform
CN112508765B (en) Frequency domain color digital image blind watermarking method based on Walsh-Hadamard transform
CN112488904B (en) Matrix singular value decomposition-based quaternion color digital image blind watermarking method
CN105023236B (en) A kind of dual-color image blind watermarking method based on LU Decomposition
CN110570345B (en) Blind watermarking method for airspace color digital image fused with discrete cosine transform
Rao et al. A novel image zero-watermarking scheme based on DWT-BN-SVD
CN106157233B (en) A kind of good digital water mark method decomposed based on matrix Schur
CN110415155B (en) Blind watermarking method for airspace color image fused with haar transformation
CN116993567A (en) Frequency domain blind watermarking method based on Hadamard transform and teaching optimization algorithm
CN116503230A (en) Robust image watermarking algorithm based on double channels
CN106169171B (en) The good digital water mark method decomposed based on Hessenberg
CN111242828B (en) Spatial domain color digital image blind watermarking method fused with discrete Fourier transform
CN110415154B (en) Haer transformation-based quaternary color digital image blind watermarking method
Yuan et al. Blind watermarking method based on DWT middle frequency pair
Tomar et al. A statistical comparison of digital image watermarking techniques
CN112017098B (en) Self-adaptive color digital image blind watermarking method

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
CB03 Change of inventor or designer information

Inventor after: Wang Huanying

Inventor after: Yuan Zihan

Inventor after: Liu Decheng

Inventor after: Su Qingtang

Inventor after: Wang Gang

Inventor after: Deng Guanlong

Inventor before: Su Qingtang

Inventor before: Yuan Zihan

Inventor before: Liu Decheng

Inventor before: Wang Huanying

Inventor before: Wang Gang

Inventor before: Deng Guanlong

CB03 Change of inventor or designer information
GR01 Patent grant
GR01 Patent grant