CN108242041A - A kind of non-blind watermark implementing method of random order based on chaos - Google Patents
A kind of non-blind watermark implementing method of random order based on chaos Download PDFInfo
- Publication number
- CN108242041A CN108242041A CN201611214181.3A CN201611214181A CN108242041A CN 108242041 A CN108242041 A CN 108242041A CN 201611214181 A CN201611214181 A CN 201611214181A CN 108242041 A CN108242041 A CN 108242041A
- Authority
- CN
- China
- Prior art keywords
- value
- carrier image
- watermark
- channels
- embedded
- 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.)
- Pending
Links
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
-
- 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/0061—Embedding of the watermark in each block of the image, e.g. segmented watermarking
-
- 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
Landscapes
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Editing Of Facsimile Originals (AREA)
- Image Processing (AREA)
Abstract
A kind of non-blind watermark implementing method of entitled random order based on chaos of patent of the present invention, involved technical field are the technical fields such as image procossing, computer application, information security.Patent of the present invention calculates the embedded location of different pixels position to be embedded in watermark information in carrier image by chaos system.When embedded, watermark information is subjected to XOR operation with the place value on corresponding position in carrier image (coordinate of pixel is identical) on the specific bit position of binary pixel values, operation result is embedded on the bit that operation is participated in carrier image；In extraction, the value on the specific bit position identical with binary pixel values on initial carrier image corresponding position of carrier image containing watermark is extracted respectively, and the two is subjected to XOR operation, to extract original watermark information.Patent of the present invention can be widely used in the fields such as Information hiding, copyright protection.
Description
Technical field
Patent of the present invention is related to the technical fields such as image procossing, computer application, information security.
Background technology
This system generates random sequence using chaos system.It is Logi st ic chaos system by widely used chaos system
System, its improved form are：
The system is extremely sensitive to initial value, and initial value is slightly different, just will appear entirely different result.According to chaos
The characteristic of system can generate a pseudo-random sequence, which is carried out processing can generate a sequence between [0,7]
Row.
For example, setting the initial value of a chaos system as 0.98, then an one-dimensional chaos sequence, the chaos can be obtained
Preceding 16 values of ordered series of numbers a are as shown in table 1.
1 ordered series of numbers a of table
According to the formula of chaos sequence, the sequence can iteration continues always, generates any number of numerical value.
Obtained one-dimensional chaos sequence is subjected to transposition, you can obtain and the equal-sized two-dimensional matrix of carrier image.Example
Such as：The size of some carrier image is 4*4 (long and wide be 4 pixel sizes), then can be by 16 members in above-mentioned sequence
Element is converted to be arranged with 4 rows 4 of carrier image same size, i.e. the matrix form of 4*4.For the convenience handled, by above-mentioned square
Battle array is labeled as OI, and specific value is as shown in table 2.
2 matrix OI of table
| 0.98 | -0.9208 | -0.69575 | 0.031877 |
| 0.997968 | -0.99188 | -0.96765 | -0.87269 |
| -0.52316 | 0.452599 | 0.590308 | 0.303073 |
| 0.816293 | -0.33267 | 0.778662 | -0.21263 |
If necessary to which above-mentioned array is converted to embedded location, the formula that can be used is：
resultt=mod (a (t) * 1000000,8)
In formula, resultt∈ [0.7], mod () are modulo operations.According to above-mentioned operation, embedded location square can be obtained
Battle array CS is as shown in table 3.
3 embedded location Matrix C S of table
When carrier image is embedded in watermark information, the embedded location of each pixel is determined all in accordance with the value of location matrix CS
It is fixed.Such as：
● location of pixels is the pixel (serial number refers to the element in the upper left corner since 1 here) of (1,1) in carrier image,
The value of corresponding embedded location Matrix C S is " 0 ", therefore, 0th ratio of the watermark embedded location for current pixel binary value
Special position (the 0th)；
● location of pixels is the pixel of (1,3) in carrier image, and the value of corresponding embedded location Matrix C S is " 7 ", because
This, watermark embedded location is the 7th of current pixel binary value；
● location of pixels is the pixel of (2,2) in carrier image, and the value of corresponding embedded location Matrix C S is " 1 ", because
This, watermark embedded location is the 1st of current pixel binary value；
● location of pixels is the pixel of (3,2) in carrier image, and the value of corresponding embedded location Matrix C S is " 7 ", because
This, watermark embedded location is the 7th of current pixel binary value.
It needs to ensure embedded location using same location matrix and carry in the telescopiny and extraction process of watermark
Fetch bit, which is put, to be consistent, to guarantee correctly to extract watermark information.
Therefore, initial value 0.98 is key information, if all made in telescopiny and extraction watermarking process using the value
To generate the initial value of location matrix, then they have identical location matrix, it can be ensured that embedded watermark and extraction watermark institute
The bit in respective pixel used is identical.If telescopiny and extraction process can be produced using different keys
Raw different location matrix, extraction process can extract watermark information on the position different from embedded location, therefore also cannot
Enough extract correct watermark information.
Invention content
In non-blind watermatking, random order watermark refers to the operation of embedded watermark selected participation operation on each pixel
The position of binary digit is that unfixed, each embedded location is all determined by the respective value of location matrix.When embedded, needle
To each pixel of carrier image, all in the 0th to the 7th of its binary value, (bit, serial number are since 0, i.e., minimum to have
Imitate position be the 0th, most significant bit is the 7th) on randomly select one, by the different bits chosen in all pixels
Place value forms a bit plane, and the bit plane and watermark information are carried out XOR operation, its former ratio is replaced with the result of calculation
Place value on special position is completed with forming carrier image with watermarked information before operation result is embedded into initial carrier image
It states on the bit randomly selected.Therefore, it is necessary to use location matrix of the value generated at random between [0,7] to determine
The specific of each pixel participates in bit information.Location matrix used in telescopiny and extraction process is by chaos system
To generate.
1 telescopiny
When the non-blind watermatking of random order is embedded in, the binary digit that embedded watermark operation is participated in each pixel is according to chaos
What the location matrix that system is generated determined, be unfixed.
Here, only phase can be embedded in multiple channels in practical operation for R channels are embedded in binary watermarking information
Same or different watermark information.
Telescopiny is：
(1) embedded location matrix is generated using chaos system.
According to the knowledge introduced in " background technology " trifle, an embedded location matrix, example are built using chaos system
Such as：
(2) bit plane determined in carrier image by location matrix is determined
First, initial carrier image is subjected to channel decomposition, is divided into R channels, G channels, channel B.Then, made with R channels
For embedded channel, determine specifically to be embedded in the bit of watermark in the binary value of wherein each pixel.It finally, will be in each pixel
Be embedded in watermark information bit extract form a bit plane it is spare.
For example, there is carrier image O, channel decomposition is carried out, is divided into R channels rgb [0], G channels rgb [1], channel B
rgb[2].The pixel value of its R channel rgb [0] is：
| 209 | 197 | 163 | 193 |
| 125 | 247 | 160 | 112 |
| 161 | 137 | 243 | 203 |
| 39 | 82 | 154 | 127 |
The value of the corresponding binary form rgbb of above-mentioned rgb [0] is：
| 11010001 | 11000101 | 10100011 | 11000001 |
| 01111101 | 11110111 | 10100000 | 01110000 |
| 10100001 | 10001001 | 11110011 | 11001011 |
| 00100111 | 01010010 | 10011010 | 01111111 |
According to location information Matrix C S, then embedded bit information is needed as shown in underscore：
| 11010001 | 11000101 | 10100011 | 11000001 |
| 01111101 | 11110111 | 10100000 | 01110000 |
| 10100001 | 10001001 | 11110011 | 11001011 |
| 00100111 | 01010010 | 10011010 | 01111111 |
The place value of designated bit position is extracted, forming new bit plane BI is：
| 1 | 1 | 1 | 0 |
| 1 | 1 | 0 | 0 |
| 0 | 1 | 1 | 1 |
| 1 | 0 | 0 | 1 |
(3) watermarking images are handled
Threshold process is carried out to watermarking images, is binary value watermarking images by binary bitmap processing, adjusts its picture
Form of the element value for binary value 0 and 1.
For example, there is the binary bitmap WT to be：
| 255 | 0 | 255 | 0 |
| 255 | 255 | 0 | 255 |
| 0 | 0 | 0 | 0 |
| 255 | 255 | 0 | 255 |
Its corresponding binary value image WB is：
| 1 | 0 | 1 | 0 |
| 1 | 1 | 0 | 1 |
| 0 | 0 | 0 | 0 |
| 1 | 1 | 0 | 1 |
(4) embedded watermark information
Exclusive or fortune is carried out as the bit plane specified by location matrix and watermarking images by what is extracted from initial carrier image
It calculates, XOR operation result is embedded into initial carrier image.
For example, by the bit plane BI extracted out of initial carrier image O R channels and binary value watermarking images WB
XOR operation is carried out, obtains matrix R, as " embedded watermark information ", value is：
| 0 | 1 | 0 | 0 |
| 0 | 0 | 0 | 1 |
| 0 | 1 | 1 | 1 |
| 0 | 1 | 0 | 0 |
The binary digit as specified by location information Matrix C S in pixel each in initial carrier image is replaced with into " embedded water
Corresponding value in official seal breath " matrix R, that is, complete the insertion of watermark information, obtain being embedded in the R channels of watermark information, as contain
The R channels of watermark carrier image EW.EWO is marked as, then the information of the R channels EWO of the EW of carrier image containing watermark is：
| 11010000 | 11000101 | 00100011 | 11000001 |
| 01111100 | 11110101 | 10100000 | 01110010 |
| 10100001 | 10001001 | 11110011 | 11001011 |
| 00000111 | 01010110 | 10011010 | 01101111 |
Decimal value EWOD corresponding to image EWO is：
| 208 | 197 | 35 | 193 |
| 124 | 245 | 160 | 114 |
| 161 | 137 | 243 | 203 |
| 7 | 86 | 154 | 111 |
It can be seen that after being embedded in watermark information in the random bit position of carrier image, the value of carrier image can change,
The size of value variation depends on the specific bit replaced.When the value that pixel is replaced is in higher in its binary coding
Position when, pixel value variation it is relatively large；When the value that pixel is replaced is in relatively low in its binary coding
Position when, pixel value variation unobvious.Therefore, algorithm can be further improved, allow pixel value its low level (such as
0th to the 3rd) between carry out random replacement, to make embedded watermark information smaller to initial carrier image contributions, so as to allow
Watermark has certain concealment.
(4) image channel combines.
The channel of watermark information and other combination of channels of initial carrier image will be embedded in into the carrier image containing watermark
Coloured image.
For example, the R channel EWOD that watermark information will be embedded in, with the G channels extracted out of initial carrier image O
Rgb [1], channel B rgb [2] are combined into the EW of RGB color image containing watermark.
So far, watermark telescopiny is completed.
2 extraction process
Extraction process is the inverse process of telescopiny, and matrix is extracted according to determined by chaos system and is carried respectively from containing watermark
In body image and the specific bit position of each pixel of extraction is formed in initial carrier image bit plan, and by the two positions
Plan view carries out XOR operation, and result of calculation is " identification watermark information ".
Extraction process the specific steps are：
(1) structure extraction location matrix
Utilize chaos system and its initial value structure extraction location matrix.
For example, using telescopiny when uses to obtain chaos system and the structure extraction location matrix CS of initial value 0.98,
It is worth and is：
| 0 | 0 | 7 | 5 |
| 0 | 1 | 0 | 1 |
| 4 | 7 | 4 | 1 |
| 5 | 2 | 6 | 4 |
【Pay attention to】
Here initial value 0.98 is key information, which must be identical with the initial value used in telescopiny, no
Different extraction location matrixs can be then obtained, can cannot be extracted from the bit extraction watermark different from embedded location
Go out correct watermark information.
(2) from initial carrier image zooming-out as the bit plane specified by location matrix
First, initial carrier image is subjected to channel decomposition, is divided into R channels, G channels, channel B.Then, R channels are extracted
In as the bit plane specified by extraction location matrix.
For example, the pixel value for having the R channels rgb [0] of carrier image O is：
| 209 | 197 | 163 | 193 |
| 125 | 247 | 160 | 112 |
| 161 | 137 | 243 | 203 |
| 39 | 82 | 154 | 127 |
Its corresponding binary value is：
| 11010001 | 11000101 | 10100011 | 11000001 |
| 01111101 | 11110111 | 10100000 | 01110000 |
| 10100001 | 10001001 | 11110011 | 11001011 |
| 00100111 | 01010010 | 10011010 | 01111111 |
According to bit information determined by extraction location matrix CS as shown in underscore：
| 11010001 | 11000101 | 10100011 | 11000001 |
| 01111101 | 11110111 | 10100000 | 01110000 |
| 10100001 | 10001001 | 11110011 | 11001011 |
| 00100111 | 01010010 | 10011010 | 01111111 |
Place value on above-mentioned designated bit position is extracted, then the bit plane OBI extracted from initial carrier image is：
| 1 | 1 | 1 | 0 |
| 1 | 1 | 0 | 0 |
| 0 | 1 | 1 | 1 |
| 1 | 0 | 0 | 1 |
(3) it is extracted from carrier image containing watermark as the bit plane specified by location matrix
First, watermark carrier image will be contained and carry out channel decomposition, be divided into R channels, G channels, channel B.Then, extraction R leads to
As the bit plane specified by location matrix in road.
For example, there is the WE of carrier image containing watermark, channel decomposition is carried out, is divided into R channels rgb2 [0], G channels rgb2
[1], channel B rgb2 [2].It decomposites the R channels rgb2 [0] come：
| 208 | 197 | 35 | 193 |
| 124 | 245 | 160 | 114 |
| 161 | 137 | 243 | 203 |
| 7 | 86 | 154 | 111 |
The binary value of the R channels rgb2 of carrier image containing watermark [0] is：
| 11010000 | 11000101 | 00100011 | 11000001 |
| 01111100 | 11110101 | 10100000 | 01110010 |
| 10100001 | 10001001 | 11110011 | 11001011 |
| 00000111 | 01010110 | 10011010 | 01101111 |
According to bit determined by location matrix CS as shown in underscore：
| 11010000 | 11000101 | 00100011 | 11000001 |
| 01111100 | 11110101 | 10100000 | 01110010 |
| 10100001 | 10001001 | 11110011 | 11001011 |
| 00000111 | 01010110 | 10011010 | 01101111 |
Place value on above-mentioned designated bit position is extracted, then fromContainThe bit plane WOBI that watermark carrier image is extracted
For：
| 0 | 1 | 0 | 0 |
| 0 | 0 | 0 | 1 |
| 0 | 1 | 1 | 1 |
| 0 | 1 | 0 | 0 |
(4) watermark is extracted
Exclusive or will be carried out from the bit plane of initial carrier image zooming-out with the bit plane extracted from carrier image containing watermark
Operation obtains " identification watermark information " image.
For example, by the bit plane WOBI extracted from carrier image containing watermark with being put down from the position that initial carrier image is extracted
Face OBI carries out XOR operation, and the binary picture W for obtaining " identification watermark information " is：
| 1 | 0 | 1 | 0 |
| 1 | 1 | 0 | 1 |
| 0 | 0 | 0 | 0 |
| 1 | 1 | 0 | 1 |
Binary watermark is subjected to threshold process, by therein 1 processing for 255 in order to showing.It is obtained after processing
Its corresponding binary bitmap OW is：
Extraction watermarking process finishes.
Description of the drawings
Attached drawing 1 is telescopiny.
Attached drawing 2 is extraction process.
Specific embodiment
The non-blind watermatking of random order carries out operation in each pixel in the carrier, the position of embedded watermark is unfixed.Its
Specific implementation step is divided into telescopiny and extraction process.
For the convenience on understanding, watermark here is only embedded only in the R channels of carrier image.In actual treatment,
It can embed watermark data into multiple channels, the method for watermark and the method phase being embedded in R channels are embedded in other channels
Together.
1 telescopiny
Telescopiny is embedded into carrier image again after original watermark information and carrier image are carried out operation.
(1) initial carrier image procossing
Initial carrier image is read in, image size is obtained, is carried out channel decomposition, be divided into R channels, G channels, channel B.
For example, having initial carrier image O, size 4*4 to be carried out channel decomposition, it is divided into R channels rgb [0], G leads to
Road rgb [1], channel B rgb [2].The R channels rgb [0] extracted is：
| 209 | 197 | 163 | 193 |
| 125 | 247 | 160 | 112 |
| 161 | 137 | 243 | 203 |
| 39 | 82 | 154 | 127 |
Its corresponding binary value BR is：
| 11010001 | 11000101 | 10100011 | 11000001 |
| 01111101 | 11110111 | 10100000 | 01110000 |
| 10100001 | 10001001 | 11110011 | 11001011 |
| 00100111 | 01010010 | 10011010 | 01111111 |
(2) watermarking images are handled
Binary bitmap is read, carrying out threshold process to binary bitmap obtains binary watermark.
For example, there is the binary bitmap WO to be：
| 255 | 255 | 255 | 255 |
| 255 | 255 | 255 | 255 |
| 255 | 0 | 255 | 0 |
| 0 | 0 | 255 | 255 |
It is 1 by the pixel processing that binary bitmap WO intermediate values are 255, then it is corresponding obtains binary bitmap WO
Binary watermark W is：
| 1 | 1 | 1 | 1 |
| 1 | 1 | 1 | 1 |
| 1 | 0 | 1 | 0 |
| 0 | 0 | 1 | 1 |
(3) work location is determined
In random order blind watermatking, need to randomly select a bit from the binary value of each pixel, by this
The place value of bit carries out exclusive or calculating, and result of calculation is embedded on selected bit with watermark, i.e., with operation knot
Fruit replaces original place value on the bit.Patent of the present invention determines that embedded specific bit location is believed according to chaos system
Breath.
For example, as it is known that the initial value of chaos system is 0.98, then can generate embedding with the sizes such as initial carrier image 4*4
Entering location matrix CS is：
| 0 | 0 | 7 | 5 |
| 0 | 1 | 0 | 1 |
| 4 | 7 | 4 | 1 |
| 5 | 2 | 6 | 4 |
The location matrix CS established during according to chaos system initial value by 0.98 is determined in initial carrier bianry image BR
Interior each pixel specifically participates in the bit location of operation, then the bit information such as underscore that operation is participated in BR is shown：
| 11010001 | 11000101 | 10100011 | 11000001 |
| 01111101 | 11110111 | 10100000 | 01110000 |
| 10100001 | 10001001 | 11110011 | 11001011 |
| 00100111 | 01010010 | 10011010 | 01111111 |
(4) embedded watermark
During embedded digital watermarking, first by the value on the binary value designated bit position of original watermark information and each pixel into
Row XOR operation obtains " embedded watermark information ", original place value information on the bit is replaced with " embedded watermark information ", i.e.,
Complete watermark insertion.
In the realization of specific program, two on bit will be specified in watermark information W and two-value initial carrier image BR
System place value carry out exclusive or possibility situation be：
Situation 1：Watermark information is 0, on carrier image corresponding position (coordinate of the pixel in image) the two of pixel into
Place value on value designated bit position processed is 0, and the exclusive or result of the two is 0, does not need to any operation at this time, i.e., watermark information is embedding
Enter into carrier image.
Situation 2：Watermark information is 0, the place value on carrier image corresponding position on the binary value designated bit position of pixel
It is 1, the exclusive or result of the two is 1, does not need to any operation at this time, i.e., watermark information has been embedded into carrier image.
Situation 3：Watermark information is 1, the place value on carrier image corresponding position on the binary value designated bit position of pixel
It is 0, the exclusive or result of the two is 1, and needing at this time will be on the designated bit position of binary pixel values on carrier image corresponding position
Place value be changed to 1 by 0, complete watermark information being embedded into carrier image.In specific implementation, it is assumed that need embedded watermark
Bit binary n-th (binary digit is turned left number from the right side here, and serial number is since 0, i.e., least significant bit is the 0th,
Most significant bit is the 7th), then the pixel value of carrier image is added into 2^n, that is, realize and be replaced into 1 by the 0 of the bit,
Complete the insertion of watermark.
Situation 4：Watermark information is 1, the place value on carrier image corresponding position on the binary value designated bit position of pixel
It is 1, the exclusive or result of the two is 0, and needing at this time will be on the designated bit position of binary pixel values on carrier image corresponding position
Place value be changed to 0 by 1, complete watermark information being embedded into carrier image.In specific implementation, it is assumed that need embedded watermark
The pixel value of carrier image is then subtracted 2^n, that is, realizes and be replaced into the 1 of the bit by bit at binary n-th
0, that is, complete the insertion of watermark.
In above-mentioned four kinds of situations, situation 1, situation 2 all do not need to be changed initial carrier image, unite after being merged
Situation 2 is known as " regular B ", " situation 3 " is known as " regular C " by referred to as " regular A ".It is described using example, part
Embedded example (pays attention to as shown in table 7：For the serial number of binary digit since 0, least significant bit is the 0th, and most significant bit is
7).
Table 7 is embedded in example
According to above-mentioned conclusion as a result, being operated respectively for three types, specially：
Step 1：Handle rule A
Pixel corresponding position (the coordinate position phase where pixel in watermark W and in initial carrier image R channels BR
On together), the information of watermark W is 0, needs to participate in the bit (binary value of operation (embedded watermark) in carrier image R channels BR
In position serial number) place value be 0 or 1.Meet the BR and W of the rule as shown in dark-background partial table in table 8 and table 9,
The element of this part does not need to any insertion for changing and completing watermark in table 8.
8 initial carrier R channels BR of table
9 watermark W of table
Directly the element in above-mentioned initial carrier image R channels BR can be copied in WB containing watermarking images, at this time WB
In value be：
Step 2：Handle rule B
On pixel corresponding position in watermark W and in initial carrier image BR, watermark value 1, carrier image R channels BR
The place value of the middle bit for participating in operation is 0, and such case meets regular B, needs the correspondence of initial carrier image R channels BR
Pixel adds 2^n, and the value of n is determined by location matrix CS.
Meet background slightly dark in the watermark W of the rule and initial carrier image image R channels BR such as table 10 and table 11
Shown in part.
10 initial carrier image R channels BR of table
11 watermark W of table
For this partial value, need the value of respective pixel in carrier image R channels BR plus 2^n, n is that watermark exists here
The bit location to be embedded in binary number in carrier image R channel BR respective pixels, passes through embedded location Matrix C S
It obtains, it is as shown in table 12 that CS corresponding positions are set as dark-background.
12 embedded location Matrix C S of table
Therefore, according to embedded location matrix, according to regular B, operation is as follows：
● the 1st row the 4th arranges the value of (serial number of row and column is since 1 here) in initial carrier image R channels BR in table 10
“11000001 " needs the position of embedded watermark to be obtained by the embedded location Matrix C S shown in table 12, corresponding position in CS
Be worth is 5, it is therefore desirable to by the value plus " 2^5 ", obtain " 1110 0001”；
● the value " 1010000 that the 2nd row the 3rd arranges in initial carrier image R channels BR in table 100" according to embedded location matrix
It is the 0th that CS, which obtains embedded location, it is therefore desirable to by the value plus " 2^0 ", obtain " 10100001”；
● the value " 011100 that the 2nd row the 4th arranges in initial carrier image R channels BR in table 1000 " according to embedded location matrix
It is the 1st that CS, which obtains embedded location, it is therefore desirable to by the value plus " 2^1 ", obtain " 01110010”；
● the value " 101 that the 3rd row the 1st arranges in initial carrier image R channels BR in table 1000001 " according to embedded location matrix
It is the 4th that CS, which obtains embedded location, it is therefore desirable to by the value plus " 2^4 ", obtain " 10110001”；
● the value " 1 that the 4th row the 3rd arranges in initial carrier image R channels BR in table 100011010 " according to embedded location matrix
It is the 6th that CS, which obtains embedded location, it is therefore desirable to by the value plus " 2^6 ", obtain " 11011010”；
After the completion of the above process, obtained value is copied in WB containing watermarking images, the value in WB is at this time：
Step 3：Handle rule C
In watermark W and on initial carrier image R channel BR pixel corresponding positions, watermark value 1, carrier image R channels
The place value that the bit of operation is participated on BR is 1, and meet such case belongs to regular C, needs initial carrier image R channels
The pixel value of BR respective pixels will remove 2^n, and the value of n is determined by location matrix CS.
Meet the watermark W and initial carrier image R channels BR of the rule as shown in white background portions in table 13 and table 14.
13 initial carrier image R channels BR of table
14 watermark W of table
For this partial value, need the value in carrier image R channels BR subtracting 2^n, n is the watermark load to be embedded in here
Bit location in body image R channels BR in the binary number of respective pixel, is obtained by location matrix CS, CS is corresponded to position
Install that be set to white background as shown in Table 15.
15 embedded location Matrix C S of table
Therefore, the embedded location Matrix C S according to table 15, according to regular C, can obtain：
● the value " 1101000 that the 1st row the 1st arranges in initial carrier image R channels BR in table 131" need to subtract " 2^0 ", it obtains
To " 11010000”；
● the value " 1100010 that the 1st row the 2nd arranges in initial carrier image R channels BR in table 131" need to subtract " 2^0 ", it obtains
To " 11000100”；
● in table 13 in initial carrier image R channels BR the 1st row the 3rd arrange value "10100011 " needs to subtract " 2^7 ", obtains
To "00100011”；
● the value " 0111110 that the 2nd row the 1st arranges in initial carrier image R channels BR in table 131" need to subtract " 2^0 ", it obtains
To " 01111100”；
● the value " 111101 that the 2nd row the 2nd arranges in initial carrier image R channels BR in table 1311 " needs to subtract " 2^1 ", obtains
To " 11110101”；
● the value " 111 that the 3rd row the 3rd arranges in initial carrier image R channels BR in table 1310011 " needs to subtract " 2^4 ", obtains
To " 11100011”；
● the value " 011 that the 4th row the 4th arranges in initial carrier image R channels BR in table 1311111 " need to subtract " 2^4 ", obtain
To " 01101111”；
After the completion of the above process, obtained value is copied in WB containing watermarking images, the value in WB is at this time：
The decimal form of the WB containing watermarking images is：
| 208 | 196 | 35 | 225 |
| 124 | 245 | 161 | 114 |
| 177 | 137 | 227 | 203 |
| 39 | 82 | 218 | 111 |
By the use of above-mentioned aqueous watermark image WB as the R channels of aqueous printed color picture, it is detached with from initial carrier image
G channels rgb [1], the channel B rgb [2] gone out synthesizes aqueous printed color picture.
After completing above-mentioned steps, watermarking images preservation will be contained.
(5) image is shown
The conversion of channel sequence is carried out to initial carrier image to be shown, containing watermarking images, in order to show.
Initial carrier image, watermarking images are shown respectively, containing watermarking images.
The flow chart of telescopiny is as shown in Figure 1.
2 extraction process
Extraction process is to complete the extraction process of " identification watermark information ", is as follows：
(1) the R channels of initial carrier image are extracted
Initial carrier image is read in, image size M*N is obtained, is carried out channel decomposition, be divided into R channels, G channels, B and lead to
Road.
For example, having initial carrier image O, size 4*4 to be carried out channel decomposition, it is divided into R channels rgb [0], G leads to
Road rgb [1], channel B rgb [2].The R channels rgb [0] extracted is：
| 209 | 197 | 163 | 193 |
| 125 | 247 | 160 | 112 |
| 161 | 137 | 243 | 203 |
| 39 | 82 | 154 | 127 |
Its corresponding binary value BR is：
| 11010001 | 11000101 | 10100011 | 11000001 |
| 01111101 | 11110111 | 10100000 | 01110000 |
| 10100001 | 10001001 | 11110011 | 11001011 |
| 00100111 | 01010010 | 10011010 | 01111111 |
(2) the R channels of the carrier image containing watermark are extracted
Carrier image containing watermark is read in, image size M*N is obtained, is carried out channel decomposition, be divided into R channels, G channels, B
Channel.
For example, having carrier image containing watermark OW, size 4*4 to be carried out channel decomposition, it is divided into R channels OWrgb
[0], G channels OWrgb [1], channel B OWrgb [2].The R channels OWrgb [0] extracted is：
| 208 | 196 | 35 | 225 |
| 124 | 245 | 161 | 114 |
| 177 | 137 | 227 | 203 |
| 39 | 82 | 218 | 111 |
Its corresponding binary value OWBR is：
| 11010000 | 11000100 | 00100011 | 11100001 |
| 01111100 | 11110101 | 10100001 | 01110010 |
| 10110001 | 10001001 | 11100011 | 11001011 |
| 00100111 | 01010010 | 11011010 | 01101111 |
(3) bit plane is extracted
The extraction location matrix that size is M*N is generated according to the initial value of chaos system, original is extracted according to the matrix respectively
Binary bit value in beginning carrier image R channels and the R channels of carrier image containing watermark on the designated bit position of each pixel, by this
A little place values form the bit plane needed for subsequent operation.
If the value containing pixel in watermarking images is 218, (pixel has the corresponding position in corresponding location matrix CS
Identical coordinate) on value for 3, then need (to pay attention to from the 3rd of the binary bit of the pixel：Serial number is since 0, i.e., most
Low order is the 0th) extract watermark information.It is specific as shown in table 14.
Table 14 extracts watermark example
| Aqueous print pixel value | Binary value | The CS values of corresponding position | The watermark value of extraction |
| 216 | 11011000 | 3 | 1 |
When program implements, referred to by the way that the binary value of aqueous printing element is moved to right extraction location information Matrix C S values
Fixed digit obtains several information Nleft on the left side so that watermark information is in least significant bit.The least significant bit is
Watermark information, can be by the way that numerical value of N left obtains 2 modulus.For example, pixel value 216, binary bit value are
“11011000 ", corresponding CS values are 3, therefore are first moved to right 3 and obtained " 11011 ", then the value then obtains 2 modulus
The watermark numerical value " 1 " to be extracted.
The calculation expression of extracting rule is：
(11011000>>3) %2
Such as：The initial value of known chaos system is 0.98, then can generate the extraction location information Matrix C S of 4*4 sizes
For：
| 0 | 0 | 7 | 5 |
| 0 | 1 | 0 | 1 |
| 4 | 7 | 4 | 1 |
| 5 | 2 | 6 | 4 |
Specific bit plane is extracted in the extraction position determined according to CS according to extracting rule out of initial carrier image R channels BR,
The operation carried out is needed to be：
| (11010001>>0) %2 | (11000101>>0) %2 | (10100011>>7) %2 | (11000001>>5) %2 |
| (01111101>>0) %2 | (11110111>>1) %2 | (10100000>>0) %2 | (01110000>>1) %2 |
| (10100001>>4) %2 | (10001001>>7) %2 | (11110011>>4) %2 | (11001011>>1) %2 |
| (00100111>>5) %2 | (01010010>>2) %2 | (10011010>>6) %2 | (01111111>>4) %2 |
By above formula, the specific bit plane BRB that can obtain extracting out of initial carrier image R channels BR is：
| 1 | 1 | 1 | 0 |
| 1 | 1 | 0 | 0 |
| 0 | 1 | 1 | 1 |
| 1 | 0 | 0 | 1 |
The extraction position determined according to CS is extracted according to extracting rule out of the carrier image containing watermark R channels OWBR specific
Bit plane, needs the operation carried out to be：
| (11010000>>0) %2 | (11000100>>0) %2 | (00100011>>7) %2 | (11100001>>5) %2 |
| (01111100>>0) %2 | (11110101>>1) %2 | (10100001>>0) %2 | (01110010>>1) %2 |
| (10110001>>4) %2 | (10001001>>7) %2 | (11100011>>4) %2 | (11001011>>1) %2 |
| (00100111>>5) %2 | (01010010>>2) %2 | (11011010>>6) %2 | (01101111>>4) %2 |
By above formula, the bit plane OWBRB extracted out of the carrier image containing watermark R channels OWBR according to extracting rule is：
| 0 | 0 | 0 | 1 |
| 0 | 0 | 1 | 1 |
| 1 | 1 | 0 | 1 |
| 1 | 0 | 1 | 0 |
【Prompting】
It, can also be by n institutes by the way that the Mat types matrix of image and an all 2^n of intrinsic value are carried out step-by-step and operation
The information on different location specified extracts.It is different from extracting specific bit plane, institute is calculated here passes through position using n values
Matrix C S is obtained, and for different pixels, the value of n is unfixed.
(4) watermark information is extracted
Two that place value on the designated bit position extracted from initial carrier image and carrier image containing watermark is formed
A bit plane carries out xor operation and obtains " identification watermark information ".
For example, by the bit plane BRB extracted out of initial carrier image R channels BR and the R channels of the carrier image containing watermark
The bit plane OWBRB extracted in OWBR carries out XOR operation, obtains the binary value watermarking images WS of " identification watermark information ", tool
Body is：
| 1 | 1 | 1 | 1 |
| 1 | 1 | 1 | 1 |
| 1 | 0 | 1 | 0 |
| 0 | 0 | 1 | 1 |
(5) watermark processing
Threshold process is carried out to " identification watermark information " and is shown.
For example, the binary watermark WS of extraction is carried out threshold process, 255 are adjusted to by therein 1.The language used
Sentence be：
threshold(WS,WS,0,255,THRESH_BINARY)
The binary bitmap WB that after above-mentioned processing, can obtain " identification watermark information " is:
| 255 | 255 | 255 | 255 |
| 255 | 255 | 255 | 255 |
| 255 | 0 | 255 | 0 |
| 0 | 0 | 255 | 255 |
Custom function is called, above-mentioned watermark is included in main interface.
(6) carrier image containing watermark is shown
Channel sequence conversion is carried out to containing watermark carrier image, shows carrier image.
The flow chart of extraction process is as shown in Figure 2.
Claims (1)
1. a kind of non-blind watermark implementing method of random order based on chaos, it is characterized in that：Different pixels are calculated by chaos system
The embedded location of position in carrier image is embedded in watermark information；When embedded, by watermark information with corresponding to position in carrier image
It puts the place value on (coordinate of pixel is identical) on the specific bit position of binary pixel values and carries out XOR operation, by operation result
It is embedded on the bit that operation is participated in carrier image；In extraction, carrier image containing watermark and initial carrier are extracted respectively
Value on image corresponding position on the identical specific bit position of binary pixel values, and the two is subjected to XOR operation, with extraction
Go out original watermark information：
1 telescopiny
Telescopiny is embedded into carrier image again after original watermark information and carrier image are carried out operation.
(1) initial carrier image procossing
Initial carrier image is read in, image size is obtained, is carried out channel decomposition, be divided into R channels, G channels, channel B.
For example, having initial carrier image O, size 4*4 to be carried out channel decomposition, it is divided into R channels rgb [0], G channels
Rgb [1], channel B rgb [2].The R channels rgb [0] extracted is：
Its corresponding binary value BR is：
(2) watermarking images are handled
Binary bitmap is read, carrying out threshold process to binary bitmap obtains binary watermark.
For example, there is the binary bitmap WO to be：
Be 1 by the processing of pixel that binary bitmap WO intermediate values are 255, then obtain binary bitmap WO corresponding two into
Watermarking images W processed is：
(3) work location is determined
In random order blind watermatking, need to randomly select a bit from the binary value of each pixel, by the bit
The place value of position carries out exclusive or calculating, and result of calculation is embedded on selected bit with watermark, i.e., is replaced with operation result
Change original place value on the bit.Patent of the present invention determines embedded specific bit location information according to chaos system.
For example, as it is known that the initial value of chaos system is 0.98, then the insertion position with the sizes such as initial carrier image 4*4 can be generated
Putting Matrix C S is：
The location matrix CS established during according to chaos system initial value by 0.98 determines every in initial carrier bianry image BR
A pixel specifically participates in the bit location of operation, then the bit information such as underscore that operation is participated in BR is shown：
(4) embedded watermark
During embedded digital watermarking, first original watermark information is carried out with the value on the binary value designated bit position of each pixel different
Or operation obtains " embedded watermark information ", and original place value information on the bit is replaced with " embedded watermark information ", that is, is completed
Watermark is embedded in.
In the realization of specific program, the binary system on bit will be specified in watermark information W and two-value initial carrier image BR
Place value carry out exclusive or possibility situation be：
Situation 1：Watermark information is 0, the binary value of pixel on carrier image corresponding position (coordinate of the pixel in image)
Place value on designated bit position is 0, and the exclusive or result of the two is 0, does not need to any operation at this time, i.e., is embedded into watermark information
In carrier image.
Situation 2：Watermark information is 0, and the place value on carrier image corresponding position on the binary value designated bit position of pixel is 1,
The exclusive or result of the two is 1, does not need to any operation at this time, i.e., watermark information has been embedded into carrier image.
Situation 3：Watermark information is 1, and the place value on carrier image corresponding position on the binary value designated bit position of pixel is 0,
The exclusive or result of the two is 1, is needed at this time by the position on the designated bit position of binary pixel values on carrier image corresponding position
Value is changed to 1 by 0, completes watermark information being embedded into carrier image.In specific implementation, it is assumed that need the bit of embedded watermark
At binary n-th, (binary digit is turned left number from the right side here, and serial number is since 0, i.e., least significant bit is the 0th, highest for position
Significance bit is the 7th), then by the pixel value of carrier image plus 2^n, that is, realize and be replaced into 1 by the 0 of the bit, i.e., it is complete
Into the insertion of watermark.
Situation 4：Watermark information is 1, and the place value on carrier image corresponding position on the binary value designated bit position of pixel is 1,
The exclusive or result of the two is 0, is needed at this time by the position on the designated bit position of binary pixel values on carrier image corresponding position
Value is changed to 0 by 1, completes watermark information being embedded into carrier image.In specific implementation, it is assumed that need the bit of embedded watermark
The pixel value of carrier image is then subtracted 2^n, that is, realizes and be replaced into 0 by the 1 of the bit, i.e., by position at binary n-th
Complete the insertion of watermark.
In above-mentioned four kinds of situations, situation 1, situation 2 all do not need to be changed initial carrier image, are referred to as after being merged
Situation 2 is known as " regular B ", " situation 3 " is known as " regular C " by " regular A ".It is described, is partially submerged into using example
Example (pays attention to as shown in table 7：The serial number of binary digit is since 0, and least significant bit is the 0th, and most significant bit is the 7th
Position).
Table 7 is embedded in example
According to above-mentioned conclusion as a result, being operated respectively for three types, specially：
Step 1：Handle rule A
In watermark W on pixel corresponding position (coordinate position where pixel is identical) in initial carrier image R channels BR,
The information of watermark W is 0, needs to participate in the bit (position in binary value of operation (embedded watermark) in carrier image R channels BR
Serial number) place value be 0 or 1.Meet the BR and W of the rule as shown in dark-background partial table in table 8 and table 9, this in table 8
Partial element does not need to any insertion for changing and completing watermark.
8 initial carrier R channels BR of table
9 watermark W of table
Directly the element in above-mentioned initial carrier image R channels BR can be copied in WB containing watermarking images, at this time in WB
It is worth and is：
Step 2：Handle rule B
On pixel corresponding position in watermark W and in initial carrier image BR, watermark value 1 is joined in carrier image R channels BR
Place value with the bit of operation is 0, and such case meets regular B, needs the respective pixel of initial carrier image R channels BR
In addition the value of 2^n, n are determined by location matrix CS.
Meet background parts slightly dark in the watermark W of the rule and initial carrier image image R channels BR such as table 10 and table 11
It is shown.
10 initial carrier image R channels BR of table
11 watermark W of table
For this partial value, need the value of respective pixel in carrier image R channels BR plus 2^n, n is watermark in carrier here
The bit location to be embedded in binary number in image R channel BR respective pixels, is obtained by embedded location Matrix C S,
It is as shown in table 12 that CS corresponding positions are set as dark-background.
12 embedded location Matrix C S of table
Therefore, according to embedded location matrix, according to regular B, operation is as follows：
● the 1st row the 4th arranges the value of (serial number of row and column is since 1 here) in initial carrier image R channels BR in table 10
“11000001 " needs the position of embedded watermark to be obtained by the embedded location Matrix C S shown in table 12, corresponding position in CS
Be worth is 5, it is therefore desirable to by the value plus " 2^5 ", obtain " 1110 0001”；
● the value " 1010000 that the 2nd row the 3rd arranges in initial carrier image R channels BR in table 100" obtained according to embedded location Matrix C S
It it is the 0th to embedded location, it is therefore desirable to by the value plus " 2^0 ", obtain " 10100001”；
● the value " 011100 that the 2nd row the 4th arranges in initial carrier image R channels BR in table 1000 " obtains according to embedded location Matrix C S
It it is the 1st to embedded location, it is therefore desirable to by the value plus " 2^1 ", obtain " 01110010”；
● the value " 101 that the 3rd row the 1st arranges in initial carrier image R channels BR in table 1000001 " obtains according to embedded location Matrix C S
It it is the 4th to embedded location, it is therefore desirable to by the value plus " 2^4 ", obtain " 10110001”；
● the value " 1 that the 4th row the 3rd arranges in initial carrier image R channels BR in table 100011010 " obtains according to embedded location Matrix C S
It it is the 6th to embedded location, it is therefore desirable to by the value plus " 2^6 ", obtain " 11011010”；
After the completion of the above process, obtained value is copied in WB containing watermarking images, the value in WB is at this time：
Step 3：Handle rule C
In watermark W and on initial carrier image R channel BR pixel corresponding positions, in watermark value 1, carrier image R channels BR
The place value of the bit of operation is participated in as 1, meet such case belongs to regular C, needs BR pairs of initial carrier image R channels
2^n will be removed by answering the pixel value of pixel, and the value of n is determined by location matrix CS.
Meet the watermark W and initial carrier image R channels BR of the rule as shown in white background portions in table 13 and table 14.
13 initial carrier image R channels BR of table
14 watermark W of table
It for this partial value, needs the value in carrier image R channels BR subtracting 2^n, n is the watermark carrier figure to be embedded in here
As the bit location in the binary number of respective pixel in R channels BR, obtained by location matrix CS, CS corresponding positions are set
It is as shown in Table 15 to be set to white background.
15 embedded location Matrix C S of table
Therefore, the embedded location Matrix C S according to table 15, according to regular C, can obtain：
● the value " 1101000 that the 1st row the 1st arranges in initial carrier image R channels BR in table 131" need to subtract " 2^0 ", it obtains
“11010000”；
● the value " 1100010 that the 1st row the 2nd arranges in initial carrier image R channels BR in table 131" need to subtract " 2^0 ", it obtains
“11000100”；
● in table 13 in initial carrier image R channels BR the 1st row the 3rd arrange value "10100011 " needs to subtract " 2^7 ", obtains
“00100011”；
● the value " 0111110 that the 2nd row the 1st arranges in initial carrier image R channels BR in table 131" need to subtract " 2^0 ", it obtains
“01111100”；
● the value " 111101 that the 2nd row the 2nd arranges in initial carrier image R channels BR in table 1311 " needs to subtract " 2^1 ", obtains
“11110101”；
● the value " 111 that the 3rd row the 3rd arranges in initial carrier image R channels BR in table 1310011 " needs to subtract " 2^4 ", obtains
“11100011”；
● the value " 011 that the 4th row the 4th arranges in initial carrier image R channels BR in table 1311111 " need to subtract " 2^4 ", obtain
“01101111”；
After the completion of the above process, obtained value is copied in WB containing watermarking images, the value in WB is at this time：
The decimal form of the WB containing watermarking images is：
By the use of above-mentioned aqueous watermark image WB as the R channels of aqueous printed color picture, by itself and the G that is isolated from initial carrier image
Channel rgb [1], channel B rgb [2] synthesize aqueous printed color picture.
After completing above-mentioned steps, watermarking images preservation will be contained.
(5) image is shown
The conversion of channel sequence is carried out to initial carrier image to be shown, containing watermarking images, in order to show.
Initial carrier image, watermarking images are shown respectively, containing watermarking images.
2 extraction process
Extraction process is to complete the extraction process of " identification watermark information ", is as follows：
(1) the R channels of initial carrier image are extracted
Initial carrier image is read in, image size M*N is obtained, is carried out channel decomposition, be divided into R channels, G channels, channel B.
For example, having initial carrier image O, size 4*4 to be carried out channel decomposition, it is divided into R channels rgb [0], G channels
Rgb [1], channel B rgb [2].The R channels rgb [0] extracted is：
Its corresponding binary value BR is：
(2) the R channels of the carrier image containing watermark are extracted
Carrier image containing watermark is read in, image size M*N is obtained, is carried out channel decomposition, be divided into R channels, G channels, B and lead to
Road.
For example, having carrier image containing watermark OW, size 4*4 to be carried out channel decomposition, it is divided into R channels OWrgb [0], G
Channel OWrgb [1], channel B OWrgb [2].The R channels OWrgb [0] extracted is：
Its corresponding binary value OWBR is：
(3) bit plane is extracted
The extraction location matrix that size is M*N is generated according to the initial value of chaos system, original load is extracted according to the matrix respectively
Binary bit value in body image R channels and the R channels of carrier image containing watermark on the designated bit position of each pixel, by these positions
Value forms the bit plane needed for subsequent operation.
If the value containing pixel in watermarking images is 218, (pixel has identical the corresponding position in corresponding location matrix CS
Coordinate) on value for 3, then need (to pay attention to from the 3rd of the binary bit of the pixel：Serial number is since 0, i.e., minimum to have
Effect position is the 0th) extract watermark information.It is specific as shown in table 14.
Table 14 extracts watermark example
When program implements, by the way that the binary value of aqueous printing element is moved to right what extraction location information Matrix C S values were specified
Digit obtains several information Nleft on the left side so that watermark information is in least significant bit.Least significant bit, that is, the watermark
Information, can be by the way that numerical value of N left obtains 2 modulus.For example, pixel value 216, binary bit value are
“11011000 ", corresponding CS values are 3, therefore are first moved to right 3 and obtained " 11011 ", then the value then obtains 2 modulus
The watermark numerical value " 1 " to be extracted.
The calculation expression of extracting rule is：
(11011000>>3) %2
Such as：The initial value of known chaos system is 0.98, then the extraction location information Matrix C S that can generate 4*4 sizes is：
The extraction position determined according to CS is extracted specific bit plane out of initial carrier image R channels BR according to extracting rule, is needed
The operation of progress is：
By above formula, the specific bit plane BRB that can obtain extracting out of initial carrier image R channels BR is：
The extraction position determined according to CS is extracted certain bits out of the carrier image containing watermark R channels OWBR according to extracting rule and is put down
Face, needs the operation carried out to be：
By above formula, the bit plane OWBRB extracted out of the carrier image containing watermark R channels OWBR according to extracting rule is：
【Prompting】
It, can also will be specified by n by the way that the Mat types matrix of image and all 2^n of intrinsic value is carried out step-by-step and operation
Different location on information extract.It is different from extracting specific bit plane, institute is calculated here passes through location matrix using n values
CS is obtained, and for different pixels, the value of n is unfixed.
(4) watermark information is extracted
Two positions that place value on the designated bit position extracted from initial carrier image and carrier image containing watermark is formed
Plane carries out xor operation and obtains " identification watermark information ".
For example, by the bit plane BRB extracted out of initial carrier image R channels BR and the R channels OWBR of the carrier image containing watermark
The bit plane OWBRB of interior extraction carries out XOR operation, obtains the binary value watermarking images WS of " identification watermark information ", specifically
For：
(5) watermark processing
Threshold process is carried out to " identification watermark information " and is shown.
For example, the binary watermark WS of extraction is carried out threshold process, 255 are adjusted to by therein 1.The sentence used
For：
threshold(WS,WS,0,255,THRESH_BINARY)
The binary bitmap WB that after above-mentioned processing, can obtain " identification watermark information " is:
Custom function is called, above-mentioned watermark is included in main interface.
(6) carrier image containing watermark is shown
Channel sequence conversion is carried out to containing watermark carrier image, shows carrier image.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201611214181.3A CN108242041A (en) | 2016-12-26 | 2016-12-26 | A kind of non-blind watermark implementing method of random order based on chaos |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201611214181.3A CN108242041A (en) | 2016-12-26 | 2016-12-26 | A kind of non-blind watermark implementing method of random order based on chaos |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN108242041A true CN108242041A (en) | 2018-07-03 |
Family
ID=62703731
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201611214181.3A Pending CN108242041A (en) | 2016-12-26 | 2016-12-26 | A kind of non-blind watermark implementing method of random order based on chaos |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108242041A (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111510776A (en) * | 2020-05-11 | 2020-08-07 | 知安视娱(南京)科技有限公司 | Method and system for inserting and extracting watermark identification |
| CN111669615A (en) * | 2020-05-13 | 2020-09-15 | 北京奇艺世纪科技有限公司 | Video stream processing method and device |
| CN112040086A (en) * | 2019-06-03 | 2020-12-04 | 湖北微模式科技发展有限公司 | Image encryption and decryption method and device, equipment and readable storage medium |
| CN113766243A (en) * | 2020-11-19 | 2021-12-07 | 北京沃东天骏信息技术有限公司 | Image data processing method and device, electronic equipment and storage medium |
-
2016
- 2016-12-26 CN CN201611214181.3A patent/CN108242041A/en active Pending
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112040086A (en) * | 2019-06-03 | 2020-12-04 | 湖北微模式科技发展有限公司 | Image encryption and decryption method and device, equipment and readable storage medium |
| CN112040086B (en) * | 2019-06-03 | 2023-06-06 | 湖北微模式科技发展有限公司 | Image encryption and decryption methods and devices, equipment and readable storage medium |
| CN111510776A (en) * | 2020-05-11 | 2020-08-07 | 知安视娱(南京)科技有限公司 | Method and system for inserting and extracting watermark identification |
| CN111669615A (en) * | 2020-05-13 | 2020-09-15 | 北京奇艺世纪科技有限公司 | Video stream processing method and device |
| CN111669615B (en) * | 2020-05-13 | 2022-09-30 | 北京奇艺世纪科技有限公司 | Video stream processing method and device |
| CN113766243A (en) * | 2020-11-19 | 2021-12-07 | 北京沃东天骏信息技术有限公司 | Image data processing method and device, electronic equipment and storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108242041A (en) | A kind of non-blind watermark implementing method of random order based on chaos | |
| CN108242040A (en) | Random order blind watermatking implementation method based on chaos system | |
| CN104200424B (en) | Difference conversion based (K, N) meaningful image sharing and recovering method | |
| CN105404817B (en) | It is based on（k, n）The user-friendly visual secret sharing scheme method of thresholding | |
| Nilizadeh et al. | A novel steganography method based on matrix pattern and LSB algorithms in RGB images | |
| CN104899823B (en) | The dual-color image blind watermarking method decomposed based on Hessenberg | |
| Qin et al. | A novel steganography for spatial color images based on pixel vector cost | |
| CN106204410B (en) | A kind of novel digital watermark method decomposed based on matrix Schur | |
| Ernawan et al. | Three layer authentications with a spiral block mapping to prove authenticity in medical images | |
| CN110264390A (en) | A kind of digital watermark method based on double watermarks insertion | |
| Al-Tamimi et al. | Image steganography using least significant bits (LSBs): a novel algorithm | |
| CN106991636B (en) | Airspace color image blind watermarking method fusing approximate Schur decomposition | |
| CN109064381B (en) | Multi-dimensional digital watermark encryption method based on secret key | |
| CN106157233B (en) | A kind of good digital water mark method decomposed based on matrix Schur | |
| CN106228503A (en) | The digital watermark embedding of satellite remote-sensing image SHP dot file and extracting method | |
| Wu et al. | Modified multiway pixel-value differencing methods based on general quantization ranges for image steganography | |
| CN111489278B (en) | Text watermark embedding and extracting method based on scrambling diffusion | |
| Gou et al. | Improving Embedding Payload in Binary Imageswith" Super-Pixels" | |
| CN110349071B (en) | Method for extracting watermark from image based on dense network | |
| CN113160028A (en) | Information hiding and recovering method and equipment based on colorful character picture and storage medium | |
| Benyoussef et al. | Blind invisible watermarking technique in DT-CWT domain using visual cryptography | |
| Niimi et al. | An attack to BPCS-steganography using complexity histogram and countermeasure | |
| Lee et al. | Authentication of binary document images in PNG format based on a secret sharing technique | |
| CN115037845B (en) | Color image reversible hiding method based on Hachimoji DNA and Julia fractal | |
| Zhang et al. | High Quality Image Steganography Model Based on Encoder-Decoder Networks and 2D Logistic Chaotic Encryption |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20180703 |
|
| WD01 | Invention patent application deemed withdrawn after publication |