CN111242828B - Spatial domain color digital image blind watermarking method fused with discrete Fourier transform - Google Patents
Spatial domain color digital image blind watermarking method fused with discrete Fourier transform Download PDFInfo
- Publication number
- CN111242828B CN111242828B CN202010044544.3A CN202010044544A CN111242828B CN 111242828 B CN111242828 B CN 111242828B CN 202010044544 A CN202010044544 A CN 202010044544A CN 111242828 B CN111242828 B CN 111242828B
- Authority
- CN
- China
- Prior art keywords
- watermark
- image
- blue
- green
- pixel
- 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
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/0051—Embedding of the watermark in the spatial domain
-
- 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/0083—Image watermarking whereby only watermarked image required at decoder, e.g. source-based, blind, oblivious
Abstract
The invention discloses a blind watermarking method of a spatial domain color digital image, which integrates the advantages of high operation speed of a spatial domain digital watermarking algorithm and high robustness of the spatial domain digital watermarking algorithm. According to the unique characteristic of discrete Fourier transform direct current components, the invention completes the embedding and blind extraction of the digital watermark in a space domain by utilizing the correlation principle between the direct current components of adjacent pixel blocks and adopting different quantization step lengths in different channels without carrying out real discrete Fourier transform. The invention embeds the color digital watermark image into the color carrier image, has stronger watermark robustness and higher algorithm real-time property on the premise of better watermark invisibility, solves the problems of low running speed and weak robustness of a large-capacity color image digital watermark algorithm, and is suitable for the occasion of quickly and efficiently carrying out digital media copyright protection.
Description
Technical Field
The invention belongs to the technical field of network space security, and relates to copyright protection of a color digital image as a digital watermark.
Background
With the rapid development of Internet and multimedia technology, it becomes possible to store and transmit digitalized information efficiently, however, when various digital products are transmitted over the Internet, a series of problems such as piracy, infringement and tampering are also generated. Therefore, the issue of digital copyright protection is receiving more and more attention from scholars at home and abroad. Digital watermarking technology has emerged as an effective digital product copyright protection and data security maintenance technology. The digital watermark technology can embed the digital watermark serving as the identification information into a digital carrier by using a certain embedding method, and the digital watermark is not easy to be perceived visually, so that the copyright protection is effectively carried out.
According to different processing modes of carrier images, a digital watermarking algorithm is divided into a spatial domain watermarking algorithm and a frequency domain watermarking algorithm, wherein the spatial domain watermarking algorithm has the advantages of simple calculation and high running speed, but the robustness is relatively poor, and the frequency domain watermarking algorithm has the advantages of strong robustness, but the running time of the algorithm is long, and the real-time performance is poor. Therefore, how to combine the advantages of the two, and on the premise of ensuring good invisibility of the digital watermark, designing a digital watermark algorithm with strong robustness and high real-time performance becomes a problem to be solved urgently at present.
Disclosure of Invention
The invention aims to provide a blind watermarking method of a spatial domain color digital image fused with discrete Fourier transform, which comprises two specific watermark embedding processes and watermark extracting processes, wherein the watermark embedding process is described as follows:
the first step is as follows: to a size ofM×MColor carrier image ofHPerforming dimensionality reduction to obtain three layered carrier images of red, green and blueH i And imaging each layered carrierH i Is divided intom×mOf non-overlapping pixel blocks ofi=1,2,3 respectively represent red, green, blue three layers;
the second step is that: to a width ofN×NColor watermark image ofWDimension reduction processing is carried out to obtain three layered watermark images of red, green and blue, and simultaneously, in order to improve the security of the watermark, each layered watermark image is carried out based on a secret keyKa i The Arnold transformation obtains three layered watermark images after scramblingW i (ii) a Watermarking layered imagesW i Each decimal pixel value in the decimal system is converted into 8-bit binary number and is connected into binary numbers with the length of 8 in sequenceN 2 Of the watermark bit sequenceSW i In whichi=1,2,3 respectively represent red, green, blue three layers;
the third step: sequentially selecting blocks from the layered carrier image according to the longitudinal block selection orderH i In selecting adjacent pixel blocksAAndBin whichi=1,2,3 represents red, green, blue trilayer respectively;
the fourth step: directly calculating pixel blocks in the spatial domain according to formula (1)AAndBdirect current component ofdf p ；
Wherein, the first and the second end of the pipe are connected with each other,p=1,2 denote pixel blocks, respectivelyAAndB，mis a block of pixelspThe size of the row (column) of (c),f p (x, y) Is a block of pixelspFirst, thexGo to the firstyPixel values of the columns;
the fifth step: sequentially from hierarchical watermark order to hierarchical watermark orderColumn(s)SW i In which the watermark bit to be embedded is selectedw(ii) a Selecting different quantization step lengths according to the similarity between the direct current components of the adjacent pixel blocks and the channel correlation in the RGB color spaceT i Embedding watermark information using equations (2) and (3)wObtaining a block of pixelspModified DC componentdf p * ，p=1,2 denote pixel blocks, respectivelyAAndB；
wherein, the first and the second end of the pipe are connected with each other,win order for the watermark bits to be embedded,avg=(df 1 +df 2 )/2，T i is a firstiThe quantization step size of a layer is,i=1,2,3 represents red, green, blue trilayer respectively;
and a sixth step: calculating the pixel block according to formula (4)pModified pixel valuef p * (x, y) And replacing the original pixel block with itpPixel value of corresponding position in the imagef p (x, y) Obtaining a pixel block containing the watermarkA * AndB * whereinp=1, 2；
The seventh step: block of pixels to be watermarkedA * AndB * respectively updated to its in-layer carrier imageH i In a corresponding position of (1), whereini=1,2,3 represents red, green, blue trilayer respectively;
eighth step: repeating the third to seventh steps of the process until all watermark information is embeddedThereby obtaining a layered carrier image containing a watermarkH i * In whichi=1,2,3 represents red, green, blue trilayer respectively;
the ninth step: combined three-layer watermark-containing layered carrier imageH i * Obtaining a color carrier image containing a watermarkH * In whichi=1,2,3 respectively represent red, green, blue three layers;
the watermark extraction process is described as follows:
the first step is as follows: aqueous print bearing image by dimension reductionH * Layered carrier image divided into red, green and blue watermarksH i * (ii) a At the same time, each watermark-containing layered carrier image is combinedH i * Is divided into sizes ofm×mOf non-overlapping pixel blocks ofi=1,2,3 respectively represent red, green, blue three layers;
the second step: sequentially separating the layered carrier image from the water containing print according to the longitudinal blocking orderH i * To select adjacent blocks of hydrous pixelsA * AndB * whereini=1,2,3 respectively represent red, green, blue three layers;
the third step: directly calculating the block of pixels containing watermark in the spatial domain according to the formula (5)A * AndB * direct current component ofdf p * ；
Wherein, the first and the second end of the pipe are connected with each other,p=1,2 denotes a block of water-containing print pixels, respectivelyA * AndB * ，mfor blocks of water-containing print pixelspThe size of the rows (columns) of (c),f p * (x, y) For blocks of water-containing print pixelspFirst, thexGo to the firstyPixel values of the columns;
the fourth step: according to block of watermark pixelsA * AndB * direct current component ofdf p * The magnitude relationship between the pixel blocks, from the water-containing print pixel block, using equation (6)A * AndB * extracting watermark bits from the imagew * Whereinp=1, 2；
The fifth step: repeating the second step to the fourth step of the process to obtain the extracted binary watermark sequenceSW i * Then, in turn, willSW i * Dividing each 8-bit binary information into a group and converting into decimal pixel value to finally form the extracted layered watermark image, whereini=1,2,3 represents red, green, blue trilayer respectively;
and a sixth step: key-based extraction of layered watermark imagesKa i Inverse Arnold transformation to obtain the extracted layered watermark imageW i * Whereini=1,2,3 respectively represent red, green, blue three layers;
the seventh step: combining extracted layered watermark imagesW i * Forming a final extracted watermark imageW * WhereiniAnd =1,2 and 3 respectively represent red, green and blue three layers.
The method does not need to carry out real discrete Fourier transform, directly obtains the direct current component of the discrete Fourier transform in a space domain, utilizes the correlation between the direct current components of adjacent pixel blocks, and adopts different quantization step sizes to complete the embedding and blind extraction of the color digital watermark in different channels; the method not only has better watermark invisibility, but also has stronger watermark robustness and higher algorithm instantaneity.
Drawings
Fig. 1 (a) and 1 (b) show two original color carrier images.
Fig. 2 (a) and 2 (b) show two original color watermark images.
Fig. 3 (a) and 3 (b) show watermark images obtained by embedding the watermark shown in fig. 2 (a) into carrier images such as fig. 1 (a) and 1 (b) in this order, wherein the structural similarity SSIM values are 0.9759 and 0.9728 in this order, and the peak signal-to-noise ratio PSNR values are 41.5249dB and 42.2817dB in this order.
Fig. 4 (a) and 4 (b) show watermarks extracted from fig. 3 (a) and 3 (b) in this order, and normalized cross-correlation coefficients NC of the watermarks are 1.0000 and 1.0000, respectively.
Fig. 5 (a), 5 (b), 5 (c), 5 (d), and 5 (e) show watermarks extracted after the watermark-containing image shown in fig. 3 (a) is subjected to attacks such as JPEG2000 compression (4.
Fig. 6 (a) and 6 (b) show watermark images obtained by embedding the watermark shown in fig. 2 (b) into the carrier images such as fig. 1 (a) and 1 (b) in sequence, wherein the structural similarity SSIM values are 0.9761 and 0.9712 in sequence, and the peak signal-to-noise ratio PSNR values are 41.4400dB and 41.8342dB in sequence.
Fig. 7 (a) and 7 (b) show watermarks extracted from fig. 6 (a) and 6 (b) in this order, and normalized cross-correlation coefficients NC of the watermarks are 1.0000 and 1.0000, respectively.
Fig. 8 (a), 8 (b), 8 (c), 8 (d), and 8 (e) show watermarks extracted after the watermark-containing image shown in fig. 6 (a) is subjected to attacks such as JPEG2000 compression (4).
Detailed Description
The invention aims to provide a blind watermarking method of a spatial domain color digital image fused with discrete Fourier transform, which comprises two specific watermark embedding processes and watermark extracting processes, wherein the watermark embedding process is described as follows:
the first step is as follows: for a color carrier image with the size of 512 multiplied by 512HAs a point of dimension reductionThen, three layered carrier images of red, green and blue are obtainedH i And imaging each layered carrierH i Divided into 2 x 2 non-overlapping blocks of pixels, whereini=1,2,3 respectively represent red, green, blue three layers;
the second step is that: for a color watermark image with the size of 32 multiplied by 32WDimension reduction processing is carried out to obtain three layered watermark images of red, green and blue, and simultaneously, in order to improve the security of the watermark, each layered watermark image is carried out based on a secret keyKa i The Arnold transformation obtains three layered watermark images after scramblingW i (ii) a Watermarking images in layersW i Each decimal pixel value in (a) is converted into an 8-bit binary number (e.g. a decimal number 225 may be converted into a binary sequence '11100001'), concatenated in turn into a watermark bit sequenceSW i ，SW i Is 8X 32 in length 2 =8192, whereini=1,2,3 respectively represent red, green, blue three layers;
the third step: sequentially from layered carrier images in longitudinal block selection orderH i In selecting adjacent pixel blocksAAndBin whichi=1,2,3 represents red, green, blue trilayer respectively; here, leti=1, pixel block selected from red layerAIs composed of
Selecting a block of pixelsBIs composed of
；
The fourth step: directly calculating pixel blocks in the spatial domain according to formula (1)AAndBdirect current component ofdf p ；
Wherein the content of the first and second substances,p=1,2 denote pixel blocks, respectivelyAAndB，mis a block of pixelspThe size of the rows (columns) of (c),f p (x, y) Is a block of pixelspFirst, thexGo to the firstyPixel values of the columns; at this time, the size of the row (column) of the pixel blockm=2, pixel block obtained by calculationADirect current component ofdf 1 =897.0000, pixel blockBDirect current component ofdf 2 =897.0000；
The fifth step: from hierarchical watermark sequences in order of precedenceSW i In which the watermark bit to be embedded is selectedw(ii) a Selecting different quantization step lengths according to the similarity between the direct current components of the adjacent pixel blocks and the channel correlation in the RGB color spaceT i Embedding watermark information using equations (2) and (3)wObtaining a block of pixelspModified DC componentdf p * ，p=1,2 denote pixel blocks, respectivelyAAndB；
wherein the content of the first and second substances,win order for the watermark bits to be embedded,avg=(df 1 +df 2 )/2，T i is as followsiThe quantization step size of a layer is,i=1,2,3 respectively represent red, green, blue three layers; at this time, the process of the present invention,i=1 from watermark sequenceSW 1 In the selected watermark bit to be embeddedw=‘0’，T 1 =20.2800，avgIf =897.0000, the pixel block after modification is obtained according to equations (2) and (3)A * Direct current component ofdf 1 * =897.0000, pixel blockB * Direct current component ofdf 2 * =897.0000；
And a sixth step: calculating the pixel block according to formula (4)pModified pixel valuesf p * (x, y) And replacing the original pixel block with the samepPixel value of corresponding position in the imagef p (x, y) Obtaining a pixel block containing the watermarkA * AndB * whereinp=1, 2；
At this time, the resultant water-containing print pixel blockA * Is composed of
Containing blocks of watermark pixelsB * Is composed of
；
The seventh step: block of pixels containing watermarkA * AndB * respectively updated to its in-layer carrier imageH i In a corresponding position in (b), whereini=1,2,3 represents red, green, blue trilayer respectively; at this time, the process of the present invention,i=1, block of hydrous pixelsA * AndB * are updated to their respective layered carrier imagesH 1 The respective position in (a);
eighth step: repeating the third to seventh steps until all watermark information is embedded, thereby obtaining a layered carrier image containing watermarkH i * In whichi=1,2,3 respectively represent red, green, blue three layers;
the ninth step: combined three-layer layered carrier image containing watermarkH i * Obtaining a color carrier image containing a watermarkH * Whereini=1,2,3 represents red, green, blue trilayer respectively;
the watermark extraction process is described as follows:
the first step is as follows: aqueous print bearing image by dimension reductionH * Layered carrier image divided into red, green and blue watermarksH i * (ii) a Simultaneously, each watermark-containing layered carrier image is subjected toH i * Divided into non-overlapping blocks of pixels of size 2 x 2, whereini=1,2,3 respectively represent red, green, blue three layers;
the second step is that: sequentially separating the layered carrier image from the water containing print according to the longitudinal blocking orderH i * To select adjacent blocks of hydrous print pixelsA * AndB * in whichi=1,2,3 represents red, green, blue trilayer respectively; at this time, leti=1 aqueous printed pixel block selected from red layerA * Is composed of
Blocks of pixels containing watermarksB * Is composed of
；
The third step: according to the formula (5), directly calculating the block of pixels containing the watermark in the space domainA * AndB * direct current component ofdf p * ；
Wherein the content of the first and second substances,p=1,2 denotes a block of water-containing print pixels, respectivelyA * AndB * ，mfor blocks of water-containing print pixelspThe size of the rows (columns) of (c),f p * (x, y) For blocks of pixels containing watermarkpFirst, thexGo to the firstyPixel values of the columns; at this time, the size of the row (column) of the block of water-marked pixelsm=2, calculated block of hydrous pixelsA * Direct current component ofdf 1 * =897.0000, block of hydrous pixelsB * Direct current component ofdf 2 * =897.0000；
The fourth step: according to block of watermark pixelsA * AndB * direct current component ofdf p * The magnitude relationship between the pixel blocks, from the water-containing print pixel block, using equation (6)A * AndB * extracting watermark bits from the imagew * Whereinp=1, 2；
At this time, the process of the present invention,df 1 * =df 2 * then according to equation (6), the extracted watermark bit is obtainedw * =‘0’；
The fifth step: repeating the second step to the fourth step of the process to obtain the extracted binary watermark sequenceSW i * Then, in turn, willSW i * Dividing each 8-bit binary information into a group and converting into decimal pixel value to finally form the extracted layered watermark image, whereini=1,2,3 respectively represent red, green, blue three layers;
and a sixth step: key-based extraction of layered watermark imagesKa i Inverse Arnold transformation to obtain the extracted layered watermark imageW i * Whereini=1,2,3 respectively represent red, green, blue three layers;
the seventh step: combining extracted layered watermark imagesW i * Forming a final extracted watermark imageW * WhereiniAnd =1,2 and 3 respectively represent red, green and blue three layers.
The method not only has better watermark invisibility, but also has stronger watermark robustness and higher algorithm real-time property, and is suitable for copyright protection of the color digital image as the watermark.
Validation of the invention
In order to prove the effectiveness of the invention, two 24-bit standard color images with the size of 512 × 512 as shown in fig. 1 (a) and 1 (b) are selected as carrier images, and two 24-bit color images with the size of 32 × 32 as shown in fig. 2 (a) and 2 (b) are respectively used as digital watermarks for verification.
Fig. 3 (a) and 3 (b) are watermark-containing images obtained by embedding the watermark shown in fig. 2 (a) into the carrier images (fig. 1 (a) and 1 (b) in sequence, wherein the structural similarity SSIM values are 0.9759 and 0.9728 in sequence, and the peak signal-to-noise ratio PSNR values are 41.5249dB and 42.2817dB in sequence; fig. 4 (a) and 4 (b) show watermarks extracted from fig. 3 (a) and 3 (b) in sequence, and normalized cross-correlation coefficients NC of the watermarks are 1.0000 and 1.0000, respectively; fig. 5 (a), 5 (b), 5 (c), 5 (d), and 5 (e) show watermarks extracted after the watermark-containing image shown in fig. 3 (a) is subjected to attacks such as JPEG2000 compression (4.
Fig. 6 (a) and fig. 6 (b) are watermark-containing images obtained by embedding the watermark shown in fig. 2 (b) into the carrier images (1 (a) and fig. 1 (b) in sequence, wherein the structural similarity SSIM values are 0.9761 and 0.9712 in sequence, and the peak signal-to-noise ratio PSNR values are 41.4400dB and 41.8342dB in sequence; fig. 7 (a) and 7 (b) show watermarks extracted from fig. 6 (a) and 6 (b) in sequence, and normalized cross-correlation coefficients NC of the watermarks are 1.0000 and 1.0000, respectively; fig. 8 (a), 8 (b), 8 (c), 8 (d), and 8 (e) are watermarks extracted after the watermark image shown in fig. 6 (a) is subjected to attacks such as JPEG2000 compression (4), JPEG compression (70), salt and pepper noise (0.2%), median filtering (3 × 3), and scaling (4).
The algorithm is operated on platforms 1.60GHZ CPU,8.00GB RAM, win10, MATLAB (R2017 a) for nearly ten thousand times, the average embedding time of the digital watermark is 0.444945 seconds, the average extraction time is 0.199158 seconds, and the total time is 0.644103 seconds.
In conclusion, the embedded digital image watermark has higher invisibility, and the invisibility requirement of the watermark algorithm is met; meanwhile, digital image watermarks extracted from various attacked images have good identifiability and high NC values, which shows that the method has strong robustness; in addition, the average running total time of the algorithm is less than 1 second, and the requirement of the multimedia big data on quick copyright protection is met.
Claims (1)
1. A blind watermark method of a spatial domain color digital image fused with discrete Fourier transform comprises two specific processes of watermark embedding and watermark extraction, wherein the watermark embedding process is described as follows:
the first step is as follows: performing dimension reduction processing on a color carrier image H with the pixel size of M multiplied by M to obtain three layered carrier images H of red, green and blue i And laminating each of the carrier images H i Dividing into non-overlapping blocks of pixels of size m × m, where i =1,2,3 represents three layers of red, green and blue, respectively;
the second step is that: performing dimension reduction processing on a color watermark image W with the pixel size of NxN to obtain three layered watermark images of red, green and blue, and simultaneously performing key Ka-based processing on each layered watermark image in order to improve the security of the watermark i The Arnold transformation obtains three layered watermark images W after scrambling i (ii) a Watermark image W in layers i Each decimal pixel value in the decimal system is converted into 8-bit binary number and is connected into binary numbers with the length of 8N in sequence 2 Of the watermark bit sequence SW i Wherein i =1,2,3 represents three layers of red, green and blue, respectively;
the third step: sequentially from the layered carrier image H in the order of longitudinal blocking i Wherein i =1,2,3 represents three layers of red, green and blue, respectively;
the fourth step: according to the formula (1), the direct current component df of the pixel blocks A and B is directly calculated in the space domain p ；
Where p =1,2 denotes pixel blocks a and B, respectively, m is the pixel size of the row (column) of the pixel block p, f p (x, y) is the pixel value of the xth row and the yth column of the pixel block pth;
the fifth step: from the hierarchical watermark sequence SW in order of precedence i Selecting a watermark bit w to be embedded; selecting different quantization step lengths T according to the similarity between the direct current components of the adjacent pixel blocks and the channel correlation in the RGB color space i Embedding watermark information w to obtain the modified DC component df of the pixel block p by using the formulas (2) and (3) p * P =1,2 denotes pixel blocks a and B, respectively;
w is the watermark bit to be embedded, avg = (df) 1 +df 2 )/2，T i I =1,2,3 represents three layers of red, green and blue, respectively, for the quantization step size of the ith layer;
and a sixth step: calculating the modified pixel value f of the pixel block p according to the formula (4) p * (x, y) and replaces the pixel value f of the corresponding position in the original pixel block p with it p (x, y) to obtain a pixel block A containing the watermark * And B * Wherein p =1,2;
the seventh step: printing the water-containing pixel block A * And B * Respectively updated to its layered carrier image H i Wherein i =1,2,3 represents three layers of red, green and blue, respectively;
eighth step: the third to seventh steps of the present process are repeatedly performedUntil all watermark information is embedded, thereby obtaining a layered carrier image H containing the watermark i * Wherein i =1,2,3 represents three layers of red, green and blue, respectively;
the ninth step: combined three-layer watermark-containing layered carrier image H i * Obtaining a color carrier image H containing a watermark * Wherein i =1,2,3 represents three layers of red, green and blue, respectively;
the watermark extraction process is described as follows:
the first step is as follows: watermark-bearing carrier image H by dimension reduction * Layered carrier image H divided into red, green and blue watermarks i * (ii) a At the same time, each watermark-containing layered carrier image H is subjected to i * Dividing into non-overlapping pixel blocks with the pixel size of m × m, wherein i =1,2,3 respectively represents three layers of red, green and blue;
the second step is that: sequentially separating the layered carrier image H from the water containing print according to the longitudinal block selection order i * To select adjacent water-containing print pixel blocks a * And B * Wherein i =1,2,3 represents three layers of red, green and blue, respectively;
the third step: according to the formula (5), the block A containing the watermark pixels is directly calculated in the space domain * And B * D.c. component of (1) p * ；
Wherein p =1,2 respectively represents the water-containing print pixel block a * And B * M is the pixel size of the row (column) containing the block p of watermark pixels, f p * (x, y) is the pixel value of the x-th row and y-th column of the block of hydrous pixels;
the fourth step: according to the block A of watermark-containing pixels * And B * D.c. component df of p * The magnitude relationship between the pixel blocks A, B, C, and C, from the water-containing print pixel block A using equation (6) * And B * Extracting watermark bit w * Wherein p =1,2;
the fifth step: repeatedly executing the second step to the fourth step of the process to obtain the extracted binary watermark sequence SW i * Then, SW is sequentially turned on i * Dividing each 8-bit binary information into a group and converting the group into decimal pixel values to finally form an extracted layered watermark image, wherein i =1,2,3 respectively represents three layers of red, green and blue;
and a sixth step: key Ka-based processing is carried out on extracted layered watermark image i Inverse Arnold transformation to obtain the extracted layered watermark image W i * Wherein i =1,2,3 represents three layers of red, green and blue, respectively;
the seventh step: combined extracted layered watermark image W i * Forming a final extracted watermark image W * Wherein i =1,2,3 represents three layers of red, green and blue, respectively.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010044544.3A CN111242828B (en) | 2020-01-16 | 2020-01-16 | Spatial domain color digital image blind watermarking method fused with discrete Fourier transform |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010044544.3A CN111242828B (en) | 2020-01-16 | 2020-01-16 | Spatial domain color digital image blind watermarking method fused with discrete Fourier transform |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111242828A CN111242828A (en) | 2020-06-05 |
| CN111242828B true CN111242828B (en) | 2023-02-03 |
Family
ID=70865743
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010044544.3A Active CN111242828B (en) | 2020-01-16 | 2020-01-16 | Spatial domain color digital image blind watermarking method fused with discrete Fourier transform |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111242828B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112488903B (en) * | 2021-01-04 | 2022-04-08 | 鲁东大学 | Spatial domain color digital image blind watermarking method fusing multilevel discrete Fourier transform |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104123694A (en) * | 2014-07-14 | 2014-10-29 | 苏州工业职业技术学院 | Fractional Fourier transform based image blind watermark embedding and extraction method |
| CN108416727A (en) * | 2018-04-04 | 2018-08-17 | 宁波大学 | A kind of coloured image total blindness's robust digital watermark method based on self-embedding technology |
| CN109102454A (en) * | 2018-08-13 | 2018-12-28 | 鲁东大学 | A kind of colored QR code digital blind watermark method merging Fast Fourier Transform (FFT) |
| CN110570345A (en) * | 2019-09-20 | 2019-12-13 | 鲁东大学 | Blind watermarking method of spatial domain color digital image fused with discrete cosine transform |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8271336B2 (en) * | 1999-11-22 | 2012-09-18 | Accenture Global Services Gmbh | Increased visibility during order management in a network-based supply chain environment |
-
2020
- 2020-01-16 CN CN202010044544.3A patent/CN111242828B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104123694A (en) * | 2014-07-14 | 2014-10-29 | 苏州工业职业技术学院 | Fractional Fourier transform based image blind watermark embedding and extraction method |
| CN108416727A (en) * | 2018-04-04 | 2018-08-17 | 宁波大学 | A kind of coloured image total blindness's robust digital watermark method based on self-embedding technology |
| CN109102454A (en) * | 2018-08-13 | 2018-12-28 | 鲁东大学 | A kind of colored QR code digital blind watermark method merging Fast Fourier Transform (FFT) |
| CN110570345A (en) * | 2019-09-20 | 2019-12-13 | 鲁东大学 | Blind watermarking method of spatial domain color digital image fused with discrete cosine transform |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111242828A (en) | 2020-06-05 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| 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 | |
| CN111199508B (en) | Spatial domain color digital image blind watermarking method fusing DCT and DHT | |
| CN110349073B (en) | Four-system color digital image blind watermarking method based on Schur decomposition | |
| CN107274333B (en) | Spatial domain color image blind watermarking method fusing singular value decomposition | |
| CN109102454B (en) | Color QR code digital blind watermarking method integrating fast Fourier transform | |
| CN112488904B (en) | Matrix singular value decomposition-based quaternion color digital image blind watermarking method | |
| CN110570345B (en) | Blind watermarking method for airspace color digital image fused with discrete cosine transform | |
| CN112508765B (en) | Frequency domain color digital image blind watermarking method based on Walsh-Hadamard transform | |
| CN111242828B (en) | Spatial domain color digital image blind watermarking method fused with discrete Fourier transform | |
| CN106991636B (en) | Airspace color image blind watermarking method fusing approximate Schur decomposition | |
| CN109829846B (en) | Digital image blind watermarking method based on two-dimensional discrete cosine transform | |
| CN110415155B (en) | Blind watermarking method for airspace color image fused with haar transformation | |
| Rajab et al. | Hybrid DWT-SVD video watermarking | |
| CN110415154B (en) | Haer transformation-based quaternary color digital image blind watermarking method | |
| 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 | |
| CN106169171A (en) | The good digital water mark method decomposed based on Hessenberg | |
| Tomar et al. | A statistical comparison of digital image watermarking techniques | |
| CN113191933B (en) | Color digital image blind watermarking method based on approximate Hadamard transform | |
| CN112017098B (en) | Self-adaptive color digital image blind watermarking method | |
| CN114862649A (en) | Spatial domain color digital image blind watermarking method fusing LU decomposition | |
| 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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |