CN110417551A - A kind of the character picture production camouflage and restoration methods of the diffusion of combination error - Google Patents
A kind of the character picture production camouflage and restoration methods of the diffusion of combination error Download PDFInfo
- Publication number
- CN110417551A CN110417551A CN201910712471.8A CN201910712471A CN110417551A CN 110417551 A CN110417551 A CN 110417551A CN 201910712471 A CN201910712471 A CN 201910712471A CN 110417551 A CN110417551 A CN 110417551A
- Authority
- CN
- China
- Prior art keywords
- character
- formula
- image
- value
- key
- 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.)
- Granted
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/08—Key distribution or management, e.g. generation, sharing or updating, of cryptographic keys or passwords
- H04L9/0861—Generation of secret information including derivation or calculation of cryptographic keys or passwords
- H04L9/0863—Generation of secret information including derivation or calculation of cryptographic keys or passwords involving passwords or one-time passwords
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/08—Key distribution or management, e.g. generation, sharing or updating, of cryptographic keys or passwords
- H04L9/0861—Generation of secret information including derivation or calculation of cryptographic keys or passwords
- H04L9/0869—Generation of secret information including derivation or calculation of cryptographic keys or passwords involving random numbers or seeds
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N1/00—Scanning, transmission or reproduction of documents or the like, e.g. facsimile transmission; Details thereof
- H04N1/32—Circuits or arrangements for control or supervision between transmitter and receiver or between image input and image output device, e.g. between a still-image camera and its memory or between a still-image camera and a printer device
- H04N1/32101—Display, printing, storage or transmission of additional information, e.g. ID code, date and time or title
- H04N1/32144—Display, printing, storage or transmission of additional information, e.g. ID code, date and time or title embedded in the image data, i.e. enclosed or integrated in the image, e.g. watermark, super-imposed logo or stamp
- H04N1/32149—Methods relating to embedding, encoding, decoding, detection or retrieval operations
- H04N1/32267—Methods relating to embedding, encoding, decoding, detection or retrieval operations combined with processing of the image
- H04N1/32272—Encryption or ciphering
Abstract
The character that the present invention provides a kind of combination error diffusion draws production camouflage and restoration methods, specifically, firstly, generating character picture by given 0 and 1 character；Secondly, 2 value secret informations are backed up and are encrypted to enhance being associated with and improves and attacking discrimination capabilities for secret information and key；Again, random coordinates sequence is generated using key to determine that embedding dense bit of the secret bit in cover-image is set, traverse blindage pixel, embedding close and non-embedding dense bit set, place respectively associated with key and position or secret bit is expressed and is covered with character similar in blindage placement location pixel；The deviation that character placement process generates finally is passed into unprocessed pixel around blindage using error diffusion, is drawn to generate containing close character.When restoring, character carries out expression to secret information to this method and telescopiny places one's entire reliance upon key merely with randomly placing, and can produce visual quality and preferably contains close character and draw, can resist channel attack, have good anti-attack ability.
Description
Technical field
The invention belongs to image information safety and digital image signal process crossing domain, be related to a kind of production camouflage and
Restoration methods, in particular to a kind of character of combination error diffusion draw production camouflage and restoration methods.
Background technique
The development of computer and network technologies, so that the safety of network traffic is particularly important, to guarantee its safety
Property, there has been proposed a variety of using image as the information concealing method of carrier, such as secret writing, such as: Gandharba S, 2016
(Gandharba S.Adaptive pixel value differencing steganography using both
vertical and horizontal[J].Multimedia Tools and applications,2016,75(21):
13541-13556.)、Yang T Y,2017(Yang T Y,Chen H S.Matrix embedding in
steganography with binary Reed–Muller codes[J].IET Image Processing,2017,11
(7): 522-529.), Zhang Yang, 2018 (Zhang Yang, Shao Liping, Ren Pingan exempt from base vector EMD (n, m) model and its in Image Steganographics
On application [J] CAD and figure journal, 2018,30 (8): 1490-1504.), point deposit, such as: Ou Yangxian
Refined, 2017 (backup of Ou Yangxianbin, Shao Liping, Le Zhifang non-equivalent and double certification limited area images of selfreparing point deposit [J] software
Journal, 2017,28 (12): 3306-3346.), Shao Liping, 2018 (multi-threshold of Shao Liping, the Le Zhifang based on DCT is progressive secret
Close image point deposits scheme [J] information network security, 2018,18 (3): 54-62.), Shao Liping, 2019 (Shao Liping, Le Zhifang
Multi version backup and restricted double authentication master key (t, s, k, n) image point deposit [J] electronic letters, vol, 2019,47 (2): 390-
403.), Huang Yanyan, 2018 (Huang Yanyan, Shao Liping combination EMD-clClose figure separate-management method [J] the China figure of the multichip carrier of insertion
Image pattern journal, 2018,23 (8): 1108-1130.), watermark, such as: Su Q T, 2018 (Su Q T, Chen B
J.Robust color image watermarking technique in the spatial domain[J].Soft
Computing, 2018,22 (1): 91-106.) and camouflage, such as: Lai I J, 2011 (Lai I J, Tsai W
H.Secret-fragment-visible mosaic image–a new computer art and its application
to information hiding[J].IEEE Transactions on Information Forensics&Security,
2011,6(3):936-945.)、Zhai S Y,2015(Zhai S Y,Li F,Chang C C,et al.A meaningful
scheme for sharing secret images using mosaic images[J].International Journal
Of Network Security, 2015,17 (5): 643-649.), Zhang Meng, 2016 (Zhang Meng, Zhai Shengyun, Su Dongqi be based on horse
Match gram technology Secret Image Sharing innovatory algorithm [J] computer application research, 2016,33 (11): 3480-3484.), Lee
Y L,2014(Lee Y L,Tsai W H.A new secure image transmission technique via
secret-fragment-visible mosaic images by nearly reversible color
transformations[J].IEEE Transactions on Circuits&Systems for Video
Technology,2014,24(4):695-703.)、Hou D,2016(Hou D,Zhang W,Yu N.Image
camouflage by reversible image transformation[J].Journal of Visual
Communication&Image Representation, 2016,40:225-236.), Liu little Kai, 2018 (Liu little Kai, Yao Heng,
The reversible image of improvement of the Qin Chuan based on image block classification threshold optimization pretends [J] applied science journal, 2018,36 (2): 237-
246.) etc..Mosaic camouflage strategy wherein based on block replacement and block picture mosaic is a kind of typical information concealing method.
Close figure is usually divided into fritter as mosaic by such methods, is replaced by the similar block to significant cover-image
It brings and hides close figure or close figure is divided into fritter as dictionary, generated using the method for picture mosaic incoherent containing close intentional therewith
Adopted blindage.For example, Lai I J, 2011 in large database concept by choosing public image similar with close figure feature, by similar
Block replacement, close figure is disguised oneself as public image.To avoid large database concept from searching for and ensuring containing close blindage visual quality, Zhai S
Y, 2015, Zhang Meng, 2016 are replaced using similar block, and a width Secret Image is hidden in multiple image, i.e., draw close figure fritter
It is divided into n parts of insertion n cover-images.To improve hiding efficiency and reducing matching error, Lee Y L, 2014 press close figure fritter
It is sorted with the mean value and standard deviation of blindage fritter to establish the mapping relations of close figure fritter and blindage fritter, then by close figure fritter
Reconstruct cover-image.Hou D, 2016 on the basis of Lee Y L, 2014, is further introduced into mean cluster and comes to close figure fritter
Classified and matched with blindage fritter.Liu little Kai, 2018 improve Hou D using classification thresholds optimization algorithm, and 2016, make close
Matching mean square error between figure fritter and blindage fritter is smaller.
Above-mentioned document Lai I J, 2011, Zhai S Y, 2015, Zhang Meng, 2016, Lee Y L, 2014, Hou D, 2016
And Liu little Kai, 2018 produce and significant are covered to hiding close figure containing close cover-image.However these documents are not
It is related to the insertion of parameter, such as Lai I J avoidablely, 2011, Zhai S Y, 2015, Zhang Meng, 2016 to need to be embedded in close figure small
Block is in the location information of former close figure, and Lee Y L, 2014, Hou D, 2016 and Liu little Kai, 2018 need to be embedded in blindage fritter rope
Draw or the additional ginseng such as cluster index, close figure fritter and the equal value difference of blindage fritter, the direction of rotation of close figure fritter and truncation residual error
Number.For the embedded mode of additional parameter, above-mentioned document is all made of the embedding close method of modification formula, such as document Lai I J,
2011, Lee Y L, 2014, Hou D, 2016 and Liu little Kai, 2018 use the reversible embedding grammar Dinu C based on LSB, 2007
(Dinu C,Jean-Marc C.Very fast watermarking by reversible contrast mapping[J]
.IEEE Signal Processing Letters, 2007,14 (4): 255-258.) it is embedded in and extracts additional parameter；Zhai S
Y, 2015 are embedded into relevant parameter in cover-image by simple LSB method；Zhang Meng, 2016 are embedded in correlation by difference expansion
Parameter simultaneously extracts secret information.And such way the problem of bringing is that the modification embedding close method of formula inevitably can be in cover-image
In leave lower modification trace, it is difficult to the detection for resisting steganalysis algorithm easily causes the suspection of channel potential attacker；Document
Lai I J, 2011, Zhai S Y, 2015, Zhang Meng, 2016, Lee Y L, 2014, Hou D, 2016 and Liu little Kai, 2018 relate to
And LSB insertion, poor robustness more sensitive to non-significant bit are easy to cause the parameter of insertion to lose when by attacking.
Summary of the invention
It is an object of the invention to overcome prior art defect, the character for providing a kind of combination error diffusion draws production puppet
Dress and restoration methods, this method are depicted as carrier with character, by secret to express in embedding dense bit placement location character relevant to key
Confidential information, and will not leave modification trace, robustness is preferable.
To achieve the above object, the invention adopts the following technical scheme:
The character of combination error of the present invention diffusion draw production camouflage method the following steps are included:
Step 1: 2 value secret bit sequence S=(s of inputi)l,si∈ { 0,1 } and resolution ratio are m0×n0R rank gray scale cover
Body imageti,j∈{0,1,…,2r- 1 }, code character image is generated using the character 0 and 1 of specified font size；
Step 2: by 2 τ parts of S backup of value secret bit sequences, as B=(bi)τ·l, by key k0Generate random coordinates sequence
Arrange Z, wherein Z=(zi=(xi,yi))τ·l,(xi,yi)∈m0×n0, and the coordinate two in random coordinates sequence Z is neither etc., by
Key k1Generate 2 value random reference matrixesci,j∈ { 0,1 }, and initialize blank image
Step 3: by r rank gray scale cover-imageti,j∈{0,1,…,2r- 1 } it is quantified as cover-image
Step 4: pass through key k2By B=(bi)τ·lIt is encrypted as F=(fi)τ·l；
Step 5: for cover-image T0In each elementAccording to F, Z and C, chooses character picture and be placed on sky
On white image M, the deviation that placement process is generated is spread to untreated pixel around；
Step 6: repeating step 5, until cover-image T0In all elementsIt is disposed, M at this time is exported and is made
It is drawn for the character of generation.
In step 1, the character 0 and 1 of specified font size is used to generate the specific operation process of code character image are as follows: using referring to
It is l that the character 0 and 1 for determining font size, which generates 2 width resolution ratio,1×l2Character picture A0,A1, wherein A0Correspond to the code pattern of 0 character
Picture, A1Correspond to the coded image of 1 character；
In step 2, by τ parts of S backup, as B=(bi)τ·lSpecific operation process are as follows: by the sequentially connected result of τ S
As B；
In step 2, blank image is initializedThe constraint of satisfaction are as follows:
In step 4, pass through key k2By B=(bi)τ·lIt is encrypted as F=(fi)τ·lOperating process are as follows: by key k2Generate 2
It is worth Random number sequence R=(ri)τl, right back-pushed-type (4) is by B=(bi)τ·lIt is encrypted as F=(fi)τ·l；
Wherein, symbolIndicate exclusive or encryption.
In step 3, by r rank gray scale cover-imageti,j∈{0,1,…,2r- 1 } it is quantified as covering by formula (2)
Body image
In step 5, to cover-image T0In each elementAccording to F, Z and C, the concrete operations of character picture are chosen
Process are as follows:
5.1) for cover-image T0In each elementDynamic threshold t is determined by formula (3), calculates t by formula (6)x
′,y, 2 value bit b are generated by formula (5)cur；
Wherein, if (x, y) ∈ Z and corresponding to i-th of coordinate position in Z, from F=(fi)τ·lI-th of 2 value ratios of middle interception
Special fi, c is read from 2 value random reference Matrix Csx,y, then b is calculated by exclusive orcur；IfThen by tx′,yAs bcur；
5.2) formula (9) are pressed from character picture A0,A1Middle selection character picture D；
In step 5, the specific operation process that the character picture D of selection is placed on blank image M are as follows: by the word of selection
Symbol image D is placed in blank image M with (xl1,y·l2) it is starting point, size l1×l2Image block on.
In step 5, specific operation process that the deviation that placement process is generated is spread to untreated pixel around are as follows:
Error delta is calculated by formula (7)i,j, by error deltai,jT is distributed to by formula (8)i,jOn the pixel in 8 fields of surrounding；
Wherein, (x, y) ∈ { (i-1, j-1), (i-1, j), (i-1, j+1), (i, j-1), (i, j+1), (i+1, j-1), (i
+ 1, j), (i+1, j+1) }, NCFor ti,jThe valid pixel number of formula (6) processing is not pressed in 8 fields of surrounding, and Range (x, 0,1) is used for
[0,1] section is arrived into x quantization, if when x < 0, x=0；If when x > 1, x=1；If being then x when [0,1] x ∈.
In step 2, by key k0Generate the specific operation process of random coordinates sequence Z are as follows:
2.1) positive integer greater than 1 is chosen as k0；
2.2) formula (16) are pressed by k0It is mapped asAgain willIt changes as rr ∈ (0,1) by formula (17)
Generation, to generate rr ∈ (0,1)；
Wherein, IFF () is condition discriminant function, and the 1st parameter is Rule of judgment, and it is true that the 2nd parameter, which is Rule of judgment,
When calculated result, the 3rd parameter is the calculated result that Rule of judgment is fictitious time；SymbolTo be rounded downwards, max-1 () table
Show the maximum value of exclusion 1, min-0 () indicates to exclude 0 minimum value；
2.3) step 2.2) is iterated, to generate adjacent random number rr0,rr1, then by the adjacent random number of generation
rr0,rr1(x, y) ∈ m is quantified as by formula (18)0×n0；
2.4) step 2.2- step 2.3) is repeated, until generating the m of preset quantity0×n0Random coordinates in range；
In step 2, by key k1Generate 2 value random reference matrixesci,jThe concrete operations of ∈ { 0,1 }
Journey are as follows: choose the positive integer greater than 1 as k1, by formula (16) by k1It is mapped asThen willAs rr ∈
(0,1) is iterated by formula (17), to generate rr ∈ (0,1), then by the m of generation0n0A random number rri,j, i=0,1 ..., m0-
1, j=0,1 ..., n0- 1 is quantified as c by formula (19)i,j, to obtainci,j∈{0,1}；
In step 4, by key k2Generate 2 value Random number sequence R=(ri)τlSpecific operation process are as follows: choose be greater than 1
Positive integer as k2, by formula (16) by k2It is mapped asAgain willIt is carried out as rr ∈ (0,1) by formula (17)
Iteration, to generate rr ∈ (0,1), by the τ l random number rr of generationi, i=0,1 ..., τ l-1 is quantified as r by formula (20)i,
To obtain R=(ri)τl；
The character of combination error of the present invention diffusion draw production restoration methods the following steps are included:
Step 1: the embedding close cover-image of inputKey k0,k1,k2And 2 value secret bit sequence length
L generates code character image using the character 0 and 1 of specified font size；
Step 2: by key k0Generate the random coordinates sequence Z that length is τ l, wherein Z=(zi=(xi,yi))τ·l,
(xi,yi)∈m0×n0, and the coordinate two in random coordinates sequence Z is neither etc., by key k1Generate 2 value random reference matrixesci,j∈{0,1}；
Step 3: to each coordinate (x in random coordinates sequence Zi,yi), interception and coded word in embedding close cover-image M
The image block D for according with image equidimension, immediate code character image is chosen from code character image, extracts image block D
2 representative value bit bcur, then by 2 value bit bcurIt is decoded as 2 value bit fi；
Step 4: by all fi, i=0,1 ..., the sequence that τ l-1 is constituted is as F=(fi)τ·l, by key k2F is solved
Code is B=(bi)τ·l, B is divided into the 2 value secret bit sequences that τ length is l and is backed up
Step 5: by S0,S1,…,Sτ-1Extract secret information S and identification sequences E.
In step 1, the character 0 and 1 of specified font size is used to generate the specific operation process of code character image are as follows: using referring to
Determine font size character 0 and 1 to initialize 2 width resolution ratio to be l1×l2Character picture A0,A1；
In step 2, the random reference matrix of generationci,jThe constraint that ∈ { 0,1 } meets are as follows:
In step 3, according to formula (12) by bcurIt is decoded as 2 value bit fi；
In step 4, by key k2Generate 2 value Random number sequence R=(ri)τ·l, F is decoded as B=by formula (13)
(bi)τ·l；
In step 3, the concrete operations with the image block D of code character image equidimension are intercepted in embedding close cover-image M
Process are as follows: with (x in embedding close cover-image Mi·l1,yi·l2) it is upper left corner starting point, interception resolution ratio is l1×l2Image
Block D；
In step 3, the specific operation process of immediate code character image is chosen from code character image are as follows: press formula
(11) from A0,A1It is middle to choose immediate character picturebcur∈{0,1}；
In step 4, B is divided into the 2 value secret bit sequences that τ length is l and is backed upSpecific operation process are as follows: successively intercepted length be l 2 value secret ratios
Special sequence, with construction
In step 5, by S0,S1,…,Sτ-1Extract the specific operation process of secret information S and identification sequences E are as follows: according to S0,
S1,…,Sτ-1The element of corresponding positionCalculate 2 value secret bit siAnd siAuthentication value ei, by si, i=0,
1 ..., l-1 are as the secret information S extracted, by ei, i=0,1 ..., l-1 is as corresponding identification sequences E.
In step 5, according to S0,S1,…,Sτ-1The element of corresponding positionCalculate 2 value secret bit siAnd si
Authentication value eiDetailed process are as follows:
1) it countsIn for 0 and be 1 quantity N0And N1；
2) s is calculated by formula (14)i；
Wherein, rand (2) be used to generate [0,2) random number in range, symbolFor being rounded downwards,
For the random number of 0 or 1 to be randomly generated；
3) e is calculated by formula (15)i；
In step 2, by key k0Generate the specific operation process of random coordinates sequence Z are as follows:
2.1) positive integer greater than 1 is chosen as k0；
2.2) formula (16) are pressed by k0It is mapped asAgain willIt changes as rr ∈ (0,1) by formula (17)
Generation, to generate rr ∈ (0,1)；
Wherein, IFF () is condition discriminant function, and the 1st parameter is Rule of judgment, and it is true that the 2nd parameter, which is Rule of judgment,
When calculated result, the 3rd parameter is the calculated result that Rule of judgment is fictitious time；SymbolTo be rounded downwards, max-1 () table
Show the maximum value of exclusion 1, min-0 () indicates to exclude 0 minimum value；
2.3) step 2.2) is iterated, to generate adjacent random number rr0,rr1, then by the adjacent random number of generation
rr0,rr1(x, y) ∈ m is quantified as by formula (18)0×n0；
2.4) step 2.2)-step 2.3) is repeated, until generating the m of preset quantity0×n0Random coordinates in range；
In step 2, by key k1Generate 2 value random reference matrixesci,jThe concrete operations of ∈ { 0,1 }
Journey are as follows: choose the positive integer greater than 1 as k1, by formula (16) by k1It is mapped asThen willAs rr ∈
(0,1) is iterated by formula (17), to generate rr ∈ (0,1), then by the m of generation0n0A random number rri,j, i=0,1 ..., m0-
1, j=0,1 ..., n0- 1 is quantified as c by formula (19)i,j, to obtainci,j∈{0,1}；
In step 4, by key k2Generate 2 value Random number sequence R=(ri)τlSpecific operation process are as follows: choose be greater than 1
Positive integer as k2, by formula (16) by k2It is mapped asAgain willIt is carried out as rr ∈ (0,1) by formula (17)
Iteration, to generate rr ∈ (0,1), by the τ l random number rr of generationi, i=0,1 ..., τ l-1 is quantified as r by formula (20)i,
To obtain R=(ri)τl；
The invention has the following advantages:
The character of combination error diffusion of the present invention draws production camouflage and restoration methods when specific operation, uses
Production method, and the key that places one's entire reliance upon represent white pixel point using character 1, and character 0 represents black pixel point, according to
Cover-image generation is corresponding to draw containing close halftoning character, and is placed on the character for representing secret bit in generating process and contains
Close halftoning character draws designated position, i.e., generates random coordinates sequence first with key to determine secret information bit in blindage
Embedding dense bit in image is set, and can produce drawing containing close character for high quality, and generation is relevant to cover-image to draw containing close character, and can
Secret information is combined into using specific character in drawing containing close character and secret information is expressed, while without additional parameter
Insertion, initial carrier do not transmit in the channel.In addition, mentioned method need to only read corresponding position character, extraction side when restoring
Method is insensitive to the non-significant bit of pixel, can resist a degree of attacked by noise or JPEG compression, have good robust
Property, camouflage drives by key completely with Restoration stage, the Random Maps of secret bit and the embedding dense bit of secret bit set and with
Machine disturbance is generated by key, has complete dependence to key, and screen secret information by multiple duplication, has good
Good anti-attack ability and higher safety, and the authenticity for extracting information can be authenticated.Further, the present invention returns
The Nonlinear Mapping by key mapping for random number is gone out, a variety of nonlinear disturbances is introduced in the Nonlinear Mapping constructed
Factor, the random number of generation are strictly limited at (0,1) section, have effectively prevented the generation that iterative process gets over dividing value, have compared with
Good random performance.
Detailed description of the invention
Fig. 1 is the flow chart of secret information camouflage；
Fig. 2 is the flow chart that secret information restores；
Fig. 3 is cover-image, is 8 rank gray level image camera of 64 × 64 resolution ratio；
Fig. 4 is cover-image, is 8 rank gray level image cameraman of 64 × 64 resolution ratio；
Fig. 5 is secret information, and the ancient poetry " quiet night thinks " comprising 20 Chinese characters is scanned and made for 2 value bit sequences
For 2 value bit sequences of insertion；
Fig. 6 is using Fig. 5 as the embedding close carrier 1 of secret information；
Fig. 7 is using Fig. 5 as the embedding close carrier 2 of secret information；
Fig. 8 is the secret information recovered by Fig. 6 and Fig. 7, and the bit error rate EBR relative to Fig. 5 is 0%；
Fig. 9 is that the image after salt-pepper noise attack is carried out to Fig. 6, and taking noise intensity is 25%, the PSNR=relative to Fig. 6
12.2107dB；
Figure 10 is that the image after salt-pepper noise attack is carried out to Fig. 7, and taking noise intensity is 10%, the PSNR relative to Fig. 7
=15.9304dB；
Figure 11 is the secret information recovered by Fig. 9 and Figure 10, and the bit error rate EBR relative to Fig. 5 is 0%；
Figure 12 is that the image after JPEG compression attack, quality factor 80, the PSNR=relative to Fig. 6 are carried out to Fig. 6
32.3513dB；
Figure 13 is that the image after JPEG compression attack, quality factor 60, the PSNR=relative to Fig. 7 are carried out to Fig. 7
25.4144dB；
Figure 14 is the secret information recovered by Figure 12 and Figure 13, and the bit error rate EBR relative to Fig. 5 is 0%；
Figure 15 is the image carried out after shearing attack to Fig. 6, and shearing accounting is 10%, the PSNR=relative to Fig. 6
11.3272dB；
Figure 16 is the image carried out after shearing attack to Fig. 7, and shearing accounting is 25%, the PSNR=relative to Fig. 7
7.4260dB；
Figure 17 is the secret information recovered by Figure 15, and the bit error rate EBR relative to Fig. 5 is 5.00%；
Figure 18 is the secret information recovered by Figure 16, and the bit error rate EBR relative to Fig. 5 is 48.12%；
Figure 19 is the image carried out after random character image substitution attack to Fig. 6, and replacement accounting is 20%, relative to Fig. 6
PSNR=20.5928dB；
Figure 20 is the secret information recovered by Figure 19, and the bit error rate EBR relative to Fig. 5 is 7.50%；
Figure 21 is the image carried out after blindage character substitution attack to Fig. 7, and replacement accounting is 10%, relative to Fig. 7's
PSNR=16.1410dB；
Figure 22 is the secret information recovered by Figure 21, and the bit error rate EBR relative to Fig. 5 is 7.80%；
Figure 23 is the secret information gone out to the key recovery of Fig. 6 mistake, and the bit error rate EBR relative to Fig. 5 is
47.50%；
Figure 24 is the secret information gone out to the key recovery of Fig. 7 mistake, and the bit error rate EBR relative to Fig. 5 is
49.06%.
Specific embodiment
Below using JAVA jdk1.8.0_65 as case implementation environment, embodiment of the present invention is carried out in conjunction with attached drawing detailed
Illustrate, but is not limited to the implementation case.
With reference to Fig. 1, the character of combination error of the present invention diffusion draw production camouflage method the following steps are included:
Step 1: 2 value secret bit sequence S=(s of inputi)l,si∈ { 0,1 } and resolution ratio are m0×n0R rank gray scale cover
Body imageti,j∈{0,1,…,2r- 1 }, code character image is generated using the character 0 and 1 of specified font size；
In step 1, the character 0 and 1 of specified font size is used to generate the specific operation process of code character image are as follows: using referring to
It is l that the character 0 and 1 for determining font size, which generates 2 width resolution ratio,1×l2Character picture A0,A1, wherein A0Correspond to the code pattern of 0 character
Picture, A1Correspond to the coded image of 1 character；
Such as: if the 2 value bit bit string S=(1,0) that input length is l=2, if taking m0=n0=2, r=8 can then be inputted
The 8 rank gray scale cover-images that one width resolution ratio is 2 × 2Wherein, t0,0=25, t0,1=136, t1,0=
255,t1,1=10 ∈ 0,1 ..., 2r- 1=255 }；Input the corresponding character 0 and 1 of small No. 5 words, it is assumed that take side length l1=10, it can
Generating 2 width resolution ratio is l1×l1=10 × 10 character picture A0,A1, wherein A0The coded image of 0 character is corresponded to, for example,A1The coded image of 1 character is corresponded to, such as
Step 2: by 2 τ parts of S backup of value secret bit sequences, as B=(bi)τ·l, by key k0Generate random coordinates sequence
Arrange Z, wherein Z=(zi=(xi,yi))τ·l,(xi,yi)∈m0×n0, and the coordinate two in random coordinates sequence Z is neither etc., by
Key k1Generate 2 value random reference matrixesci,j∈ { 0,1 }, and initialize blank image
In step 2, by τ parts of S backup, as B=(bi)τ·lSpecific operation process are as follows: by the sequentially connected result of τ S
As B；
In step 2, blank image is initializedThe constraint of satisfaction are as follows:
Such as: if τ=2,2 S=(1,0) are sequentially connected with, B=(1,0,1,0) is obtained；If taking τ=2, l=2, m0=n0
=2, then it can be by k0Generate length be 4 and 2 × 2 ranges of coordinate two neither etc. in random coordinates sequence Z, it is assumed that by key k0It produces
The length random coordinates sequence in 2 × 2 ranges that raw two neither wait is denoted as Z=((0,0), (0,1), (1,0), (1,1))；It takes
m0=n0=2, it can be by key k1Generate 2 value random reference Matrix Cs of 2 × 2 scales, it is assumed that by k0It generatesIf
Take l1=10, l2=10, then then have by formula (1): m2=m0·l1=20, n2=n0·l2=20, then can initialize resolution ratio is m2
×n2=20 × 20 blank image M=(mi,j=0)20×20。
Step 3: by r rank gray scale cover-imageti,j∈{0,1,…,2r- 1 } it is quantified as cover-imageti,j∈[0,1]；
In step 3, by r rank gray scale cover-imageti,j∈{0,1,…,2r- 1 } it is quantified as covering by formula (2)
Body imageti,j∈[0,1]；
Such as: r=8 is taken, by 8 rank gray scale cover-imagesKnown to: t0,0=25, t0,1=136, t1,0=
255,t1,1=10 ∈ { 0,1 ..., 255 }, by known to formula (2):
Step 4: pass through key k2By B=(bi)τ·lIt is encrypted as F=(fi)τ·l；
In step 4, pass through key k2By B=(bi)τ·lIt is encrypted as F=(fi)τ·lOperating process are as follows: by key k2Generate 2
It is worth Random number sequence R=(ri)τl, right back-pushed-type (4) is by B=(bi)τ·lIt is encrypted as F=(fi)τ·l；
Wherein, symbolIndicate exclusive or encryption.
Such as: it is assumed that by key k2It generates Random number sequence R=(1,1,0,1), then r0=1, r1=1, r2=0, r3=
1, wherein τ=2, l=2；Known by B=(1,0,1,0): b0=1, b1=0, b2=1, b3=0, then know by formula (4):
It can thus be concluded that F=(0,1,1,1).
Step 5: for cover-image T0In each elementAccording to F, Z and C, chooses character picture and be placed on sky
On white image M, the deviation that placement process is generated is spread to untreated pixel around；
In step 5, to cover-image T0In each elementAccording to F, Z and C, the concrete operations of character picture are chosen
Process are as follows:
For cover-image T0In each elementDynamic threshold t is determined by formula (3), calculates t by formula (6)x′,y, press
Formula (5) generates 2 value bit bcur；
Wherein, if (x, y) ∈ Z and corresponding to i-th of coordinate position in Z, from F=(fi)τ·lI-th of 2 value ratios of middle interception
Special fi, c is read from 2 value random reference Matrix Csx,y, then b is calculated by exclusive orcur；IfThen by tx′,yAs bcur；
In step 5, specific operation process that the deviation that placement process is generated is spread to untreated pixel around are as follows:
Error delta is calculated by formula (7)i,j, by error deltai,jT is distributed to by formula (8)i,jOn the pixel in 8 fields of surrounding；
Wherein, (x, y) ∈ { (i-1, j-1), (i-1, j), (i-1, j+1), (i, j-1), (i, j+1), (i+1, j-1), (i
+ 1, j), (i+1, j+1) }, NCFor ti,jThe valid pixel number of formula (6) processing is not pressed in 8 fields of surrounding, and Range (x, 0,1) is used for
[0,1] section is arrived into x quantization, if when x < 0, x=0；If when x > 1, x=1；If being then x when [0,1] x ∈.
Such as: it takesbcur=0, then it can be obtained by formula (7): Δ0,0=0.098-0=0.098；WhenWhen, with pixelExist for 8 neighborhood unprocessed pixels of center pixelIt is upper to only haveTherefore NC=3, then have by formula (8): SimultaneouslyIt is quantified as by formula (6)Cause
This is in subsequent processingShould all exclude toAny diffusion.
By formula (9) from character picture A0,A1Middle selection character picture D；
Such as: take (x0,y0)=(0,0), by t0′,0=0, bcur=0, then then have by formula (9)Therefore it selects
It takesAs D, D is placed on M=(mi,j=0)20×20In with (x0·l1,y0·l2)=(010,010)=(0,0)
For starting point, size l1×l2On=10 × 10 image block, obtainWherein, M is divided into 4 l1×l2=
10 × 10 fritter can place 4 l1×l2=10 × 10 image block.
In step 5, the specific operation process that the character picture D of selection is placed on blank image M are as follows: by the word of selection
Symbol image D is placed in blank image M with (xl1,y·l2) it is starting point, size l1×l2Image block on.
Step 6: repeating step 5, until cover-image T0In all elementsIt is disposed, M at this time is exported and is made
It is drawn for the character of generation.
In subsequent processing: withFor, by known to formula (6):ThereforeDue to Z=
((0,0), (0,1), (1,0), (1,1)), (0,1) ∈ Z and corresponds to the 1st coordinate position in Z, then from F=(0,1,1,1)
Intercept the 1st 2 value bit f1=1, fromMiddle reading c0,1=1, by known to formula (5):Right back-pushed-type (7): Δ0,1=0.565-1=-0.435, with pixelFor center pixel
8 neighborhood unprocessed pixels in T0It is upper to only haveTherefore NC=2, then then have by formula (8):SimultaneouslyFormula (6) quantization is pressed
ForTherefore subsequent processingWhen, should all exclude toAny diffusion；Due toThen then have by formula (9)Therefore it choosesAs D, (x is taken0,y0)=
D is placed on M=(m by (0,1)i,j=0)20×20In with (x0·l1,y0·l2)=(010,110)=(0,10) be starting point,
Size is l1×l2On=10 × 10 image block, then it can obtain
WithFor, by known to formula (6):ThereforeDue to Z=((0,0), (0,1), (1,
0), (1,1)), (1,0) ∈ Z and the 2nd coordinate position in Z is corresponded to, then intercepts the 2nd 2 value bits from F=(0,1,1,1)
f2=1, fromMiddle reading c1,0=1, know by formula (5):Right back-pushed-type (7):
Δ1,0=0.7825-1=-0.2175, with pixelFor center pixel 8 neighborhood unprocessed pixels in T0It is upper to only haveCause
This NC=1, then it is obtained by formula (8):SimultaneouslyIt is quantified as by formula (6)Therefore subsequent processingWhen, should all exclude toAny diffusion；Due toThen have by formula (9)Therefore it choosesAs D, (x is taken0,y0)=(1,
0) D, is placed on M=(mi,j=0)20×20In with (x0·l1,y0·l2)=(110,010)=(10,0) be starting point, big
Small is l1×l2On=10 × 10 image block, then it can be obtained
WithFor, by known to formula (6):ThereforeDue to Z=((0,0), (0,1), (1,0),
(1,1)), (1,1) ∈ Z and the 3rd coordinate position in Z is corresponded to, then intercepts the 3rd 2 value bit f from F=(0,1,1,1)3
=1, fromMiddle reading c1,1=1, by known to formula (5):Right back-pushed-type (7):
Δ1,1=0-0=0, with pixelFor center pixel 8 neighborhood unprocessed pixels in T0Upper no any element, therefore NC=0,
It does not need to be handled by formula (8)；Due toThen obtained by formula (9)Therefore it selects
It takesAs D, (x is taken0,y0)=(1,1), D is placed on M=(mi,j=0)20×20In with (x0·l1,y0·l2)=(1
10,110)=(10,10) are starting point, size l1×l2On=10 × 10 image block, then it can obtain
Due to all coordinates (0,0) (0,1) in 2 × 2 ranges, (1,0), (1,1) is all disposed, therefore will finally generate
Containing close blindage figureOutput.
In addition illustrate, in step 2, by key k0Generate the specific operation process of random coordinates sequence Z are as follows:
2.1) positive integer greater than 1 is chosen as k0；
2.2) formula (16) are pressed by k0It is mapped asAgain willIt changes as rr ∈ (0,1) by formula (17)
Generation, to generate rr ∈ (0,1)；
Wherein, IFF () is condition discriminant function, and the 1st parameter is Rule of judgment, and it is true that the 2nd parameter, which is Rule of judgment,
When calculated result, the 3rd parameter is the calculated result that Rule of judgment is fictitious time；SymbolTo be rounded downwards, max-1 () table
Show the maximum value of exclusion 1, min-0 () indicates to exclude 0 minimum value；
2.3) step 2.2) is iterated, to generate adjacent random number rr0,rr1, then by the adjacent random number of generation
rr0,rr1(x, y) ∈ m is quantified as by formula (18)0×n0；
2.4) step 2.2)-step 2.3) is repeated, until generating the m of preset quantity0×n0Random coordinates in range；
Such as: take k0=4, m0=2, n0=2 press formula (16) for k0It is mapped asAgain willAs rr ∈
(0,1) is iterated by formula (17), in which:
It is true
Therefore a random number rr=0.7660 can produce by formula (17).
Assuming that step 2.2) is iterated, generated adjacent random number rr0=0.7660, rr1=0.6254, it will
rr0,rr1It is quantified as by formula (18)Random coordinates can be obtained
(1,1).Step 2.2)-step 2.3) is repeated, can produce m0×n0Random coordinates random coordinates in=2 × 2 ranges, such as (1,
1), (0,1), (1,0), (0,0) etc..
In step 2, by key k1Generate 2 value random reference matrixesci,jThe concrete operations of ∈ { 0,1 }
Journey are as follows: choose the positive integer greater than 1 as k1, by formula (16) by k1It is mapped asThen willAs rr ∈
(0,1) is iterated by formula (17), to generate rr ∈ (0,1), then by the m of generation0n0A random number rri,j, i=0,1 ..., m0-
1, j=0,1 ..., n0- 1 is quantified as c by formula (19)i,j, to obtainci,j∈{0,1}；
Such as: take k1=4, m0=2, n0=2, by formula (16) by k1It is mapped asAgain willIt is pressed as rr
4 random numbers that formula (17) iteration generates are rr0,0=0.7660, rr0,1=0.6254, rr1,0=0.9396, rr1,1=
0.9892 is quantified as c by formula (19)0,0=1, c0,1=1, c1,0=1, c1,1=1, i.e.,
In step 4, by key k2Generate 2 value Random number sequence R=(ri)τlSpecific operation process are as follows: choose be greater than 1
Positive integer as k2, by formula (16) by k2It is mapped asAgain willIt is carried out as rr ∈ (0,1) by formula (17)
Iteration, to generate rr ∈ (0,1), by the τ l random number rr of generationi, i=0,1 ..., τ l-1 is quantified as r by formula (20)i,
To obtain R=(ri)τl；
Such as: take k2=4, τ=2, l=2 press formula (16) for k2It is mapped asAgain willFormula is pressed as rr
(17) 4 random number rr of generation are iterated0=0.7660, rr1=0.6254, rr2=0.9396, rr3=0.9892, then
R is quantified as by formula (20)0=1, r1=1, r2=1, r3=1, so that R=(1,1,1,1) can be obtained.
With reference to Fig. 2, the character of combination error of the present invention diffusion draw production restoration methods the following steps are included:
Step 1: the embedding close cover-image of inputKey k0,k1,k2And 2 value secret bit sequence length
L generates code character image using the character 0 and 1 of specified font size；
In step 1, the character 0 and 1 of specified font size is used to generate the specific operation process of code character image are as follows: using referring to
Determine font size character 0 and 1 to initialize 2 width resolution ratio to be l1×l2Character picture A0,A1；
Such as: if taking m2=n2=20, then it can input the embedding close cover-image that resolution ratio is 20 × 20
If taking key k0,k1,k2, the corresponding character 0 and 1 of small No. 5 words is inputted, side length l is taken1=l2=10, by 0 He of character of specified font size
1 is successively individually positioned in l1×l2In=10 × 10 square-shaped images, corresponding square-shaped image is exported, can produce the resolution of 2 width
The character picture that rate is 10 × 10
Step 2: by key k0Generate the random coordinates sequence Z that length is τ l, wherein Z=(zi=(xi,yi))τ·l,
(xi,yi)∈m0×n0, and the coordinate two in random coordinates sequence Z is neither etc., by key k1Generate 2 value random reference matrixesci,j∈{0,1}；
In step 2, the random reference matrix of generationci,jThe constraint that ∈ { 0,1 } meets are as follows:
Such as: if m2=n2=20, l1×l2=10 × 10, then according to formula (10): m0=n0=2；If taking τ=2, l
=2, m0=n0=2, then it can be by k0Generate length be 4 and 2 × 2 ranges of coordinate two neither etc. in random coordinates sequence Z, it is assumed that
By key k0Length random coordinates sequence of two generated neither in equal 2 × 2 ranges be denoted as Z=((0,0), (0,1), (1,
0), (1,1)), by key k1Generate 2 value random reference Matrix Cs of 2 × 2 scales, it is assumed that by k1It generates
Step 3: to each coordinate (x in random coordinates sequence Zi,yi), interception and coded word in embedding close cover-image M
The image block D for according with image equidimension, immediate code character image is chosen from code character image, extracts image block D
2 representative value bit bcur, then by 2 value bit bcurIt is decoded as 2 value bit fi；
In step 3, the concrete operations with the image block D of code character image equidimension are intercepted in embedding close cover-image M
Process are as follows: with (x in embedding close cover-image Mi·l1,yi·l2) it is upper left corner starting point, interception resolution ratio is l1×l2Image
Block D；
In step 3, the specific operation process of immediate code character image is chosen from code character image are as follows: press formula
(11) from A0,A1It is middle to choose immediate character picturebcur∈{0,1}；
In step 3, according to formula (12) by bcurIt is decoded as 2 value bit fi；
Such as: by key k0Length random coordinates sequence of two generated neither in equal 2 × 2 ranges be denoted as Z=((0,
0),(0,1),(1,0),(1,1))；By key k1Generate 2 value random reference matrixes of 2 × 2 scalesIf taking l1×
l2=10 × 10, (x0,y0) ∈ Z=(0,0), containing close blindage figureMiddle interception is with (x0·l1,y0·l2)=
(010,010)=(0,0) is starting point, size l1×l2=10 × 10 image block D can obtain image block D=by formula (11)
A0, i.e. bcur=0, fromMiddle reading c0,0=0, then it can be produced by formula (12)
Take (x1,y1) ∈ Z=(0,1), InMiddle interception is with (x1·l1,y1·l2)=(010,1
10)=(0,10) is starting point, size l1×l2=10 × 10 image block can obtain D=A by formula (11)0, bcur=0, fromMiddle reading c0,1=1, it is known that:
Take (x2,y2) ∈ Z=(1,0), InMiddle interception is with (x2·l1,y2·l2)=(110,0
10)=(10,0) are starting point, size l1×l2=10 × 10 image block can obtain D=A by formula (11)1, bcur=1, fromMiddle reading c1,0=0, it is known that:
Take (x3,y3) ∈ Z=(1,1), InMiddle interception is with (x3·l1,y3·l2)=(110,1
10)=(10,10) are starting point, size l1×l2=10 × 10 image block can obtain image block D=A by formula (11)0, bcur=
0, fromMiddle reading c1,1=1, it is known that:
Step 4: by all fi, i=0,1 ..., the sequence that τ l-1 is constituted is as F=(fi)τ·l, by key k2F is solved
Code is B=(bi)τ·l, B is divided into the 2 value secret bit sequences that τ length is l and is backed up
In step 4, by key k2Generate 2 value Random number sequence R=(ri)τ·l, F is decoded as B=by formula (13)
(bi)τ·l；
In step 4, B is divided into the 2 value secret bit sequences that τ length is l and is backed upSpecific operation process are as follows: successively intercepted length be l 2 value secret ratios
Special sequence, with construction
Such as: τ=2, l=2 are taken, then by f0=0, f1=1, f2=1, f3=1 can obtain: F=(0,1,1,1).If by key
k2It generates Random number sequence R=(1,1,0,1), i.e. r0=1, r1=1, r2=0, r3=1；From F=(0,1,1,1): f0
=0, f1=1, f2=1, f3=1, then by R=(1,1,0,1) and F=(0,1,1,1) by known to formula (13):
It obtains B=(1,0,1,0).Due to τ=2, l=2, B is divided into the 2 value secret bit sequence backup S that 2 length are 20=(1,
0),S1=(1,0).
Step 5: by S0,S1,…,Sτ-1Extract secret information S and identification sequences E.
In step 5, by S0,S1,…,Sτ-1Extract the specific operation process of secret information S and identification sequences E are as follows: according to S0,
S1,…,Sτ-1The element of corresponding positionCalculate 2 value secret bit siAnd siAuthentication value ei, by si, i=0,1 ...,
L-1 is as the secret information S extracted, by ei, i=0,1 ..., l-1 is as corresponding identification sequences E.
In step 5, according to S0,S1,…,Sτ-1The element of corresponding positionCalculate 2 value secret bit siAnd si's
Authentication value eiDetailed process are as follows:
1) it countsIn for 0 and be 1 quantity N0And N1；
2) s is calculated by formula (14)i；
Wherein, rand (2) be used to generate [0,2) random number in range, symbolFor being rounded downwards,
For the random number of 0 or 1 to be randomly generated；
3) e is calculated by formula (15)i；
Such as: assuming that S0=(1,0), S1=(1,0), it is known thatTherefore N0=0, N1=2, by formula (14)
Know: N0<N1,s0=1,Middle N0=2, N1=0, from formula (14): N0>N1,s1=0, therefore S=(1,0)；
By known to formula (15): whenWhen, N1=2=τ, from formula (15): e0=1；WhenWhen, N0=2
=τ, from formula (15): e1=1；Therefore E=(1,1).
In step 2, by key k0Generate the specific operation process of random coordinates sequence Z are as follows:
2.1) positive integer greater than 1 is chosen as k0；
2.2) formula (16) are pressed by k0It is mapped asAgain willIt changes as rr ∈ (0,1) by formula (17)
Generation, to generate rr ∈ (0,1)；
Wherein, IFF () is condition discriminant function, and the 1st parameter is Rule of judgment, and it is true that the 2nd parameter, which is Rule of judgment,
When calculated result, the 3rd parameter is the calculated result that Rule of judgment is fictitious time；SymbolTo be rounded downwards；Max-1 () table
Show the maximum value of exclusion 1, min-0 () indicates to exclude 0 minimum value；
2.3) step 2.2) is iterated, to generate adjacent random number rr0,rr1, then by the adjacent random number of generation
rr0,rr1(x, y) ∈ m is quantified as by formula (18)0×n0；
2.4) step 2.2)-step 2.3) is repeated, until generating the m of preset quantity0×n0Random coordinates in range；
Such as: take k0=4, m0=2, n0=2 press formula (16) for k0It is mapped asAgain willAs rr ∈
(0,1) is iterated by formula (17), in which:
It is true
Therefore a random number rr=0.7660 can produce by formula (17).
Assuming that step 2.2) is iterated, generated adjacent random number rr0=0.7660, rr1=0.6254, it will
rr0,rr1It is quantified as by formula (18)Random coordinates can be obtained
(1,1).Step 2.2)-step 2.3) is repeated, can produce m0×n0Random coordinates random coordinates in=2 × 2 ranges, such as (1,
1), (0,1), (1,0), (0,0) etc..
In step 2, by key k1Generate 2 value random reference matrixesci,jThe concrete operations of ∈ { 0,1 }
Journey are as follows: choose the positive integer greater than 1 as k1, by formula (16) by k1It is mapped asThen willAs rr ∈
(0,1) is iterated by formula (17), to generate rr ∈ (0,1), by the m of generation0n0A random number rri,j,(i,j)∈m0×n0It presses
Formula (19) is quantified as ci,j, to obtainci,j∈{0,1}；
Such as: take k1=4, m0=2, n0=2, by formula (16) by k1It is mapped asAgain willIt is pressed as rr
4 random numbers that formula (17) iteration generates are rr0,0=0.7660, rr0,1=0.6254, rr1,0=0.9396, rr1,1=
0.9892 is quantified as c by formula (19)0,0=1, c0,1=1, c1,0=1, c1,1=1, i.e.,
In step 4, by key k2Generate 2 value Random number sequence R=(ri)τlSpecific operation process are as follows: choose be greater than 1
Positive integer as k2, by formula (16) by k2It is mapped asAgain willIt is carried out as rr ∈ (0,1) by formula (17)
Iteration, to generate rr ∈ (0,1), by the τ l random number rr of generationi, i=0,1 ..., τ l-1 is quantified as r by formula (20)i,
To obtain R=(ri)τl；
Such as: take k2=4, τ=2, l=2 press formula (16) for k2It is mapped asAgain willFormula is pressed as rr
(17) it is iterated, generated 4 random number rr0=0.7660, rr1=0.6254, rr2=0.9396, rr3=0.9892, it presses
Formula (20) can be quantified as r0=1, r1=1, r2=1, r3=1, so that R=(1,1,1,1) can be obtained.
Fig. 3 is cover-image, is 8 rank gray level image camera of 64 × 64 resolution ratio；Fig. 4 is cover-image, be 64 ×
8 rank gray level image cameraman of 64 resolution ratio；Fig. 5 is secret information, the ancient poetry " quiet night thinks " comprising 20 Chinese characters,
Scanned the 2 value bit sequences for 2 value bit sequences as insertion.
Fig. 6 is using Fig. 5 as the embedding close carrier 1 of secret information；Fig. 7 is using Fig. 5 as the embedding close carrier 2 of secret information；Fig. 8 is
The secret information recovered by Fig. 6 and Fig. 7, the bit error rate EBR relative to Fig. 5 are 0%.
Fig. 9 is that the image after salt-pepper noise attack is carried out to Fig. 6, and taking noise intensity is 25%, the PSNR=relative to Fig. 6
12.2107dB；Figure 10 is that the image after salt-pepper noise attack is carried out to Fig. 7, and taking noise intensity is 10%, relative to Fig. 7's
PSNR=15.9304dB；Figure 11 is the secret information recovered by Fig. 9~Figure 10；Bit error rate EBR relative to Fig. 5 is 0%；
Figure 12 is that the image after JPEG compression attack, quality factor 80, the PSNR=32.3513dB relative to Fig. 6 are carried out to Fig. 6；
Figure 13 is that the image after JPEG compression attack, quality factor 60, the PSNR=25.4144dB relative to Fig. 7 are carried out to Fig. 7；
Figure 14 is the secret information recovered by Figure 12~Figure 13, and the bit error rate EBR relative to Fig. 5 is 0%.
Figure 15 is the image carried out after shearing attack to Fig. 6, and shearing accounting is 10%, the PSNR=relative to Fig. 6
11.3272dB；Figure 16 is the image carried out after shearing attack to Fig. 7, and shearing accounting is 25%, the PSNR=relative to Fig. 7
7.4260dB；Figure 17 is the secret information recovered by Figure 15, and the bit error rate EBR relative to Fig. 5 is 5.00%；Figure 18 is by scheming
16 secret informations recovered, the bit error rate EBR relative to Fig. 5 are 48.12%；Figure 19 is to carry out random character image to Fig. 6
Image after substitution attack, replacement accounting are 20%, the PSNR=20.5928dB relative to Fig. 6；Figure 20 is to be recovered by Figure 19
Secret information, relative to Fig. 5 bit error rate EBR be 7.50%；Figure 21 is the figure carried out after blindage character substitution attack to Fig. 7
Picture, replacement accounting are 10%, the PSNR=16.1410dB relative to Fig. 7；Figure 22 is the secret information recovered by Figure 21, phase
Bit error rate EBR for Fig. 5 is 7.80%；Figure 23 is the secret information gone out to the key recovery of Fig. 6 mistake, relative to Fig. 5
Bit error rate EBR be 47.50%；Figure 24 is the secret information gone out to the key recovery of Fig. 7 mistake, the error code relative to Fig. 5
Rate EBR is 49.06%.
Claims (10)
1. a kind of character of combination error diffusion draws production camouflage method, which comprises the following steps:
Step 1: 2 value secret bit sequence S=(s of inputi)l,si∈ { 0,1 } and resolution ratio are m0×n0R rank gray scale blindage figure
PictureCode character image is generated using the character 0 and 1 of specified font size；
Step 2: by 2 τ parts of S backup of value secret bit sequences, as B=(bi)τ·l, by key k0Random coordinates sequence Z is generated,
In, Z=(zi=(xi,yi))τ·l,(xi,yi)∈m0×n0, and the coordinate two in random coordinates sequence Z is neither etc., by key k1
Generate 2 value random reference matrixesAnd initialize blank image
Step 3: by r rank gray scale cover-imageIt is quantified as cover-image
Step 4: pass through key k2By B=(bi)τ·lIt is encrypted as F=(fi)τ·l；
Step 5: for cover-image T0In each elementAccording to F, Z and C, chooses character picture and be placed on blank sheet
As the deviation that on M, placement process is generated is spread to untreated pixel around；
Step 6: repeating step 5, until cover-image T0In all elementsIt is disposed, by M output at this time as life
At character draw.
2. drawing production camouflage method in conjunction with the character of error diffusion as described in claim 1, which is characterized in that in step 1,
The specific operation process of code character image is generated using the character 0 and 1 of specified font size are as follows: use the character 0 and 1 of specified font size
Generating 2 width resolution ratio is l1×l2Character picture A0,A1, wherein A0Correspond to the coded image of 0 character, A1Correspond to 1 character
Coded image；
In step 2, by τ parts of S backup, as B=(bi)τ·lSpecific operation process are as follows: using the sequentially connected result of τ S as
B；
In step 2, blank image is initializedThe constraint of satisfaction are as follows:
In step 4, pass through key k2By B=(bi)τ·lIt is encrypted as F=(fi)τ·lOperating process are as follows: by key k2Generate 2 values with
Machine integer sequence R=(ri)τl, right back-pushed-type (4) is by B=(bi)τ·lIt is encrypted as F=(fi)τ·l；
Wherein, symbolIndicate exclusive or encryption.
3. drawing production camouflage method in conjunction with the character of error diffusion as claimed in claim 2, which is characterized in that in step 3,
By r rank gray scale cover-imageCover-image is quantified as by formula (2)
In step 5, to cover-image T0In each elementAccording to F, Z and C, the specific operation process of character picture is chosen
Are as follows:
5.1) for cover-image T0In each elementDynamic threshold t is determined by formula (3), calculates t ' by formula (6)x,y, press
Formula (5) generates 2 value bit bcur；
Wherein, if (x, y) ∈ Z and corresponding to i-th of coordinate position in Z, from F=(fi)τ·lI-th of 2 value bit f of middle interceptioni,
C is read from 2 value random reference Matrix Csx,y, then b is calculated by exclusive orcur；IfThen by t 'x,yAs bcur；
5.2) formula (9) are pressed from character picture A0,A1Middle selection character picture D；
In step 5, the specific operation process that the character picture D of selection is placed on blank image M are as follows: by the character figure of selection
As D is placed in blank image M with (xl1,y·l2) it is starting point, size l1×l2Image block on.
4. drawing production camouflage method in conjunction with the character of error diffusion as claimed in claim 3, which is characterized in that in step 5,
Specific operation process of the deviation that placement process is generated to untreated pixel diffusion around are as follows:
Error delta is calculated by formula (7)i,j, by error deltai,jT is distributed to by formula (8)i,jOn the pixel in 8 fields of surrounding；
Wherein, (x, y) ∈ (i-1, j-1), (i-1, j), (i-1, j+1), (i, j-1), (i, j+1), (i+1, j-1), (i+1,
J), (i+1, j+1) }, NCFor ti,jThe valid pixel number of formula (6) processing is not pressed in 8 fields of surrounding, and Range (x, 0,1) is used for x
Quantify to [0,1] section, if when x < 0, x=0；If when x > 1, x=1；If being then x when [0,1] x ∈.
5. drawing production camouflage method in conjunction with the character of error diffusion as claimed in claim 2, which is characterized in that
In step 2, by key k0Generate the specific operation process of random coordinates sequence Z are as follows:
2.1) positive integer greater than 1 is chosen as k0；
2.2) formula (16) are pressed by k0It is mapped asAgain willIt is iterated as rr ∈ (0,1) by formula (17), with
It generates rr ∈ (0,1)；
Wherein, IFF () is condition discriminant function, and the 1st parameter is Rule of judgment, and the 2nd parameter is Rule of judgment when being true
Calculated result, the 3rd parameter are the calculated result that Rule of judgment is fictitious time；SymbolTo be rounded downwards, max-1 () indicates row
Except 1 maximum value, min-0 () indicates to exclude 0 minimum value；
2.3) step 2.2) is iterated, to generate adjacent random number rr0,rr1, then by the adjacent random number rr of generation0,
rr1(x, y) ∈ m is quantified as by formula (18)0×n0；
2.4) step 2.2- step 2.3) is repeated, until generating the m of preset quantity0×n0Random coordinates in range；
In step 2, by key k1Generate 2 value random reference matrixesSpecific operation process are as follows:
The positive integer greater than 1 is chosen as k1, by formula (16) by k1It is mapped asThen willAs rr ∈ (0,1)
It is iterated by formula (17), to generate rr ∈ (0,1), then by the m of generation0n0A random number rri,j, i=0,1 ..., m0- 1, j=
0,1,…,n0- 1 is quantified as c by formula (19)i,j, to obtain
In step 4, by key k2Generate 2 value Random number sequence R=(ri)τlSpecific operation process are as follows: choose and be greater than 1 just
Integer is as k2, by formula (16) by k2It is mapped asAgain willIt changes as rr ∈ (0,1) by formula (17)
Generation, to generate rr ∈ (0,1), by the τ l random number rr of generationi, i=0,1 ..., τ l-1 is quantified as r by formula (20)i, from
And obtain R=(ri)τl；
6. a kind of character of combination error diffusion draws production restoration methods, which comprises the following steps:
Step 1: the embedding close cover-image of inputKey k0,k1,k2And 2 value secret bit sequence length l, make
Code character image is generated with the character 0 and 1 of specified font size；
Step 2: by key k0Generate the random coordinates sequence Z that length is τ l, wherein Z=(zi=(xi,yi))τ·l,(xi,yi)
∈m0×n0, and the coordinate two in random coordinates sequence Z is neither etc., by key k1Generate 2 value random reference matrixes
Step 3: to each coordinate (x in random coordinates sequence Zi,yi), interception and code character figure in embedding close cover-image M
As the image block D of equidimension, immediate code character image is chosen from code character image, extracts image block D institute's generation
2 value bit b of tablecur, then by 2 value bit bcurIt is decoded as 2 value bit fi；
Step 4: by all fi, i=0,1 ..., the sequence that τ l-1 is constituted is as F=(fi)τ·l, by key k2F is decoded as
B=(bi)τ·l, B is divided into the 2 value secret bit sequences that τ length is l and is backed up
Step 5: by S0,S1,…,Sτ-1Extract secret information S and identification sequences E.
7. drawing production restoration methods in conjunction with the character of error diffusion as claimed in claim 6, which is characterized in that in step 1,
The specific operation process of code character image is generated using the character 0 and 1 of specified font size are as follows: using at the beginning of designated word sign character 0 and 1
2 width resolution ratio of beginningization is l1×l2Character picture A0,A1；
In step 2, the random reference matrix of generationThe constraint of satisfaction are as follows:
In step 3, according to formula (12) by bcurIt is decoded as 2 value bit fi；
In step 4, by key k2Generate 2 value Random number sequence R=(ri)τ·l, F is decoded as B=(b by formula (13)i)τ·l；
8. drawing production restoration methods in conjunction with the character of error diffusion as claimed in claim 7, which is characterized in that in step 3,
The specific operation process with the image block D of code character image equidimension is intercepted in embedding close cover-image M are as follows: in embedding close blindage
With (x in image Mi·l1,yi·l2) it is upper left corner starting point, interception resolution ratio is l1×l2Image block D；
In step 3, the specific operation process of immediate code character image is chosen from code character image are as follows: press formula (11)
From A0,A1It is middle to choose immediate character picture
In step 4, B is divided into the 2 value secret bit sequences that τ length is l and is backed upSpecific operation process are as follows: successively intercepted length be l 2 value secret ratios
Special sequence, with construction
In step 5, by S0,S1,…,Sτ-1Extract the specific operation process of secret information S and identification sequences E are as follows: according to S0,
S1,…,Sτ-1The element of corresponding positionCalculate 2 value secret bit siAnd siAuthentication value ei, by si, i=0,
1 ..., l-1 are as the secret information S extracted, by ei, i=0,1 ..., l-1 is as corresponding identification sequences E.
9. drawing production restoration methods in conjunction with the character of error diffusion as claimed in claim 8, which is characterized in that in step 5,
According to S0,S1,…,Sτ-1The element of corresponding positionCalculate 2 value secret bit siAnd siAuthentication value eiIt is specific
Process are as follows:
1) it countsIn for 0 and be 1 quantity N0And N1；
2) s is calculated by formula (14)i；
Wherein, rand (2) be used to generate [0,2) random number in range, symbolFor being rounded downwards,For with
Machine generates 0 or 1 random number；
3) e is calculated by formula (15)i；
10. drawing production restoration methods in conjunction with the character of error diffusion as claimed in claim 7, which is characterized in that
In step 2, by key k0Generate the specific operation process of random coordinates sequence Z are as follows:
2.1) positive integer greater than 1 is chosen as k0；
2.2) formula (16) are pressed by k0It is mapped asAgain willIt is iterated as rr ∈ (0,1) by formula (17), with
It generates rr ∈ (0,1)；
Wherein, IFF () is condition discriminant function, and the 1st parameter is Rule of judgment, and the 2nd parameter is Rule of judgment when being true
Calculated result, the 3rd parameter are the calculated result that Rule of judgment is fictitious time；SymbolTo be rounded downwards；Max-1 () indicates row
Except 1 maximum value, min-0 () indicates to exclude 0 minimum value；
2.3) step 2.2) is iterated, to generate adjacent random number rr0,rr1, then by the adjacent random number rr of generation0,
rr1(x, y) ∈ m is quantified as by formula (18)0×n0；
2.4) step 2.2)-step 2.3) is repeated, until generating the m of preset quantity0×n0Random coordinates in range；
In step 2, by key k1Generate 2 value random reference matrixesSpecific operation process are as follows:
The positive integer greater than 1 is chosen as k1, by formula (16) by k1It is mapped asThen willAs rr ∈ (0,1)
It is iterated by formula (17), to generate rr ∈ (0,1), by the m of generation0n0A random number rri,j, i=0,1 ..., m0- 1, j=0,
1,…,n0- 1 is quantified as c by formula (19)i,j, to obtain
In step 4, by key k2Generate 2 value Random number sequence R=(ri)τlSpecific operation process are as follows: choose and be greater than 1 just
Integer is as k2, by formula (16) by k2It is mapped asAgain willIt changes as rr ∈ (0,1) by formula (17)
Generation, to generate rr ∈ (0,1), by the τ l random number rr of generationi, i=0,1 ..., τ l-1 is quantified as r by formula (20)i, from
And obtain R=(ri)τl；
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910712471.8A CN110417551B (en) | 2019-08-02 | 2019-08-02 | Character and picture generation type camouflage and recovery method combined with error diffusion |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910712471.8A CN110417551B (en) | 2019-08-02 | 2019-08-02 | Character and picture generation type camouflage and recovery method combined with error diffusion |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110417551A true CN110417551A (en) | 2019-11-05 |
| CN110417551B CN110417551B (en) | 2022-03-01 |
Family
ID=68365573
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910712471.8A Active CN110417551B (en) | 2019-08-02 | 2019-08-02 | Character and picture generation type camouflage and recovery method combined with error diffusion |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110417551B (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112288617A (en) * | 2020-10-28 | 2021-01-29 | 陕西师范大学 | Mosaic puzzle-based information hiding and restoring method, equipment and medium |
| CN113160028A (en) * | 2021-02-24 | 2021-07-23 | 陕西师范大学 | Information hiding and recovering method and equipment based on colorful character picture and storage medium |
| CN112288617B (en) * | 2020-10-28 | 2024-04-26 | 陕西师范大学 | Information hiding and recovering method, equipment and medium based on mosaic jigsaw |
Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2010046104A2 (en) * | 2008-10-23 | 2010-04-29 | University Of Ulster | An encryption method |
| CN101847251A (en) * | 2010-06-13 | 2010-09-29 | 电子科技大学 | Digital watermark embedding and extraction method based on chaos sequences |
| CN102509058A (en) * | 2011-11-04 | 2012-06-20 | 南京师范大学 | Point type GIS vector data disguise and recovery method based on redundant bit replacement |
| CN104348611A (en) * | 2013-08-06 | 2015-02-11 | 珠海市金邦达保密卡有限公司 | Camouflage encryption method fusing file in image |
| US9639912B2 (en) * | 2014-12-30 | 2017-05-02 | University Of Macau | Method for reversible image data hiding |
| US9905021B2 (en) * | 2014-04-16 | 2018-02-27 | Siemens Aktiengesellschaft | Processing imaging data |
| US20180103050A1 (en) * | 2016-10-11 | 2018-04-12 | Salesforce.Com, Inc. | Authentication of client devices using modified images |
| CN108648133A (en) * | 2018-05-11 | 2018-10-12 | 陕西师范大学 | A kind of rotation of combined block and mosaic without embedded camouflage method |
| CN108717683A (en) * | 2018-05-16 | 2018-10-30 | 陕西师范大学 | A kind of close figure camouflage restoration methods of combination key and random orthogonal tensor base |
| CN109447886A (en) * | 2018-10-08 | 2019-03-08 | 陕西师范大学 | In conjunction with EMD-21The band of insertion restores the close figure separate-management method of multichip carrier |
-
2019
- 2019-08-02 CN CN201910712471.8A patent/CN110417551B/en active Active
Patent Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2010046104A2 (en) * | 2008-10-23 | 2010-04-29 | University Of Ulster | An encryption method |
| CN101847251A (en) * | 2010-06-13 | 2010-09-29 | 电子科技大学 | Digital watermark embedding and extraction method based on chaos sequences |
| CN102509058A (en) * | 2011-11-04 | 2012-06-20 | 南京师范大学 | Point type GIS vector data disguise and recovery method based on redundant bit replacement |
| CN104348611A (en) * | 2013-08-06 | 2015-02-11 | 珠海市金邦达保密卡有限公司 | Camouflage encryption method fusing file in image |
| US9905021B2 (en) * | 2014-04-16 | 2018-02-27 | Siemens Aktiengesellschaft | Processing imaging data |
| US9639912B2 (en) * | 2014-12-30 | 2017-05-02 | University Of Macau | Method for reversible image data hiding |
| US20180103050A1 (en) * | 2016-10-11 | 2018-04-12 | Salesforce.Com, Inc. | Authentication of client devices using modified images |
| CN108648133A (en) * | 2018-05-11 | 2018-10-12 | 陕西师范大学 | A kind of rotation of combined block and mosaic without embedded camouflage method |
| CN108717683A (en) * | 2018-05-16 | 2018-10-30 | 陕西师范大学 | A kind of close figure camouflage restoration methods of combination key and random orthogonal tensor base |
| CN109447886A (en) * | 2018-10-08 | 2019-03-08 | 陕西师范大学 | In conjunction with EMD-21The band of insertion restores the close figure separate-management method of multichip carrier |
Non-Patent Citations (2)
| Title |
|---|
| KUANG TSAN LIN: ""Data Encrypting in a Binary Image Base on Modified Data Hiding Method"", 《2011 SEVENTH INTERNATIONAL CONFERENCE ON INTELLIGENT INFORMATION HIDING AND MULTIMEDIA SIGNAL PROCESSING》 * |
| 郭毅 等: ""基于约瑟夫和Henon映射的比特位图像加密算法"", 《计算机应用研究》 * |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112288617A (en) * | 2020-10-28 | 2021-01-29 | 陕西师范大学 | Mosaic puzzle-based information hiding and restoring method, equipment and medium |
| CN112288617B (en) * | 2020-10-28 | 2024-04-26 | 陕西师范大学 | Information hiding and recovering method, equipment and medium based on mosaic jigsaw |
| CN113160028A (en) * | 2021-02-24 | 2021-07-23 | 陕西师范大学 | Information hiding and recovering method and equipment based on colorful character picture and storage medium |
| CN113160028B (en) * | 2021-02-24 | 2023-03-24 | 陕西师范大学 | Information hiding and recovering method and equipment based on colorful character picture and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110417551B (en) | 2022-03-01 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Yu | Attention based data hiding with generative adversarial networks | |
| Cao et al. | High capacity reversible data hiding in encrypted images by patch-level sparse representation | |
| Zhang et al. | Reference sharing mechanism for watermark self-embedding | |
| Muhammad et al. | A secure method for color image steganography using gray-level modification and multi-level encryption | |
| Saha et al. | Steganographic techniques of data hiding using digital images | |
| CN108648133B (en) | Non-embedded camouflage method combining block rotation and mosaic | |
| CN110430336B (en) | Method, apparatus and storage medium for image hiding and restoring | |
| Rawat et al. | Steganography technique for hiding text information in color image using improved LSB method | |
| CN110475038B (en) | Character and picture generating type hiding and recovering method combined with minimum closure coding | |
| CN110430337A (en) | Method, equipment and the storage medium that image camouflage and image restore | |
| CN110417551A (en) | A kind of the character picture production camouflage and restoration methods of the diffusion of combination error | |
| Fei et al. | A reversible watermark scheme for 2D vector map based on reversible contrast mapping | |
| Lu et al. | Multipurpose image watermarking method based on mean-removed vector quantization | |
| Almola et al. | Robust method for embedding an image inside cover image based on least significant bit steganography | |
| Liu et al. | A fake threshold visual cryptography of QR code | |
| Ramalingam et al. | A steganography approach for sequential data encoding and decoding in video images | |
| Satar et al. | A new model for hiding text in an image using logical connective | |
| Wang et al. | A novel (n, n) secret image sharing scheme based on Sudoku | |
| Tsai et al. | A Steganographic Method by Pixel–Value Differencing and Exploiting Modification Direction | |
| CN111147686A (en) | Video and image content tracking method and system based on steganographic information | |
| Cai et al. | A multiple watermarks algorithm for image content authentication | |
| CN110740226A (en) | Optical image encryption method based on data container and phase iterative recovery process | |
| Gupta et al. | A survey on reversible watermarking techniques for image security | |
| CN114065245B (en) | Fractal information hiding/recovering method and system based on local micro-domain variable precision | |
| Xia et al. | Perceptual image hashing using rotation invariant uniform local binary patterns and color feature |
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 |