CN109102454B - Color QR code digital blind watermarking method integrating fast Fourier transform - Google Patents
Color QR code digital blind watermarking method integrating fast Fourier transform Download PDFInfo
- Publication number
- CN109102454B CN109102454B CN201810916666.XA CN201810916666A CN109102454B CN 109102454 B CN109102454 B CN 109102454B CN 201810916666 A CN201810916666 A CN 201810916666A CN 109102454 B CN109102454 B CN 109102454B
- Authority
- CN
- China
- Prior art keywords
- watermark
- color
- pixel
- embedded
- channel
- 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 21
- 238000000605 extraction Methods 0.000 claims abstract description 5
- 230000008569 process Effects 0.000 claims description 10
- 239000011159 matrix material Substances 0.000 claims description 9
- 238000007781 pre-processing Methods 0.000 claims description 6
- 230000008859 change Effects 0.000 claims description 5
- 230000000903 blocking effect Effects 0.000 claims description 3
- 238000013139 quantization Methods 0.000 claims description 3
- 239000003086 colorant Substances 0.000 claims 1
- 230000009466 transformation Effects 0.000 claims 1
- 230000008901 benefit Effects 0.000 abstract description 6
- 230000006835 compression Effects 0.000 description 8
- 238000007906 compression Methods 0.000 description 8
- 230000006870 function Effects 0.000 description 8
- 235000002566 Capsicum Nutrition 0.000 description 4
- 239000006002 Pepper Substances 0.000 description 4
- 241000722363 Piper Species 0.000 description 4
- 235000016761 Piper aduncum Nutrition 0.000 description 4
- 235000017804 Piper guineense Nutrition 0.000 description 4
- 235000008184 Piper nigrum Nutrition 0.000 description 4
- 150000003839 salts Chemical class 0.000 description 4
- 238000010008 shearing Methods 0.000 description 4
- 238000006243 chemical reaction Methods 0.000 description 3
- 239000000758 substrate Substances 0.000 description 3
- 238000005516 engineering process Methods 0.000 description 2
- 238000013473 artificial intelligence Methods 0.000 description 1
- 238000013135 deep learning Methods 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 239000004973 liquid crystal related substance Substances 0.000 description 1
- 239000003607 modifier Substances 0.000 description 1
- 238000012795 verification Methods 0.000 description 1
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
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Landscapes
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Image Processing (AREA)
- Editing Of Facsimile Originals (AREA)
Abstract
The invention discloses a color QR code digital blind watermarking method fused with fast Fourier transform by combining the advantages of fast running speed of a space domain digital watermarking algorithm and high robustness of a frequency domain digital watermarking algorithm. According to the unique characteristics of the direct current coefficient of the fast Fourier transform, the direct current coefficient of the fast Fourier transform of the image block is obtained in the space domain, and the embedding and blind extraction of the digital watermark are completed in the space domain by utilizing the direct current coefficient, so that the digital watermark can be completed without carrying out real fast Fourier transform. The invention can embed the color QR code digital watermark into the color host image, has better watermark concealment and stronger robustness, has better real-time performance, solves the difficult problem of low running speed of the large-capacity color image digital watermark, and is suitable for the situation of fast and efficient digital media copyright protection.
Description
Technical Field
The invention belongs to the technical field of information security, and relates to rapid copyright protection of a high-capacity robust color digital watermark image.
Background
With the rapid development of multimedia technology, more and more color digital images emerge and spread on the network and become one of the main media of modern information, and the illegal actions such as piracy, infringement and the like are frequent, so that the copyright protection problem is also more and more widely focused by students at home and abroad. For this reason, on the one hand, the identification requiring copyright protection tends to be attractive and practical, color image digital watermarks of high capacity, and is not limited to pseudo-random sequences, binary images or gray images with smaller capacity; on the other hand, with the wide popularization of mobile terminal devices, the existing watermarking algorithm, especially the digital watermarking algorithm adopting the technologies of artificial intelligence, deep learning and the like, is difficult to meet the requirements of quick and efficient application due to the longer running time, and needs to further improve the running speed.
According to the difference of the working domains of the host image, the digital watermarking algorithm mainly comprises a spatial domain digital watermarking algorithm and a frequency domain digital watermarking algorithm; the former has the advantages of simple algorithm and fast operation, but has the defect of weak robustness, while the latter has the advantage of strong robustness, but the forward conversion and the reverse conversion of the corresponding conversion domain cause the longer operation time of the watermark algorithm, thereby influencing the real-time performance, the practicability and the popularization of the algorithm. Therefore, how to fully combine the advantages of the two to design a digital watermarking algorithm with strong robustness and good real-time performance becomes one of the problems to be solved urgently.
Disclosure of Invention
The invention aims to provide a color QR code digital blind watermarking method integrating fast Fourier transform, which is characterized by being realized through a specific watermarking embedding process and an extracting process, wherein the watermarking embedding process is described as follows:
the first step: preprocessing operation of images: one width is of the sizeM×M24-bit color host image of (2)HIs divided into three color channels of red, green and blueH i Dividing each channel into a plurality of channels of a sizem×mIs a non-overlapping block of pixels; one width is of the sizeN×N24-bit color QR code watermark image of (a)WIs also divided into three color channels of red, green and blueW i And sequentially combining each color channelW i Performing key-basedKa i Arnold scrambling of (A)Transform and channelW i Is converted into binary values of 8 bits in length, andW i binary values in the watermark are spliced into a character string sequence of the watermark in turnSW i ，SW i Is the total length of (2)lenwIs thatN×NX 8, whereini=1, 2,3, respectively representing three color channels of red, green, blue;
and a second step of: positioning an embedded pixel block and determining watermark bits to be embedded: selecting embedded pixel blocks using a positioning matrixblock，The positioning matrix is based on keyKb i Is generated by a Hash pseudo-random scrambling algorithm; at the same time, binary character string sequences from corresponding channels in orderSW i Read in (1)jWatermark bits to be embeddedw j Wherein, 1 to less than or equal toj≤lenw，i=1, 2,3, respectively representing three color channels of red, green, blue;
and a third step of: direct current component in the fast Fourier transform result is directly obtained in the space domain by the formula (1)tmaxThe direct current component does not need to be obtained by real fast Fourier transform;
(1)
wherein,,p、 qis that pixels are embedded in a pixel blockblockThe positions of the middle row and the middle column,is a block of pixelsblockMiddle (f)pLine 1qPixel value of column position, ">，m Is an embedded pixel blockblockWidth (or height) of (a) a substrate;
fourth step: calculating the DC component by using the formulas (2), (3)tmaxLower boundary value of (2)C low And upper boundary valueC high ：
(2)
(3)
Wherein,,w j is the firstjWatermark bits to be embedded are 1-1%j≤lenwFloor () is a round down function,Tis the quantization step length;
fifth step: from the upper and lower boundary values according to equation (4)C high AndC low selecting the best boundary valuecc：
(4)
Wherein abs (-) is the absolute function;
sixth step: calculating a pixel block containing a watermark: using equation (5) to calculate the variation of the DC componentchangeEvenly distributed to embedded pixel blocksblockOn all pixels in the image, a pixel block containing the watermark can be obtainedblocknewAnd updates it back to the corresponding color channel;
(5)
wherein,,change=cc-tmax， m is an embedded pixel blockblockWidth (or height) of (a) a substrate;
seventh step: the second step to the sixth step are circularly executed until all watermark bits are respectively embedded into the three color channels after the blocking, and finally, the red, green and blue color channels containing the watermark are recombined to obtain the watermark-containing imageH*；
The watermark extraction process is described as follows:
the first step: preprocessing watermark-containing imagesH*: will contain the watermark imageH*Is divided into three color channels of red, green and blueWhereini=1, 2,3, respectively representing three color channels of red, green, blue, each divided into sizem×mIs a non-overlapping block of pixels;
and a second step of: positioning a pixel block: in the color channelIn (1) using a key based->Determining pixel blocks by using a positioning matrix generated by a Hash pseudo-random scrambling algorithmblock*；
And a third step of: direct current component in the fast Fourier transform result is directly obtained in the space domain by the formula (6)tmax*The direct current component does not need to be obtained by real fast Fourier transform;
(6)
wherein,,p、q is a pixel-in-pixel blockblock*The positions of the middle row and the middle column,is a block of pixelsblock*Middle (f)pLine 1qPixel value of column position, ">，m Is a block of pixelsblock*Width (or height) of (a) a substrate;
fourth step: extracting the first by using the formula (7)jWatermark bitsw j Wherein, 1 to less than or equal toj≤lenw；
(7)
Wherein mod (-) is a remainder function and round (-) is a rounding function;
fifth step: circularly executing the second step to the fourth step to respectively obtain the binary character string sequences in all the channelsSW i *Then willSW i *Converting into decimal pixel values with every 8-bit binary string as a group, whereini=1, 2,3, respectively representing three color channels of red, green, blue;
sixth step: the decimal pixel value of each channel is respectively processed based on the keyKa i Is the inverse Arnold transform of (A), at which time the watermark of each channel is obtainedWhereini=1, 2,3, respectively representing three color channels of red, green, blue;
seventh step: reorganizing watermarks for channelsObtaining 24-bit color QR code watermark image +.>。
The method utilizes the principle of obtaining the direct current coefficient of the fast Fourier transform in the airspace and the distribution rule of the coefficient modifier in airspace pixels to directly finish the digital watermark embedding and blind extraction which are needed to be carried out in the fast Fourier transform in the airspace; the method has the advantages of good watermark robustness, high algorithm instantaneity, simplicity and rapidness.
Drawings
Fig. 1 (a), 1 (b) are two original color host images.
Fig. 2 is an original color QR code watermark image.
Fig. 3 (a) and 3 (b) are watermark-containing images obtained by embedding the watermarks shown in fig. 2 into the host images in sequence in fig. 1 (a) and 1 (b), wherein the structural similarity SSIM values are 0.9042 and 0.8815 in sequence, and the peak signal-to-noise ratio PSNR values are 35.9099dB and 35.8736dB 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), salt and pepper noise (3%), JPEG compression (60), shearing (12.5%), and scaling (75%), and the normalized cross-correlation coefficients NC are 0.9516, 0.9728, 0.9588, 0.9271, and 0.9843, respectively.
Fig. 6 (a), 6 (b), 6 (c), 6 (d), and 6 (e) show watermarks extracted by sequentially subjecting the watermark image shown in fig. 3 (b) to attacks such as JPEG2000 compression (7:1), salt and pepper noise (3%), JPEG compression (60), shearing (12.5%), and scaling (75%), and the normalized cross-correlation coefficients NC are 0.9921, 0.9782, 0.9481, 0.9271, and 0.9966, respectively.
Detailed Description
The invention aims to provide a color QR code digital blind watermarking method integrating fast Fourier transform, which is characterized by being realized through a specific watermarking embedding process and an extracting process, wherein the watermarking embedding process is described as follows:
the first step: preprocessing operation of images: a 24-bit color host image with the size of 512 x 512 is obtainedHIs divided into three color channels of red, green and blueH i Each channel is divided into non-overlapping pixel blocks of size 2×2 (the total number of host image blocks is (512×512)/(2×2) =65536); watermark image of 24-bit color QR code with 64 multiplied by 64WIs also divided into three color channels of red, green and blueW i And sequentially combining each color channelW i Performing key-basedKa i Arnold scrambling transform of (A), and channel (B)W i Is converted to a binary value of length 8 bits (e.g., decimal pixel value 225 is converted to an 8-bit binary value 11100001), will beW i Binary values in the watermark are spliced into a character string sequence of the watermark in turnSW i ，SW i Is the total length of (2)lenw64×64×8=32768<65536 of whichi=1, 2,3, respectively representing three color channels of red, green, blue;
and a second step of: positioning an embedded pixel block and determining watermark bits to be embedded: selecting embedded pixel blocks using a positioning matrixblock，The positioning matrix is based on keyKb i Is generated by a Hash pseudo-random scrambling algorithm; at the same time, from the corresponding channels in orderSW i Read out of the binary string sequence of (c)jWatermark bits to be embeddedw j Wherein, 1 to less than or equal toj≤32768，i=1, 2,3, respectively representing three color channels of red, green, blue; here, a selected embedded pixel block is providedblockIs that；
And a third step of: direct current component in the fast Fourier transform result is directly obtained in the space domain by the formula (1)tmax=843, whereas the direct current component does not require a true fast fourier transform to be obtained;
(1)
wherein,,p、 qis that pixels are embedded in a pixel blockblockThe positions of the middle row and the middle column,is a block of pixelsblockMiddle (f)pLine 1qPixel value of column position, ">Embedding pixel blocksblockThe width (or height) of (a) is 2;
fourth step: calculating the DC component by using the formulas (2), (3)tmaxLower boundary value of (2)C low And upper boundary valueC high ：
(2)
(3)
Wherein,,w j is the firstjWatermark bits to be embedded are 1-1%j32768, floor () is a downward rounding function,Tis the quantization step length; at this time, the watermark information bit to be embedded is set to '1',T=80, according to the formulas (2), (3), getC low =784，C high =864；
Fifth step: from the upper and lower boundary values according to equation (4)C high AndC low selecting the best boundary valuecc：
(4)
Wherein abs (-) is the absolute function; at this time, the optimal boundary value is obtained according to the formula (4)cc= C high =864；
Sixth step: calculating a pixel block containing a watermark: using equation (5) to calculate the variation of the DC componentchangeEvenly distributed to embedded pixel blocksblockOn all pixels in the image, a pixel block containing the watermark can be obtainedblocknewAnd updates it back to the corresponding color channel;
(5)
wherein,,change=cc-tmax=864-843=21, at which time,blocknew=；
seventh step: the second step to the sixth step are circularly executed until all watermark bits are respectively embedded into the three color channels after the blocking, and finally, the red, green and blue color channels containing the watermark are recombined to obtain the watermark-containing imageH*；
The watermark extraction process is described as follows:
the first step: preprocessing watermark-containing imagesH*: will contain the watermark imageH*Is divided into three color channels of red, green and blueWhereini=1, 2,3, representing three color channels red, green, blue, respectively, each divided into non-overlapping blocks of pixels of size 2×2;
and a second step of: positioning a pixel block: in the color channelIn (1) using a key based->Determining pixel blocks by using a positioning matrix generated by a Hash pseudo-random scrambling algorithmblock*；
And a third step of: direct current component in the fast Fourier transform result is directly obtained in the space domain by the formula (6)tmax*The direct current component does not need to be obtained by real fast Fourier transform;
(6)
wherein,,p、q is a pixel-in-pixel blockblock*The positions of the middle row and the middle column,is a block of pixelsblock*Middle (f)pLine 1qPixel value of column position, ">The method comprises the steps of carrying out a first treatment on the surface of the At this time, a selected image block is setblocknew* Is->Then using formula (6)tmax*=864;
Fourth step: extracting the first by using the formula (7)jWatermark bitsw j Wherein, 1 to less than or equal toj≤32768；
(7)
Wherein mod (-) is a remainder function and round (-) is a rounding function; at this time, the liquid crystal display device,T=80，tmax*=864, extracting the watermark information bit contained as '1' using formula (7);
fifth step: circularly executing the second step to the fourth step to respectively obtain the binary character string sequences in all the channelsSW i *Then willSW i *Converting into decimal pixel values with every 8-bit binary string as a group, whereini=1, 2,3, respectively representing three color channels of red, green, blue;
sixth step: the decimal pixel value of each channel is respectively processed based on the keyKa i Is the inverse Arnold transform of (A), at which time the watermark of each channel is obtainedWhereini=1, 2,3, respectively representing three color channels of red, green, blue;
seventh step: reorganizing watermarks for channelsObtaining 24-bit color QR code watermark image +.>。
The method has the advantages of a frequency domain digital watermarking algorithm, a spatial domain digital watermarking algorithm, strong robustness, high instantaneity and good watermark invisibility; the algorithm is simple and quick, and is suitable for high-efficiency copyright protection of high-capacity color images as digital watermarks.
The invention has the effect of verification
To prove the effectiveness of the present invention, two standard images of 24 bits of size 512×512 as shown in fig. 1 (a) and 1 (b) were selected as host images, and verified with a watermark image of 24-bit color QR code of size 64×64 as shown in fig. 2.
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.9042 and 0.8815 in sequence, and the peak signal-to-noise ratio PSNR values are 35.9099dB and 35.8736dB 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), salt and pepper noise (3%), JPEG compression (60), shearing (12.5%), and scaling (75%), and the normalized cross-correlation coefficients NC are 0.9516, 0.9728, 0.9588, 0.9271, and 0.9843, respectively.
Fig. 6 (a), 6 (b), 6 (c), 6 (d), and 6 (e) show watermarks extracted by sequentially subjecting the watermark image shown in fig. 3 (b) to attacks such as JPEG2000 compression (7:1), salt and pepper noise (3%), JPEG compression (60), shearing (12.5%), and scaling (75%), and the normalized cross-correlation coefficients NC are 0.9921, 0.9782, 0.9481, 0.9271, and 0.9966, respectively.
The algorithm runs on a platform 2.8GHZ CPU, 4.00GB RAM, win 8.1 and MATLAB 9.2.0.538062 (R2017 a) for almost ten thousands times, the average embedding time of the digital watermark is 0.306250 seconds, the average extracting time is 0.309944 seconds and the total time is 0.616194 seconds.
In summary, the embedded color QR code digital watermark has better invisibility, and meets the invisibility requirement of a watermark algorithm; meanwhile, color QR code watermark images extracted from various attacked images have higher identifiability and higher NC value, which shows that the method has stronger robustness; in addition, the average running total time of the algorithm is less than 1 second, and the requirement of rapid copyright protection of multimedia big data is met.
Claims (1)
1. A color QR code digital blind watermarking method integrating fast Fourier transform is characterized by being realized through a specific watermarking embedding process and an extracting process, wherein the watermarking embedding process is described as follows:
the first step: preprocessing operation of images: a24-bit color host image H of M×M is divided into three color channels H of red, green and blue i Dividing each channel into non-overlapping pixel blocks with the size of m multiplied by m; a 24-bit color QR code watermark image W with the size of N multiplied by N is also divided into three color channels W of red, green and blue i And sequentially combining each color channel W i Performing a key Ka-based process i Arnold scrambling transform of (A), and channel W i Is converted into binary value with length of 8 bits, W is converted into each decimal pixel value of the number of the decimal pixel i The binary values in the watermark are spliced into a character string sequence SW of the watermark in turn i ，SW i Is n×n×8, where i=1, 2,3, respectively representing three color channels of red, green, blue;
and a second step of: positioning an embedded pixel block and determining watermark bits to be embedded: selecting an embedded pixel block using a positioning matrix, the positioning matrix being based on a key Kb i Is generated by a Hash pseudo-random scrambling algorithm; at the same time, the binary string sequences SW of the corresponding channels are sequentially selected from i The j-th watermark bit w to be embedded is read j Wherein j is not less than 1 and not more than lenw, i=1, 2 and 3 respectively represent three colors of red, green and blueA color channel;
and a third step of: directly obtaining a direct current component tmax in a fast Fourier transform result in a space domain by the formula (1), wherein the direct current component does not need to be obtained by real fast Fourier transform;
wherein p and q are the positions of pixels in rows and columns in an embedded pixel block, block (p and q) is the pixel value of the p-th row and q-th column in the pixel block, p is more than or equal to 1, m is more than or equal to q, and m is the width or the height of the embedded pixel block;
fourth step: calculating the lower boundary value C of the DC component tmax by using the formulas (2), (3) low And upper boundary value C high ：
Wherein w is j For the j-th watermark bit to be embedded, j is more than or equal to 1 and less than or equal to lenw, floor () is a downward rounding function, and T is a quantization step length;
fifth step: from the upper and lower boundary values C according to formula (4) high And C low Selecting the optimal boundary value cc:
wherein abs (-) is the absolute function;
sixth step: calculating a pixel block containing a watermark: uniformly distributing the change of the direct current component to all pixels embedded in the pixel block by using a formula (5), obtaining a pixel block new containing the watermark, and updating the pixel block new back to a corresponding color channel;
blocknew＝block+change/(m×m) (5)
where change = cc-tmax, m is the width or height of the embedded pixel block;
seventh step: the second step to the sixth step are circularly executed until all watermark bits are respectively embedded into the three color channels after the blocking, and finally, the red, green and blue color channels containing the watermark are recombined to obtain the watermark-containing image H * ；
The watermark extraction process is described as follows:
the first step: preprocessing watermark-containing image H * : will contain the watermark image H * The color channel H is divided into three color channels of red, green and blue i * Wherein i=1, 2,3, respectively representing three color channels of red, green, blue, each channel being divided into non-overlapping blocks of pixels of size m×m;
and a second step of: positioning a pixel block: in color channel H i * In using a key Kb-based key i A positioning matrix generated by a Hash pseudo-random scrambling algorithm of (2) determines a pixel block * ；
And a third step of: directly obtaining a direct current component tmax in the fast Fourier transform result in a space domain according to a formula (6) * The direct current component does not need to be obtained by real fast Fourier transform;
wherein p and q are pixel-in-pixel blocks * The position of the middle row and column, block (p, q) * Is a block of pixels * The pixel values of the p-th row and the q-th column in the pixel block are 1-p, q-m and m * Is the width or height of (a);
fourth step: extracting the jth watermark bit w using equation (7) j Wherein j is more than or equal to 1 and less than or equal to lenw;
wherein mod (-) is a remainder function and round (-) is a rounding function;
fifth step: circularly executing the second step to the fourth step to respectively obtain the binary string sequences SW in each channel i * Then SW is carried out i * Taking each 8-bit binary character string as a group of pixel values converted into decimal, wherein i=1, 2 and 3 respectively represent three color channels of red, green and blue;
sixth step: the decimal pixel value of each channel is respectively processed based on the key Ka i Is the inverse Arnold transformation of (A) at which time the watermark W for each channel is obtained i * Wherein i=1, 2,3, respectively represents three color channels of red, green, blue;
seventh step: reorganizing watermark W of each channel i * Obtaining 24-bit color QR code watermark image W * 。
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810916666.XA CN109102454B (en) | 2018-08-13 | 2018-08-13 | Color QR code digital blind watermarking method integrating fast Fourier transform |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810916666.XA CN109102454B (en) | 2018-08-13 | 2018-08-13 | Color QR code digital blind watermarking method integrating fast Fourier transform |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109102454A CN109102454A (en) | 2018-12-28 |
| CN109102454B true CN109102454B (en) | 2023-08-01 |
Family
ID=64849634
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810916666.XA Active CN109102454B (en) | 2018-08-13 | 2018-08-13 | Color QR code digital blind watermarking method integrating fast Fourier transform |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109102454B (en) |
Families Citing this family (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110599388B (en) * | 2019-08-26 | 2021-10-15 | 华中科技大学 | Blind robust digital watermark embedding and detecting method based on positioning point assistance |
| CN111242828B (en) * | 2020-01-16 | 2023-02-03 | 鲁东大学 | Spatial domain color digital image blind watermarking method fused with discrete Fourier transform |
| CN112488903B (en) * | 2021-01-04 | 2022-04-08 | 鲁东大学 | Spatial domain color digital image blind watermarking method fusing multilevel discrete Fourier transform |
| CN112508765B (en) * | 2021-01-18 | 2022-05-10 | 鲁东大学 | Frequency domain color digital image blind watermarking method based on Walsh-Hadamard transform |
| CN114189744B (en) * | 2021-11-03 | 2024-02-23 | 日立楼宇技术（广州）有限公司 | Multimedia playing method, system and device based on two-dimension code and display screen |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103077495A (en) * | 2013-02-01 | 2013-05-01 | 上海理工大学 | Digital holography watermarking algorithm based on QR (quick response) code |
| CN104408338A (en) * | 2014-10-31 | 2015-03-11 | 上海理工大学 | Three-dimension mesh model copyright verification method |
| CN105608661A (en) * | 2015-12-28 | 2016-05-25 | 辽宁师范大学 | Shear wave domain audio watermark embedding and detecting method based on robust QR decomposition |
| CN106023054A (en) * | 2016-05-16 | 2016-10-12 | 上海理工大学 | Low-false-alarm-rate color QR code digital watermarking method |
| 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 |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US10037587B2 (en) * | 2016-11-23 | 2018-07-31 | Macau University Of Science And Technology | Color image watermarking |
-
2018
- 2018-08-13 CN CN201810916666.XA patent/CN109102454B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103077495A (en) * | 2013-02-01 | 2013-05-01 | 上海理工大学 | Digital holography watermarking algorithm based on QR (quick response) code |
| CN104408338A (en) * | 2014-10-31 | 2015-03-11 | 上海理工大学 | Three-dimension mesh model copyright verification method |
| CN105608661A (en) * | 2015-12-28 | 2016-05-25 | 辽宁师范大学 | Shear wave domain audio watermark embedding and detecting method based on robust QR decomposition |
| CN106023054A (en) * | 2016-05-16 | 2016-10-12 | 上海理工大学 | Low-false-alarm-rate color QR code digital watermarking method |
| 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 (1)
| Title |
|---|
| 基于四元数的双彩色图像盲水印算法;姚涛;苏庆堂;阙大顺;;计算机工程;第39卷(第01期);第149-152页 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109102454A (en) | 2018-12-28 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109102454B (en) | Color QR code digital blind watermarking method integrating fast Fourier transform | |
| CN108648134B (en) | Spatial domain color digital image blind watermarking method fusing discrete wavelet transform | |
| CN109035129B (en) | Color digital image blind watermarking method based on two-dimensional discrete sine transformation | |
| 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 | |
| CN111199508B (en) | Spatial domain color digital image blind watermarking method fusing DCT and DHT | |
| CN104050622B (en) | The coloured image blind watermark method encoded based on ternary | |
| CN106204410A (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 | |
| CN108616757B (en) | Video watermark embedding and extracting method capable of extracting watermark after copying | |
| CN106991636B (en) | Airspace color image blind watermarking method fusing approximate Schur decomposition | |
| CN110570345B (en) | Blind watermarking method for airspace color digital image fused with discrete cosine transform | |
| CN105023236A (en) | Matrix LU decomposition-based double-color image blind watermarking method | |
| 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 | |
| CN116993567A (en) | Frequency domain blind watermarking method based on Hadamard transform and teaching optimization algorithm | |
| CN106169171B (en) | The good digital water mark method decomposed based on Hessenberg | |
| CN110415154B (en) | Haer transformation-based quaternary color digital image blind watermarking method | |
| CN115510404A (en) | Fusion domain blind watermarking method based on graph transformation and particle swarm optimization algorithm | |
| CN112488903B (en) | Spatial domain color digital image blind watermarking method fusing multilevel discrete Fourier transform | |
| CN111242828A (en) | Blind watermarking method of spatial domain color digital image fused with discrete Fourier transform | |
| CN113191932B (en) | Spatial domain color digital image blind watermarking method fusing discrete Chebyshev transformation | |
| CN113222803B (en) | Color digital image blind watermarking method based on pure quaternion Schur decomposition |
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: Yao Tao Inventor after: Wang Zengfeng Inventor after: Sheng Guorui Inventor after: Liu Decheng Inventor after: Yuan Zihan Inventor after: Su Lin Inventor after: Su Qingtang Inventor after: Wang Gang Inventor after: Zhang Xiaofeng Inventor after: Wang Yilei Inventor after: Sun Yujuan Inventor before: Su Qingtang Inventor before: Yao Tao Inventor before: Wang Zengfeng Inventor before: Sheng Guorui Inventor before: Liu Decheng Inventor before: Yuan Zihan Inventor before: Su Lin Inventor before: Wang Huanying Inventor before: Wang Gang Inventor before: Zhang Xiaofeng Inventor before: Wang Yilei Inventor before: Sun Yujuan |
|
| CB03 | Change of inventor or designer information | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |