CN109035129B - Color digital image blind watermarking method based on two-dimensional discrete sine transformation - Google Patents

Color digital image blind watermarking method based on two-dimensional discrete sine transformation Download PDF

Info

Publication number
CN109035129B
CN109035129B CN201810925869.5A CN201810925869A CN109035129B CN 109035129 B CN109035129 B CN 109035129B CN 201810925869 A CN201810925869 A CN 201810925869A CN 109035129 B CN109035129 B CN 109035129B
Authority
CN
China
Prior art keywords
watermark
image
dstc
layered
transformation
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
CN201810925869.5A
Other languages
Chinese (zh)
Other versions
CN109035129A (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 CN201810925869.5A priority Critical patent/CN109035129B/en
Publication of CN109035129A publication Critical patent/CN109035129A/en
Application granted granted Critical
Publication of CN109035129B publication Critical patent/CN109035129B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T1/00—General purpose image data processing
    • G06T1/0021—Image watermarking
    • G06T1/005—Robust watermarking, e.g. average attack or collusion attack resistant
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T2201/00—General purpose image data processing
    • G06T2201/005—Image watermarking
    • G06T2201/0052—Embedding of the watermark in the frequency domain

Landscapes

  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Editing Of Facsimile Originals (AREA)
  • Image Processing (AREA)

Abstract

The invention discloses a color digital image blind watermarking method based on two-dimensional discrete sine transformation by utilizing the advantage of strong robustness of a frequency domain digital watermarking algorithm. According to the unique characteristics of the two-dimensional discrete sine transformation, the maximum energy coefficient in the two-dimensional discrete sine transformation of the image block is obtained in the transformation domain, and the energy coefficient is utilized to complete the embedding and blind extraction of the digital watermark. The invention can embed the digital watermark of the color image into the color host image, has better watermark invisibility and stronger robustness, solves the problem of weak robustness of the digital watermark of the large-capacity color image, and is suitable for occasions of copyright protection of the color digital image.

Description

Color digital image blind watermarking method based on two-dimensional discrete sine transformation
Technical Field
The invention belongs to the technical field of information security, and relates to strong robustness digital watermark copyright protection of a color digital image.
Background
With the rapid development of the current technology, the internet permeates the aspects of our life, and although we can easily acquire the required information from the internet, various illegal piracy, infringement, tampering and other behaviors are accompanied at the same time. As an effective solution, digital watermarking technology has resulted in the successful embedding and extraction of watermarks that can effectively protect digital rights, thereby improving this situation. Due to the requirements of visual visibility and robustness of digital images, embedded digital watermarks need to be hidden in the images while ensuring a certain robustness in the image attack. Therefore, how to design a digital watermark algorithm with strong robustness on the premise of ensuring good invisibility of the digital watermark is a problem to be solved at present.
Disclosure of Invention
The invention aims to provide a color digital image blind watermarking method based on two-dimensional discrete sine transformation, which is characterized by being realized through a specific watermarking embedding process and a watermarking extracting process, wherein the watermarking embedding process is described as follows:
the first step: preprocessing a color host image and a watermark image: first, a web is made into a size ofM×MColor host image of (a)HThree layered host images, red, green, blueH i Simultaneously integrating each hierarchical host imageH i Is divided into the following sizesm×mIs a non-overlapping block of pixels; one width is of the sizeN×NColor watermark image of (a)WDividing into red, green and blue three layered watermark imagesW i The method comprises the steps of carrying out a first treatment on the surface of the To improve the security of the watermark, the layered watermark image is provided withW i Performing key-basedKa i Arnold transformation of (A) and watermark image layeringW i Each decimal pixel value in (2) is converted into 8-bit binary number which is sequentially connected into a length of 8N 2 Is a layered watermark bit sequence of (1)SW i Whereini=1, 2,3, respectively representing three layers of red, green, blue;
and a second step of: selecting an embedded block of the host image: using key-basedKb i From layered host imagesH i In selecting blocks of pixelsAWhereini=1, 2,3, respectively representing three layers of red, green, blue;
and a third step of: for the selected pixel block according to formula (1)APerforming two-dimensional discrete sine transformation to obtain a transformation matrixdstc；
Figure 270230DEST_PATH_IMAGE001
(1)
Wherein,,Bis a transform basis matrix of a two-dimensional discrete sinusoidal transform,
Figure 249687DEST_PATH_IMAGE002
is thatBIs a transposed matrix of (a);
fourth step: fetching the transformation matrixdstcThe DC coefficient having the greatest energy in (a)dstc(1, 1) whereindstc(1, 1) represents a transformation matrixdstcElements of row 1 and column 1;
fifth step: sequentially from a layered watermark sequenceSW i Extracting watermark information to be embeddedwThe method comprises the steps of carrying out a first treatment on the surface of the Embedding watermark information according to equation (2)wObtaining new DC coefficientdstc(1,1) * ；
Figure 29424DEST_PATH_IMAGE003
(2)
Wherein,,mod(.) is a function of the remainder,Tis the quantization step size;
sixth step: by means of new DC coefficientsdstc(1,1) * Replace the original DC coefficientdstc(1, 1) obtaining a transform matrix containing watermarksdstc * The method comprises the steps of carrying out a first treatment on the surface of the According to formula (3), for a transformation matrixdstc * Performing inverse two-dimensional discrete sine transformation to obtain pixel block containing watermark
Figure 424633DEST_PATH_IMAGE004
；
Figure 239006DEST_PATH_IMAGE005
(3)
Wherein,,Bis a transform basis matrix of a two-dimensional discrete sinusoidal transform,
Figure 874517DEST_PATH_IMAGE006
is thatBIs a transposed matrix of (a);
seventh step: the obtained water-containing print pixel block
Figure 141551DEST_PATH_IMAGE004
Update to its in-hierarchical host imageH i Corresponding positions in the image and obtaining a layered host image containing the watermarkWhereini=1, 2,3, respectively representing three layers of red, green, blue;
eighth step: repeating the second to seventh steps until all watermark information is embedded; finally, combining layered host images containing watermarks
Figure 9329DEST_PATH_IMAGE007
Obtaining a watermark-containing host image
Figure 65010DEST_PATH_IMAGE008
Whereini=1, 2,3, respectively representing three layers of red, green, blue;
the watermark extraction process is described as follows:
the first step: image of a host to be printed
Figure 819340DEST_PATH_IMAGE008
Divided into three layered images of red, green and blue
Figure 556351DEST_PATH_IMAGE009
The method comprises the steps of carrying out a first treatment on the surface of the At the same time, each watermark is layered into an image
Figure 79737DEST_PATH_IMAGE010
Is divided into the following sizesm×mNon-overlapping pixel blocks of (1), whereini=1, 2,3, respectively representing three layers of red, green, blue;
and a second step of: using key-basedKb i Pseudo-random scrambling algorithm in a layered image containing a watermark
Figure 821165DEST_PATH_IMAGE011
Selecting pixel blocks containing watermarks
Figure 62791DEST_PATH_IMAGE004
；
And a third step of: according toEquation (4) for selected blocks of watermark pixels
Figure 337914DEST_PATH_IMAGE004
Performing two-dimensional discrete sine transformation to obtain a transformation matrixdstc * ；
Figure 981385DEST_PATH_IMAGE012
(4)
Wherein,,Bis a transform basis matrix of a two-dimensional discrete sinusoidal transform,
Figure 378869DEST_PATH_IMAGE002
is thatBIs a transposed matrix of (a);
fourth step: fetching the transformation matrixdstc * The DC coefficient having the greatest energy in (a)dstc(1,1) * Whereindstc(1,1) * Representing a transformation matrixdstc * Elements of row 1 and column 1;
fifth step: from the pixel block using equation (5)
Figure 107790DEST_PATH_IMAGE004
Obtained extracted watermark bits
Figure 186605DEST_PATH_IMAGE013
；
Figure 684582DEST_PATH_IMAGE014
(5)
Wherein mod ()' is a function of the remainder,Tis the quantization step length;
sixth step: repeating the second step to the fifth step to obtain a binary extraction watermark sequence of each layer
Figure 269278DEST_PATH_IMAGE015
The method comprises the steps of carrying out a first treatment on the surface of the Will be
Figure 219917DEST_PATH_IMAGE015
Is divided into a group of every 8 bits of binary information and converted into decimal pixel values, whereini=1, 2,3, respectively representing three layers of red, green, blue;
seventh step: key-based separate for each layer of decimal pixel valuesKa i Is inverse Arnold transformation to obtain the extracted watermark of each layer
Figure 102422DEST_PATH_IMAGE016
The method comprises the steps of carrying out a first treatment on the surface of the At the same time, the extracted watermarks of the layers are combined
Figure 454906DEST_PATH_IMAGE016
Forming a final extracted watermark
Figure 459771DEST_PATH_IMAGE017
Whereini=1, 2,3, respectively representing three layers of red, green, blue.
The method utilizes the maximum energy coefficient in the two-dimensional discrete sine transformation to complete 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 color host images.
Fig. 2 (a) and 2 (b) are two original color 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.9724 and 0.9742 in sequence, and the peak signal to noise ratio PSNR values are 40.3284dB and 40.2897dB 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.00000 and 1.00000, 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,6), scaling (75%), and shearing (25%), and the normalized cross-correlation coefficient NC values thereof are 0.99915, 0.98658, 0.99287, 0.97051, 0.99983, 0.98162, 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.9713 and 0.9734 in sequence, and the peak signal-to-noise ratio PSNR values are 40.3339dB and 40.2650dB 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.00000 and 1.00000, 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,6), scaling (75%), and shearing (25%), and the normalized cross-correlation coefficient NC values thereof are 0.99944, 0.98715, 0.99707, 0.97023, 0.99987, 0.92095, respectively.
Detailed Description
The invention aims to provide a color digital image blind watermarking method based on two-dimensional discrete sine transformation, which is characterized by being realized through a specific watermarking embedding process and a watermarking extracting process, wherein the watermarking embedding process is described as follows:
the first step: preprocessing a color host image and a watermark image: first, a color host image of 512×512 size is obtainedHThree layered host images, red, green, blueH i Simultaneously integrating each hierarchical host imageH i Divided into non-overlapping blocks of pixels of size 4 x 4; will have a width of 32×32 colour watermark imageWDividing into red, green and blue three layered watermark imagesW i The method comprises the steps of carrying out a first treatment on the surface of the To improve the security of the watermark, the layered watermark image is provided withW i Performing key-basedKa i Arnold transformation of (A) and watermark image layeringW i Ten of each of (3)Conversion of a binary pixel value into an 8-bit binary number (e.g., decimal number 214 may be converted into binary number 11010110), which in turn are connected into a layered watermark bit sequenceSW i ，SW i Length of 8 x 32 2 =8192, wherei=1, 2,3, respectively representing three layers of red, green, blue;
and a second step of: selecting an embedded block of the host image: using key-basedKb i From layered host imagesH i In selecting blocks of pixelsAWhereini=1, 2,3, respectively representing three layers of red, green, blue;
here, a selected pixel block is setAIs that
Figure 897706DEST_PATH_IMAGE018
；
And a third step of: for the selected pixel block according to formula (1)APerforming two-dimensional discrete sine transformation to obtain a transformation matrixdstc；
Figure 318323DEST_PATH_IMAGE001
(1)
Wherein,,Bis a transform basis matrix of a two-dimensional discrete sinusoidal transform,
Figure 790893DEST_PATH_IMAGE002
is thatBIs a transposed matrix of (a); at this time, for the selected pixel blockAPerforming two-dimensional discrete sine transformation to obtain a transformation matrixdstcIs that
Figure 215927DEST_PATH_IMAGE019
；
Fourth step: fetching the transformation matrixdstcThe DC coefficient having the greatest energy in (a)dstc(1, 1) whereindstc(1, 1) represents a transformation matrixdstcElements of row 1 and column 1; at this time, the DC coefficientdstc(1, 1) has a value of 767.8812;
fifth step: sequentially from a layered watermark sequenceSW i Extracting watermark information to be embeddedwThe method comprises the steps of carrying out a first treatment on the surface of the Embedding watermark information according to equation (2)wObtaining new DC coefficientdstc(1,1) * ；
Figure 141157DEST_PATH_IMAGE003
(2)
Wherein,,mod(.) is a function of the remainder,Tis the quantization step size; at this time, set upw=‘0’，T=36, then according to formula (2), getdstc(1,1) * =765；
Sixth step: by means of new DC coefficientsdstc(1,1) * Replace the original DC coefficientdstc(1, 1) obtaining a transform matrix containing watermarksdstc * The method comprises the steps of carrying out a first treatment on the surface of the According to formula (3), for a transformation matrixdstc * Performing inverse two-dimensional discrete sine transformation to obtain pixel block containing watermark
Figure 365465DEST_PATH_IMAGE004
；
Figure 426962DEST_PATH_IMAGE005
(3)
Wherein,,Bis a transform basis matrix of a two-dimensional discrete sinusoidal transform,
Figure 773630DEST_PATH_IMAGE006
is thatBIs a transposed matrix of (a); at this time, the transformation matrix containing the watermarkdstc * Is that
Figure 186157DEST_PATH_IMAGE020
，
Pixel block containing watermark
Figure 214155DEST_PATH_IMAGE004
Is that
Figure 395738DEST_PATH_IMAGE021
；
Seventh step: the obtained water-containing print pixel block
Figure 585411DEST_PATH_IMAGE004
Update to its in-hierarchical host imageH i Corresponding positions in the image and obtaining a layered host image containing the watermark
Figure 298283DEST_PATH_IMAGE022
Whereini=1, 2,3, respectively representing three layers of red, green, blue;
eighth step: repeating the second to seventh steps until all watermark information is embedded; finally, combining layered host images containing watermarks
Figure 864394DEST_PATH_IMAGE023
Obtaining a watermark-containing host image
Figure 166062DEST_PATH_IMAGE008
Whereini=1, 2,3, respectively representing three layers of red, green, blue;
the watermark extraction process is described as follows:
the first step: image of a host to be printed
Figure 526636DEST_PATH_IMAGE008
Divided into three layered images of red, green and blue
Figure 976072DEST_PATH_IMAGE024
The method comprises the steps of carrying out a first treatment on the surface of the At the same time, each watermark is layered into an image
Figure 345874DEST_PATH_IMAGE025
Divided into non-overlapping blocks of pixels of size 4 x 4, whereini=1, 2,3, respectively representing three layers of red, green, blue;
and a second step of: using key-basedKb i Pseudo-random scrambling algorithm in a layered host image containing a watermark
Figure 236469DEST_PATH_IMAGE025
Selecting pixel blocks containing watermarks
Figure 33524DEST_PATH_IMAGE004
The method comprises the steps of carrying out a first treatment on the surface of the At this time, a pixel block containing a watermark is provided
Figure 953944DEST_PATH_IMAGE004
Is that
Figure 127437DEST_PATH_IMAGE026
；
And a third step of: for a selected block of hydrous pixels according to equation (4)
Figure 138118DEST_PATH_IMAGE004
Performing two-dimensional discrete sine transformation to obtain a transformation matrixdstc * ；
Figure 106074DEST_PATH_IMAGE012
(4)
Wherein,,Bis a transform basis matrix of a two-dimensional discrete sinusoidal transform,
Figure 202206DEST_PATH_IMAGE002
is thatBIs a transposed matrix of (a);
at this time, the matrix is transformeddstc * Is that
Figure 841315DEST_PATH_IMAGE028
；
Fourth step: fetching the transformation matrixdstc * The DC coefficient having the greatest energy in (a)dstc(1,1) * Whereindstc(1,1) * Representing a transformation matrixdstc * Elements of row 1 and column 1; at this time, the DC coefficientdstc(1,1) * Is 764.6451;
fifth step: from the pixel block using equation (5)
Figure 980172DEST_PATH_IMAGE004
Obtained extracted watermark bits
Figure 563600DEST_PATH_IMAGE013
；
Figure 626365DEST_PATH_IMAGE014
(5)
Wherein mod ()' is a function of the remainder,Tis the quantization step length; at this time, the liquid crystal display device,T=36，
Figure 611639DEST_PATH_IMAGE029
=8.6451,
Figure 921397DEST_PATH_IMAGE030
=18, so
Figure 992122DEST_PATH_IMAGE031
Then according to the formula (5)
Figure 45528DEST_PATH_IMAGE013
=‘0’；
Sixth step: repeating the second step to the fifth step to obtain a binary extraction watermark sequence of each layer
Figure 947625DEST_PATH_IMAGE032
The method comprises the steps of carrying out a first treatment on the surface of the Will be
Figure 428285DEST_PATH_IMAGE032
Is divided into a group of every 8 bits of binary information and converted into decimal pixel values, whereini=1, 2,3, respectively representing three layers of red, green, blue;
seventh step: key-based separate for each layer of decimal pixel valuesKa i Is inverse Arnold transformation to obtain the extracted watermark of each layer
Figure 720726DEST_PATH_IMAGE033
The method comprises the steps of carrying out a first treatment on the surface of the At the same time, the extracted watermarks of the layers are combined
Figure 577824DEST_PATH_IMAGE033
Forming a final extracted watermark
Figure 583695DEST_PATH_IMAGE017
Whereini=1, 2,3, respectively representing three layers of red, green, blue.
The method has strong robustness and good watermark invisibility, and is suitable for copyright protection of the color image as the digital 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 color 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.9724 and 0.9742 in sequence, and the peak signal-to-noise ratio PSNR values are 40.3284dB and 40.2897dB 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.00000 and 1.00000, 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,6), scaling (75%), and shearing (25%), and the normalized cross-correlation coefficient NC values thereof are 0.99915, 0.98658, 0.99287, 0.97051, 0.99983, 0.98162, 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.9713 and 0.9734 in sequence, and the peak signal-to-noise ratio PSNR values are 40.3339dB and 40.2650dB 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.00000 and 1.00000, 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,6), scaling (75%), and shearing (25%), and the normalized cross-correlation coefficient NC values thereof are 0.99944, 0.98715, 0.99707, 0.97023, 0.99987, 0.92095, respectively.
In summary, the embedded color image digital watermark has better invisibility, and meets the invisibility requirement of a watermark algorithm; meanwhile, the color image digital 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 color digital image copyright protection.

Claims (1)

1. A color digital image blind watermarking method based on two-dimensional discrete sine transformation is characterized by being realized through a specific watermarking embedding process and a watermarking extracting process, wherein the watermarking embedding process is described as follows:
the first step: preprocessing a color host image and a watermark image: first, a web is made into a size ofM×MColor host image of (a)HThree layered host images, red, green, blueH i Simultaneously integrating each hierarchical host imageH i Is divided into the following sizesm×mIs a non-overlapping block of pixels; one width is of the sizeN×NColor watermark image of (a)WDividing into red, green and blue three layered watermark imagesW i The method comprises the steps of carrying out a first treatment on the surface of the To improve the security of the watermark, the layered watermark image is provided withW i Performing key-basedKa i Arnold transformation of (A) and watermark image layeringW i Each decimal pixel value in (2) is converted into 8-bit binary number which is sequentially connected into a length of 8N 2 Is a layered watermark bit sequence of (1)SW i Whereini=1, 2,3, respectively representing three layers of red, green, blue;
and a second step of: selecting an embedded block of the host image: utilization based onKey(s)Kb i From layered host imagesH i In selecting blocks of pixelsAWhereini=1, 2,3, respectively representing three layers of red, green, blue;
and a third step of: for the selected pixel block according to formula (1)APerforming two-dimensional discrete sine transformation to obtain a transformation matrixdstc；
Figure 456417DEST_PATH_IMAGE001
(1)
Wherein,,Bis a transform basis matrix of a two-dimensional discrete sinusoidal transform,
Figure 564050DEST_PATH_IMAGE002
is thatBIs a transposed matrix of (a);
fourth step: fetching the transformation matrixdstcThe DC coefficient having the greatest energy in (a)dstc(1, 1) whereindstc(1, 1) represents a transformation matrixdstcElements of row 1 and column 1;
fifth step: sequentially from a layered watermark sequenceSW i Extracting watermark information to be embeddedwThe method comprises the steps of carrying out a first treatment on the surface of the Embedding watermark information according to equation (2)wObtaining new DC coefficientdstc(1,1) * ；
Figure 959259DEST_PATH_IMAGE003
(2)
Wherein,,mod(.) is a function of the remainder,Tis the quantization step size;
sixth step: by means of new DC coefficientsdstc(1,1) * Replace the original DC coefficientdstc(1, 1) obtaining a transform matrix containing watermarksdstc * The method comprises the steps of carrying out a first treatment on the surface of the According to formula (3), for a transformation matrixdstc * Performing inverse two-dimensional discrete sine transformation to obtain pixel block containing watermark
Figure 508052DEST_PATH_IMAGE004
；
Figure 907678DEST_PATH_IMAGE005
(3)
Wherein,,Bis a transform basis matrix of a two-dimensional discrete sinusoidal transform,
Figure 174712DEST_PATH_IMAGE006
is thatBIs a transposed matrix of (a);
seventh step: the obtained water-containing print pixel block
Figure 373612DEST_PATH_IMAGE004
Update to its in-hierarchical host imageH i Corresponding positions in the image and obtaining a layered host image containing the watermark
Figure 776911DEST_PATH_IMAGE007
Whereini=1, 2,3, respectively representing three layers of red, green, blue;
eighth step: repeating the second to seventh steps until all watermark information is embedded; finally, combining layered host images containing watermarks
Figure 98171DEST_PATH_IMAGE007
Obtaining a watermark-containing host image
Figure 852501DEST_PATH_IMAGE008
Whereini=1, 2,3, respectively representing three layers of red, green, blue;
the watermark extraction process is described as follows:
the first step: image of a host to be printed
Figure 589513DEST_PATH_IMAGE008
Divided into three layered images of red, green and blue
Figure 112898DEST_PATH_IMAGE009
The method comprises the steps of carrying out a first treatment on the surface of the At the same time, each watermark is layered into an image
Figure 355791DEST_PATH_IMAGE010
Is divided into the following sizesm×mNon-overlapping pixel blocks of (1), whereini=1, 2,3, respectively representing three layers of red, green, blue;
and a second step of: using key-basedKb i Pseudo-random scrambling algorithm in a layered image containing a watermark
Figure 331838DEST_PATH_IMAGE011
Selecting pixel blocks containing watermarks
Figure 872540DEST_PATH_IMAGE004
；
And a third step of: for a selected block of hydrous pixels according to equation (4)
Figure 516011DEST_PATH_IMAGE004
Performing two-dimensional discrete sine transformation to obtain a transformation matrixdstc * ；
Figure 851178DEST_PATH_IMAGE012
(4)
Wherein,,Bis a transform basis matrix of a two-dimensional discrete sinusoidal transform,
Figure 642416DEST_PATH_IMAGE002
is thatBIs a transposed matrix of (a);
fourth step: fetching the transformation matrixdstc * The DC coefficient having the greatest energy in (a)dstc(1,1) * Whereindstc(1,1) * Representing a transformation matrixdstc * Elements of row 1 and column 1;
fifth step: from the pixel block using equation (5)
Figure 721231DEST_PATH_IMAGE004
Obtained extracted watermark bits
Figure 219208DEST_PATH_IMAGE013
；
Figure 725276DEST_PATH_IMAGE014
(5)
Wherein mod ()' is a function of the remainder,Tis the quantization step length;
sixth step: repeating the second step to the fifth step to obtain a binary extraction watermark sequence of each layer
Figure 823999DEST_PATH_IMAGE015
The method comprises the steps of carrying out a first treatment on the surface of the Will be
Figure 488067DEST_PATH_IMAGE015
Is divided into a group of every 8 bits of binary information and converted into decimal pixel values, whereini=1, 2,3, respectively representing three layers of red, green, blue;
seventh step: key-based separate for each layer of decimal pixel valuesKa i Is inverse Arnold transformation to obtain the extracted watermark of each layer
Figure 430616DEST_PATH_IMAGE016
The method comprises the steps of carrying out a first treatment on the surface of the At the same time, the extracted watermarks of the layers are combined
Figure 868550DEST_PATH_IMAGE016
Forming a final extracted watermark
Figure 289167DEST_PATH_IMAGE017
Whereini=1, 2,3, respectively representing three layers of red, green, blue.
CN201810925869.5A 2018-08-15 2018-08-15 Color digital image blind watermarking method based on two-dimensional discrete sine transformation Active CN109035129B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201810925869.5A CN109035129B (en) 2018-08-15 2018-08-15 Color digital image blind watermarking method based on two-dimensional discrete sine transformation

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201810925869.5A CN109035129B (en) 2018-08-15 2018-08-15 Color digital image blind watermarking method based on two-dimensional discrete sine transformation

Publications (2)

Publication Number Publication Date
CN109035129A CN109035129A (en) 2018-12-18
CN109035129B true CN109035129B (en) 2023-07-14

Family

ID=64631218

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201810925869.5A Active CN109035129B (en) 2018-08-15 2018-08-15 Color digital image blind watermarking method based on two-dimensional discrete sine transformation

Country Status (1)

Country Link
CN (1) CN109035129B (en)

Families Citing this family (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109829846B (en) * 2019-01-29 2023-07-07 鲁东大学 Digital image blind watermarking method based on two-dimensional discrete cosine transform
CN109829845B (en) * 2019-01-29 2023-07-14 鲁东大学 Variable step-length color image blind watermarking method based on matrix Schur decomposition
CN110390621B (en) * 2019-07-16 2023-07-07 鲁东大学 DCT domain color digital image blind watermarking method based on variable step length
CN110570345B (en) * 2019-09-20 2023-07-14 鲁东大学 Blind watermarking method for airspace color digital image fused with discrete cosine transform
CN111583088B (en) * 2020-05-06 2022-07-01 中国民航大学 Self-embedding totally-blind color image robust watermarking method based on multiple transform domains
CN112017098B (en) * 2020-08-31 2022-04-19 鲁东大学 Self-adaptive color digital image blind watermarking method
CN112488903B (en) * 2021-01-04 2022-04-08 鲁东大学 Spatial domain color digital image blind watermarking method fusing multilevel discrete Fourier transform
CN112488904B (en) * 2021-01-18 2023-09-29 鲁东大学 Matrix singular value decomposition-based quaternion color digital image blind watermarking method
CN115150627B (en) * 2022-06-30 2024-04-19 四川大学 DST-based video compression robustness-resistant blind watermarking method

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101582158A (en) * 2009-06-26 2009-11-18 中山大学 Method for embedding and authenticating watermark of digital image
CN102096894A (en) * 2010-12-30 2011-06-15 浙江工商大学 Image fragile watermarking algorithm capable of realizing accurate positioning of tampered region
CN106991636A (en) * 2017-04-05 2017-07-28 鲁东大学 The spatial domain coloured image blind watermark method that a kind of fusion Schur is decomposed
CN107895340A (en) * 2017-11-29 2018-04-10 鲁东大学 The null tone domain color digital image blind watermark method that a kind of fusion QR is decomposed

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101582158A (en) * 2009-06-26 2009-11-18 中山大学 Method for embedding and authenticating watermark of digital image
CN102096894A (en) * 2010-12-30 2011-06-15 浙江工商大学 Image fragile watermarking algorithm capable of realizing accurate positioning of tampered region
CN106991636A (en) * 2017-04-05 2017-07-28 鲁东大学 The spatial domain coloured image blind watermark method that a kind of fusion Schur is decomposed
CN107895340A (en) * 2017-11-29 2018-04-10 鲁东大学 The null tone domain color digital image blind watermark method that a kind of fusion QR is decomposed

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
一种基于DCT域直流分量的盲水印算法;马睿;赵国芳;任亚辉;;农业网络信息(第10期);全文 *
丁胜军 ; 李玉惠 ; 李勃 ; 冯和平.基于FPGA软硬件协同设计实现数字图片水印.2010国际信息技术与应用论坛.2010,全文. *

Also Published As

Publication number Publication date
CN109035129A (en) 2018-12-18

Similar Documents

Publication Publication Date Title
CN109035129B (en) Color digital image blind watermarking method based on two-dimensional discrete sine transformation
CN108648134B (en) Spatial domain color digital image blind watermarking method fusing discrete wavelet transform
CN107895340B (en) Space-frequency domain color digital image blind watermarking method integrating QR decomposition
CN110390621B (en) DCT domain color digital image blind watermarking method based on variable step length
CN110349073B (en) Four-system color digital image blind watermarking method based on Schur decomposition
CN109102454B (en) Color QR code digital blind watermarking method integrating fast Fourier transform
CN111199508B (en) Spatial domain color digital image blind watermarking method fusing DCT and DHT
CN106204410B (en) A kind of novel digital watermark method decomposed based on matrix Schur
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
CN112508765B (en) Frequency domain color digital image blind watermarking method based on Walsh-Hadamard transform
CN110570345B (en) Blind watermarking method for airspace color digital image fused with discrete cosine transform
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
CN109829846B (en) Digital image blind watermarking method based on two-dimensional discrete cosine transform
CN110415154B (en) Haer transformation-based quaternary color digital image blind watermarking method
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
Yang et al. A watermarking algorithm based on wavelet and cosine transform for color image
CN112017098B (en) Self-adaptive color digital image blind watermarking method
CN113222803B (en) Color digital image blind watermarking method based on pure quaternion Schur decomposition
CN112488903B (en) Spatial domain color digital image blind watermarking method fusing multilevel discrete Fourier transform
CN113191933B (en) Color digital image blind watermarking method based on approximate Hadamard transform
CN117495647A (en) Color image digital watermarking method based on ULV decomposition
CN113191932B (en) Spatial domain color digital image blind watermarking method fusing discrete Chebyshev transformation

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 Lin

Inventor after: Su Qingtang

Inventor after: Wang Yilei

Inventor after: Li Tao

Inventor after: Li Bo

Inventor before: Su Qingtang

Inventor before: Yuan Zihan

Inventor before: Liu Decheng

Inventor before: Su Lin

Inventor before: Wang Huanying

Inventor before: Wang Yilei

Inventor before: Li Tao

Inventor before: Li Bo

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