CN110430335A - A kind of method, equipment and the storage medium of information disguising and recovery - Google Patents
A kind of method, equipment and the storage medium of information disguising and recovery Download PDFInfo
- Publication number
- CN110430335A CN110430335A CN201910711927.9A CN201910711927A CN110430335A CN 110430335 A CN110430335 A CN 110430335A CN 201910711927 A CN201910711927 A CN 201910711927A CN 110430335 A CN110430335 A CN 110430335A
- Authority
- CN
- China
- Prior art keywords
- bit
- value
- sequence
- key
- formula
- 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
- 238000000034 method Methods 0.000 title claims abstract description 87
- 238000011084 recovery Methods 0.000 title abstract description 4
- 239000000284 extract Substances 0.000 claims abstract description 7
- 238000004590 computer program Methods 0.000 claims description 23
- 230000006870 function Effects 0.000 claims description 11
- 238000013507 mapping Methods 0.000 claims description 6
- NAWXUBYGYWOOIX-SFHVURJKSA-N (2s)-2-[[4-[2-(2,4-diaminoquinazolin-6-yl)ethyl]benzoyl]amino]-4-methylidenepentanedioic acid Chemical compound C1=CC2=NC(N)=NC(N)=C2C=C1CCC1=CC=C(C(=O)N[C@@H](CC(=C)C(O)=O)C(O)=O)C=C1 NAWXUBYGYWOOIX-SFHVURJKSA-N 0.000 claims description 4
- 238000012546 transfer Methods 0.000 claims description 4
- 241001577299 Vindex Species 0.000 claims description 3
- 229940116024 aftera Drugs 0.000 claims description 3
- 241000208340 Araliaceae Species 0.000 claims 1
- 235000005035 Panax pseudoginseng ssp. pseudoginseng Nutrition 0.000 claims 1
- 235000003140 Panax quinquefolius Nutrition 0.000 claims 1
- 235000008434 ginseng Nutrition 0.000 claims 1
- 230000015572 biosynthetic process Effects 0.000 abstract description 13
- 238000003786 synthesis reaction Methods 0.000 abstract description 13
- 230000008569 process Effects 0.000 abstract description 9
- 238000000605 extraction Methods 0.000 abstract description 5
- 238000007796 conventional method Methods 0.000 abstract 1
- 238000004422 calculation algorithm Methods 0.000 description 5
- 238000003780 insertion Methods 0.000 description 5
- 230000037431 insertion Effects 0.000 description 5
- 238000012545 processing Methods 0.000 description 5
- 230000005540 biological transmission Effects 0.000 description 4
- 238000004519 manufacturing process Methods 0.000 description 3
- 239000007787 solid Substances 0.000 description 3
- 230000008901 benefit Effects 0.000 description 2
- 238000004364 calculation method Methods 0.000 description 2
- 238000006243 chemical reaction Methods 0.000 description 2
- 238000011161 development Methods 0.000 description 2
- 230000018109 developmental process Effects 0.000 description 2
- 230000006872 improvement Effects 0.000 description 2
- 238000010189 synthetic method Methods 0.000 description 2
- 230000000007 visual effect Effects 0.000 description 2
- 230000003044 adaptive effect Effects 0.000 description 1
- 239000003086 colorant Substances 0.000 description 1
- 238000004891 communication Methods 0.000 description 1
- 238000010276 construction Methods 0.000 description 1
- 230000002452 interceptive effect Effects 0.000 description 1
- 238000007726 management method Methods 0.000 description 1
- 239000011159 matrix material Substances 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 230000002441 reversible effect Effects 0.000 description 1
- 230000011218 segmentation Effects 0.000 description 1
- 239000004065 semiconductor Substances 0.000 description 1
- 238000010008 shearing Methods 0.000 description 1
- XLYOFNOQVPJJNP-UHFFFAOYSA-N water Substances O XLYOFNOQVPJJNP-UHFFFAOYSA-N 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T7/00—Image analysis
- G06T7/90—Determination of colour characteristics
-
- 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
-
- 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/44—Secrecy systems
- H04N1/448—Rendering the image unintelligible, e.g. scrambling
- H04N1/4486—Rendering the image unintelligible, e.g. scrambling using digital data encryption
Abstract
The invention belongs to image information safety and digital image signal process crossing domain, disclose method, equipment and the storage medium of a kind of information disguising and recovery.In camouflage, secret information the coordinate in key image is encoded to first to transmit to avoid the direct channels of secret information, secondly prepare more part is introduced, coordinate points are further encoded to the high frequency colour sequential for providing sample image and by key pseudo-random placement on blank texture image to be synthesized, finally generate image containing close grain by point texture generation strategy pixel-by-pixel.When restoring, according to cipher key-extraction colour sequential, coordinate is restored by sample image then in conjunction with the interval extension strategy of prepare more part and extracts secret information according to key image.Compared with the conventional method, this method carries out textures synthesis by point pixel-by-pixel, will not leave behind apparent splicing trace and repeat pattern, and secret information places one's entire reliance upon key, has certain anti-attack ability and higher safety.
Description
Technical field
The invention belongs to image information safety and digital image signal process crossing domain, it is related to a kind of information disguising and extensive
Multiple method, equipment and storage medium.
Background technique
With the development of internet, more and more information are bringing the same of great convenience by network transmission
When, there is also certain security risks.For the safety of secret information in protection transmission, it has been proposed that hiding secret letter with image
Breath, for example, being directed to the document of secret writing: Mao Ping Hua, 2019 (Mao Ping Hua, Wang Zichi, Zhang Xinpeng are based on the non-right of DCT domain correlation
Claim JPEG steganography [J] computer science, 2019,46 (01): 203-207.)；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.) and Zhang Yang, 2018 (
Ocean, Shao Liping, Ren Pingan exempt from base vector EMD (n, m) model and its application [J] CAD on Image Steganographic
With graphics journal, 2018,30 (8): 1490-1504.)；For point document deposited: Ou Yangxianbin, 2017 (Ou Yangxianbin, Shaos
Benefit is flat, and the non-equivalent backup of Le Zhifang and double certification limited area images of selfreparing point deposit [J] Journal of Software, 2017,12 (28):
3306-3346.) He Huangyan swallow, 2018 (Huang Yanyan, Shao Liping combination EMD-clClose figure separate-management method [J] of the multichip carrier of insertion
Journal of Image and Graphics, 2018,23 (8): 1108-1130.) on.But the essence of these methods is all traditional modification formula insertion
Information concealing method, carrier image need to be modified, embedding close carrier visual quality can be affected greatly, easily cause attacker
Suspection.
Such issues that avoid, there has been proposed texture production carrier-free Information hidings, it mainly includes texture structure
Formula Information hiding and the spliced Information hiding of texture.Wherein texture structure formula Information hiding is in such a way that analog texture generates
Some class natural textures are generated, such as: QIAN Z X, 2018 (QIAN Z X, PAN L, LI S, ZHANG X
P.Steganography by constructing marbling texture [C] // the // 2018China
Information Hiding Workshop (CIHW2018), Guang Zhou, 2018:17-35.)；Pan Lin, 2016 (Pan Lin,
Money development, steganography [J] the applied science journal of Zhang Xinpeng based on construction texture image, 2016,34 (5): 625-632.)
With XU J, 2015 (XU J, MAO X, JIN X, et al.Hidden message in a deformation-based
Texture [J] .Visual Computer International Journal of Computer Graphics, 2015,31
(12): 1653-1669.) etc., such methods are all to draw texture by generating class water shadow to hide secret information, but generated
Texture is all non-natural texture, to cannot effectively be covered to secret information.
Spliced hide of texture derives from OTORI H, 2007 (OTORI H, KURIYAMA S.Data- earliest
Embeddable texture synthesis [C] //International Symposium on Smart Graphics,
Kyoto, Japan, 2007:146-157.) and OTORI H, 2009 (OTORI H, KURIYAMA S.Texture synthesis
For mobile data communications [J] .IEEE Computer Graphics and Applications,
2009,29 (6): 74-81.), such methods are by way of sample texture padding come the local binary mould to expression secret information
Formula pixel is covered, but due to that cannot cover well to local binary patterns, thus the person that easily causes steganalysis
Suspection and cause secret information to be revealed.To avoid this problem, WU C, 2015 (WU C, WANG C M.Steganography
Using reversible texture synthesis [J] .Transactions on Image Processing, 2015,
24 (1): 130-139.)；QIN Z C, 2017 (QIN Z C, LI M, WU B.Robust steganography via
patch-based texture synthesis[C]//International Conference on Internet
Multimedia Computing and Service.Springer, Singapore, 2017:429-439.) and QIAN Z X,
2016 (QIAN Z X, ZHOU H, ZHANG W M, et al.Robust steganography using texture
synthesis[C]//Advances in Intelligent Information Hiding and Multimedia
Signal Processing.Proceeding of the Twelfth International Conference on
Intelligent Information Hiding and Multimedia Signal Processing, 2016:21-23.)
All be generated in such a way that texture fritter splices it is similar with given sample containing close grain.But WU C, 2015 introduce mirror image
Operation is so that coding and non-coding sample fritter there are apparent distinguishing characteristics, cause to encode fritter and directly reveal.QIN Z C,
2017 and QIAN Z X, there is fixed one-to-one relationships between the segmentation of 2016 secret informations and sample fritter classification, easily
The suspection for causing attacker causes safety lower.In addition WU C, 2015, QIN Z C, 2017 and QIAN Z X contain in 2016
Close grain image is using EFROS A A, 2001 (EFROS A A, FREEMAN W T.Image quilting for
texture synthesis and transfer[C]//Proc.of the 28th Annual Conference on
Computer Graphics and Interactive Techniques, 2001:341-346.) in suture algorithm come pair
The texture of overlapping region is spliced, and is inevitably resulted from suture trace and is repeated texture pattern, thus cannot be to secret
Information is covered.
Summary of the invention
It is an object of the invention to overcome the above-mentioned prior art, provide a kind of information disguising and recovery method,
Equipment and storage medium.
In order to achieve the above objectives, the present invention is achieved by the following scheme:
A kind of information disguising method, comprising the following steps:
S1: pass through preset-key k1R rank key graph S is generated, 2 value secret information bit sequence B are inputted, 2 value secrets are believed
Breath bit sequence B is encoded to 2RSystem Number Sequence R；
S2: by R rank key graph S with 2RThe pixel coordinate of element same pixel value in system Number Sequence R, by 2RSystem
Number Sequence R is encoded to 2 value bit bit string b；
S3: picking out m+t kind color in default texture sample figure T and constitute palette sequence V, initialize blank image K,
Pass through preset-key k2Generate random coordinates sequence C；
S4: by the mapping relations of element and element index in palette sequence V, the 3 of 2 value bit bit string b are backed up again
It is encoded to colour sequential V ', places all elements in colour sequential V ' on blank image K in conjunction with random coordinates sequence C；
S5: texture padding is carried out to rest position in blank image K by point texture generation strategy pixel-by-pixel, is obtained containing close
Texture image K.
Information disguising method of the present invention further improvement is that
The S1's method particularly includes:
S1-1: pass through preset-key k1Generation resolution ratio is h1×w1R rank key graph
S1-2: 2 value secret information bit sequence B of input, being one group for every R bit in B, to be converted to length be l12R
System Number SequenceWherein l1It is determined by formula (1)；
Wherein, symbolExpression rounds up；
The S2's method particularly includes:
By in R rank key graph S with 2RThe pixel coordinate of element same pixel value in system Number Sequence R, by 2RSystem number sequence
Column R is encoded to 2 value bit bit stringsWherein l2It is determined by formula (2)；
The S2's method particularly includes:
S2-1: to 2RSystem Number SequenceIn each element ri, random selection and r in R rank key graph SiIt is worth phase
Deng elementAnd record its corresponding coordinate position (ui, vi), by formula (3) by uiAnd viBeing converted to length is2
System bit bit string
Wherein, bin (ui) it is 2 value transfer functions, it is used for ui2 value bit bit strings are converted to, for ui∈ [0, h1- 1],
bin(ui) by uiBeing converted to length is2 value bit bit strings, for vi∈ [0, w1- 1], bin (vi) by viBeing converted to length is2 value bit bit strings, symbol " | | " is that bit bit string is connected function；
S2-2: S2-1 is repeated extremelyBe converted to l1A 2 system bit bit stringBy formula (4) by l1
A 2 system bit bit stringSeries connection obtains 2 value bit bit strings
The S3's method particularly includes:
S3-1: in resolution ratio h2×w2Default texture sample figureIn select the highest m+t kind of the frequency of occurrences
Color constitutes palette sequence V=(vi)m+t；
S3-2: initialization resolution ratio is h3×w3R rank blank image
S3-3: pass through preset-key k2Generation length is 3l3Random coordinates sequenceWherein (xi,
yi)∈h3×w3And in random coordinates sequence C coordinate two neither etc., l3It is determined by formula (5):
Wherein, symbolIt indicates to be rounded downwards；
The S4's method particularly includes:
S4-1: by 2 value bits in 2 value bit bit string b withA bit is 1 group, and to be converted to length be l3Sequence
S4-2: by sequenceEach of element di, d is encoded to by formula (6)iBackup
S4-3: it repeats S4-2 and D is extremely encoded to 3l3A elementIt is logical
It crosses formula (7) and obtains colour sequential V '；
S4-4: willAs (x in blank image K3·i+k, y3·i+k), i=0,1 ..., l3- 1, k=0,1, the member of 2 positions
Element；
The S5's method particularly includes:
S5-1: in blank image K, to any kI, jAndNote is with kI, jCentered on γ × γ neighborhood be N
(kI, j), all elements t is traversed in texture sample figure TX, yCentered on γ × γ neighborhood N ' (tX, y), N is obtained by formula (8)
(kI, j) and N ' (tX, y) similarity and therefrom choose with N (kI, j) most like neighborhoodIt pressesTo kI, jAssignment；
Wherein, p, q are corresponding 8 neighborhood N (kI, j), N ' (tX, y) in corresponding position pixel, R (x), G (x), B (x) point
The R of pixel x, G, B component value, d (N (k are not representedI, j), N ' (tX, y)) smaller show N (kI, j) and N ' (tX, y) more similar；
S5-2: S5-1 all elements into blank image K are repeatedAssignment is completed, image containing close grain is obtained
K。
Another aspect of the invention, a kind of computer readable storage medium, the computer-readable recording medium storage have meter
The step of calculation machine program, the computer program realizes the information disguising method when being executed by processor.
Another aspect of the invention, a kind of computer equipment, including memory, processor and storage are in the memory
And the computer program that can be run on the processor, the processor realize the information when executing the computer program
The step of camouflage method.
Another aspect of the invention, a kind of information recovering method, comprising the following steps:
R1: pass through preset-key k2Random coordinates sequence C is generated, close grain is contained from input by random coordinates sequence C
Colour sequential V ' is extracted in figure K '；
R2: m+t kind color is picked out in default texture sample figure T and constitutes palette sequence V, passes through palette sequence V
In element and element index mapping relations, colour sequential V ' is decoded as 2 value bit bit string b；
R3: pass through preset-key k1R rank key graph S is generated, extracts secret in key graph S in conjunction with 2 value bit bit string b
Information B.
Information recovering method of the present invention further improvement is that
The R1's method particularly includes:
R1-1: pass through preset-key k2Generation length is 3l3Random coordinates sequenceWherein (xi,
yi)∈h3×w3And coordinate two is neither etc. in random coordinates sequence C；
R1-2: by random coordinates sequence C from the figure containing close grain of inputIn, to each (xi, yi) ∈ C,
Find (x3·i+k, y3·i+k), i ∈ [0, l3- 1], k=0, all elements of 1,2 positionAnd combine, obtain color
Sequence V '；
The R2's method particularly includes:
R2-1: in resolution ratio h2×w2Texture sample figureIn select the highest m+t kind color of the frequency of occurrences
Constitute palette sequence V=(vi)m+t；
R2-2: it is found out according to palette sequence VIndex positionIt is calculated by formula (9)
NoteNumber of elements positioned at section [0, m-1] is denoted as Ec, d is calculated by following 5 kinds of situationsi:
1. if Ec=0, it sets
2. if Ec=1 andElement value positioned at section [0, m-1] is v, sets di=v；
3. if Ec=2 andElement value positioned at section [0, m-1] is v1, v2, set di=(v1+v2)/2；
4. if Ec=3 andThere are two and more than two values are equal, and note equal value is v, sets di=v；
5. if Ec=3 andTwo neither etc., sets
R2-3: repeating R2-2 all coordinates into random coordinates sequence C and be disposed, and obtaining length by formula (10) is l2
2 value bit bit string b:
Wherein, Left () is 2 value bit string cutted functions, and the 1st parameter is the 2 value bit bit strings to be intercepted, the 2nd
Parameter is from the length intercepted from left to right；l2It is determined by formula (11)；
The R3's method particularly includes:
R3-1: pass through preset-key k1Generation resolution ratio is h1×w1R rank key graph
R3-2: by the 2 value bits of 2 value bit bit string b withIt is 1 group, is divided into l1Group is denoted asPass through formula (12) and formula (13) respectively from each groupingBefore middle interceptionA 2 value bit is with afterA 2
It is worth bit as coordinate (ui, vi), then pass through formula (14) for (u in R rank key graph Si, vi) the corresponding element in position is assigned to
ri, wherein i=0,1 ..., l1-1；
Wherein, Right () is 2 value bit string cutted functions, and the 1st parameter is the 2 value bit bit strings to be intercepted, the 2nd
A parameter is from the length intercepted from right to left；
R3-3: by ri, i=0,1 ..., l1- 1 is respectively converted into the 2 system bit bit strings that length is R, is R by all length
The series connection of 2 system bit bit strings be 2 system bit bit strings that length is N, obtain secret information B=(Bi)N。
Another aspect of the invention, a kind of computer readable storage medium, the computer-readable recording medium storage have meter
The step of calculation machine program, the computer program realizes the information recovering method when being executed by processor.
Another aspect of the invention, a kind of computer equipment, including memory, processor and storage are in the memory
And the computer program that can be run on the processor, the processor realize the information when executing the computer program
The step of restoration methods.
Compared with prior art, the invention has the following advantages:
The present invention is generated using point texture synthetic method pixel-by-pixel containing close grain, and image containing close grain is pixel-level generation
Rather than the splicing of texture fritter generates, so avoiding solid existing for the block splicing production Information hiding based on suture algorithm
There is splicing trace and reduce the generation of repeat pattern, safety is higher, and is not easy to cause the suspection of attacker.It efficiently solves
Tradition is spliced in the information concealing method of textures synthesis based on block since image containing close grain uses suture algorithm come to overlapping
The texture in region is spliced, and is inevitably resulted from suture trace and is repeated texture pattern, thus cannot be to secret information
The problem of being covered.Secret information is expressed by the key graph coordinate of key generation, is secret containing what is be embedded in close blindage figure
Coordinate information of the confidential information in key graph rather than secret information, avoid the direct channels transmission of secret information, and secret
The insertion of information and extraction process place one's entire reliance upon key, safety with higher.It efficiently solves existing based on block splicing
Due to using the small block coding secret information of sample, secret information transmits the information concealing method of textures synthesis in the channel, safety
The not high problem of property.Invention introduces the certification policies based on prepare more part and interval extension, and more parts of secrets are embedded in when embedding close
Information at the extraction all extracts more parts of secret informations, then compares more parts of secret informations, and secret information is identical
The secret information of most parts takes mean value as secret information, the plan as the secret information correctly extracted if being different from
Summary can effectively improve the anti-attack ability for extracting secret information.Efficiently solve the existing letter based on block splicing textures synthesis
Hidden method is ceased due to lacking authentication information, if can not determine after being attacked containing close blindage figure, the secret information extracted is
It is no be correct secret information the problem of.
Detailed description of the invention
Fig. 1 is information disguising method flow chart of the present invention；
Fig. 2 is information recovering method flow chart of the present invention；
Fig. 3 is texture sample figure of the invention, is the 8-bit color image texture 1 of 64 × 64 resolution ratio；
Fig. 4 is texture sample figure of the invention, is the 8-bit color image texture 2 of 64 × 64 resolution ratio；
Fig. 5 is texture sample figure of the invention, is the 8-bit color image texture 3 of 64 × 64 resolution ratio；
Fig. 6 is texture sample figure of the invention, is the 8-bit color image texture 4 of 64 × 64 resolution ratio；
Fig. 7 is close figure of the invention, is 8 gray level image lena of 64 × 64 resolution ratio；
Fig. 8 is of the invention using Fig. 3 as texture sample figure, and Fig. 7 is that the resolution ratio that close figure generates is 512 × 512 containing close
Texture 1, user key takes key1=6546, key2=7653；
Fig. 9 is of the invention using Fig. 4 as texture sample figure, and Fig. 7 is that the resolution ratio that close figure generates is 512 × 512 containing close
Texture 2, user key takes key1=6548, key2=7659；
Figure 10 is of the invention using Fig. 5 as texture sample figure, and Fig. 7 is that the resolution ratio that close figure generates is 512 × 512 containing close
Texture 3, user key takes key1=6546, key2=7653；
Figure 11 is of the invention using Fig. 6 as texture sample figure, and Fig. 7 is that the resolution ratio that close figure generates is 512 × 512 containing close
Texture 4, user key takes key1=6548, key2=7659；
Figure 12 is the close figure of the invention recovered by Fig. 8, and the bit error rate BR relative to Fig. 7 is 0%；
Figure 13 is the close figure of the invention recovered by Fig. 9, and the bit error rate BR relative to Fig. 7 is 0%；
Figure 14 is the close figure of the invention recovered by Figure 10, and the bit error rate BR relative to Fig. 7 is 0%；
Figure 15 is the close figure of the invention recovered by Figure 11, and the bit error rate BR relative to Fig. 7 is 0%；
Figure 16 cuts out attack graph to Fig. 8 progress 1.9% to be of the invention；
Figure 17 cuts out attack graph to Fig. 9 progress 3.4% to be of the invention；
Figure 18 cuts out attack graph to Figure 10 progress 4.1% to be of the invention；
Figure 19 cuts out attack graph to Figure 11 progress 2.6% to be of the invention；
Figure 20 is the random noise attack graph of the invention to Fig. 8 progress 8%；
Figure 21 is the random noise attack graph of the invention to Fig. 9 progress 20%；
Figure 22 is the random noise attack graph of the invention to Figure 10 progress 15%；
Figure 23 is the random noise attack graph of the invention to Figure 11 progress 10%；
Figure 24 is the close figure of the invention recovered by Figure 16, and the bit error rate BR relative to Fig. 7 is 0.63%, peak value noise
It is 30.7281dB than PSNR=；
Figure 25 is the close figure of the invention recovered by Figure 17, and the bit error rate BR relative to Fig. 7 is 1.12%, peak value noise
It is 28.1291dB than PSNR=；
Figure 26 is the close figure of the invention recovered by Figure 18, and the bit error rate BR relative to Fig. 7 is 1.37%, peak value noise
It is 26.7750dB than PSNR=；
Figure 27 is the close figure of the invention recovered by Figure 19, and the bit error rate BR relative to Fig. 7 is 0.85%, peak value noise
It is 29.8146dB than PSNR=；
Figure 28 is the close figure of the invention recovered by Figure 20, and the bit error rate BR relative to Fig. 7 is 2.66%, peak value noise
It is 24.3136dB than PSNR=；
Figure 29 is the close figure of the invention recovered by Figure 21, and the bit error rate BR relative to Fig. 7 is 6.35%, peak value noise
It is 20.1874dB than PSNR=；
Figure 30 is the close figure of the invention recovered by Figure 22, and the bit error rate BR relative to Fig. 7 is 4.79%, peak value noise
It is 21.7039dB than PSNR=；
Figure 31 is the close figure of the invention recovered by Figure 23, and the bit error rate BR relative to Fig. 7 is 3.13%, peak value noise
It is 23.7018dB than PSNR=.
Specific embodiment
In order to enable those skilled in the art to better understand the solution of the present invention, below in conjunction in the embodiment of the present invention
Attached drawing, technical scheme in the embodiment of the invention is clearly and completely described, it is clear that described embodiment is only this
The embodiment of a part is invented, instead of all the embodiments.Based on the embodiments of the present invention, those of ordinary skill in the art
Every other embodiment obtained without making creative work, should fall within the scope of the present invention.
It should be noted that description and claims of this specification and term " first " in above-mentioned attached drawing, "
Two " etc. be to be used to distinguish similar objects, without being used to describe a particular order or precedence order.It should be understood that using in this way
Data be interchangeable under appropriate circumstances, so as to the embodiment of the present invention described herein can in addition to illustrating herein or
Sequence other than those of description is implemented.In addition, term " includes " and " having " and their any deformation, it is intended that cover
Cover it is non-exclusive include, for example, the process, method, system, product or equipment for containing a series of steps or units are not necessarily limited to
Step or unit those of is clearly listed, but may include be not clearly listed or for these process, methods, product
Or other step or units that equipment is intrinsic.
The present invention is done using JAVA jdk1.8.0_65 as implementation environment combination accompanying drawings and embodiments below further detailed
It describes in detail bright.
The invention will be described in further detail with reference to the accompanying drawing:
Referring to Fig. 1, information disguising method of the present invention, comprising the following steps:
Step 1: pass through preset-key k first1Generation resolution ratio is h1×w1R rank key graphThen the 2 value secret information bit sequence B=(B that input length is Ni)N, finally by 2 values
Every R bit in secret information bit sequence B is one group, and to be converted to length be l12RSystem Number SequenceWherein l1
It is determined by formula (1)；
Wherein, symbolExpression rounds up.
Such as: if taking the random seed of linear congruence random generator as key k1, then by k1=6546, R=8, h1=
w1=16 producible S=(sI, j)16×16, sI, j∈ [0,28- 1], it is assumed that 2 value secret information bit sequence B=of input
(1101011010110010)2, then N=16, then length can be obtained by formula (1) is2R=28
It include 2 element r in=256 system Number Sequence R, R0=(11010110)2=214, r1=(10110010)2=178, i.e. R=
(r0=214, r1=178).
Step 2: for 2RSystem Number SequenceIn each element ri, random selection and r in R rank key graph SiValue
Equal elementAnd record its corresponding coordinate position (ui, vi), by formula (3) by uiAnd viBeing converted to length is2
System bit bit stringThus it can incite somebody to actionBe converted to l1A 2 system bit bit stringIt is carried out by formula (4)
2 value bit bit strings can be obtained in bit bit serialWherein l2It is determined by formula (2)；
In formula (3), bin (ui) it is 2 value transfer functions, it is used for ui2 value bit bit strings are converted to, for ui∈ [0, h1-
1], bin (ui) can be by uiBeing converted to length is2 value bit bit strings, for vi∈ [0, w1- 1], bin (vi) can be by viConversion
It is for length2 value bit bit strings, symbol " | | " is that bit bit string is connected function；
Such as: for R=(r0=214, r1=178) 2 element r in0=214, r1=178, and if r0Equal R rank
Element is s in key graph S4,6=214, then record its corresponding coordinate position (u0, v0)=(4,6), it here can be by u0=4 conversions
ForA 2 system position bin (u0)=(0100)2, can be by v0=6 are converted toA 2 system position bin (v0)=(0110)2, to be obtained by formula (3)For r1=178, and if r1Element is in equal S
s5,2=178,Then willBit is carried out by formula (4)
2 value bit bit strings can be obtained in bit serialWherein
Step 3: first from texture sample figureIn select the highest m+t kind color of the frequency of occurrences and constitute toning
Plate sequence V=(vi)m+t, then initializing resolution ratio is h3×w3R rank blank imageBy key k2
Generation length is 3l3Random coordinates sequenceWherein (xi, yi)∈h3×w3And in C coordinate two neither etc.,
l3It is determined by formula (5), symbolIt indicates to be rounded downwards；
Such as: take h2=w2=64, m=16, t=2, then can be from texture sample figure T=(tX, y)64×64In select appearance frequency
The highest 18 kinds of colors of rate constitute palette sequence V=(vi)18；Take h3=w3=512, R=8, can obtain resolution ratio is 512 × 512
8 rank blank image K=(kI, j=28- 1=255)512×512；If taking the random seed of linear congruence random generator as close
Key k2, take k2=7653, l2=16, it can be obtained by formula (5)Then producing length is 3l3
The random coordinates sequence of=34=12 and coordinate two neither etc. are as follows: C=((55,64), (49,74), (82,84), (228,
113), (89,73), (169,196), (170,165), (253,129), (104,222), (116,62), (235,246), (235,
161))；
Step 4: by the mapping relations of element and element index in palette sequence V, by 3 weights of 2 value bit bit string b
Backup is encoded to colour sequential V ', finally combines random coordinates sequence C to place in blank image K all in colour sequential V '
Element.Specific method is:
1) by 2 value bits in 2 value bit bit string b withA bit is 1 group, and to be converted to length be l3SequenceWherein l3It is determined by formula (6), forIn each element di, by formula (7) by diIt is encoded to diBackup
2) it executes repeatedly 1), D can be encoded to 3l3A elementIt will
It is as colour sequential V ', as shown in formula (8)；
3) willAs (x in blank image K3·i+k, y3·i+k), i=0,1 ..., l3- 1, k=0,1, the element of 2 positions；
Such as:
1) b=(0100011001010010) is taken2, l2=16, by 2 value bits in b with
A bit is 1 group and is converted to length and isSequence D=(d0, d1, d2, d3)=
((0100)2, (0110)2, (0101)2, (0010)2)=(4,6,5,2), for d0=4, it can be calculated by formula (6)Wherein
(x3·0+0, y3·0+0)=(x0, y0)=(55,64) be C in the 0th coordinate, can similarly obtain
2) for d1=6, it can obtainFor d2=5, it can obtain For d3=2, it can obtainIt can be obtained by formula (7):
3) willAs (x in K3·i+k, y3·i+k)=(x3·0+0, y3·0+0)=(55,64) position element, willAs (x in K1, y1)=(49,74) position element, willAs (x in K2, y2)=(82,84) position
Element；It willAs (x in K3·i+k, y3·i+k)=(x3·1+0, y3·1+0)=(x3, y3)=(228,113) position element,
It willAs (x in K4, y4)=(89,73) position element, willAs (x in K5, y5)=(169,196) position
The element set；It willAs (x in K3·i+k, y3·i+k)=(x3·2+0, y3·2+0)=(x6, y6)=(170,165) position
Element, willAs (x in K7, y7)=(253,129) position element, willAs (x in K8, y8)=(104,
222) element of position；It willAs (x in K3·i+k, y3·i+k)=(x3·3+0, y3·3+0)=(x9, y9)=(116,62)
The element of position, willAs (x in K10, y10)=(253,246) position element, willAs (x in K11,
y11)=(235,161) position element.
Step 5: combining point texture generation strategy pixel-by-pixel first, carries out texture padding to rest position in blank image K,
Method particularly includes:
In blank image K, to any kI, jAndNote is with kI, jCentered on γ × γ neighborhood be N (kI, j), In
All elements t is traversed in texture sample figure TX, yCentered on γ × γ neighborhood N ' (tX, y), N (k is calculated by formula (8)I, j) and N '
(tX, y) similarity, choose with N (kI, j) most like γ × γ neighborhoodIt pressesTo kI, jAssignment；It executes repeatedly
Until all elements in blank image KAssignment is completed, then blank image K is exported and contains fine groove as what is generated
Manage image.
Such as: by taking γ × γ=3 × 3 as an example, if
Assuming thatMost
It is small, i.e.,Then pressTo kI, jAssignment, similarly all elements in achievable blank image K
Assignment.
Referring to fig. 2, information recovering method of the present invention, comprising the following steps:
Step 1: the figure containing close grain that receives of input channel firstPass through preset-key k2Generate length
For 3l3Random coordinates sequenceWherein (xi, yi)∈h3×w3And coordinate two neither etc., is containing fine groove in C
In reason figure K ', to each (xi, yi) ∈ C, find (x3·i+k, y3·i+k), i ∈ [0, l3- 1], k=0, all elements of 1,2 positionFinally obtain colour sequential V '；
Such as: if the K ' of figure containing close grain=(k that input channel receivesI, j)512×512, then h3=w3=512；
Still take the random number seed of linear congruence random generator as key k2, then k is pressed2=7653, l3=4, it produces
Length is 3l3The random coordinates sequence of=34=12 are as follows: C=((55,64), (49,74), (82,84), (228,113),
(89,73), (169,196), (170,165), (253,129), (104,222), (116,62), (235,246), (235,
161))；
In the K ' of figure containing close grain, to each (xi, yi) ∈ C, such as (x3·i+k, y3·i+k)=(x3·0+0, y3·0+0)
=(55,64) can find elementFor (x1, y1)=(49,74) it can findFor
(x11, y11)=(235,161) it can findColour sequential can finally be obtained
Step 2: first from texture sample figureIn pick out m+t kind color constitute palette sequence V=
(vi)m+t, then by the mapping relations of element and element index in palette sequence V, colour sequential V ' is decoded as coordinate
Sequence b, specific method are:
1) it is found out according to palette sequence VIndex positionRight back-pushed-type (9) calculates
2) rememberNumber of elements positioned at section [0, m-1] is denoted as Ec, then d is calculated by following 5 kinds of situationsi:
1. if Ec=0, then it sets
2. if Ec=1 andElement value positioned at section [0, m-1] is v, then sets di=v；
3. if Ec=2 andElement value positioned at section [0, m-1] is v1, v2, then d is seti=(v1+v2)/2；
4. if Ec=3 andThere are two and more than two values are equal, and note equal value is v, then sets di=v；
5. if Ec=3 andTwo neither etc., then sets
3) it repeats 2) until all coordinates are disposed in random coordinates sequence C, right back-pushed-type (10) obtains length
For l22 value coordinate sequence b:
In formula (10), Left () is 2 value bit string cutted functions, wherein the 1st parameter is the 2 value bits to be intercepted
String, the 2nd parameter is from the length intercepted from left to right, l2It is determined by formula (11):
Such as: take h2=w2=64, m=16, t=2, then can be from T=(tX, y)64×64In select the frequency of occurrences highest 18
Kind color constitutes palette sequence V=(vi)18；
If 1) according to V=(vi)18It finds outIndex position beIndex position be's
Index position isIndex position beIndex position beIndex position
ForIndex position beIndex position beIndex position beIndex position beIndex position beIndex position beThen
It can be obtained by formula (9):
Together
It manages
If 2) rememberThenNumber of elements positioned at section [0,15] is Ec=3, by
Ec=3 andThere are two and more than two values are equal, equal value v=4 remembered, so d0=4；
If 3) rememberThenNumber of elements positioned at section [0,15] is Ec=3, by
Ec=3 andThere are two and more than two values are equal, remember equal value v=6, obtain d1=6；If noteThenNumber of elements positioned at section [0,15] is Ec=3, by Ec=3 andThere are two and more than two values are equal, remember equal value v=5, obtain d2=5；If noteThenNumber of elements positioned at section [0,15] is Ec=3, by Ec=3 andThere are two and more than two values are equal, remember equal value v=2, obtain d3=2；Assuming that l1=2,
Obtaining length by formula (10) is2 value coordinate sequence b=Left (bin (d0)||bin(d1)
||bin(d2)||bin(d3), l2)=Left (bin (4) | | bin (6) | | bin (5) | | bin (2), 8)=
(0100011001010010)2；
Step 3: pass through preset-key k first1The specific method for generating R rank key graph S is by key k1Generating resolution ratio is
h1×w1R rank key graphsI, j∈ [0,2R- 1], mentioned in R rank key graph S then in conjunction with 2 value bit bit string b
Secret information B is taken out, specific method is:
1) by the 2 value bits of 2 value bit bit string b withIt is 1 group, is divided into l1Group is denoted asPoint
Not An formula (12) and formula (13) from each groupingBefore middle interceptionA 2 value bit is with afterA 2 value bit is as coordinate (ui,
vi), then by (u in Si, vi) the corresponding element in position is assigned to riAs shown in formula (14), wherein i=0,1 ..., l1-1；
2) by ri, i=0,1 ..., l1- 1 to be respectively converted into the 2 system bit bit strings that length is R and connected be length
For the 2 system bit bit string B=(B of Ni)NOutput.
Such as: take the random seed of linear congruential random number generator as key k1, such as take k1=6546, R=8, h1
=w1=16, then produce the 8 rank key graph S that resolution ratio is 16 × 16, it is assumed that b=(0 10001100102；
1) l is taken1=2,By the 2 value ratios of b
Spy withIt is 1 group, is divided into l1=2 groups, respectivelyBy formula
(11) it interceptsBeforeA 2 value bit obtainsBy formula
(12) it interceptsAfterA 2 value bit obtainsTogether
Reason can be byObtain u1=(0101)2, v1=(0010)2, it is assumed that the upper element s of S4,6=214, s5,2=178, then by (u in S0, v0)
The corresponding element in=(4,6) position is assigned to r0, r can be obtained0=s4,6=214, by (u in S1, v1)=(5,2) the corresponding member in position
Element is assigned to r1, r can be obtained1=s5,2=178；
2) by r0=214, r1=178 to be respectively converted into the 2 system bit bit strings that length is R=8 and connected be length
For the 2 system bit bit string B=(bin (r of N=160)||bin(ri))=((bin (214) | | bin (178)))=
(1101011010110010)2Output.
Referring to Fig. 3~Figure 31, Fig. 8~Figure 11 be using Fig. 3~Fig. 6 as texture sample figure, with Fig. 7 be close figure, user key
Key is taken respectively1=6546, key2=7653, key1=6548, key2=7659, key1=6546, key2=7653, key1=
6548、key2=7659, disclosed image containing close grain is obtained by the corresponding insertion process of Fig. 1.Figure 12~Figure 15 is mentioned by Fig. 2
Process is taken, correct key is provided, the close figure successively extracted from Fig. 8~Figure 11, the bit error rate BR relative to Fig. 7 is
0%, therefore close figure can be extracted correctly.Figure 16~Figure 19 is to carry out 1.9%, 3.4%, 4.1%, 2.6% respectively to Fig. 8~Figure 11
Cut out attack after image containing close grain.Figure 24~Figure 27 is to extract process according to Fig. 2, is extracted from Figure 16~Figure 19
Close figure, Figure 24 are 0.63%, PSNR=30.7281dB, bit error rate BR of the Figure 25 relative to Fig. 7 relative to the bit error rate BR of Fig. 7
For 1.12%, PSNR=28.1291dB, Figure 26 is 1.37%, PSNR=26.7750dB, Figure 27 relative to the bit error rate BR of Fig. 7
Bit error rate BR relative to Fig. 7 is 0.85%, PSNR=29.8146dB, therefore the close figure of reconstruct and former close figure are similar enough, explanation
Method of the invention has certain shearing resistance to cut out attacking ability.Figure 20~Figure 23 be carry out 8% respectively to Fig. 8~Figure 11,20%,
15%, the image containing close grain after 10% random noise attack.Figure 28~Figure 31 be according to Fig. 2 extract process, from Figure 20~
The close figure extracted in Figure 23, Figure 28 relative to Fig. 7 bit error rate BR be 2.66%, PSNR=24.3136dB, Figure 29 relative to
The bit error rate BR of Fig. 7 is 6.35%, PSNR=20.1874dB, and Figure 30 is 4.79%, PSNR=relative to the bit error rate BR of Fig. 7
21.7039dB, Figure 31 are 3.13%, PSNR=23.7018dB relative to the bit error rate BR of Fig. 7, therefore the close figure of reconstruct and original are close
Figure is similar enough, illustrates that method of the invention has certain anti-random noise attacking ability.
If information disguising method of the present invention and information recovering method are realized in the form of SFU software functional unit and as only
Vertical product when selling or using, can store in a computer readable storage medium.Based on this understanding, this hair
All or part of the process in bright realization above-described embodiment method, can also be instructed by computer program relevant hardware come
It completes, the computer program can be stored in a computer readable storage medium, which holds by processor
When row, it can be achieved that the step of above-mentioned each embodiment of the method.Wherein, the computer program includes computer program code, institute
Stating computer program code can be source code form, object identification code form, executable file or certain intermediate forms etc..It calculates
Machine readable storage medium storing program for executing include permanent and non-permanent, removable and non-removable media can by any method or technique Lai
Realize information storage.Information can be computer readable instructions, data structure, the module of program or other data.It needs to illustrate
, the content that the computer-readable medium includes can be according to the requirement progress made laws in jurisdiction with patent practice
Increase and decrease appropriate, such as do not include electric carrier wave according to legislation and patent practice, computer-readable medium in certain jurisdictions
Signal and telecommunication signal.
In the exemplary embodiment, a kind of computer readable storage medium, the computer-readable storage medium are additionally provided
Matter is stored with computer program, and the computer program realizes the information disguising method or Information recovering when being executed by processor
The step of method.Wherein, the computer storage medium can be any usable medium that computer can access or data are deposited
Store up equipment, including but not limited to magnetic storage (such as floppy disk, hard disk, tape, magneto-optic disk (MO) etc.), optical memory (example
Such as CD, DVD, BD, HVD) and semiconductor memory (such as ROM, EPROM, EEPROM, nonvolatile memory
(NANDFLASH), solid state hard disk (SSD)) etc..
In the exemplary embodiment, it additionally provides a kind of computer equipment, including memory, processor and is stored in institute
The computer program that can be run in memory and on the processor is stated, the processor executes real when the computer program
The step of existing information disguising method or information recovering method.Processor may be central processing unit
(CentralProcessingUnit, CPU) can also be other general processors, digital signal processor
(DigitalSignalProcessor, DSP), specific integrated circuit (ApplicationSpecificIntegratedCircu
It, ASIC), ready-made programmable gate array (Field-ProgrammableGateArray, FPGA) or other programmable logic
Device, discrete gate or transistor logic, discrete hardware components etc..
The present invention is generated using point texture synthetic method pixel-by-pixel containing close grain, and image containing close grain is pixel-level generation
Rather than the splicing of texture fritter generates, so avoiding solid existing for the block splicing production Information hiding based on suture algorithm
There is splicing trace and reduce the generation of repeat pattern, safety is higher, and is not easy to cause the suspection of attacker.It efficiently solves
Tradition is spliced in the information concealing method of textures synthesis based on block since image containing close grain uses suture algorithm come to overlapping
The texture in region is spliced, and is inevitably resulted from suture trace and is repeated texture pattern, thus cannot be to secret information
The problem of being covered.Secret information is expressed by the key graph coordinate of key generation, is secret containing what is be embedded in close blindage figure
Coordinate information of the confidential information in key graph rather than secret information, avoid the direct channels transmission of secret information, and secret
The insertion of information and extraction process place one's entire reliance upon key, safety with higher.It efficiently solves existing based on block splicing
Due to using the small block coding secret information of sample, secret information transmits the information concealing method of textures synthesis in the channel, safety
The not high problem of property.Invention introduces the certification policies based on prepare more part and interval extension, and more parts of secrets are embedded in when embedding close
Information at the extraction all extracts more parts of secret informations, then compares more parts of secret informations, and secret information is identical
The secret information of most parts takes mean value as secret information, the plan as the secret information correctly extracted if being different from
Summary can effectively improve the anti-attack ability for extracting secret information.Efficiently solve the existing letter based on block splicing textures synthesis
Hidden method is ceased due to lacking authentication information, if can not determine after being attacked containing close blindage figure, the secret information extracted is
It is no be correct secret information the problem of.
The above content is merely illustrative of the invention's technical idea, and this does not limit the scope of protection of the present invention, all to press
According to technical idea proposed by the present invention, any changes made on the basis of the technical scheme each falls within claims of the present invention
Protection scope within.
Claims (10)
1. a kind of information disguising method, which comprises the following steps:
S1: pass through preset-key k1R rank key graph S is generated, 2 value secret information bit sequence B are inputted, by 2 value secret information bits
Sequence B is encoded to 2RSystem Number Sequence R；
S2: by R rank key graph S with 2RThe pixel coordinate of element same pixel value in system Number Sequence R, by 2RSystem number sequence
Column R is encoded to 2 value bit bit string b；
S3: m+t kind color is picked out in default texture sample figure T and constitutes palette sequence V, blank image K is initialized, passes through
Preset-key k2Generate random coordinates sequence C；
S4: by the mapping relations of element and element index in palette sequence V, the 3 of 2 value bit bit string b is backed up again and is encoded
For colour sequential V ', all elements in colour sequential V ' are placed on blank image K in conjunction with random coordinates sequence C；
S5: texture padding is carried out to rest position in blank image K by point texture generation strategy pixel-by-pixel, is obtained containing close grain
Image K.
2. information disguising method according to claim 1, which is characterized in that the S1's method particularly includes:
S1-1: pass through preset-key k1Generation resolution ratio is h1×w1R rank key graph
S1-2: 2 value secret information bit sequence B of input, being one group for every R bit in B, to be converted to length be l12RSystem
Number SequenceWherein l1It is determined by formula (1)；
Wherein, symbolExpression rounds up；
The S2's method particularly includes:
By in R rank key graph S with 2RThe pixel coordinate of element same pixel value in system Number Sequence R, by 2RSystem Number Sequence R
It is encoded to 2 value bit bit stringsWherein l2It is determined by formula (2)；
3. information disguising method according to claim 2, which is characterized in that the S2's method particularly includes:
S2-1: to 2RSystem Number SequenceIn each element ri, random selection and r in R rank key graph SiIt is worth equal
ElementAnd record its corresponding coordinate position (ui,vi), by formula (3) by uiAnd viBeing converted to length is2 systems
Bit bit string
Wherein, bin (ui) it is 2 value transfer functions, it is used for ui2 value bit bit strings are converted to, for ui∈[0,h1- 1], bin
(ui) by uiBeing converted to length is2 value bit bit strings, for vi∈[0,w1- 1], bin (vi) by viBeing converted to length is
2 value bit bit strings, symbol " | | " is that bit bit string is connected function；
S2-2: S2-1 is repeated extremelyBe converted to l1A 2 system bit bit stringBy formula (4) by l1A 2 into
Bit bit string processedSeries connection obtains 2 value bit bit strings
The S3's method particularly includes:
S3-1: in resolution ratio h2×w2Default texture sample figureIn select the highest m+t kind color of the frequency of occurrences
Constitute palette sequence V=(vi)m+t；
S3-2: initialization resolution ratio is h3×w3R rank blank image
S3-3: pass through preset-key k2Generation length is 3l3Random coordinates sequenceWherein (xi,yi)∈
h3×w3And in random coordinates sequence C coordinate two neither etc., l3It is determined by formula (5):
Wherein, symbolIt indicates to be rounded downwards；
The S4's method particularly includes:
S4-1: by 2 value bits in 2 value bit bit string b withA bit is 1 group, and to be converted to length be l3Sequence
S4-2: by sequenceEach of element di, d is encoded to by formula (6)iBackup
S4-3: it repeats S4-2 and D is extremely encoded to 3l3A elementPass through formula
(7) colour sequential V ' is obtained；
S4-4: willAs (x in blank image K3·i+k,y3·i+k), i=0,1 ..., l3The element of the position -1, k=0,1,2；
The S5's method particularly includes:
S5-1: in blank image K, to any ki,jAndNote is with ki,jCentered on γ × γ neighborhood be N (ki,j),
All elements t is traversed in texture sample figure Tx,yCentered on γ × γ neighborhood N ' (tx,y), N (k is obtained by formula (8)i,j) with
N′(tx,y) similarity and therefrom choose with N (ki,j) most like neighborhoodIt pressesTo ki,jAssignment；
Wherein, p, q are corresponding 8 neighborhood N (ki,j), N ' (tx,y) in corresponding position pixel, R (x), G (x), B (x) generation respectively
The R of table pixel x, G, B component value, d (N (ki,j),N′(tx,y)) smaller show N (ki,j) and N ' (tx,y) more similar；
S5-2: S5-1 all elements into blank image K are repeatedAssignment is completed, the K of image containing close grain is obtained.
4. a kind of computer readable storage medium, the computer-readable recording medium storage has computer program, and feature exists
In when the computer program is executed by processor the step of any one of such as claims 1 to 3 of realization the method.
5. a kind of computer equipment, including memory, processor and storage are in the memory and can be in the processor
The computer program of upper operation, which is characterized in that the processor realized when executing the computer program as claim 1 to
The step of any one of 3 the method.
6. a kind of information recovering method based on camouflage method described in claim 1, which comprises the following steps:
R1: pass through preset-key k2Random coordinates sequence C is generated, through random coordinates sequence C from the K ' of figure containing close grain of input
Extract colour sequential V '；
R2: m+t kind color is picked out in default texture sample figure T and constitutes palette sequence V, by palette sequence V
Colour sequential V ' is decoded as 2 value bit bit string b by the mapping relations of element and element index；
R3: pass through preset-key k1R rank key graph S is generated, extracts secret information in key graph S in conjunction with 2 value bit bit string b
B。
7. information recovering method according to claim 6, which is characterized in that the R1's method particularly includes:
R1-1: pass through preset-key k2Generation length is 3l3Random coordinates sequenceWherein (xi,yi)∈
h3×w3And coordinate two is neither etc. in random coordinates sequence C；
R1-2: by random coordinates sequence C from the figure containing close grain of inputIn, to each (xi,yi) ∈ C, it finds
(x3·i+k,y3·i+k),i∈[0,l3- 1], all elements of the position k=0,1,2And combine, obtain colour sequential
V′；
The R2's method particularly includes:
R2-1: in resolution ratio h2×w2Texture sample figureIn select the highest m+t kind color of the frequency of occurrences and constitute
Palette sequence V=(vi)m+t；
R2-2: it is found out according to palette sequence VIndex positionIt is calculated by formula (9)
NoteNumber of elements positioned at section [0, m-1] is denoted as Ec, d is calculated by following 5 kinds of situationsi:
1. if Ec=0, it sets
2. if Ec=1 andElement value positioned at section [0, m-1] is v, sets di=v；
3. if Ec=2 andElement value positioned at section [0, m-1] is v1,v2, set di=(v1+v2)/2；
4. if Ec=3 andThere are two and more than two values are equal, and note equal value is v, sets di=v；
5. if Ec=3 andTwo neither etc., sets
R2-3: repeating R2-2 all coordinates into random coordinates sequence C and be disposed, and obtaining length by formula (10) is l22 values
Bit bit string b:
B=Left (bin (d0)||bin(d1)||…||bin(dl3-1),l2) (10)
Wherein, Left () is 2 value bit string cutted functions, and the 1st parameter is the 2 value bit bit strings to be intercepted, the 2nd parameter
It is from the length intercepted from left to right；l2It is determined by formula (11)；
8. information recovering method according to claim 6, which is characterized in that the R3's method particularly includes:
R3-1: pass through preset-key k1Generation resolution ratio is h1×w1R rank key graph
R3-2: by the 2 value bits of 2 value bit bit string b withIt is 1 group, is divided into l1Group is denoted asPoint
Not Tong Guo formula (12) and formula (13) from each groupingBefore middle interceptionA 2 value bit is with afterA 2 value bit is as coordinate
(ui,vi), then pass through formula (14) for (u in R rank key graph Si,vi) the corresponding element in position is assigned to ri, wherein i=0,
1,…,l1-1；
Wherein, Right () is 2 value bit string cutted functions, and the 1st parameter is the 2 value bit bit strings to be intercepted, the 2nd ginseng
It counts from the length intercepted from right to left；
R3-3: by ri, i=0,1 ..., l1- 1 is respectively converted into the 2 system bit bit strings that length is R, is the 2 of R by all length
The series connection of system bit bit string is the 2 system bit bit strings that length is N, obtains secret information B=(Bi)N。
9. a kind of computer readable storage medium, the computer-readable recording medium storage has computer program, and feature exists
In when the computer program is executed by processor the step of any one of such as claim 6 to 8 of realization the method.
10. a kind of computer equipment, including memory, processor and storage are in the memory and can be in the processor
The computer program of upper operation, which is characterized in that the processor realized when executing the computer program as claim 6 to
The step of any one of 8 the method.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910711927.9A CN110430335B (en) | 2019-08-02 | 2019-08-02 | Information disguising and recovering method, equipment and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910711927.9A CN110430335B (en) | 2019-08-02 | 2019-08-02 | Information disguising and recovering method, equipment and storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110430335A true CN110430335A (en) | 2019-11-08 |
| CN110430335B CN110430335B (en) | 2021-05-11 |
Family
ID=68412323
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910711927.9A Active CN110430335B (en) | 2019-08-02 | 2019-08-02 | Information disguising and recovering method, equipment and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110430335B (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112235291A (en) * | 2020-10-13 | 2021-01-15 | 陕西师范大学 | Pixel-by-pixel texture generation type information hiding and recovering method, equipment and medium |
| CN113992327A (en) * | 2021-11-16 | 2022-01-28 | 陕西师范大学 | Lossless approximate memory-sharing recovery method and system based on prime number decomposition |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2004079980A2 (en) * | 2003-03-05 | 2004-09-16 | Xsides Corporation | System and method for data encryption |
| CN106998471A (en) * | 2017-03-16 | 2017-08-01 | 中国人民武装警察部队工程大学 | A kind of video hidden method and video extraction method for changing predictive mode |
| CN107613304A (en) * | 2017-09-11 | 2018-01-19 | 西安电子科技大学 | The hidden close transmission method of mobile terminal video stream based on Android platform |
| CN107846530A (en) * | 2017-09-28 | 2018-03-27 | 四川长虹电器股份有限公司 | Digital watermarking algorithm |
| CN108537049A (en) * | 2018-03-14 | 2018-09-14 | 中山大学 | A kind of adaptive steganographic algorithm based on bianry image |
| CN108898537A (en) * | 2018-04-03 | 2018-11-27 | 宁波大学 | A kind of digital picture steganography method |
-
2019
- 2019-08-02 CN CN201910711927.9A patent/CN110430335B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2004079980A2 (en) * | 2003-03-05 | 2004-09-16 | Xsides Corporation | System and method for data encryption |
| CN106998471A (en) * | 2017-03-16 | 2017-08-01 | 中国人民武装警察部队工程大学 | A kind of video hidden method and video extraction method for changing predictive mode |
| CN107613304A (en) * | 2017-09-11 | 2018-01-19 | 西安电子科技大学 | The hidden close transmission method of mobile terminal video stream based on Android platform |
| CN107846530A (en) * | 2017-09-28 | 2018-03-27 | 四川长虹电器股份有限公司 | Digital watermarking algorithm |
| CN108537049A (en) * | 2018-03-14 | 2018-09-14 | 中山大学 | A kind of adaptive steganographic algorithm based on bianry image |
| CN108898537A (en) * | 2018-04-03 | 2018-11-27 | 宁波大学 | A kind of digital picture steganography method |
Non-Patent Citations (2)
| Title |
|---|
| 毛炳华等: "基于DCT域相关性的非对称JPEG隐写", 《计算机科学》 * |
| 潘琳等: "基于构造纹理图像的数字隐写", 《应用科学学报》 * |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112235291A (en) * | 2020-10-13 | 2021-01-15 | 陕西师范大学 | Pixel-by-pixel texture generation type information hiding and recovering method, equipment and medium |
| CN112235291B (en) * | 2020-10-13 | 2023-04-07 | 陕西师范大学 | Pixel-by-pixel texture generation type information hiding and recovering method, equipment and medium |
| CN113992327A (en) * | 2021-11-16 | 2022-01-28 | 陕西师范大学 | Lossless approximate memory-sharing recovery method and system based on prime number decomposition |
| CN113992327B (en) * | 2021-11-16 | 2023-10-20 | 陕西师范大学 | Lossless approximate split-memory recovery method and system based on prime number decomposition |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110430335B (en) | 2021-05-11 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Mahto et al. | A survey of color image watermarking: State-of-the-art and research directions | |
| CN108648133B (en) | Non-embedded camouflage method combining block rotation and mosaic | |
| CN110430336B (en) | Method, apparatus and storage medium for image hiding and restoring | |
| CN110430335A (en) | A kind of method, equipment and the storage medium of information disguising and recovery | |
| CN110475039A (en) | Lines, Artss draw method, equipment and the storage medium hidden and restored | |
| CN111327785A (en) | Information steganography communication method based on automatic image construction of countermeasure generation network | |
| Ye et al. | Research on reversible image steganography of encrypted image based on image interpolation and difference histogram shift | |
| CN113014742B (en) | Image tampering detection positioning and self-recovery method based on fragile watermark | |
| Li et al. | Coverless image steganography using morphed face recognition based on convolutional neural network | |
| CN113313621B (en) | Image encryption watermark embedding method based on hybrid chaotic system and closed-loop diffusion | |
| CN110706145B (en) | Reversible remote sensing image information hiding processing method and device | |
| CN112184841A (en) | Block replacement generating type information hiding and recovering method, device and medium | |
| CN112235291B (en) | Pixel-by-pixel texture generation type information hiding and recovering method, equipment and medium | |
| Latha et al. | An efficient wavelet transform based steganography technique using chaotic map | |
| CN111383290A (en) | Optical information hiding technology based on visual password and speckle | |
| Wu et al. | Image reversible visual transformation based on MSB replacement and histogram bin mapping | |
| CN109920015B (en) | Image visual meaningful encryption method based on fractal graph generation | |
| Banu et al. | Secure reversible data hiding technique on textures using double encryption | |
| CN110417551A (en) | A kind of the character picture production camouflage and restoration methods of the diffusion of combination error | |
| CN114979402B (en) | Shared image storage method based on matrix coding embedding | |
| CN112288617B (en) | Information hiding and recovering method, equipment and medium based on mosaic jigsaw | |
| CN115222575B (en) | Vector data watermark embedding and extracting method using frequency domain coefficient ratio | |
| Sainudeen | REVERSIBLE TEXTURE COMBINATION STEGANOGRAPHY | |
| Wen et al. | Joint Coverless Steganography and Image Transformation for Covert Communication of Secret Messages | |
| Moon | Forensic multi-dimensional Ary exploited modified direction data embedding approach to increase imperceptibility and robustness of secured data |
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 | ||
| TR01 | Transfer of patent right | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20231214 Address after: No. 546, Luoyu Road, Hongshan District, Wuhan, Hubei Province, 430000 Patentee after: HUBEI CENTRAL CHINA TECHNOLOGY DEVELOPMENT OF ELECTRIC POWER Co.,Ltd. Address before: 710119 No. 620 West Chang'an Street, Chang'an District, Xi'an City, Shaanxi Province Patentee before: Shaanxi Normal University |