CN110349073B - Four-system color digital image blind watermarking method based on Schur decomposition - Google Patents
Four-system color digital image blind watermarking method based on Schur decomposition Download PDFInfo
- Publication number
- CN110349073B CN110349073B CN201910669035.7A CN201910669035A CN110349073B CN 110349073 B CN110349073 B CN 110349073B CN 201910669035 A CN201910669035 A CN 201910669035A CN 110349073 B CN110349073 B CN 110349073B
- Authority
- CN
- China
- Prior art keywords
- watermark
- color
- blue
- green
- scblock
- 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
Links
- 238000000034 method Methods 0.000 title claims abstract description 31
- 238000000354 decomposition reaction Methods 0.000 title claims abstract description 18
- 239000011159 matrix material Substances 0.000 claims abstract description 40
- 238000013139 quantization Methods 0.000 claims abstract description 10
- 238000000605 extraction Methods 0.000 claims abstract description 5
- 238000007781 pre-processing Methods 0.000 claims description 8
- XLYOFNOQVPJJNP-UHFFFAOYSA-N water Substances O XLYOFNOQVPJJNP-UHFFFAOYSA-N 0.000 claims description 5
- PXFBZOLANLWPMH-UHFFFAOYSA-N 16-Epiaffinine Natural products C1C(C2=CC=CC=C2N2)=C2C(=O)CC2C(=CC)CN(C)C1C2CO PXFBZOLANLWPMH-UHFFFAOYSA-N 0.000 claims description 4
- 230000009466 transformation Effects 0.000 claims description 4
- 101100379080 Emericella variicolor andB gene Proteins 0.000 claims description 3
- 239000004576 sand Substances 0.000 claims description 3
- 230000006835 compression Effects 0.000 description 8
- 238000007906 compression Methods 0.000 description 8
- 238000001914 filtration Methods 0.000 description 4
- 238000010008 shearing Methods 0.000 description 4
- 238000011161 development Methods 0.000 description 2
- 239000000969 carrier Substances 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 238000011160 research Methods 0.000 description 1
- 238000012795 verification Methods 0.000 description 1
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/0065—Extraction of an embedded watermark; Reliable detection
Abstract
The invention discloses a four-system color digital image blind watermarking method based on Schur decomposition by combining the advantage of strong robustness of a transform domain digital watermarking algorithm. According to the characteristic that Schur decomposition is lower in complexity than other matrix decomposition methods, the maximum characteristic value in the upper triangular matrix is obtained by performing Schur decomposition on the image block, and the embedding and blind extraction of the color digital watermark are completed by performing multi-interval quantization on the maximum characteristic value. The invention can embed the digital watermark of the color image into the color host image, has the characteristics of stronger robustness, better invisibility and higher safety, has the characteristic of large capacity, and is suitable for occasions of large-capacity color digital image copyright protection.
Description
Technical Field
The invention belongs to the technical field of network space security, and relates to copyright protection of color digital images as watermarks.
Background
With the popularization of computers and the rapid development of network technology, people are increasingly carrying out various information exchanges through the internet, and color digital images serving as information carriers are increasingly moving into lives of people, but infringement such as distortion, tampering and plagiarism are accompanied, so that the problem of copyright protection of the color digital images is receiving widespread attention. On the one hand, the technology of computer software and hardware is continuously developed deeply, and the security of the algorithm is challenged. On the other hand, with the development of image acquisition technology, the size of copyright identification is becoming larger and larger. Therefore, how to fully utilize the advantages of the transform domain digital watermarking algorithm to design a color image digital watermarking algorithm with strong robustness, high security and large capacity becomes one of the problems of current research.
Disclosure of Invention
The invention aims to provide a four-system color digital image blind watermarking method based on Schur decomposition, which comprises an embedding process and an extracting process of color image digital watermarking, wherein the specific process of watermark embedding is described as follows:
step1: preprocessing of color host images: will be of the size ofM×M24-bit color host image of (2)HPerforming dimension reduction treatment to obtain red, green and blue three-layer color channelsH p And divide the pixels in each color channel intom×mIs used to determine the non-overlapping pixel blocks of (1),p=1, 2,3, respectively representing red, green, blue three-layer color channels;
step2: preprocessing a color watermark image: for a size ofN×N24 bit color watermark image of (2)WPerforming dimension reduction treatment to obtain red, green and blue three-layer color channels, and performing private key-based on each layer of color channelK p Affine transformation of (a) to obtain scrambled color channelsW p ，p=1, 2,3, respectively representing red, green, blue three-layer color channels; then, the layers are color-channeledW p Each decimal pixel value in the color channel is converted into a 4-bit quaternary sequence, and the quaternary sequences are spliced into watermark character strings of color channels of each layer in turnstr p ， p=1, 2,3, respectively representing red, green, blue three-layer color channels;
step3: selecting a pixel block: using a selection block matrixlocationFrom the color channelH p In selecting blocks of pixelsscblockWherein the block matrix is selectedlocationIs pseudo-randomly generated by a MATLAB built-in function randperm,p=1, 2,3, respectively representing red, green, blue three-layer color channels;
step 4: obtaining the maximum characteristic value of the pixel block: for a block of pixels according to equation (1)scblockPerforming Schur decomposition to obtain unitary matrixSAnd upper triangular matrixCUpper triangular matrixCThe largest major diagonal element of (a)
I.e. pixel blocksscblockIs the maximum eigenvalue of (2);
step 5: calculating the upper and lower boundary values of the maximum characteristic value: selecting watermark bits from a watermark string in order of precedencewUsing formulas (2) and (3) to obtain the upper boundary of the maximum characteristic valueB upper And lower boundaryB lower ；
wherein ,
is a block of pixelsscblockMod ()' is a function of the remainder,Tis the quantization step size;
step6: calculating an optimal boundary value: obtaining an optimal boundary value by using a formula (4)
And replace the original maximum characteristic value with the same
Obtaining a new upper triangular matrixC * ；
wherein ,B upper andB lower respectively an upper boundary and a lower boundary of the maximum characteristic value, wherein abs (degree) is an absolute value function;
step7: obtaining a pixel block containing watermark: performing inverse Schur decomposition by using a formula (5) to obtain a pixel block containing the watermarkscblock * ；
Step 8: obtaining a watermarked host image: step 3-Step 7 of the process is repeatedly executed until all watermark bits are embedded; finally recombined three-layer color channel containing watermarkH p * Obtaining a color host image containing a watermarkH * ；
The specific process of watermark extraction is described as follows:
step1: preprocessing of color watermark-containing host images: color host image to be printed with waterH * Performing dimension reduction treatment to obtain three layers of color channels containing watermarks of red, green and blueH p * And divide the pixels in each color channel intom×mIs used to determine the non-overlapping pixel blocks of (1),p=1, 2,3, respectively representing red, green, blue three-layer color channels;
step2: selecting a pixel block containing a watermark: using a selection block matrixlocationFrom the color channelH p * Selecting pixel blocks containing watermarksscblock * Wherein the block matrix is selectedlocationIs pseudo-randomly generated by a MATLAB built-in function randperm,p=1, 2,3, respectively representing red, green, blue three-layer color channels;
step3: obtaining the maximum characteristic value of the watermark-containing block: for blocks of hydrous pixels according to equation (6)scblock * Performing Schur decomposition to obtain unitary matrixS * And upper triangular matrixC * Upper triangular matrixC * The largest major diagonal element of (a)
I.e. pixel blocksscblock * Is the maximum eigenvalue of (2);
step 4: extracting watermark bits: extracting the pixel block containing the watermark by using a formula (7)scblock * Watermark bits contained in the filew * ；
Wherein mod ()' is a function of the remainder,Tis the quantization step size，
Is a block of pixelsscblock * Is the maximum eigenvalue of (2);
step 5: extracting all watermark bits: step 2-Step 4 of the process is repeatedly executed until all watermark bits are extracted, and a character string containing the watermark is obtainedstr p * ，p=1, 2,3, respectively representing red, green, blue three-layer color channels;
step6: obtaining layered color channels: sequentially taking outstr p * Is converted into decimal pixel values, and the operation is repeated until all sequences are converted into decimal pixel values; the pixel values are then rearranged to obtain threeN×NColor channels of (a)W p * ，p=1, 2,3, respectively representing red, green, blue three-layer color channels;
step7: decrypting to obtain an extracted watermark image: private key-based per-layer color channelK p And re-obtaining the final extracted color watermark imageW * ；
The method completes the embedding and blind extraction of the digital watermark by carrying out multi-interval quantization on the maximum characteristic value of the image block; the method not only has better watermark invisibility and stronger watermark robustness, but also has higher security and larger watermark capacity.
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.9486 and 0.9730 in sequence, and the peak signal to noise ratio PSNR values are 36.3865dB and 36.2235dB 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), and 5 (e) show watermarks extracted by sequentially subjecting the watermark image shown in fig. 3 (a) to attacks such as JPEG2000 compression (7:1), median filtering (3×3), JPEG compression (60), shearing (12.5%), scaling (75%), and the like, and the normalized cross-correlation coefficient NC values thereof are 0.9999, 0.9717, 0.9997, 0.9331, and 0.9996, 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.9511 and 0.9723 in sequence, and the peak signal-to-noise ratio PSNR values are 36.4149dB and 36.2279dB 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), and 8 (e) are watermarks extracted by sequentially subjecting the watermark image shown in fig. 6 (a) to attacks such as JPEG2000 compression (7:1), median filtering (3×3), JPEG compression (60), shearing (12.5%), scaling (75%), and the like, and normalized cross-correlation coefficient NC values thereof are 0.9999, 0.9575, 0.9995, 0.9865, and 0.9997, respectively.
Detailed Description
The invention aims to provide a four-system color digital image blind watermarking method based on Schur decomposition, which comprises an embedding process and an extracting process of color image digital watermarking, wherein the specific process of watermark embedding is described as follows:
step1: preprocessing of color host images: a 24-bit color host image of 512×512 size is displayedHPerforming dimension reduction treatment to obtain red, green and blue three-layer color channelsH p And the pixels in each color channel are divided into 4 x 4 non-overlapping blocks of pixels,p=1, 2,3, respectively representing red, green, blue three-layer color channels;
step2: color watermark patternPreprocessing an image: for 24-bit color watermark image with size of 32×32WPerforming dimension reduction treatment to obtain red, green and blue three-layer color channels, and performing private key-based on each layer of color channelK p Affine transformation of (a) to obtain scrambled color channelsW p ，p=1, 2,3, respectively representing red, green, blue three-layer color channels; then, the layers are color-channeledW p Each decimal pixel value of (a) is converted into a 4-bit quaternary sequence (e.g. decimal pixel value 205 is converted into a 4-bit quaternary sequence '3031'), and the decimal pixel values are sequentially spliced into watermark character strings of color channels of each layerstr p ， p=1, 2,3, respectively representing red, green, blue three-layer color channels;
step3: selecting a pixel block: using a selection block matrixlocationFrom the color channelH p In selecting blocks of pixelsscblockWherein the block matrix is selectedlocationIs pseudo-randomly generated by a MATLAB built-in function randperm,p=1, 2,3, respectively representing red, green, blue three-layer color channels; here, a selected pixel block is setscblockIs that
；
Step 4: obtaining the maximum characteristic value of the pixel block: for a block of pixels according to equation (1)scblockPerforming Schur decomposition to obtain unitary matrixSAnd upper triangular matrixCUpper triangular matrixCThe largest major diagonal element of (a)
I.e. pixel blocksscblockIs the maximum eigenvalue of (2); at this time, unitary matrixS=
Upper triangular matrixC=
Pixel blockscblockMaximum characteristic value of (2)
=618.5028；
Step 5: calculating the upper and lower boundary values of the maximum characteristic value: selecting watermark bits from a watermark string in order of precedencewUsing formulas (2) and (3) to obtain the upper boundary of the maximum characteristic valueB upper And lower boundaryB lower ；
wherein ,
is a block of pixelsscblockMod ()' is a function of the remainder,Tis the quantization step size; at this time, the selected watermark bit is setw= '0', pixel blockscblockMaximum characteristic value of (2)
= 618.5028, quantization step sizeT=104, upper boundary of maximum eigenvalueB upper Lower boundary =637B lower =533；
Step6: calculating an optimal boundary value: obtaining an optimal boundary value by using a formula (4)
And replace the original maximum characteristic value with the same
ObtainingNew upper triangular matrixC * ；
wherein ,B upper andB lower respectively an upper boundary and a lower boundary of the maximum characteristic value, wherein abs (degree) is an absolute value function; at this time, the optimum boundary value
=637, new upper triangular matrixC * =
；
Step7: obtaining a pixel block containing watermark: performing inverse Schur decomposition by using a formula (5) to obtain a pixel block containing the watermarkscblock * The method comprises the steps of carrying out a first treatment on the surface of the At this time, the obtained water-containing print pixel blockscblock * =
；
Step 8: obtaining a watermarked host image: step 3-Step 7 of the process is repeatedly executed until all watermark bits are embedded; finally recombined three-layer color channel containing watermarkH p * Obtaining a color host image containing a watermarkH * ；
The specific process of watermark extraction is described as follows:
step1: preprocessing of color watermark-containing host images: color host image to be printed with waterH * Performing dimension reduction treatment to obtain three layers of color channels containing watermarks of red, green and blueH p * And dividing pixels in each color channel into 4×4 non-overlapping pixelsThe block of pixels is formed such that,p=1, 2,3, respectively representing red, green, blue three-layer color channels;
step2: selecting a pixel block containing a watermark: using a selection block matrixlocationFrom the color channelH p * Selecting pixel blocks containing watermarksscblock * Wherein the block matrix is selectedlocationIs pseudo-randomly generated by a MATLAB built-in function randperm,p=1, 2,3, respectively representing red, green, blue three-layer color channels; at this time, a selected water-containing print pixel block is setscblock * Is that
；
Step3: obtaining the maximum characteristic value of the watermark-containing block: for blocks of hydrous pixels according to equation (6)scblock * Performing Schur decomposition to obtain unitary matrixS * And upper triangular matrixC * Upper triangular matrixC * The largest major diagonal element of (a)
I.e. pixel blocksscblock * Is the maximum eigenvalue of (2); at this time, unitary matrixS * =
Upper triangular matrixC * =
Pixel blockscblock * Maximum characteristic value of (2)
=638.5027；
Step 4: extracting watermark bits: lifting by using formula (7)Taking a block of watermark pixelsscblock * Watermark bits contained in the filew * ；
Wherein mod ()' is a function of the remainder,Tis the quantization step size and,
is a block of pixelsscblock * Is the maximum eigenvalue of (2); at this time, quantization step sizeT=104, pixel blockscblock * Maximum characteristic value of (2)
= 638.5027, extracted watermark bitsw * =’0’；
Step 5: extracting all watermark bits: step 2-Step 4 of the process is repeatedly executed until all watermark bits are extracted, and a character string containing the watermark is obtainedstr p * ，p=1, 2,3, respectively representing red, green, blue three-layer color channels;
step6: obtaining layered color channels: sequentially taking outstr p * Is converted into decimal pixel values, and the operation is repeated until all sequences are converted into decimal pixel values; the pixel values are then rearranged to obtain threeN×NColor channels of (a)W p * ，p=1, 2,3, respectively representing red, green, blue three-layer color channels;
step7: decrypting to obtain an extracted watermark image: private key-based per-layer color channelK p And re-obtaining the final extracted color watermark imageW * ；
The method is simple and quick, has strong robustness, high safety, large watermark capacity and good watermark invisibility, and is suitable for copyright protection of color digital images as watermarks.
The invention has the effect of verification
To prove the effectiveness of the present invention, two standard 24-bit color images of 512×512 size as shown in fig. 1 (a) and 1 (b) were selected as host images, and verified with 24-bit color watermark images of 32×32 size as shown in fig. 2 (a) and 2 (b).
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.9486 and 0.9730 in sequence, and the peak signal-to-noise ratio PSNR values are 36.38655dB and 36.2235dB 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) show watermarks extracted by sequentially subjecting the watermark image shown in fig. 3 (a) to attacks such as JPEG2000 compression (7:1), median filtering (3×3), JPEG compression (60), shearing (12.5%), scaling (75%), and the like, and the normalized cross-correlation coefficient NC values thereof are 0.9999, 0.9717, 0.9997, 0.9331, and 0.9996, 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.9511 and 0.9723 in sequence, and the peak signal-to-noise ratio PSNR values are 36.4149dB and 36.2279dB 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), and 8 (e) are watermarks extracted by sequentially subjecting the watermark image shown in fig. 6 (a) to attacks such as JPEG2000 compression (7:1), median filtering (3×3), JPEG compression (60), shearing (12.5%), scaling (75%), and the like, and normalized cross-correlation coefficient NC values thereof are 0.9999, 0.9575, 0.9995, 0.9865, and 0.9997, respectively.
In summary, the color image digital watermark extracted from various attacked images has high recognizability and high levelThe NC value of (2) shows that the method has stronger robustness; at the same time, the key space of the affine transformation scrambling method used by the algorithm is 2 84 The safety is high; in addition, the binary information actually embedded in the color digital image is 3×2 13 Bits, maximum embeddable binary information of 3×2 15 The watermark capacity is larger; finally, the embedded color image digital watermark has better invisibility, and meets the requirements of strong robustness, high safety and large capacity for protecting the copyright of the color image digital watermark.
Claims (1)
1. A four-system color digital image blind watermarking method based on Schur decomposition comprises a color image digital watermarking embedding process and an extracting process, wherein the specific watermarking embedding process is described as follows:
step1: preprocessing of color host images: will be of the size ofM×M24-bit color host image of (2)HPerforming dimension reduction treatment to obtain red, green and blue three-layer color channelsH p And divide the pixels in each color channel intom×mIs used to determine the non-overlapping pixel blocks of (1),p=1, 2,3, respectively representing red, green, blue three-layer color channels;
step2: preprocessing a color watermark image: for a size ofN×N24 bit color watermark image of (2)WPerforming dimension reduction treatment to obtain red, green and blue three-layer color channels, and performing private key-based on each layer of color channelK p Affine transformation of (a) to obtain scrambled color channelsW p ，p=1, 2,3, respectively representing red, green, blue three-layer color channels; then, the layers are color-channeledW p Each decimal pixel value in the color channel is converted into a 4-bit quaternary sequence, and the quaternary sequences are spliced into watermark character strings of color channels of each layer in turnstr p ，p=1, 2,3, respectively representing red, green, blue three-layer color channels;
step3: selecting a pixel block: using a selection block matrixlocationFrom the color channelH p In selecting blocks of pixelsscblockWherein the block matrix is selectedlocationIs pseudo-randomly generated by a MATLAB built-in function randperm,p=1, 2,3, respectively representing red, green, blue three-layer color channels;
step 4: obtaining the maximum characteristic value of the pixel block: for a block of pixels according to equation (1)scblockPerforming Schur decomposition to obtain unitary matrixSAnd upper triangular matrixCUpper triangular matrixCThe largest major diagonal element of (a)
I.e. pixel blocksscblockIs the maximum eigenvalue of (2);
step 5: calculating the upper and lower boundary values of the maximum characteristic value: selecting watermark bits from a watermark string in order of precedencewUsing formulas (2) and (3) to obtain the upper boundary of the maximum characteristic valueB upper And lower boundaryB lower ；
wherein ,
is a block of pixelsscblockMod ()' is a function of the remainder,Tis the quantization step size;
step6: calculating an optimal boundary value: obtaining an optimal boundary value by using a formula (4)
And replace the original maximum characteristic value with the same
Obtaining a new upper triangular matrixC * ；
wherein ,B upper andB lower respectively an upper boundary and a lower boundary of the maximum characteristic value, wherein abs (degree) is an absolute value function;
step7: obtaining a pixel block containing watermark: performing inverse Schur decomposition by using a formula (5) to obtain a pixel block containing the watermarkscblock * ；
Step 8: obtaining a watermarked host image: step 3-Step 7 of the process is repeatedly executed until all watermark bits are embedded; finally recombined three-layer color channel containing watermarkH p * Obtaining a color host image containing a watermarkH * ；
The specific process of watermark extraction is described as follows:
step1: preprocessing of color watermark-containing host images: color host image to be printed with waterH * Performing dimension reduction treatment to obtain three layers of color channels containing watermarks of red, green and blueH p * And divide the pixels in each color channel intom×mIs used to determine the non-overlapping pixel blocks of (1),p=1, 2,3, respectively representing red, green, blue three-layer color channels;
step2: selecting a pixel block containing a watermark: using a selection block matrixlocationFrom the color channelH p * Selecting pixel blocks containing watermarksscblock * Wherein the block matrix is selectedlocationIs pseudo-randomly generated by a MATLAB built-in function randperm,p=1, 2,3 tables respectivelyRed, green and blue three-layer color channels are shown;
step3: obtaining the maximum characteristic value of the watermark-containing block: for blocks of hydrous pixels according to equation (6)scblock * Performing Schur decomposition to obtain unitary matrixS * And upper triangular matrixC * Upper triangular matrixC * The largest major diagonal element of (a)
I.e. pixel blocksscblock * Is the maximum eigenvalue of (2);
step 4: extracting watermark bits: extracting the pixel block containing the watermark by using a formula (7)scblock * Watermark bits contained in the filew * ；
Wherein mod ()' is a function of the remainder,Tis the quantization step size and,
is a block of pixelsscblock * Is the maximum eigenvalue of (2);
step 5: extracting all watermark bits: step 2-Step 4 of the process is repeatedly executed until all watermark bits are extracted, and a character string containing the watermark is obtainedstr p * ，p=1, 2,3, respectively representing red, green, blue three-layer color channels;
step6: obtaining layered color channels: sequentially taking outstr p * Is converted into decimal pixel values, and the operation is repeated until all sequences are converted into decimal pixel values; and then re-useThe pixel values are arranged to obtain threeN×NColor channels of (a)W p * ，p=1, 2,3, respectively representing red, green, blue three-layer color channels;
step7: decrypting to obtain an extracted watermark image: private key-based per-layer color channelK p And re-obtaining the final extracted color watermark imageW * 。
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910669035.7A CN110349073B (en) | 2019-07-24 | 2019-07-24 | Four-system color digital image blind watermarking method based on Schur decomposition |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910669035.7A CN110349073B (en) | 2019-07-24 | 2019-07-24 | Four-system color digital image blind watermarking method based on Schur decomposition |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110349073A CN110349073A (en) | 2019-10-18 |
| CN110349073B true CN110349073B (en) | 2023-05-09 |
Family
ID=68178881
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910669035.7A Active CN110349073B (en) | 2019-07-24 | 2019-07-24 | Four-system color digital image blind watermarking method based on Schur decomposition |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110349073B (en) |
Families Citing this family (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111223035B (en) * | 2020-01-07 | 2022-04-05 | 鲁东大学 | Color blind watermarking method based on Hamming code, eigenvalue decomposition and image correction |
| CN112488904B (en) * | 2021-01-18 | 2023-09-29 | 鲁东大学 | Matrix singular value decomposition-based quaternion color digital image blind watermarking method |
| CN113222803B (en) * | 2021-05-31 | 2022-03-29 | 鲁东大学 | Color digital image blind watermarking method based on pure quaternion Schur decomposition |
| CN115147325B (en) * | 2022-09-05 | 2022-11-22 | 深圳清瑞博源智能科技有限公司 | Image fusion method, device, equipment and storage medium |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108876694A (en) * | 2018-05-31 | 2018-11-23 | 上海理工大学 | The threedimensional model blind watermark algorithm algorithm decomposed based on Schur |
| CN109829845A (en) * | 2019-01-29 | 2019-05-31 | 鲁东大学 | The variable step size color image blind watermark method decomposed based on matrix Schur |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP2362382A1 (en) * | 2010-02-26 | 2011-08-31 | Fraunhofer-Gesellschaft zur Förderung der Angewandten Forschung e.V. | Watermark signal provider and method for providing a watermark signal |
| US10296999B2 (en) * | 2017-02-13 | 2019-05-21 | Macau University Of Science And Technology | Methods and apparatus for color image watermarking |
-
2019
- 2019-07-24 CN CN201910669035.7A patent/CN110349073B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108876694A (en) * | 2018-05-31 | 2018-11-23 | 上海理工大学 | The threedimensional model blind watermark algorithm algorithm decomposed based on Schur |
| CN109829845A (en) * | 2019-01-29 | 2019-05-31 | 鲁东大学 | The variable step size color image blind watermark method decomposed based on matrix Schur |
Non-Patent Citations (2)
| Title |
|---|
| 基于QR码和Schur分解的感兴趣区域水印算法;王晓红;孙业强;;光电子・激光(第04期);全文 * |
| 基于矩阵Schur分解的彩色图像盲水印算法;刘凡;杨洪勇;苏庆堂;计算机应用研究(第010期);全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110349073A (en) | 2019-10-18 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110349073B (en) | Four-system color digital image blind watermarking method based on Schur decomposition | |
| CN109035129B (en) | Color digital image blind watermarking method based on two-dimensional discrete sine transformation | |
| CN109829845B (en) | Variable step-length color image blind watermarking method based on matrix Schur decomposition | |
| CN108648134B (en) | Spatial domain color digital image blind watermarking method fusing discrete wavelet transform | |
| CN110390621B (en) | DCT domain color digital image blind watermarking method based on variable step length | |
| CN109102454B (en) | Color QR code digital blind watermarking method integrating fast Fourier transform | |
| CN107895340B (en) | Space-frequency domain color digital image blind watermarking method integrating QR decomposition | |
| Saturwar et al. | Secure visual secret sharing scheme for color images using visual cryptography and digital watermarking | |
| CN111199508B (en) | Spatial domain color digital image blind watermarking method fusing DCT and DHT | |
| CN112488904B (en) | Matrix singular value decomposition-based quaternion color digital image blind watermarking method | |
| CN110415155B (en) | Blind watermarking method for airspace color image fused with haar transformation | |
| CN106991636B (en) | Airspace color image blind watermarking method fusing approximate Schur decomposition | |
| CN116993567A (en) | Frequency domain blind watermarking method based on Hadamard transform and teaching optimization algorithm | |
| CN110570345B (en) | Blind watermarking method for airspace color digital image fused with discrete cosine transform | |
| CN112508765A (en) | Frequency domain color digital image blind watermarking method based on Walsh-Hadamard transform | |
| 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 | |
| Sharma et al. | Robust technique for steganography on Red component using 3-DWT-DCT transform | |
| Yang et al. | A watermarking algorithm based on wavelet and cosine transform for color image | |
| CN111242828B (en) | Spatial domain color digital image blind watermarking method fused with discrete Fourier transform | |
| CN112017098B (en) | Self-adaptive color digital image blind watermarking method | |
| CN117495647A (en) | Color image digital watermarking method based on ULV decomposition | |
| 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 | |
| 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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |