Information hiding method, device, equipment and medium

Abstract

The present application provides an information hiding method, device, equipment and medium, the method comprising: obtaining an original image, determining an initial differential matrix according to the difference of adjacent pixels in a set direction of the original image, adding at least the first element value of the initial differential matrix to the target value to obtain a first differential matrix, adding at least the binary bit stream information to be hidden to the second element value of the first differential matrix to obtain a second differential matrix, and determining an information hiding image according to the second differential matrix and the original image. The present application takes into account that the histogram of the initial differential matrix has a peak point higher than a set peak point threshold and a distribution state corresponding to the distribution state of a standard normal distribution, and only adjusts the element values ​​far from the peak point, and the element values ​​near the peak point that can represent most of the features of the original image remain unchanged, so that the information hiding image obtained after adding the secret information retains most of the features of the original image and has a high subjective quality.

Description

Technical Field

[0001] The present application relates to the technical field of information hiding, and in particular to an information hiding method, device, equipment and medium. Background Art

[0002] With the rapid development of Internet technology and multimedia information technology, it is becoming more and more common to transmit various information through the network, but at the same time it also brings hidden dangers of information security. Information hiding is a new method to solve media information security proposed in the field of information security and multimedia signal processing in recent years. It hides secret information in publicly available media information to achieve the purpose of verifying the data integrity of the media information or transmitting secret information, thus providing a new solution to the security problem of digital information.

[0003] The most commonly used image-based information hiding technology is the least significant bit (LSB) algorithm, which adds secret information to the least significant bit of the original image pixel value, that is, to the pixel level of the original image. This algorithm has the advantages of simplicity and high efficiency, but the subjective quality of the information hidden image obtained by this algorithm is low, that is, the visual perception of the human eye is poor. Summary of the invention

[0004] In view of this, the present application provides an information hiding method, device, equipment and medium for solving the problem of low subjective quality of information hiding images in the prior art. The technical solution is as follows:

[0005] An information hiding method, comprising:

[0006] Get the original image;

[0007] Determining an initial difference matrix according to adjacent pixel differences in a set direction of the original image, wherein the set direction is a row direction or a column direction, a peak point of a histogram of the initial difference matrix is ​​higher than a set peak point threshold, and a distribution state of the histogram of the initial difference matrix corresponds to a distribution state of a standard normal distribution;

[0008] At least a first element value of the initial difference matrix is ​​added to the target value to obtain a first difference matrix, wherein the first element value is greater than a preset pixel difference, and the preset pixel difference is a preset integer greater than or equal to 0;

[0009] At least adding the binary bit stream information to be hidden to the second element value of the first difference matrix to obtain a second difference matrix, wherein the binary bit stream information is bit stream information obtained by converting the secret information into binary form, and the second element value is equal to the preset pixel difference;

[0010] An information hidden image is determined according to the second difference matrix and the original image.

[0011] Optionally, if the set direction is a column direction, an initial difference matrix is ​​determined according to adjacent pixel differences in the set direction of the original image, including:

[0012] For each pixel value except the last pixel value in any row of the original image, the difference between the pixel value and the pixel value of the pixel value in the row where the pixel value is located is taken as the first adjacent pixel difference corresponding to the pixel value, so as to obtain the first adjacent pixel differences corresponding to all pixel values ​​except the last pixel value in each row of the original image;

[0013] An initial difference matrix is ​​formed by first adjacent pixel differences corresponding to all pixel values ​​except the last pixel value in each row of the original image;

[0014] If the set direction is the row direction, the initial difference matrix is ​​determined according to the adjacent pixel differences in the set direction of the original image, including:

[0015] For each pixel value except the last pixel value in any column of the original image, the difference between the pixel value and the pixel value of the pixel value in the column in which the pixel value is located is used as the second adjacent pixel difference corresponding to the pixel value, so as to obtain the second adjacent pixel differences corresponding to all pixel values ​​except the last pixel value in each column of the original image;

[0016] The initial difference matrix is ​​composed of the second adjacent pixel differences corresponding to all pixel values ​​except the last pixel value in each column of the original image.

[0017] Optionally, when the preset pixel difference is greater than 0, at least the element value greater than the preset pixel difference in the initial difference matrix is ​​added to the target value to obtain a first difference matrix, including:

[0018] A first differential matrix is ​​obtained by adding a target value to a first element value of an initial differential matrix and subtracting the target value from a third element value of the initial differential matrix, wherein the third element value is less than an inverse number of a preset pixel difference.

[0019] Optionally, at least the binary bit stream information to be hidden is added to the second element value of the first difference matrix to obtain a second difference matrix, including:

[0020] The binary bit stream information to be hidden is added to the second element value and the fourth element value of the first difference matrix, wherein the fourth element value is the opposite number of the second element value.

[0021] Optionally, the binary bit stream information to be hidden includes at least one binary bit value;

[0022] Adding the binary bit stream information to be hidden to the second element value and the fourth element value of the first difference matrix includes:

[0023] Scan the element values ​​in the first difference matrix in a preset order. For the currently scanned element value:

[0024] If the element value is the second element value or the fourth element value, and the binary bit value corresponding to the element value is 1, then add 1 to the element value;

[0025] If the element value is the second element value or the fourth element value, and the binary bit value corresponding to the element value is 0, the element value remains unchanged.

[0026] Optionally, if the direction is set to be a column direction, determining the information hidden image according to the second difference matrix and the original image includes:

[0027] The sum of the pixel value of the j+1th column in the original image and the element value of the jth column in the second difference matrix is ​​used as the pixel value of the jth column in the information hidden image, where 1≤j≤N-1, and N is the total number of columns in the original image;

[0028] The pixel value of the Nth column of the original image is used as the pixel value of the Nth column of the information hidden image;

[0029] If the direction is set to the row direction, the information hidden image is determined according to the second difference matrix and the original image, including:

[0030] The sum of the pixel value of the i+1th row in the original image and the element value of the ith row in the second difference matrix is ​​used as the pixel value of the ith row in the information hidden image, where 1≤i≤M-1, and M is the total number of rows in the original image;

[0031] The pixel values ​​of the Mth row in the original image are used as the pixel values ​​of the Mth row in the information hidden image.

[0032] An information hiding device comprises: an original image acquisition module, an initial difference matrix acquisition module, a first difference matrix determination module, a second difference matrix determination module and an information hiding image determination module;

[0033] An original image acquisition module, used for acquiring the original image;

[0034] An initial difference matrix acquisition module is used to determine an initial difference matrix according to adjacent pixel differences in a set direction of the original image, wherein the set direction is a row direction or a column direction, a peak point of a histogram of the initial difference matrix is ​​higher than a set peak point threshold, and a distribution state of the histogram of the initial difference matrix corresponds to a distribution state of a standard normal distribution;

[0035] A first difference matrix determination module, configured to add at least a first element value of an initial difference matrix to a target value to obtain a first difference matrix, wherein the first element value is greater than a preset pixel difference, and the preset pixel difference is a preset integer greater than or equal to 0;

[0036] A second differential matrix determination module, configured to add at least the binary bit stream information to be hidden to the second element value of the first differential matrix to obtain a second differential matrix, wherein the binary bit stream information is bit stream information obtained by converting the secret information into a binary form, and the second element value is equal to a preset pixel difference;

[0037] The information hidden image determination module is used to determine the information hidden image according to the second difference matrix and the original image.

[0038] Optionally, the first differential matrix determination module is specifically used to add the target value to the first element value of the initial differential matrix and subtract the target value from the third element value of the initial differential matrix when the preset pixel difference is greater than 0, so as to obtain the first differential matrix, wherein the third element value is less than the inverse of the preset pixel difference.

[0039] An information hiding device comprises a memory and a processor;

[0040] Memory, used to store programs;

[0041] The processor is used to execute the program to implement each step of any of the above information hiding methods.

[0042] A readable storage medium stores a computer program thereon, wherein when the computer program is executed by a processor, each step of any of the above-mentioned information hiding methods is implemented.

[0043] Through the above technical solution, it can be known that the information hiding method provided by the present application first obtains the original image, then determines the initial difference matrix according to the adjacent pixel difference in the set direction of the original image, then adds at least the first element value of the initial difference matrix to the target value to obtain the first difference matrix, then adds at least the binary bit stream information to be hidden to the second element value of the first difference matrix to obtain the second difference matrix, and finally determines the information hidden image according to the second difference matrix and the original image. The present application takes into account that the histogram of the initial difference matrix has a peak point higher than the set peak point threshold, and the distribution state corresponds to the distribution state of the standard normal distribution. Only a small number of element values ​​far from the peak point are adjusted, that is, at least the element value greater than the preset pixel difference in the initial difference matrix is ​​added to the target value, and most of the element values ​​near the peak point that can represent most of the features of the original image remain unchanged, so that after the binary bit stream information to be hidden is added to the second element value of the first difference matrix, the information hidden image determined by the present application can retain most of the features of the original image, so the subjective quality of the information hidden image is high. BRIEF DESCRIPTION OF THE DRAWINGS

[0044] In order to more clearly illustrate the embodiments of the present application or the technical solutions in the prior art, the drawings required for use in the embodiments or the description of the prior art will be briefly introduced below. Obviously, the drawings described below are only embodiments of the present application. For ordinary technicians in this field, other drawings can be obtained based on the provided drawings without paying any creative work.

[0045] Figure 1 A flowchart of the information hiding method provided in the embodiment of the present application;

[0046] Figure 2 Schematic diagram of the histogram of the Baboon image and the histogram of the initial difference matrix;

[0047] Figure 3 Schematic diagram of the histogram shift of the initial difference matrix;

[0048] Figure 4 A schematic diagram of the structure of an information hiding device provided in an embodiment of the present application;

[0049] Figure 5 This is a hardware structure block diagram of the information hiding device provided in an embodiment of the present application. DETAILED DESCRIPTION

[0050] The following will be combined with the drawings in the embodiments of the present application to clearly and completely describe the technical solutions in the embodiments of the present application. Obviously, the described embodiments are only part of the embodiments of the present application, not all of the embodiments. Based on the embodiments in the present application, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of this application.

[0051] In view of the problems existing in the prior art, the inventor of this case conducted in-depth research and finally proposed an information hiding method. The information hiding method provided by this application will be described in detail through the following embodiments.

[0052] See also Figure 1 , shows a schematic flow chart of an information hiding method provided in an embodiment of the present application, and the information hiding method may include:

[0053] Step S101, obtaining an original image.

[0054] Here, the original image is the image to which secret information needs to be added.

[0055] Step S102: determining an initial difference matrix according to the adjacent pixel differences in a set direction of the original image.

[0056] The setting direction is the row direction or the column direction, the peak point of the histogram of the initial difference matrix is ​​higher than the set peak point threshold, and the distribution state of the histogram of the initial difference matrix corresponds to the distribution state of the standard normal distribution. Here, the set peak point threshold refers to the peak point of the histogram of the original image.

[0057] Take the original image as Baboon image as an example, see Figure 2As shown, it is a schematic diagram of the histogram of the Baboon image and the histogram of the initial difference matrix, where (a) is the histogram of the Baboon image (here, Baboon is the image name), and (b) is the histogram of the initial difference matrix corresponding to the Baboon image. It can be seen that after studying the histogram of the initial difference matrix, the inventor of this case found that compared with the histogram of the Baboon image, the histogram of the initial difference matrix has a higher peak point and presents the characteristics of a "quasi" normal distribution. The "quasi" normal distribution, that is, the distribution state corresponds to the distribution state of the standard normal distribution, that is, the peak point of the histogram of the initial difference matrix is ​​near 0, and the two sides of the peak point are almost symmetrical (may not be completely symmetrical, but relatively close), so the number of element values ​​near the peak point in the initial difference matrix is ​​large, and the number of element values ​​far away from the peak point is small, and each element value near the peak point in the initial difference matrix can represent most of the features of the original image. Based on this, in the subsequent steps, the embedding position (i.e., the position where the secret information is added) can be found through the histogram of the initial difference matrix, and more redundant space can be constructed to improve the embedding rate.

[0058] Step S103: Add at least the first element value of the initial difference matrix to the target value to obtain a first difference matrix.

[0059] The first element value is greater than a preset pixel difference, the preset pixel difference is a preset integer greater than or equal to 0, and the target value is a positive integer greater than or equal to 1.

[0060] In this embodiment, if secret information needs to be added to the original image, the encryption party and the decryption party need to jointly discuss the embedding position, that is, the position of the preset pixel difference. Only the encryption party and the decryption party know the position of the preset pixel difference, thereby preventing the secret information from being known by others during the transmission process.

[0061] Based on this, for the encryption party, in the encryption process, some element values ​​of the initial differential matrix D can be adjusted through this step to construct embedded redundant bits, that is, at least the first element value of the initial differential matrix is ​​added to the target value to obtain a first differential matrix. Here, the first element value is greater than the preset pixel difference, that is, the first element value is the element value in the initial differential matrix D that is greater than the preset pixel difference.

[0062] For the convenience of subsequent description, the initial difference matrix is ​​recorded as D 0 , the first difference matrix is ​​recorded as D 1 , then the process of this step "adding the first element value of the initial difference matrix to the target value" may specifically include: scanning the initial difference matrix D in a preset order 0For the element value currently scanned, if the element value is the first element value (i.e., the element value is greater than the preset pixel difference), then add the target value to the element value; if the element value is not the first element value (i.e., the element value is less than or equal to the preset pixel difference), then keep the element value unchanged. For example, with the preset pixel difference as δ and the target value as 1, the initial difference matrix D 0 Taking the M*(N-1) dimensional matrix as an example, the initial difference matrix D 0 The modification process of each element value is as follows:

[0063]

[0064] In the above formula, 1≤i≤M, 1≤j≤N-1.

[0065] It should be noted that the above “adding the target value to the first element value of the initial difference matrix” is equivalent to shifting the first element value in the histogram of the initial difference matrix right by the target value. For details, see Figure 3 The initial difference matrix histogram after right shift shown in Figure (a) in the figure, the element values ​​in the first difference matrix obtained after right shift are all greater than the preset pixel difference plus the target value, or are less than or equal to the preset pixel difference.

[0066] For example, if the preset pixel difference is 0, the target value is 1, and the element values ​​in the initial difference matrix are 0-5, then this step can at least add 1 to the element values ​​greater than 0 in the initial difference matrix, which is equivalent to shifting the part of the histogram of the initial difference matrix greater than 0 right by 1, so that the element values ​​in the first difference matrix are 0, 2-6. It can be seen that the first difference matrix does not contain elements with element values ​​of 1; for another example, if the preset pixel difference is 2, the target value is 3, and the element values ​​in the initial difference matrix are 0-5, then this step can at least add 3 to the element values ​​greater than 2 in the initial difference matrix, which is equivalent to shifting the part of the histogram of the initial difference matrix greater than 2 right by 3, so that the element values ​​in the first difference matrix are 0-2, 6-8. It can be seen that the first difference matrix does not contain elements with element values ​​of 3, 4, and 5.

[0067] Step S104: Add at least the binary bit stream information to be hidden to the second element value of the first difference matrix to obtain a second difference matrix.

[0068] The binary bit stream information is the bit stream information obtained by converting the secret information into binary form, and the second element value is equal to the preset pixel difference, that is, the second element value is the element value in the first differential matrix that is equal to the preset pixel difference.

[0069] Specifically, it should be understood that the above-mentioned binary bit stream information to be hidden is bit stream information composed of at least one binary bit value, for example, the binary bit stream information to be hidden can be 001100. This step of "adding the binary bit stream information to be hidden to the second element value of the first differential matrix" is essentially to hide each binary bit value contained in the binary bit stream information to be hidden in different second element values ​​of the first differential matrix.

[0070] Based on this, optionally, the specific implementation process of the above-mentioned "adding the binary bit stream information to be hidden to the second element value of the first differential matrix to obtain the second differential matrix" may include: scanning the element values ​​in the first differential matrix in a preset order, and for the currently scanned element value: if the element value is the second element value, and the binary bit value corresponding to the element value is 1, then adding 1 to the element value; otherwise, keeping the element value unchanged. For example, with the preset pixel difference as δ, the initial differential matrix D 0 Taking the M*(N-1) dimensional matrix as an example, the first difference matrix D 1 The modification process of each element value is as follows:

[0071]

[0072] In the above formula, b represents the binary bit value, D 2 (i,j) represents the second difference matrix D 2 The element value in the i-th row and j-th column, 1≤i≤M, 1≤j≤N-1.

[0073] It should be noted that the correspondence between the element values ​​in the above-mentioned first differential matrix and the binary bit values ​​means that when the element values ​​in the first differential matrix are scanned in a preset order, for the first second element value scanned (i.e., the first element value equal to the preset pixel value), it corresponds to the first binary bit value contained in the binary bit stream information; for the second second element value scanned (i.e., the second element value equal to the preset pixel value), it corresponds to the second binary bit value contained in the binary bit stream information; and so on. For example, assuming that the binary bit stream information is 01, the element values ​​scanned in a preset order are [0, -3, 1, 3, -1, 0, 4, 5, 1], respectively, and the preset pixel difference is 1, that is, the second element value is 1, then the first "1" scanned (i.e., the third element value scanned) corresponds to the "0" in the binary bit stream information, and the second "1" scanned (i.e., the ninth element value scanned) corresponds to the second "1" in the binary bit stream information.

[0074] It is worth noting that each binary bit value contained in the binary bit stream information to be hidden can only be 0 or 1, which means that when the binary bit value 0 is added to the second element value in this step, the second element value remains unchanged, and when the binary bit value 1 is added to the second element value, the second element value becomes the preset pixel difference plus 1; since the first element value of the initial differential matrix has been adjusted in the previous step, the element values ​​in the first differential matrix are not equal to the preset pixel difference plus 1, therefore, even if the binary bit value 1 is added to the second element value in this step, the obtained new element value (i.e., the preset pixel difference plus 1) will not be confused with other element values, and thus, subsequent decryption can be successfully decrypted.

[0075] Step S105: Determine an information hidden image according to the second difference matrix and the original image.

[0076] In this embodiment, the encryption party and the decryption party need to transmit secret information through an image, so the encryption party needs to determine the information hidden image based on the second difference matrix and the original image. Thus, the decryption party can decrypt based on the information hidden image to obtain the secret information.

[0077] The information hiding method provided by the present application first obtains the original image, then determines the initial difference matrix according to the adjacent pixel difference in the set direction of the original image, then adds at least the first element value of the initial difference matrix to the target value to obtain the first difference matrix, then adds at least the binary bit stream information to be hidden to the second element value of the first difference matrix to obtain the second difference matrix, and finally determines the information hiding image according to the second difference matrix and the original image. The present application takes into account the characteristics that the histogram of the initial difference matrix has a peak point threshold value set by the peak point, and the distribution state corresponds to the distribution state of the standard normal distribution, and only adjusts a small number of element values ​​far from the peak point, that is, at least the element value greater than the preset pixel difference in the initial difference matrix is ​​added to the target value, and most of the element values ​​near the peak point that can represent most of the features of the original image remain unchanged, so that after the binary bit stream information to be hidden is added to the second element value of the first difference matrix, the information hiding image determined by the present application can retain most of the features of the original image, so the subjective quality of the information hiding image is high.

[0078] Further, when the target value is equal to 1, the present application at least adds the target value to the first element value of the initial differential matrix, so that when at least the binary bit stream information to be hidden is added to the second element value in the first differential matrix, the binary bit stream information to be hidden can be added to the lower significant bits of the original image pixel value; when the target value is greater than 1, the present application at least adds the target value to the first element value of the initial differential matrix, so that when at least the binary bit stream information to be hidden is added to the second element value in the first differential matrix, the binary bit stream information to be hidden can be added to the higher significant bits of the original image pixel value, thereby improving the embedding rate.

[0079] In summary, it has been proved through experiments that when the target value is equal to 1, the subjective quality and objective quality (based on objective quality evaluation of peak signal-to-noise ratio PSNR) of the information hiding image obtained by the information hiding method provided by the present application are better than the prior art; when the target value is a positive integer greater than 1, the information hiding method provided by the present application is better than the prior art in terms of embedding capacity or the subjective quality of the information hiding image obtained after adding the binary bit stream information to be hidden. Here, the subjective quality evaluation of the image is based on the visual characteristics of the human eye as the evaluation standard. If the human eye visual perception believes that the image quality is high, it means that the subjective quality of the image is high. On the contrary, if the human eye visual perception believes that the image quality is low, it means that the subjective quality of the image is low. For example, the subjective quality evaluation of the image can be evaluated by the structural similarity (SSIM, Structural Similarity Index) of the image; the objective quality evaluation of the image measures the quality of image restoration by the error of the information hiding image deviating from the original image. For example, the objective quality evaluation of the image can be evaluated by the mean square error (MSE, Mean Squared Error) and the peak signal-to-noise ratio (PSNR, Peak Signal-to-Noise Ratio).

[0080] An embodiment of the present application describes the process of the above-mentioned "step S102, determining an initial differential matrix according to the adjacent pixel differences in the set direction of the original image".

[0081] In an optional embodiment, taking the setting directions as the column direction and the row direction as examples, the process of "step S102, determining an initial differential matrix according to the adjacent pixel differences in the set direction of the original image" is described in detail.

[0082] Optionally, if the direction is set to be a column direction, the process of step S102 may include:

[0083] Step S1021a: For each pixel value except the last pixel value in any row of the original image, the difference between the pixel value and the backward adjacent pixel value of the pixel value in the row where the pixel value is located is used as the first adjacent pixel difference corresponding to the pixel value, so as to obtain the first adjacent pixel differences corresponding to all pixel values ​​except the last pixel value in each row of the original image.

[0084] Taking the original image I as an 8-bit grayscale image of size M*N as an example, I(i,j) represents the pixel value of the original image at position (i,j), then the first adjacent pixel difference D(i,j) corresponding to the pixel value I(i,j) is: D(i,j)=I(i,j)-I(i,j+1), where I(i,j+1) represents the backward adjacent pixel of I(i,j) in its own row, 1≤i≤M, 1≤j≤N-1.

[0085] Step S1022a, forming an initial difference matrix by first adjacent pixel differences corresponding to all pixel values ​​except the last pixel value in each row of the original image.

[0086] Optionally, if the direction is set to be a row direction, the process of step S102 may include:

[0087] Step S1021b: for each pixel value except the last pixel value in any column of the original image, the difference between the pixel value and the backward adjacent pixel value of the pixel value in the column where the pixel value is located is used as the second adjacent pixel difference corresponding to the pixel value, so as to obtain the second adjacent pixel differences corresponding to all pixel values ​​except the last pixel value in each column of the original image.

[0088] Taking the original image I as an 8-bit grayscale image of size M*N as an example, I(i,j) represents the pixel value of the original image at position (i,j), then the second adjacent pixel difference D(i,j) corresponding to the pixel value I(i,j) is: D(i,j)=I(i,j)-I(i+1,j), where I(i+1,j) represents the backward adjacent pixel of I(i,j) in its own column, 1≤i≤M-1, 1≤j≤N.

[0089] Step S1022b: An initial difference matrix is ​​formed by the second adjacent pixel differences corresponding to all pixel values ​​except the last pixel value in each column of the original image.

[0090] The initial differential matrix provided in the embodiment of the present application can be a matrix obtained based on the adjacent pixel differences in the row direction, or a matrix obtained based on the adjacent pixel differences in the column direction. Regardless of which matrix is ​​used, the peak point of the histogram of the initial differential matrix is ​​higher than the set peak point threshold, and the distribution state of the histogram of the initial differential matrix corresponds to the distribution state of the standard normal distribution. This characteristic characterizes that most of the element values ​​in the initial differential matrix are concentrated near the peak point (close to or equal to 0), while a small number of element values ​​are far from the peak point. Since most of the element values ​​near the peak point can represent most of the features of the original image, the subjective quality of the information hidden image is higher after being processed in subsequent steps.

[0091] An embodiment of the present application describes the above-mentioned process of "step S103, adding at least the first element value of the initial differential matrix to the target value to obtain a first differential matrix" and "step S104, adding at least the binary bit stream information to be hidden to the second element value of the first differential matrix to obtain a second differential matrix".

[0092] Optionally, the process of step S103 may include: adding the first element value of the initial difference matrix to the target value to obtain a first difference matrix; based on this, the process of step S104 may include: adding the binary bit stream information to be hidden to the second element value of the first difference matrix to obtain a second difference matrix. The specific implementation process of this optional process can be referred to the introduction in the above steps S103 and S104, which will not be repeated here.

[0093] In a preferred case, if the preset pixel difference δ is an integer greater than 0, the process of step S103 "adding at least the first element value of the initial difference matrix to the target value to obtain the first difference matrix" may include: adding the first element value of the initial difference matrix to the target value, and subtracting the target value from the third element value of the initial difference matrix to obtain the first difference matrix, where the third element value is less than the opposite of the preset pixel difference, that is, the third element value is less than the negative preset pixel difference. Specifically, the initial difference matrix D is scanned in a preset order. 0 The element value contained in the current scanned element value is: if the element value is the first element value (that is, the element value is greater than the preset pixel difference), then the element value is added to the target value; if the element value is the third element value (that is, the element value is less than the opposite of the preset pixel difference), then the element value is subtracted from the target value; otherwise, the element value remains unchanged. For example, with the preset pixel difference as δ and the target value as 1, the initial difference matrix D 0 Taking the M*(N-1) dimensional matrix as an example, the initial difference matrix D 0 The modification process of each element value is as follows:

[0094]

[0095] In the above formula, 1≤i≤M, 1≤j≤N-1.

[0096] See also Figure 3 The histogram of the initial difference matrix after left-right shifting is shown in Figure (b). The above "adding the target value to the first element value of the initial difference matrix and subtracting the target value from the third element value of the initial difference matrix" is equivalent to shifting the part of the first element value in the histogram of the initial difference matrix right by the target value, and shifting the part of the third element value in the histogram of the initial difference matrix left by the target value, so that the element values ​​in the first difference matrix obtained after left-right shifting are all greater than the preset pixel difference plus the target value, or less than or equal to the preset pixel difference and greater than or equal to the opposite of the preset pixel difference, or less than the opposite of the preset pixel difference minus the target value. For example, if the preset pixel difference is 2, the target value is 3, and the element values ​​in the initial difference matrix are -5 to 5, then this step can at least add 3 to the element values ​​greater than 2 in the initial difference matrix (i.e., the first element value), and subtract 3 from the element values ​​less than -2 in the initial difference matrix (i.e., the third element value), so that the element values ​​in the first difference matrix are -8 to -6, -2 to 2, and 6 to 8, that is, the first difference matrix does not include elements with element values ​​of 3, 4, 5 and -5, -4, and -3.

[0097] Based on this, the process of step S104 is "adding the binary bit stream information to be hidden to the second element value and the fourth element value of the first differential matrix to obtain a second differential matrix." Here, the fourth element value is the opposite of the second element value, that is, the fourth element value is equal to the negative preset pixel difference.

[0098] Specifically, the step of "adding the binary bit stream information to be hidden to the second element value and the fourth element value of the first differential matrix" essentially hides each binary bit value contained in the binary bit stream information to be hidden in the second element value or the fourth element value respectively.

[0099] Optionally, the specific implementation process of the above “adding the binary bit stream information to be hidden to the second element value and the fourth element value of the first differential matrix to obtain the second differential matrix” may include: sequentially scanning the element values ​​in the first differential matrix, and for the currently scanned element value: if the element value is the second element value or the fourth element value, and the binary bit value corresponding to the element value is 1, then add 1 to the element value; if the element value is the second element value or the fourth element value, and the binary bit value corresponding to the element value is 0, then keep the element value unchanged. For example, with the preset pixel difference as δ, the initial differential matrix D 0 Taking the M*(N-1) dimensional matrix as an example, the first difference matrix D 1 The modification process of each element value is as follows:

[0100]

[0101] In the above formula, b represents the binary bit value, D 2 (i,j) represents the second difference matrix D 2 The element value in the i-th row and j-th column, 1≤i≤M, 1≤j≤N-1.

[0102] It should be noted that the first element value, the second element value, the third element value and the fourth element value provided in the present application are only used to represent different element values, and there is no order or parity relationship between these four element values.

[0103] It should also be noted that the correspondence between the element values ​​in the above-mentioned first differential matrix and the binary bit values ​​means that when the element values ​​in the first differential matrix are scanned in a preset order, for the first second element value or fourth element value scanned (that is, the first element value equal to the preset pixel value, or the element value equal to the opposite of the preset pixel value), it corresponds to the first binary bit value contained in the binary bit stream information; for the second second element value or fourth element value scanned (that is, the second element value equal to the preset pixel value, or the element value equal to the opposite of the preset pixel value), it corresponds to the second binary bit value contained in the binary bit stream information; and so on. For example, assuming that the binary bit stream information is 011, the element values ​​scanned in the preset order are [0, -3, 1, 3, -1, 0, 4, 5, 1], and the preset pixel difference is 1, that is, the second element value is 1, and the fourth element value is -1. Then the first "1" scanned (that is, the third element value scanned) corresponds to the "0" in the binary bit stream information, the scanned "-1" (that is, the fifth element value scanned) corresponds to the first "1" in the binary bit stream information, and the second "1" scanned (that is, the ninth element value scanned) corresponds to the second "1" in the binary bit stream information.

[0104] It is worth noting that each binary bit value contained in the binary bit stream information to be hidden can only be 0 or 1, which means that when the binary bit value 0 is added to the second element value or the fourth element value in this step, the element value remains unchanged, and when the binary bit value 1 is added to the second element value or the fourth element value, the element value becomes the preset pixel difference plus 1; since the first element value and the third element value of the initial differential matrix have been adjusted in the previous step, the element values ​​in the first differential matrix are not equal to the preset pixel difference plus 1, and are not equal to the opposite of the preset pixel value minus 1. Therefore, even if the binary bit value 1 is added to the second element value or the fourth element value in this step, the obtained new element value (that is, the preset pixel difference plus 1, or the opposite of the preset pixel difference minus 1) will not be confused with other element values, and thus, subsequent decryption can be successfully decrypted.

[0105] In addition, in the embodiment of the present application, when the preset pixel difference δ is greater than 0, the binary bit stream information to be hidden can be added to the second element value and the fourth element value of the first initial difference matrix. Compared with the method of only adding the binary bit stream information to be hidden to the second element value of the first initial difference matrix, more secret information can be embedded in the original image, further improving the embedding rate.

[0106] An embodiment of the present application describes the process of the above-mentioned "step S105, determining the information hidden image according to the second difference matrix and the original image".

[0107] In an optional embodiment, taking the setting direction as the column direction and the row direction as examples, the process of the step of "determining the information hidden image according to the second differential matrix and the original image" is described in detail.

[0108] Optionally, if the direction is set to the column direction, the process of this step may include: taking the sum of the pixel value of the j+1th column in the original image and the element value of the jth column in the second differential matrix as the pixel value of the jth column in the information hidden image; and taking the pixel value of the Nth column in the original image as the pixel value of the Nth column in the information hidden image, where 1≤j≤N-1, and N is the total number of columns of the original image.

[0109] That is, taking the original image I as an M*N dimensional image as an example, that is, taking the second difference matrix D 2 Taking the M*(N-1) dimensional matrix as an example, the above process can be expressed as:

[0110]

[0111] In the above formula, I * represents the information hidden image, and I represents the original image.

[0112] Optionally, if the direction is set to the column direction, the process of this step may include: taking the sum of the pixel value of the i+1th row in the original image and the element value of the i-th row in the second differential matrix as the pixel value of the i-th row in the information hidden image; and taking the pixel value of the M-th row in the original image as the pixel value of the M-th row in the information hidden image, where 1≤i≤M-1, and M is the total number of rows of the original image.

[0113] That is, taking the original image I as an M*N dimensional image as an example, that is, taking the second difference matrix D 2 Taking the (M-1)*N dimensional matrix as an example, the above process can be expressed as:

[0114]

[0115] In the above formula, I * represents the information hidden image, and I represents the original image.

[0116] In an embodiment of the present application, when the direction is set to the column direction, the last column pixel value of the above-mentioned information hidden image is the same as the last column pixel value of the original image, so that the subsequent decryption party can use the last column pixel value as a reference pixel value to extract the hidden information and restore the original image; similarly, when the direction is set to the row direction, the last row pixel value of the above-mentioned information hidden image is the same as the last row pixel value of the original image, so that the subsequent decryption party can use the last row pixel value as a reference pixel value to extract the hidden information and restore the original image.

[0117] In order to enable those skilled in the art to better understand the above information hiding process, an optional specific embodiment of the present application is given below by taking the direction being set as the column direction as an example.

[0118] Optionally, after the encryption party and the decryption party discuss the preset pixel difference, different adding schemes may be adopted according to different values ​​of the preset pixel difference δ:

[0119] The first adding scheme: when the preset pixel difference δ is equal to 0 (the best embedding point of the secret information), the pixels whose corresponding adjacent pixel differences are 0 in the original image are used to add the secret information.

[0120] Specifically, firstly, the initial difference matrix D 0 The element values ​​greater than the preset pixel difference δ in the matrix are added to the target value to obtain the first difference matrix D 1 ; Then add the binary bit stream information to be hidden to the first difference matrix D 1 The second difference matrix D is obtained by taking the element value equal to the preset pixel difference δ in 2 ;Finally, according to the second difference matrix D 2 and the original image I, determine the information hidden image I * .

[0121] For example, assuming the target value is 1, the preset pixel difference δ is 0, and the original image I contains a row of pixel values ​​including: 145, 146, 146, 148, 147 and 147, then: the initial difference matrix D 0 The element values ​​included are: -1, 0, -2, 1 and 0; the first difference matrix D 1 The element values ​​included are: -1, 0, -2, 2 and 0; assuming that the binary bit stream to be hidden is 10, the second difference matrix D 2 The element values ​​included are: -1, 1, -2, 2 and 0; information hidden image I * The corresponding row pixel values ​​included include: 145, 147, 146, 149, 147 and 147. The second adding scheme: when the preset pixel difference δ is greater than 0, the pixels corresponding to the adjacent pixel difference of ±δ in the original image are used to add secret information.

[0122] Specifically, firstly, the initial difference matrix D 0 The element values ​​greater than the preset pixel difference δ in the matrix are added to the target value, and the initial difference matrix D 0 The first difference matrix D is obtained by subtracting the target value from the element value that is less than the opposite number (-δ) of the preset pixel difference. 1 ; Then add the binary bit stream information to be hidden to the first difference matrix D 1 The second difference matrix D is obtained by combining the element value equal to the preset pixel difference δ and the element value equal to the opposite number (-δ) of the preset pixel difference. 2 ;Finally, according to the second difference matrix D 2 and the original image I, determine the information hidden image I * .

[0123] For example, assuming the target value is 10, the preset pixel difference δ is 1, and the original image I contains a row of pixel values ​​including: 145, 146, 146, 148, 147 and 147, then: the initial difference matrix D 0 The element values ​​included are: -1, 0, -2, 1 and 0; the first difference matrix D 1 The element values ​​included are: -1, 0, -12, 1 and 0; assuming that the binary bit stream to be hidden is 10, the second difference matrix D 2 The element values ​​included are: -2, 0, -12, 1 and 0; information hidden image I * The corresponding row pixel values ​​included are: 144, 146, 136, 148, 147 and 147.

[0124] In summary, for the first adding scheme, the target value is equal to 1, and the binary bit stream information to be hidden is added to the lower bit positions of the original image pixel value. However, through experimental simulation verification, the subjective quality of the information hidden image obtained by the present application is higher; for the second adding scheme, the target value is greater than 1, and the binary bit stream information to be hidden can be added to the higher bit positions of the original image pixel value. For example, the original image pixel value is 146, that is, 10010010, and after processing by the present application, it becomes 136, that is, 10001000. It can be seen that the binary bit stream information is added to the higher significant bits, and the second adding scheme can add more secret information compared to the first adding scheme, thereby improving the embedding rate. Through experimental simulation verification, the subjective quality of the information hidden image obtained by the present application is also relatively high.

[0125] The embodiment of the present application further provides an information hiding device. The information hiding device provided by the embodiment of the present application is described below. The information hiding device described below and the information hiding method described above can be referred to each other.

[0126] See also Figure 4 , which shows a schematic diagram of the structure of the information hiding device provided by the embodiment of the present application, such as Figure 4 As shown, the information hiding device may include: an original image acquisition module 401, an initial difference matrix acquisition module 402, a first difference matrix determination module 403, a second difference matrix determination module 404 and an information hiding image determination module 405.

[0127] The original image acquisition module 401 is used to acquire the original image.

[0128] The initial difference matrix acquisition module 402 is used to determine the initial difference matrix according to the adjacent pixel differences in the set direction of the original image, wherein the set direction is the row direction or the column direction, the peak point of the histogram of the initial difference matrix is ​​higher than the set peak point threshold, and the distribution state of the histogram of the initial difference matrix corresponds to the distribution state of the standard normal distribution.

[0129] The first difference matrix determination module 403 is used to add at least the first element value of the initial difference matrix to the target value to obtain a first difference matrix, wherein the first element value is greater than a preset pixel difference, and the preset pixel difference is a preset integer greater than or equal to 0.

[0130] The second differential matrix determination module 404 is used to add at least the binary bit stream information to be hidden to the second element value of the first differential matrix to obtain a second differential matrix, wherein the binary bit stream information is the bit stream information obtained by converting the secret information into binary form, and the second element value is equal to the preset pixel difference.

[0131] The information hidden image determination module 405 is used to determine the information hidden image according to the second difference matrix and the original image.

[0132] The information hiding device provided by the present application first obtains the original image, then determines the initial difference matrix according to the adjacent pixel difference in the set direction of the original image, then adds at least the first element value of the initial difference matrix to the target value to obtain the first difference matrix, then adds at least the binary bit stream information to be hidden to the second element value of the first difference matrix to obtain the second difference matrix, and finally determines the information hiding image according to the second difference matrix and the original image. The present application takes into account that the histogram of the initial difference matrix has a peak point higher than the set peak point threshold, and the distribution state corresponds to the distribution state of the standard normal distribution. Only a small number of element values ​​far from the peak point are adjusted, that is, at least the element values ​​in the initial difference matrix that are greater than the preset pixel difference are added to the target value, and most of the element values ​​near the peak point that can represent most of the features of the original image remain unchanged, so that after the binary bit stream information to be hidden is added to the second element value of the first difference matrix, the information hiding image determined by the present application can retain most of the features of the original image, so the subjective quality of the information hiding image is high.

[0133] In a possible implementation, if the set direction is a column direction, the initial difference matrix acquisition module 402 may include: a first adjacent pixel difference determination module and a first matrix composition module.

[0134] Among them, the first adjacent pixel difference determination module is used to, for each pixel value except the last pixel value in any row of the original image, use the difference between the pixel value and the backward adjacent pixel value of the pixel value in the row where the pixel value is located as the first adjacent pixel difference corresponding to the pixel value, so as to obtain the first adjacent pixel differences corresponding to all pixel values ​​except the last pixel value in each row of the original image.

[0135] The first matrix composition module is used to form an initial difference matrix from the first adjacent pixel differences corresponding to all pixel values ​​in each row except the last pixel value in the original image.

[0136] In a possible implementation, if the set direction is a row direction, the initial difference matrix acquisition module 402 may include: a second adjacent pixel difference determination module and a second matrix composition module.

[0137] Among them, the second adjacent pixel difference determination module is used to, for each pixel value except the last pixel value in any column of the original image, use the difference between the pixel value and the backward adjacent pixel value of the pixel value in the column where the pixel value is located as the second adjacent pixel difference corresponding to the pixel value, so as to obtain the second adjacent pixel differences corresponding to all pixel values ​​except the last pixel value in each column of the original image.

[0138] The second matrix composition module is used to form an initial differential matrix from the second adjacent pixel differences corresponding to all pixel values ​​in each column except the last pixel value in the original image.

[0139] In one possible implementation, the above-mentioned first differential matrix determination module 403 can be specifically used to add the first element value of the initial differential matrix to the target value, and subtract the target value from the third element value of the initial differential matrix when the preset pixel difference is greater than 0, to obtain the first differential matrix, wherein the third element value is less than the inverse of the preset pixel difference.

[0140] In a possible implementation, the second difference matrix determination module 404 may be specifically used to add the binary bit stream information to be hidden to the second element value and the fourth element value of the first difference matrix, wherein the fourth element value is the opposite of the second element value.

[0141] In one possible implementation, the binary bit stream information to be hidden includes at least one binary bit value. Based on this, when the second differential matrix determination module 404 adds the binary bit stream information to be hidden to the second element value and the fourth element value of the first differential matrix, it can be specifically used to scan the element values ​​in the first differential matrix in a preset order. For the currently scanned element value, if the element value is the second element value or the fourth element value, and the binary bit value corresponding to the element value is 1, then the element value is increased by 1; if the element value is the second element value or the fourth element value, and the binary bit value corresponding to the element value is 0, then the element value remains unchanged.

[0142] In a possible implementation, if the set direction is the column direction, the information hidden image determination module 405 can be specifically used to take the sum of the pixel value of the j+1th column in the original image and the element value of the jth column in the second differential matrix as the pixel value of the jth column in the information hidden image, and take the pixel value of the Nth column of the original image as the pixel value of the Nth column of the information hidden image, where 1≤j≤N-1, and N is the total number of columns of the original image.

[0143] In a possible implementation, if the set direction is a row direction, the information hidden image determination module 405 can be specifically used to take the sum of the pixel value of the i+1th row of the original image and the element value of the i-th row in the second differential matrix as the pixel value of the i-th row in the information hidden image, and take the pixel value of the M-th row of the original image as the pixel value of the M-th row of the information hidden image, where 1≤i≤M-1, and M is the total number of rows of the original image.

[0144] The embodiment of the present application also provides an information hiding device. Optionally, Figure 5The hardware structure diagram of the information hiding device is shown in FIG. Figure 5 , the hardware structure of the information hiding device may include: at least one processor 501, at least one communication interface 502, at least one memory 503 and at least one communication bus 504;

[0145] In the embodiment of the present application, the number of the processor 501, the communication interface 502, the memory 503, and the communication bus 504 is at least one, and the processor 501, the communication interface 502, and the memory 503 communicate with each other through the communication bus 504;

[0146] The processor 501 may be a central processing unit (CPU), or an application-specific integrated circuit (ASIC), or one or more integrated circuits configured to implement the embodiments of the present invention;

[0147] The memory 503 may include a high-speed RAM memory, and may also include a non-volatile memory, such as at least one disk memory;

[0148] The memory 503 stores a program, and the processor 501 can call the program stored in the memory 503, and the program is used to:

[0149] Get the original image;

[0150] Determining an initial difference matrix according to adjacent pixel differences in a set direction of the original image, wherein the set direction is a row direction or a column direction, a peak point of a histogram of the initial difference matrix is ​​higher than a set peak point threshold, and a distribution state of the histogram of the initial difference matrix corresponds to a distribution state of a standard normal distribution;

[0151] At least a first element value of the initial difference matrix is ​​added to the target value to obtain a first difference matrix, wherein the first element value is greater than a preset pixel difference, and the preset pixel difference is a preset integer greater than or equal to 0;

[0152] At least adding the binary bit stream information to be hidden to the second element value of the first difference matrix to obtain a second difference matrix, wherein the binary bit stream information is bit stream information obtained by converting the secret information into binary form, and the second element value is equal to the preset pixel difference;

[0153] An information hidden image is determined according to the second difference matrix and the original image.

[0154] Optionally, the detailed functions and extended functions of the program may refer to the above description.

[0155] An embodiment of the present application further provides a readable storage medium on which a computer program is stored. When the computer program is executed by a processor, the above-mentioned information hiding method is implemented.

[0156] Optionally, the detailed functions and extended functions of the program may refer to the above description.

[0157] Finally, it should be noted that, in this article, relational terms such as and second are only used to distinguish one entity or operation from another entity or operation, and do not necessarily require or imply any such actual relationship or order between these entities or operations. Moreover, the terms "include", "comprises" or any other variants thereof are intended to cover non-exclusive inclusion, so that a process, method, article or device including a series of elements includes not only those elements, but also other elements not explicitly listed, or also includes elements inherent to such process, method, article or device. In the absence of further restrictions, the elements defined by the statement "comprises a ..." do not exclude the presence of other identical elements in the process, method, article or device including the elements.

