CN115908092A - Mosaic puzzle steganography method with image block rotation - Google Patents
Mosaic puzzle steganography method with image block rotation Download PDFInfo
- Publication number
- CN115908092A CN115908092A CN202211120147.5A CN202211120147A CN115908092A CN 115908092 A CN115908092 A CN 115908092A CN 202211120147 A CN202211120147 A CN 202211120147A CN 115908092 A CN115908092 A CN 115908092A
- Authority
- CN
- China
- Prior art keywords
- image
- mosaic
- angle
- rotation
- gray
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Images
Landscapes
- Image Processing (AREA)
Abstract
The invention discloses a mosaic disguise steganography method with image block rotation, which comprises the following steps: randomly selecting an original shared image by using a secret key, acquiring a carrier image, and performing pixel replacement on the carrier image; carrying out color mixing and rotation on an original shared image to obtain a mosaic image, and splicing the images to obtain a mosaic image; acquiring a mosaic image, restoring the mosaic image into a decrypted and encoded image, and selecting a shared image by using a secret key; converting the shared image and the decrypted coded image into a gray image and performing polar coordinate transformation to obtain an angle gray curve; and performing rotation angle recovery and recovering secret information based on the angle gray curve. The color image is used for steganography, and the generated image containing the secret is completely covered, so that secret information can be represented and effective camouflage can be realized; an angle gray curve is generated through polar coordinate transformation, and a rotation angle is determined to recover secret information, so that the method can better face common attacks, has higher tolerance degree on various noises, and has strong algorithm robustness.
Description
Technical Field
The invention relates to the technical field of information hiding, in particular to a mosaic puzzle camouflage steganography method with a rotated image block.
Background
Information hiding is a technique for hiding secret information from a particular digital medium for transmission and to try to avoid the information being discovered by a person other than the recipient. In a plurality of information hiding methods, carrier-free steganography rapidly becomes a hot spot of controversy research of a plurality of scholars by the outstanding capability of resisting various steganography analysis algorithms. "Carrier-free" does not mean that no carrier is required, but rather, in contrast to conventional information hiding, it emphasizes that no other carrier is required, but that the secret carrier is "generated/obtained" directly driven by the secret information. According to different carrier image acquisition modes, the image-based carrier-free information hiding algorithm can be divided into two types, namely a carrier image-selected carrier-free information hiding algorithm and a carrier image-generated carrier-free information hiding algorithm.
For the carrier-free steganographic scheme of carrier image selection, there are limitations: (1) The relevance between the unmodified natural image and the secret information is very limited, and if a huge image database needs to be searched to achieve the desired effect, the time cost of the search is still high even if the inverted index is introduced. (2) The steganographic method has extremely low information content in a single carrier, and involves intensive transmission of a large number of irrelevant natural images, so that the method is easy to cause doubt to an attacker.
The carrier-free information hiding algorithm generated by the carrier image avoids the limitation of a carrier-free steganography scheme selected based on the carrier image to a certain extent, so that the single-carrier encryption capacity is greatly improved, pan and the like drive to generate a pattern with a specific shape according to secret information and place the pattern at a specific position, then perform water shadow painting deformation to generate a texture image, and transmit the texture image; and the receiving end reads the graph and the position in the image and recovers the secret information. Si and the like select the image blocks in the constructed shared dictionary according to the secret information, synthesize a large-size image, perform water shadow image deformation and send the large-size image to a receiver; and the receiver reads the position of the image block in the dictionary to recover the secret information. Saad et al, driven by secret information, generates a mosaic image texture of a specific shape on a blank sheet, and transmits the mosaic image texture to a receiving party; the receiving party reads the shape recovery secret information of each jigsaw in the received image. Zhang et al generates a corresponding image to hide secret information by controlling pixel rendering on the basis of a fractal image generation algorithm; and the receiving end reads the shape and the rendering value of the generated image to recover the secret information. However, the secret image finally generated by the above method is a meaningless unnatural image, and an attack is easily induced. Zhao et al convert the gray image into a circular encoded image, and the encoded image is mapped to a corresponding position of the bunker image according to a secret key and a corresponding corner is added under the drive of secret information; the receiving end reads the rotation angle and the position of the coded image to restore the secret information. Although the method uses the small circular pictures to splice into the large picture with practical logic significance, the circular picture in the method does not cover the generated large picture integrally, a large amount of redundant space exists, and the method is easy to cause doubts of attackers and cause secondary attack.
Disclosure of Invention
This section is for the purpose of summarizing some aspects of embodiments of the invention and to briefly introduce some preferred embodiments. In this section, as well as in the abstract and the title of the invention of this application, simplifications or omissions may be made to avoid obscuring the purpose of the section, the abstract and the title, and such simplifications or omissions are not intended to limit the scope of the invention.
The present invention has been made in view of the above-mentioned problems.
Therefore, the technical problem solved by the invention is as follows: the embedding capacity of the carrier-free steganography is low, the construction cost of the gallery is high, and the generated carrier is meaningless.
In order to solve the technical problems, the invention provides the following technical scheme: a mosaic puzzle steganography method with image block rotation comprises the following steps:
randomly selecting an original shared image by using a secret key, acquiring a carrier image, and performing pixel replacement on the carrier image;
carrying out color mixing and rotation on the original shared image to obtain a mosaic image, and obtaining a mosaic image through image splicing;
acquiring the mosaic image and restoring the mosaic image into a decrypted and encoded image, and selecting a shared image by using a secret key;
converting the shared image and the decrypted encoded image into a gray image and performing polar coordinate transformation to obtain an angle gray curve;
and performing rotation angle recovery and recovering secret information based on the angle gray curve.
As a preferred embodiment of the mosaic camouflaging steganography method with image block rotation according to the present invention, wherein: the pixel replacement of the carrier image comprises:
dividing a carrier image into
Non-overlapping small blocks of size nxn are found->
Taking each small block B l (i, j), i, j = {1,2, \8230;, n } pixel R in the middle of the RGB three channels l (α,α)、G l (α,α)、B l (α, α), wherein>
Each block B l All pixel values of the middle RGB three channels are replaced by middle pixel values to generate a new carrier image.
As a preferred embodiment of the mosaic camouflaging steganography method with image block rotation according to the present invention, wherein: the toning of the original shared image includes:
the original shared image is reduced to n × n size, where n ≦ min { a, b }, resulting in
Obtaining a coded image
Each encoded image h is adjusted by equations (1) to (3) l To produce a coded image h l ′；
Wherein i, j = {1,2, \8230;, n }, function avgRh l ，avgGh l ，avgBh l Are respectively coded images h l And adding all pixel values of the three channels of RGB, and dividing the pixel values by the number of pixels to obtain the pixel average value of different channels.
As a preferred solution of the mosaic puzzle steganography method with rotated image blocks according to the present invention, wherein: the rotating acquisition of the steganographic encoded image includes:
the rotation angle theta is expressed by the following equations (4) to (6) l Coded image h added after tone conversion l ' Up, a new mosaic coded image is generated
θ l ＝β l +γ l (4)
Wherein, theta l Encoding an image h for embeddings l ' counterclockwise rotation angle; beta is a l For the angle of rotation, gamma, generated on the basis of secret information l Is a secret key K 2 Random angle of rotation, x, generated l Is [0,3 ]]Integer, y, corresponding to secret information l Is [1,3 ]]Random integer within.
As a preferred embodiment of the mosaic camouflaging steganography method with image block rotation according to the present invention, wherein: the mosaic image acquisition by image mosaic comprises the following steps:
and according to the obtained tone of the new carrier image, the embedded coded images with different tones after rotation are placed at the same position as the tone of the new carrier image, and mosaic images, namely the images embedded with the secret information, are generated by splicing.
As a preferred embodiment of the mosaic camouflaging steganography method with image block rotation according to the present invention, wherein: the restoring into a decrypted encoded image, comprising:
the receiving end acquires the mosaic image from the channel and divides the mosaic image into
Non-overlapping blocks of size n x n result in a coded image->
Using a shared key K 2 Will encode the picture>
Is rotated angle->
Is rotated randomly over a random angle of rotation->
Subtracting to obtain a decrypted encoded image->
As a preferred solution of the mosaic puzzle steganography method with rotated image blocks according to the present invention, wherein: the polar coordinate transformation includes:
by the formulae (7) to (8), let
To be->
Being the polar angle, d' = | | | d | | calculation 2 Performing polar coordinate transformation for the diameter of the pole;
wherein p = {1,2, \8230;, 3600},
encoding an image for decryption->
To the intermediate position of (a).
As a preferred embodiment of the mosaic camouflaging steganography method with image block rotation according to the present invention, wherein: the obtaining of the angle gray curve includes:
obtaining an angle gray-scale curve of the image by using equations (9) to (10):
wherein v (p) and u (p) are new horizontal and vertical coordinates respectively,
in order to decrypt the gray scale map of the encoded image, ε (p) is the sum of d' gray values in the radial direction `>
Angle gray curve of all radial gray values and gray values.
As a preferred embodiment of the mosaic camouflaging steganography method with image block rotation according to the present invention, wherein: the performing rotation angle restoration includes:
obtaining the rotation angle of the decrypted encoded image using equations (11) to (12)
Wherein q = {0,1, \8230;, 3600},
to decrypt the angular gray scale curve of the gray scale image of the encoded image,
angle gray curve, peak, of gray images for shared images l And (6) the shifting distance when the two angle gray scale curves are shifted and multiplied to obtain the maximum value.
As a preferred solution of the mosaic puzzle steganography method with rotated image blocks according to the present invention, wherein: the recovering secret information includes:
decrypting the secret information by using the formula (13) to obtain secret information secret;
wherein, the first and the second end of the pipe are connected with each other,
for decrypting the rotation angle of the encoded image 00, 01, 10, 11 are streams of binary secret information.
The invention has the beneficial effects that: the invention uses the color image which is widely applied in daily life for steganography, and the generated dense image-containing picture is seamlessly covered, so that effective camouflage can be carried out while the secret information is ensured to be correctly represented; during extraction, an angle gray curve is generated by utilizing polar coordinate transformation, the curve is shifted and compared to determine a rotating angle, and then secret information is recovered, so that the method has better performance in the face of common attacks, higher tolerance degree on various noises and strong algorithm robustness.
Drawings
In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the drawings required to be used in the description of the embodiments are briefly introduced below, and it is obvious that the drawings in the description below are only some embodiments of the present invention, and it is obvious for those skilled in the art that other drawings can be obtained according to the drawings without inventive labor. Wherein:
fig. 1 is an overall flowchart of a mosaic disguising steganography method with image block rotation according to an embodiment of the present invention;
fig. 2 is a flowchart of information embedding of a mosaic camouflaging steganography method with image block rotation according to an embodiment of the present invention;
fig. 3 is an information extraction flowchart of a mosaic disguise steganography method with image block rotation according to an embodiment of the present invention;
fig. 4 is a diagram of bit error rate results of different shared images when a key is wrong according to an embodiment of the present invention.
Detailed Description
In order to make the aforementioned objects, features and advantages of the present invention more comprehensible, embodiments accompanying figures of the present invention are described in detail below, and it is apparent that the described embodiments are a part, not all or all of the embodiments of the present invention. All other embodiments, which can be obtained by a person skilled in the art without making creative efforts based on the embodiments of the present invention, shall fall within the protection scope of the present invention.
In the following description, numerous specific details are set forth in order to provide a thorough understanding of the present invention, but the present invention may be practiced in other ways than those specifically described and will be readily apparent to those of ordinary skill in the art without departing from the spirit of the present invention, and therefore the present invention is not limited to the specific embodiments disclosed below.
Furthermore, the references herein to "one embodiment" or "an embodiment" refer to a particular feature, structure, or characteristic that may be included in at least one implementation of the present invention. The appearances of the phrase "in one embodiment" in various places in the specification are not necessarily all referring to the same embodiment, nor are separate or alternative embodiments mutually exclusive of other embodiments.
The present invention will be described in detail with reference to the drawings, wherein the cross-sectional views illustrating the structure of the device are not necessarily enlarged to scale, and are merely exemplary, which should not limit the scope of the present invention. In addition, the three-dimensional dimensions of length, width and depth should be included in the actual fabrication.
Meanwhile, in the description of the present invention, it should be noted that the terms "upper, lower, inner and outer" and the like indicate orientations or positional relationships based on the orientations or positional relationships shown in the drawings, and are only for convenience of describing the present invention and simplifying the description, but do not indicate or imply that the referred device or element must have a specific orientation, be constructed in a specific orientation and operate, and thus, cannot be construed as limiting the present invention. Furthermore, the terms first, second, or third are used for descriptive purposes only and are not to be construed as indicating or implying relative importance.
The terms "mounted, connected and connected" in the present invention are to be understood broadly, unless otherwise explicitly specified or limited, for example: can be fixedly connected, detachably connected or integrally connected; they may be mechanically, electrically, or directly connected, or indirectly connected through intervening media, or may be interconnected between two elements. The specific meanings of the above terms in the present invention can be understood in a specific case to those of ordinary skill in the art.
Example 1
Referring to fig. 1 to 4, in an embodiment of the present invention, a mosaic camouflaging steganography method with image block rotation is provided, including:
s1: and randomly selecting an original shared image by using a secret key, acquiring a carrier image, and performing pixel replacement on the carrier image.
Further, using a key K from a shared image library 1 Randomly selecting an a x b size original shared image I a×b 。
Further, the original shared image I a×b And amplifying to NXN, wherein N is larger than or equal to max { a, b }, and further obtaining a carrier image H.
Further, the carrier image H is divided into
Non-overlapping small blocks of size n × n to obtain
It should be noted that there is a direct relationship between the information embedding capacity and the size of the finally generated image and the size of the divided non-overlapping small blocks, and when the details of the image block loss are excessive, errors are caused.
It should be noted that the larger the size of the shared image and the size of the mosaic image, the better the visual effect of the generated image containing the mosaic image, but the time cost of the algorithm is increased, so that the formula can be used to give consideration to the visual effect, the algorithm efficiency and the extraction accuracy:
setting the size of the finally generated image and the size of the divided non-overlapping small blocks; where N is the size of the finally generated mosaic image M and N is B l The size of (c).
Further, each small block B is taken l (i, j), i, j = {1,2, \8230;, n } pixel R in the middle of the RGB three channels l (α,α)、G l (α,α)、B l (α, α) wherein
Each block B l All pixel values of middle RGB three channels are replacedThe conversion into intermediate pixel values yields the carrier image H'.
S2: and carrying out color mixing and rotation on the original shared image to obtain a mosaic image, and obtaining the mosaic image through image splicing.
Further, the original shared image I a×b Scaled down to n × n, where n ≦ min { a, b }, yielding
A number of coded pictures are taken>
Furthermore, each encoded image h is adjusted by equations (1) to (3) l To produce a coded image h l ′；
Wherein i, j = {1,2, \8230;, n }, function avgRh l ，avgGh l ，avgBh l Are respectively coded images h l And adding all pixel values of the three channels of RGB, and dividing the pixel values by the number of pixels to obtain the pixel average value of different channels.
Further, each two bits of the binary secret information stream are divided into a segment, and each segment is converted into a corresponding [0,3 ] segment]Integer of (i) and total
Section, if not sufficient>
The segment is then complemented by 0.
Further, it is advantageous toThe rotation angle theta is expressed by the following equations (4) to (6) l Coded image h added after tone conversion l ' Up, a new mosaic coded image is generated
θ l ＝β l +γ l (4)
Wherein, theta l Encoding an image h for embeddings l ' counterclockwise rotation angle; beta is a l For the angle of rotation, gamma, generated on the basis of secret information l Is a secret key K 2 Random angle of rotation, x, generated l Is [0,3 ]]Integer, y, corresponding to secret information l Is [1,3 ]]Random integer within.
Furthermore, the embeded coded image with different tones after rotation is encoded according to the tone of the carrier image H
And placing the mosaic image M at the position with the same color tone as the H' color tone, and splicing to generate a mosaic image M, wherein M is the image embedded with the secret information.
S3: and acquiring the mosaic image, restoring the mosaic image into a decrypted and encoded image, and selecting a shared image by using a secret key.
Further, the receiving end acquires the mosaic image M from the channel and divides the mosaic image M into
Non-overlapping small blocks of size nxn resulting in a decrypted coded image->
/>
Further, using a key K 1 Will shareShared images I selected in an image library a×b Down to n × n size and converted into a grayscale image.
S4: and converting the shared image and the decrypted encoded image into a gray image and performing polar coordinate transformation to obtain an angle gray curve.
Further, using a shared key K 2 To decrypt the encoded image
Is rotated angle->
Is rotated randomly over a random angle of rotation->
Subtracting to obtain a decrypted encoded image->
And combines the decrypted coded picture obtained>
Converted into a gray image->
Furthermore, the reaction is carried out by using the formulas (7) to (8)
To be->
Is polar angle, d' = | | | d | | non-woven phosphor 2 Is a polar path, and the decrypted encoded image is->
And carrying out polar coordinate transformation on the gray level image of the shared image:
wherein p = {1,2, \8230;, 3600},
encoding an image for decryption->
To the intermediate position of (a).
Furthermore, the angle gray-scale curves of the gray-scale images of the decrypted encoded image and the shared image are obtained by the following equations (9) to (10), wherein the angle gray-scale curves of the gray-scale images of the decrypted encoded image are:
the angle gray scale curve of the gray scale image of the shared image is: />
Wherein v (p) and u (p) are new horizontal and vertical coordinates respectively,
for decrypting a gray-scale image of the encoded image,. Epsilon. (p) is the sum of gray-scale values in the radial direction d',. Sub.>
Angle gray curve of all radial gray values and gray values.
S5: and recovering the rotation angle and the secret information based on the angle gray curve.
Further, the rotation angle of the decrypted encoded image is obtained by equations (11) to (12)
Wherein q = {0,1, \8230;, 3600},
to decrypt the angular gray scale curve of the gray scale image of the encoded image,
angle gray curve, peak, of gray images for shared images l And (6) the shifting distance when the two angle gray scale curves are shifted and multiplied to obtain the maximum value.
Further, the secret information is decrypted by using the formula (13) to obtain the secret information secret;
wherein, the first and the second end of the pipe are connected with each other,
for decrypting the rotation angle of the encoded image 00, 01, 10, 11 are streams of binary secret information.
Example 2
Referring to fig. 1 to 4, in order to verify the beneficial effects of the present invention, scientific demonstration is performed through economic efficiency calculation and simulation experiments.
In the present embodiment, the size of the finally generated image and the size of the divided non-overlapping small blocks are determined based on the information embedding capacity, which is calculated by the formula:
in which N is the finalThe size of the generated mosaic image M, n being B l The size of (d); the Error Rate (EBR) is used to measure the difference between the recovered binary Bit stream and the secret information, and the calculation formula is: />
Wherein l e To extract the number of erroneous bits,/ t Is the total number of bits transmitted.
As shown in table 1, when the block size is 16 × 16 without noise interference, error codes are caused due to excessive details of image block loss; therefore, in order to balance the time cost, the visual effect, the algorithm efficiency and the information extraction accuracy of the algorithm, the experiment selects the mode (c) in table 1, and the size of the shared image I is 512 × 512, n =2048, n =32; the number of the images in the shared image library is 9, and the embedding capacity of the single carrier of the generated mosaic image is 8192bits/carrier.
TABLE 1 comparison of different size image Algorithm Performance
Further, in order to test the robustness of the algorithm, the following attacks are performed on the mosaic image containing the secret in the experiment, and the attacks are respectively as follows:
(1) JPEG compression; the quality factors Q are 10, 30, 50, 70 and 90, respectively.
(2) Gaussian noise; the mean μ is 0 and the variance σ is 0.001, 0.005 and 0.1, respectively.
(3) Salt and pepper noise; the noise densities were 0.001 and 0.1, respectively.
(4) Filtering the mean value; the filter window sizes are 3 × 3, 5 × 5, and 7 × 7.
(5) Gaussian filtering; the filter window sizes are 3 × 3, 5 × 5, and 7 × 7.
(6) Center cutting; account for 20% and 50% of the image weight respectively.
(7) Cutting edges; account for 10% and 20% of the image weight respectively.
(8) Rotating; the rotation angles are 10 °, 30 ° and 50 °, respectively.
(9) Zooming; the scaling ratios were 0.3, 0.5, 0.75 and 1.5, respectively.
(10) Gamma correction; the coefficient was 0.8.
(11) And (4) equalizing the color histogram.
As shown in Table 2, since the present invention maps the secret information into the image rotation angle, the JPEG compression does not affect the detection of the image rotation angle, so the present invention has significant advantages in resisting the JPEG compression. The recovered secret information is hardly erroneous in coping with different degrees of noise. The invention also exhibits a lower bit error rate for different filtering windows. For image scaling attack, when the image scaling degree is 0.3, most details of the coded image in the secret-carrying image are lost, so that the rotation angle of the coded image cannot be accurately positioned when a receiving end recovers, and further, the recovery of secret information is slightly wrong.
TABLE 2bit error rate comparison under different attacks
Further, a security experiment is performed on four different original shared images in the shared image library to verify the shared key K 2 The experimental results show in fig. 4, and therefore, it is found that the average error rates of the four graphs after single decryption are 66.59%, 67.03%, 66.54%, 67.05% and 65.84%, respectively, and the average error rate of the five times is 66.61% when no secret key exists, and it can be seen that the original secret information can be recovered more accurately only when the correct secret key is provided.
Furthermore, since the detection result of the steganography analyzer cannot be close to the actual embedding rate, it can be seen that the detection is hardly effective under different actual embedding rates; therefore, the anti-steganography analysis is performed on the image steganography method by using the most common RS (Regular simple) algorithm for steganography analysis of the existing spatial domain image steganography technology, and the specific experimental result is shown in Table 3.
TABLE 3 detection results of steganalysis at different embedding rates
Therefore, the mosaic puzzle camouflage steganography method with the image block rotation, which is provided by the invention, can better meet the basic performance requirements of carrier-free steganography, has strong robustness, high single-carrier embedding capacity and strong safety, and can be applied to the fields of carrier-free information hiding, information safety and the like.
It should be recognized that embodiments of the present invention can be realized and implemented by computer hardware, a combination of hardware and software, or by computer instructions stored in a non-transitory computer readable memory. The methods may be implemented in a computer program using standard programming techniques, including a non-transitory computer-readable storage medium configured with the computer program, where the storage medium so configured causes a computer to operate in a specific and predefined manner, according to the methods and figures described in the detailed description. Each program may be implemented in a high level procedural or object oriented programming language to communicate with a computer system. However, the program(s) can be implemented in assembly or machine language, if desired. In any case, the language may be a compiled or interpreted language. Furthermore, the program can be run on a programmed application specific integrated circuit for this purpose.
Further, the operations of processes described herein can be performed in any suitable order unless otherwise indicated herein or otherwise clearly contradicted by context. The processes described herein (or variations and/or combinations thereof) may be performed under the control of one or more computer systems configured with executable instructions and may be implemented as code (e.g., executable instructions, one or more computer programs, or one or more applications) collectively executed on one or more processors, by hardware, or combinations thereof. The computer program includes a plurality of instructions executable by one or more processors.
Further, the method may be implemented in any type of computing platform operatively connected to a suitable connection, including but not limited to a personal computer, mini computer, mainframe, workstation, networked or distributed computing environment, separate or integrated computer platform, or in communication with a charged particle tool or other imaging device, or the like. Aspects of the invention may be embodied in machine-readable code stored on a non-transitory storage medium or device, whether removable or integrated into a computing platform, such as a hard disk, optically read and/or write storage medium, RAM, ROM, or the like, such that it may be read by a programmable computer, which when read by the storage medium or device, is operative to configure and operate the computer to perform the procedures described herein. Further, the machine-readable code, or portions thereof, may be transmitted over a wired or wireless network. The invention described herein includes these and other different types of non-transitory computer-readable storage media when such media include instructions or programs that implement the steps described above in conjunction with a microprocessor or other data processor. The invention also includes the computer itself when programmed according to the methods and techniques described herein. A computer program can be applied to input data to perform the functions described herein to transform the input data to generate output data that is stored to non-volatile memory. The output information may also be applied to one or more output devices, such as a display. In a preferred embodiment of the invention, the transformed data represents physical and tangible objects, including particular visual depictions of physical and tangible objects produced on a display.
As used in this application, the terms "component," "module," "system," and the like are intended to refer to a computer-related entity, either hardware, firmware, a combination of hardware and software, or software in execution. For example, a component may be, but is not limited to being: a process running on a processor, an object, an executable, a thread of execution, a program, and/or a computer. By way of example, both an application running on a computing device and the computing device can be a component. One or more components can reside within a process and/or thread of execution and a component can be localized on one computer and/or distributed between two or more computers. In addition, these components can execute from various computer readable media having various data structures thereon. The components may communicate by way of local and/or remote processes such as in accordance with a signal having one or more data packets (e.g., data from one component interacting with another component in a local system, distributed system, and/or across a network such as the internet with other systems by way of the signal).
It should be noted that the above-mentioned embodiments are only for illustrating the technical solutions of the present invention and not for limiting, and although the present invention has been described in detail with reference to the preferred embodiments, it should be understood by those skilled in the art that modifications or equivalent substitutions may be made on the technical solutions of the present invention without departing from the spirit and scope of the technical solutions of the present invention, which should be covered by the claims of the present invention.
Claims (10)
1. A mosaic disguise steganography method with image block rotation is characterized by comprising the following steps:
randomly selecting an original shared image by using a secret key, acquiring a carrier image, and performing pixel replacement on the carrier image;
carrying out color mixing and rotation on the original shared image to obtain a mosaic image, and obtaining a mosaic image through image splicing;
acquiring the mosaic image and restoring the mosaic image into a decrypted and encoded image, and selecting a shared image by using a secret key;
converting the shared image and the decrypted encoded image into a gray image and performing polar coordinate transformation to obtain an angle gray curve;
and performing rotation angle recovery and recovering secret information based on the angle gray curve.
2. The mosaic steganography method of image block rotation of claim 1, wherein: the pixel replacement of the carrier image comprises:
dividing a carrier image into
Non-overlapping small blocks of size nxn are found->
Taking each small block B l (i, j), i, j = {1,2, \8230;, n } pixel R in the middle of the RGB three channels l (α,α)、G l (α,α)、B l (α, α), wherein>
Each block B l All pixel values of the middle RGB three channels are replaced by middle pixel values to generate a new carrier image.
3. The mosaic steganography method of image block rotation of claim 1 or 2, wherein: the toning of the original shared image comprises:
the original shared image is reduced to n × n size, where n ≦ min { a, b }, resulting in
Obtaining a coded image
Each encoded image h is adjusted by equations (1) to (3) l To produce a coded image h l ′；
Wherein i, j = {1,2, \8230;, n }, function avgRh l ，avgGh l ，avgBh l Are respectively a coded picture h l And adding all pixel values of the three channels of RGB, and dividing the pixel values by the number of pixels to obtain the pixel average value of different channels.
4. The mosaic steganography method of image block rotation of claim 3, wherein: the rotation obtaining of the mosaic coded image comprises the following steps:
the rotation angle θ is expressed by the following equations (4) to (6) l Coded image h added after tone conversion l ' Up, a new embeded coded picture is generated
θ l ＝β l +γ l (4)
Wherein, theta l Encoding an image h for embeddings l ' counterclockwise rotation angle; beta is a l Is a rotation angle, gamma, generated from secret information l Is a secret key K 2 Random angle of rotation, x, generated l Is [0,3 ]]Integer, y, corresponding to secret information l Is [1,3 ]]Random integer within.
5. The mosaic steganography method with image block rotation of claim 4, wherein: the method for acquiring the mosaic image through image mosaic splicing comprises the following steps:
and according to the obtained tone of the new carrier image, the embedded coded images with different tones after rotation are placed at the same position as the tone of the new carrier image, and mosaic images, namely the images embedded with the secret information, are generated by splicing.
6. The mosaic steganography method of image block rotation of claim 5, wherein: said restoring to a decrypted encoded image comprises:
the receiving end acquires the mosaic image from the channel and divides the mosaic image into
Non-overlapping small blocks of size nxn are taken into the coded image->
Using a shared key K 2 Will encode the image->
In a rotating angle->
In (d) is selected and/or selected>
Subtracting to obtain a decrypted encoded image->
7. The mosaic steganography method with image block rotation of claim 5 or 6, wherein: the polar transformation comprises:
by the formulae (7) to (8), let
To be->
Is polar angle, d' = | | | d | | non-woven phosphor 2 Performing polar coordinate transformation for the diameter of the pole;
wherein p = {1,2, \8230;, 3600},
encoding an image for decryption->
To the intermediate position of (c).
8. The mosaic steganography method of image block rotation of claim 7, wherein: the obtaining of the angle gray curve includes:
obtaining an angle gray scale curve of an image by using equations (9) to (10):
wherein v (p) and u (p) are new horizontal and vertical coordinates respectively,
in order to decrypt the gray scale map of the encoded image, ε (p) is the sum of d' gray values in the radial direction `>
Angle gray curve of all radial gray values and gray values.
9. The mosaic steganography method of image block rotation of claim 8, wherein: the performing rotation angle restoration includes:
obtaining the rotation angle of the decrypted encoded image using equations (11) to (12)
Wherein q = {0,1, \8230;, 3600},
for decrypting an angular gray curve of a gray image of an encoded image>
Angle gray curve, peak, of gray images for shared images l And (6) the shifting distance when the two angle gray scale curves are shifted and multiplied to obtain the maximum value.
10. The mosaic steganography method of image block rotation of claim 8 or 9, wherein: the recovering secret information includes:
decrypting the secret information by using the formula (13) to obtain secret information secret;
wherein the content of the first and second substances,
for decrypting the rotation angle of the encoded image 00, 01, 10, 11 are streams of binary secret information. />
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211120147.5A CN115908092A (en) | 2022-09-14 | 2022-09-14 | Mosaic puzzle steganography method with image block rotation |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211120147.5A CN115908092A (en) | 2022-09-14 | 2022-09-14 | Mosaic puzzle steganography method with image block rotation |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN115908092A true CN115908092A (en) | 2023-04-04 |
Family
ID=86490186
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202211120147.5A Pending CN115908092A (en) | 2022-09-14 | 2022-09-14 | Mosaic puzzle steganography method with image block rotation |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115908092A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116958006A (en) * | 2023-09-19 | 2023-10-27 | 湖北微模式科技发展有限公司 | Equal-size image superposition algorithm based on pixel bidirectional fusion |
-
2022
- 2022-09-14 CN CN202211120147.5A patent/CN115908092A/en active Pending
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116958006A (en) * | 2023-09-19 | 2023-10-27 | 湖北微模式科技发展有限公司 | Equal-size image superposition algorithm based on pixel bidirectional fusion |
| CN116958006B (en) * | 2023-09-19 | 2024-01-02 | 湖北微模式科技发展有限公司 | Equal-size image superposition algorithm based on pixel bidirectional fusion |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Mandal et al. | Digital image steganography: A literature survey | |
| Malik et al. | Recovery based high capacity reversible data hiding scheme using even-odd embedding | |
| CN110430337B (en) | Image disguising and image restoring method, apparatus and storage medium | |
| CN110475038B (en) | Character and picture generating type hiding and recovering method combined with minimum closure coding | |
| CN113658032B (en) | Image watermark encryption and decryption method and system based on deep learning and image processing | |
| CN110430334B (en) | Mosaic camouflage and recovery method based on superposition of fan-shaped composition units | |
| CN102880999A (en) | Color image digital watermark method capable of resisting stamping, printing and scanning processes | |
| Kurup et al. | Data hiding scheme based on octagon shaped shell | |
| CN115908092A (en) | Mosaic puzzle steganography method with image block rotation | |
| Soualmi et al. | A novel blind medical image watermarking scheme based on Schur triangulation and chaotic sequence | |
| CN113592698B (en) | Sixteen-element moment-based multi-view color image zero watermark processing method and system | |
| CN106875324B (en) | Lossless image information concealing method based on SBDE | |
| Meenakshi et al. | A hybrid matrix factorization technique to free the watermarking scheme from false positive and negative problems | |
| Su et al. | Optical colour image watermarking based on phase-truncated linear canonical transform and image decomposition | |
| Niu et al. | Image steganography via fully exploiting modification direction | |
| CN110490789B (en) | Image abstract obtaining method based on color and structural features | |
| CN111598766B (en) | Encryption domain three-dimensional model reversible information hiding method based on prediction error expansion | |
| Lin et al. | Applying projection and B-spline to image authentication and remedy | |
| Cao et al. | Iterative embedding-based reversible watermarking for 2D-vector maps | |
| Yang | Robust Watermarking Scheme Based on Radius Weight Mean and Feature‐Embedding Technique | |
| US8369565B2 (en) | Information hiding with similar structures | |
| CN112884632B (en) | High-load image steganography method based on reconstruction matrix | |
| CN111598765B (en) | Three-dimensional model robust watermarking method based on homomorphic encryption domain | |
| CN111723346B (en) | Visual secret sharing method based on 'bamboo joint worm' reference matrix authentication | |
| Wang et al. | A novel (n, n) secret image sharing scheme based on Sudoku |
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 |