[0158] The various embodiments in this specification are described in a progressive manner, and each embodiment focuses on the differences from other embodiments. The same or similar parts between the various embodiments can be referenced to each other.

[0159] The above description of the disclosed embodiments enables those skilled in the art to implement or use the present application. Various modifications to these embodiments will be apparent to those skilled in the art, and the general principles defined herein may be implemented in other embodiments without departing from the spirit or scope of the present application. Therefore, the present application will not be limited to the embodiments shown herein, but will conform to the widest scope consistent with the principles and novel features disclosed herein.

Claims

1. An information hiding method, characterized in that: include: Get the original image; Determining an initial difference matrix according to adjacent pixel differences in a set direction of the original image, wherein the set direction is a row direction or a column direction, a peak point of a histogram of the initial difference matrix is ​​higher than a set peak point threshold, and a distribution state of the histogram of the initial difference matrix corresponds to a distribution state of a standard normal distribution; Add at least a first element value of the initial difference matrix to a target value to obtain a first difference matrix, wherein the first element value is greater than a preset pixel difference, and the preset pixel difference is a preset integer greater than or equal to 0; At least adding the binary bit stream information to be hidden to the second element value of the first difference matrix to obtain a second difference matrix, wherein the binary bit stream information is bit stream information obtained by converting the secret information into binary form, and the second element value is equal to the preset pixel difference; An information hidden image is determined according to the second difference matrix and the original image.

2. The information hiding method according to claim 1, characterized in that: If the set direction is a column direction, determining an initial difference matrix according to adjacent pixel differences in the set direction of the original image includes: For each pixel value except the last pixel value in any row of the original image, the difference between the pixel value and the pixel value of the pixel value in the row where the pixel value is located is used as the first adjacent pixel difference corresponding to the pixel value, so as to obtain the first adjacent pixel differences corresponding to all pixel values ​​except the last pixel value in each row of the original image; The initial difference matrix is ​​formed by first adjacent pixel differences corresponding to all pixel values ​​except the last pixel value in each row of the original image; If the set direction is a row direction, determining an initial difference matrix according to adjacent pixel differences in the set direction of the original image includes: For each pixel value except the last pixel value in any column of the original image, the difference between the pixel value and the pixel value of the pixel value in the column in which the pixel value is located is used as the second adjacent pixel difference corresponding to the pixel value, so as to obtain the second adjacent pixel differences corresponding to all pixel values ​​except the last pixel value in each column of the original image; The initial difference matrix is ​​composed of second adjacent pixel differences corresponding to all pixel values ​​except the last pixel value in each column of the original image.

3. The information hiding method according to claim 1, characterized in that: When the preset pixel difference is greater than 0, at least adding the first element value of the initial difference matrix to the target value to obtain a first difference matrix includes: The first element value of the initial difference matrix is ​​added to a target value, and the target value is subtracted from the third element value of the initial difference matrix to obtain the first difference matrix, wherein the third element value is less than the inverse of the preset pixel difference.

4. The information hiding method according to claim 3, characterized in that: The step of adding at least the binary bit stream information to be hidden to the second element value of the first difference matrix to obtain a second difference matrix comprises: The binary bit stream information to be hidden is added to the second element value and the fourth element value of the first difference matrix, wherein the fourth element value is the opposite number of the second element value.

5. The information hiding method according to claim 4, characterized in that: The binary bit stream information to be hidden includes at least one binary bit value; The adding the to-be-hidden binary bit stream information to the second element value and the fourth element value of the first difference matrix comprises: The element values ​​in the first differential matrix are scanned in a preset order. For the currently scanned element value: If the element value is the second element value or the fourth element value, and the binary bit value corresponding to the element value is 1, then add 1 to the element value; If the element value is the second element value or the fourth element value, and the binary bit value corresponding to the element value is 0, the element value remains unchanged.

6. The information hiding method according to claim 1, characterized in that: If the set direction is a column direction, determining the information hidden image according to the second difference matrix and the original image includes: The sum of the pixel value of the j+1th column in the original image and the element value of the jth column in the second difference matrix is ​​used as the pixel value of the jth column in the information hidden image, where 1≤j≤N-1, and N is the total number of columns of the original image; Using the pixel value of the Nth column in the original image as the pixel value of the Nth column of the information hidden image; If the set direction is a row direction, determining the information hidden image according to the second difference matrix and the original image includes: The sum of the pixel value of the i+1th row in the original image and the element value of the ith row in the second difference matrix is ​​used as the pixel value of the ith row in the information hidden image, where 1≤i≤M-1, and M is the total number of rows in the original image; The pixel values ​​of the Mth row in the original image are used as the pixel values ​​of the Mth row in the information hidden image.

7. An information hiding device, characterized in that: include: An original image acquisition module, an initial difference matrix acquisition module, a first difference matrix determination module, a second difference matrix determination module and an information hiding image determination module; The original image acquisition module is used to acquire the original image; The initial difference matrix acquisition module is used to determine the initial difference matrix according to the adjacent pixel differences in the set direction of the original image, wherein the set direction is the row direction or the column direction, the peak point of the histogram of the initial difference matrix is ​​higher than the set peak point threshold, and the distribution state of the histogram of the initial difference matrix corresponds to the distribution state of the standard normal distribution; The first difference matrix determination module is used to add at least a first element value of the initial difference matrix to a target value to obtain a first difference matrix, wherein the first element value is greater than a preset pixel difference, and the preset pixel difference is a preset integer greater than or equal to 0; The second difference matrix determination module is used to add at least the binary bit stream information to be hidden to the second element value of the first difference matrix to obtain a second difference matrix, wherein the binary bit stream information is bit stream information obtained by converting the secret information into binary form, and the second element value is equal to the preset pixel difference; The information hidden image determination module is used to determine the information hidden image according to the second difference matrix and the original image.

8. The information hiding device according to claim 7, characterized in that: The first differential matrix determination module is specifically used to add the first element value of the initial differential matrix to the target value when the preset pixel difference is greater than 0, and subtract the target value from the third element value of the initial differential matrix to obtain the first differential matrix, wherein the third element value is less than the inverse of the preset pixel difference.

9. An information hiding device, characterized in that: including memory and processor; The memory is used to store programs; The processor is used to execute the program to implement each step of the information hiding method according to any one of claims 1 to 6.

10. A readable storage medium having a computer program stored thereon, characterized in that: When the computer program is executed by a processor, each step of the information hiding method according to any one of claims 1 to 6 is implemented.

Images