WO2017063357A1 - 一种数据隐藏方法及隐藏系统 - Google Patents

一种数据隐藏方法及隐藏系统 Download PDF

Info

Publication number
WO2017063357A1
WO2017063357A1 PCT/CN2016/081390 CN2016081390W WO2017063357A1 WO 2017063357 A1 WO2017063357 A1 WO 2017063357A1 CN 2016081390 W CN2016081390 W CN 2016081390W WO 2017063357 A1 WO2017063357 A1 WO 2017063357A1
Authority
WO
WIPO (PCT)
Prior art keywords
bit
value
square image
image block
diagonal
Prior art date
Application number
PCT/CN2016/081390
Other languages
English (en)
French (fr)
Inventor
赵东宁
张勇
谢维信
李岩山
喻建平
陈剑勇
Original Assignee
深圳大学
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by 深圳大学 filed Critical 深圳大学
Priority to JP2017525795A priority Critical patent/JP6453461B2/ja
Priority to US15/444,308 priority patent/US10311757B2/en
Publication of WO2017063357A1 publication Critical patent/WO2017063357A1/zh

Links

Classifications

    • G—PHYSICS
    • G09—EDUCATION; CRYPTOGRAPHY; DISPLAY; ADVERTISING; SEALS
    • G09C—CIPHERING OR DECIPHERING APPARATUS FOR CRYPTOGRAPHIC OR OTHER PURPOSES INVOLVING THE NEED FOR SECRECY
    • G09C1/00—Apparatus or methods whereby a given sequence of signs, e.g. an intelligible text, is transformed into an unintelligible sequence of signs by transposing the signs or groups of signs or by replacing them by others according to a predetermined system
    • G—PHYSICS
    • G09—EDUCATION; CRYPTOGRAPHY; DISPLAY; ADVERTISING; SEALS
    • G09C—CIPHERING OR DECIPHERING APPARATUS FOR CRYPTOGRAPHIC OR OTHER PURPOSES INVOLVING THE NEED FOR SECRECY
    • G09C5/00—Ciphering apparatus or methods not provided for in the preceding groups, e.g. involving the concealment or deformation of graphic data such as designs, written or printed messages
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L2209/00—Additional information or applications relating to cryptographic mechanisms or cryptographic arrangements for secret or secure communication H04L9/00
    • H04L2209/16—Obfuscation or hiding, e.g. involving white box

Definitions

  • the present invention relates to the field of data hiding technologies, and in particular, to a data hiding method and a hiding system.
  • Encrypted transmission is a traditional solution, but it also brings problems such as complex key management, low system efficiency, and easy attention to interceptors.
  • Data hiding technology can solve these problems well by hiding the secret data to be transmitted in the general file carrier content, and then transmitting the general file carrier with hidden secret data to the receiver through the common transmission channel, and the receiver passes
  • Corresponding data extraction methods obtain secret data hidden in the general file carrier.
  • the data hiding transmission mode can avoid the attention of the network interceptor, and improve the security and confidentiality of the data transmission without affecting the system efficiency and reducing the complexity of the key management.
  • multimedia files such as images, video, audio, etc.
  • carrier files for data hiding transmission are generally easier to edit and process.
  • image acquisition becomes more and more easy.
  • the use of images as data carriers for data hiding transmission has become the most common data hiding transmission method.
  • the existing image-based data hiding transmission mode under the premise of ensuring the quality of the carrier image after the hidden data, the amount of data that can be hidden in the image is not large enough, which affects the image-based data hiding transmission mode in the data hiding transmission. Applicability.
  • the technical problem to be solved by the present invention is to provide a data hiding method and a hiding system, which use an image as a data hiding carrier to improve the amount of data hidden in an image while ensuring image quality.
  • the present invention is implemented as follows:
  • a data hiding method includes the following steps:
  • Step A converting data into a bit sequence; when the bit number of the bit sequence is odd, filling a bit at the end of the bit sequence and assigning its value to 0 or 1;
  • Step B extracting the values of two bits from the bit sequence as a group in the order of the bit sequence, and obtaining M bit value groups; setting the previous bit in each bit value group
  • the value of the bit is the first bit value in the set of bit values, and the value of the latter bit is the value of the second bit in the set of values of the bit;
  • Step C Divide the rectangular image as the carrier of the data into P square image blocks of the same size, P ⁇ M, and extract the first M square image blocks; each square image block in the M square image blocks Having a first diagonal and a second diagonal;
  • Step D detecting gray values of each pixel of each square image block and the second diagonal line of the M square image blocks, to obtain a first diagonal of each square image block and a diagonally-ordered pixel gray value sequence, and detecting a reverse-order parity of each pixel gray value sequence, obtaining a sequence of pixel gray values of the first diagonal and the second diagonal of each square image block Reverse order parity;
  • Step E representing a value of one bit by a reverse order parity of a sequence of pixel gray values of each diagonal line, and correspondingly matching the M square image blocks with the M bit value groups, each The reverse order parity of the first diagonal line of the square image block and the pixel gray value sequence of the second diagonal line and the first bit value and the second bit value of the bit value group corresponding to the square image block respectively
  • detecting a value represented by a reverse order parity of a first diagonal line and a second diagonal pixel gray value sequence of each of the M square image blocks and the square image block Whether the first bit value and the second bit value in the corresponding bit value group are respectively consistent, and if not, performing pixel position adjustment on the square image block, so that the first diagonal of the square image block and the first The value represented by the inverse order parity of the two diagonal pixel gray value sequence coincides with the first bit value and the second bit value in the bit value group corresponding to the square image block, respectively.
  • the M is not a prime number.
  • Step E1 When the value represented by the inverse order parity of only the first diagonal of the pixel gray value sequence in the square image block does not coincide with the first bit value in the bit value group corresponding to the square image block Extracting two pixels whose gradation values are not equal and having the smallest difference from the first diagonal line, and swapping the two pixels to change the reverse order of the pixel gray value sequence of the first diagonal line Parity
  • Step E2 when the value represented by the inverse order parity of the second diagonal diagonal pixel value sequence in the square image block does not coincide with the second bit value in the bit value group corresponding to the square image block Extracting two pixels whose gradation values are not equal and having the smallest difference from the second diagonal line, and swapping the two pixels to change the reverse order of the pixel gray value sequence of the second diagonal line Parity
  • Step E3 when the value represented by the inverse order parity of the pixel diagonal value sequence of the first diagonal line and the second diagonal line in the square image block is the first of the bit bit value groups corresponding to the square image block
  • the following steps are included:
  • Step E3-1 extracting one pixel from each of the first diagonal line and the second diagonal line of the square image block, and exchanging the two pixels;
  • Step E3-2 After the interchange, detecting whether the reverse order parity of the first diagonal line and the second diagonal pixel gray value sequence of the square image block are changed, and if not, the swap is discarded. And returning to step E3-1 until the reverse order parity of the first diagonal line and the second diagonal pixel gray value sequence of the square image block are changed.
  • the principle of extracting one pixel from each of the first diagonal line and the second diagonal line of the square image block is as follows: the difference between the gray values of the extracted two pixels is from small to large, from gray Two pixels with the smallest difference in degree values are extracted.
  • W is an even number and W ⁇ 4.
  • a data transmission method using an image as a data carrier comprising the steps included in the data hiding method described above, after the step included in the data hiding method, further comprising the following steps:
  • Step F Transmitting a rectangular image as a carrier of the data and its key; the key comprising the size and number of bits as recited in claim 1.
  • a method for extracting data sent by the above data sending method includes the following steps:
  • Step 1 reading the received rectangular image as a carrier of the data and its key; the key includes the size and the number of bits as claimed in claim 1, and the number of bits is N;
  • Step 2 Divide the rectangular image into P square image blocks of the size, and extract the first M square image blocks therefrom, and M is (N+1)/2 rounded;
  • Step 3 Detect a gray value of each pixel of each square image block and a second diagonal line of the M square image blocks, to obtain a first diagonal of each square image block and a first a diagonally-ordered pixel gray value sequence, and detecting a reverse-order parity of each pixel gray value sequence, obtaining a sequence of pixel gray values of the first diagonal and the second diagonal of each square image block Reverse order parity;
  • Step 4 The first diagonal of each square image block in the M square image blocks and the principle that the value of one bit of the pixel gray value sequence of each diagonal line represents the value of one bit
  • the bit value represented by the inverse order parity of the diagonal line of the two diagonal pixels is arranged in the order of each square image block to obtain a bit sequence; when the number of bits is odd, the obtained bit sequence is removed The last bit of the ;
  • Step 5 Restore the resulting bit sequence to data.
  • a data hiding system comprising:
  • a data conversion module configured to convert data into a bit sequence; when the bit number of the bit sequence is an odd number, fill a bit at the end of the bit sequence, and assign a value of 0 or 1;
  • bit grouping module configured to extract a value of two bits from the bit sequence each time as a group according to an arrangement order of the bit sequence, to obtain M bit value groups; and set each bit value group
  • the value of the previous bit is the first bit value in the bit value group, and the value of the latter bit is the second bit value in the bit value group;
  • An image dividing module configured to divide a rectangular image as a carrier of the data into P square image blocks of the same size, P ⁇ M, and extract the first M square image blocks; each of the M square image blocks The square image block has a first diagonal and a second diagonal;
  • An image block detecting module configured to detect gray values of each of the first diagonal line and the second diagonal line of each of the M square image blocks, to obtain a first pair of each square image block a sequence of pixel gray values of the diagonal line and the second diagonal line, and detecting a reverse order parity of each pixel gray value sequence, to obtain a pixel of the first diagonal and the second diagonal of each square image block The inverse order parity of the sequence of degrees;
  • An image block adjustment module configured to represent a value of one bit by a reverse order parity of a sequence of pixel gray values of each diagonal line, and the M square image blocks and the M bit value groups are one by one Correspondingly, a reverse order parity of a sequence of pixel gray values of the first diagonal and the second diagonal of each square image block and a first bit value and a second of the bit value group corresponding to the square image block
  • the principle that the bit values respectively correspond to detecting a value represented by a reverse order parity of a sequence of pixel gray values of the first diagonal line and the second diagonal line of each of the square image blocks in the M square image blocks Whether the first bit value and the second bit value in the bit value group corresponding to the square image block are respectively consistent, and if not, performing pixel position adjustment on the square image block to make the first pair of the square image block
  • the value represented by the inverse order parity of the sequence of pixel gray values of the diagonal line and the second diagonal coincides with the first bit value and the second bit value
  • the image block adjustment module performs pixel position adjustment on the square image block:
  • the principle that the image block adjustment module extracts one pixel from each of the first diagonal line and the second diagonal line of the square image block is: the difference between the gray values of the extracted two pixels is small The large order is extracted from the two pixels with the smallest difference in gray values.
  • each square image block can hide two-bit data through the reverse-order parity of its two diagonal pixel gray value sequences, so that the data hidden in the image The amount will be twice the number of image blocks that the image is split into.
  • the quality of the image is The effect is small and the image quality is guaranteed.
  • FIG. 1 is a schematic flow chart of a data hiding method provided by the present invention
  • FIG. 2 is a schematic diagram of bit grouping in a data hiding method provided by the present invention.
  • FIG. 3 is a schematic diagram of image division in a data hiding method provided by the present invention.
  • Figure 4 Square image block and its diagonal diagram
  • FIG. 5 is a schematic flowchart of a method for extracting data sent by the above data sending method according to the present invention.
  • Figure 6 is a schematic diagram showing the composition of a data hiding system provided by the present invention.
  • the data hiding method proposed by the present invention uses an image as a data carrier, and the transmitting end converts the secret data into a bit sequence, and then the bit sequence is The value of each bit is hidden in the image, and the image with the secret data hidden is obtained and sent to the receiving end, and the receiving end can extract the hidden secret data from the image according to the corresponding key.
  • the present invention provides a data hiding method, which includes the following steps:
  • Step A Converting the data into a bit sequence; when the bit number of the bit sequence is an odd number, padding one bit at the end of the bit sequence and assigning its value to 0 or 1.
  • Step B extracting the values of two bits from the bit sequence as a group in the order of the bit sequence, and obtaining M bit value groups; setting the previous bit in each bit value group
  • the value of the bit is the first bit value in the set of bit values, and the value of the latter bit is the value of the second bit in the set of values of the bit.
  • the bit is the smallest unit of storage in the computer, the value of the bit is represented by 0 or 1, and the computer represents the data by a sequence of bits.
  • the present invention contemplates concealing data by dividing a rectangular image into a number of square image blocks, each square image block hiding data for two bits.
  • the bits in the bit sequence are grouped as described above, each group containing the value of two bits.
  • the first bit value group includes values of the first bit and the second bit, which are 1 and 1, respectively, wherein the value of the first bit is in the first bit value group.
  • a first bit value a value of the second bit is a second bit value in the first bit value group
  • a second bit value set includes a value of the third bit and the fourth bit, 0 and 1, respectively, wherein the value of the third bit is the first bit value in the second bit value group, and the value of the fourth bit is the second bit in the second bit value set. Value; subsequent sets of bit values and so on.
  • the number of bits is odd, since the last group contains only the value of one bit, in this case, for the convenience of calculation, a bit is filled at the end of the bit sequence, and the padded bit is The value is set to 0 or 1, so that the last bit value group contains two bit values.
  • Step C Divide the rectangular image as the carrier of the data into P square image blocks of the same size, P ⁇ M, and extract the first M square image blocks; each square image block in the M square image blocks There is a first diagonal and a second diagonal.
  • the rectangular image is divided into P square image blocks, that is, the P square image blocks constitute a complete rectangular image.
  • the present invention intends to divide a rectangular image into a plurality of square image blocks, each square image block hiding data of two bits, that is, each square image block hides data of one bit value group, and thus, is divided.
  • the number of square image blocks should at least reach the number of bit value groups divided in step B, ie P ⁇ M.
  • the first M square image blocks are sequentially extracted starting from the start position of the rectangular image (such as the upper right corner).
  • Figure 3 shows a more ideal result of the division.
  • the length and width of the rectangular image are integer multiples of the width of the square image block, which is just divided into P square image blocks.
  • the rectangular image is divided in its length and/or width direction. The end will leave a portion of the area of the square image that is insufficient to form the size, which does not have a substantial impact on the hiding and extraction of the data.
  • Step D detecting gray values of each pixel of each square image block and the second diagonal line of the M square image blocks, to obtain a first diagonal of each square image block and a diagonally-ordered pixel gray value sequence, and detecting a reverse-order parity of each pixel gray value sequence, obtaining a sequence of pixel gray values of the first diagonal and the second diagonal of each square image block Reverse order parity.
  • a schematic diagram of a square image block is shown in FIG. In the figure, the diagonal line from the upper left corner to the lower right corner is defined as the first diagonal of the square image block, and the diagonal line from the upper right corner to the lower left corner is defined as the second diagonal of the square image block.
  • a sequence of pixel gray values of the first diagonal line and the second diagonal line of the square image block is obtained by detecting gray values of pixels of the first diagonal line and the second diagonal line.
  • Each diagonal pixel gray value sequence has its parity, since the value of the bit is either 1 or 0, and the reverse order parity of the sequence is either odd or even, so a diagonal
  • the inverse ordinal parity of the sequence of pixel gray value values of the line may represent the value of one bit, and each square image block has two diagonal lines representing the value of two bits. Therefore, it is necessary to detect the inverse order parity of the first diagonal line and the second diagonal pixel gray value sequence of each square image block, so as to subsequently determine each of the M square image blocks in the current situation.
  • Step E representing a value of one bit by a reverse order parity of a sequence of pixel gray values of each diagonal line, and correspondingly matching the M square image blocks with the M bit value groups, each The reverse order parity of the first diagonal line of the square image block and the pixel gray value sequence of the second diagonal line and the first bit value and the second bit value of the bit value group corresponding to the square image block respectively
  • detecting a value represented by a reverse order parity of a first diagonal line and a second diagonal pixel gray value sequence of each of the M square image blocks and the square image block Whether the first bit value and the second bit value in the corresponding bit value group are respectively consistent, and if not, performing pixel position adjustment on the square image block, so that the first diagonal of the square image block and the first The value represented by the inverse order parity of the two diagonal pixel gray value sequence coincides with the first bit value and the second bit value in the bit value group corresponding to the square image block, respectively.
  • the value of the represented bit is 1, and when the parity is even, the value of the represented bit is zero.
  • FIG. 4 if the square image block corresponds to the second bit value group shown in FIG. 2, the reverse order parity of the first diagonal line of the square image block should be even. The reverse order parity of the sequence of pixel gray values of the second diagonal should be odd. If it is detected that the inverse order parity of the first and second diagonal pixel gray value sequences of the square image block are respectively even and odd, the first and second diagonal pixel grays of the square image block are indicated.
  • the value represented by the inverse order parity of the sequence of degrees is identical to the first bit value and the second bit value in the bit value group corresponding to the square image block, respectively, and the square image block does not need to be adjusted, otherwise, This square image block needs to be adjusted.
  • the pixel position adjustment of the square image block is only required, so that the reverse order parity of the first diagonal line and the second diagonal pixel gray value sequence of the square image block is performed.
  • the value indicated may be identical to the first bit value and the second bit value in the bit value group corresponding to the square image block, respectively.
  • the method of performing pixel position adjustment on a square image block is as follows:
  • Step E1 When the value represented by the inverse order parity of only the first diagonal of the pixel gray value sequence in the square image block does not coincide with the first bit value in the bit value group corresponding to the square image block Extracting two pixels whose gradation values are not equal and having the smallest difference from the first diagonal line, and swapping the two pixels to change the reverse order of the pixel gray value sequence of the first diagonal line Parity.
  • Step E2 when the value represented by the inverse order parity of the second diagonal diagonal pixel value sequence in the square image block does not coincide with the second bit value in the bit value group corresponding to the square image block Extracting two pixels whose gradation values are not equal and having the smallest difference from the second diagonal line, and swapping the two pixels to change the reverse order of the pixel gray value sequence of the second diagonal line Parity.
  • step E1 and step E2 since only two pixels are extracted on the first diagonal or the second diagonal for interchange, and the two pixels are extracted, the principle of minimum distortion is adopted (that is, the gray value is extracted). The two pixels with the smallest difference), so that the distortion is controlled to the maximum after the interchange, the impact on the adjusted image quality is minimal.
  • Step E3 when the value represented by the inverse order parity of the pixel diagonal value sequence of the first diagonal line and the second diagonal line in the square image block is the first of the bit bit value groups corresponding to the square image block
  • the following steps are included:
  • Step E3-1 extracting one pixel from each of the first diagonal line and the second diagonal line of the square image block, and exchanging the two pixels;
  • Step E3-2 After the interchange, detecting whether the reverse order parity of the first diagonal line and the second diagonal pixel gray value sequence of the square image block are changed, and if not, the swap is discarded. And returning to step E3-1 until the reverse order parity of the first diagonal line and the second diagonal pixel gray value sequence of the square image block are changed.
  • step E3 since only one pixel is required to be interchanged on the first diagonal line and the second diagonal line, it is equivalent to changing the gray level of one pixel on each diagonal line, thereby controlling The distortion of the entire rectangular image after adjustment ensures the quality of the adjusted image.
  • a certain principle must be followed when extracting one pixel from the first diagonal line and the second diagonal line of the square image block, that is, according to the extraction
  • the difference between the gray values of the two pixels is from small to large, starting from two pixels with the smallest difference in gray values.
  • the difference between the gradation values refers to the difference between the gradation values of the pixels on the first diagonal line and the pixels on the second diagonal line in the square image block.
  • a square image block has a plurality of pixels on the first diagonal line and the second diagonal line, and there must be one pixel on each of the two diagonal lines, so that the difference between the gray values of the two pixels is smaller than the two The difference in gray values of other pixels on the diagonal.
  • the two pixels are interchanged, and the reverse order number parity of the first diagonal line and the second diagonal pixel gray value sequence of the square image block after the interchange is detected.
  • the present invention also provides a data transmission method using an image as a data carrier, comprising the steps included in any of the above data hiding methods, and after the step included in the data hiding method, further comprising the step F: using the data as a carrier
  • the rectangular image and its key are sent out.
  • the key therein includes the size of the square image block into which the rectangular image is divided and the number of bits of the bit sequence into which the data is converted.
  • the key is used when the receiving end receives the rectangular image and performs data extraction.
  • the size of the key is used to determine how to divide the received rectangular image, that is, according to the size, the rectangular image is divided into a plurality of square image blocks having the size, and the divided square image blocks can be combined to form the foregoing Rectangular image.
  • the number of bits is used to determine whether the bit sequence is padded when the data is hidden. If the bit number of the bit sequence is odd, it indicates that there is padding, and the bit at the end of the restored bit sequence needs to be removed.
  • the present invention further provides a method for extracting data sent by the above data sending method, comprising the following steps:
  • Step 1 reading the received rectangular image as a carrier of the data and its key; the key therein includes the size of the square image block into which the rectangular image is divided and the number of bits of the bit sequence into which the data is converted, Let the number of bits be N.
  • Step 2 Divide the rectangular image into P square image blocks of the size, and extract the first M square image blocks therefrom, and M is (N+1)/2 rounded.
  • the number P of square image blocks obtained will be an integer part not less than (N+1)/2, and the integer part will be exactly The number of bit value groups in the step of the data hiding method, therefore, according to step C of the data hiding method, only the first M square image blocks are hidden with data, so only the first M square image blocks need to be extracted.
  • Step 3 Detect a gray value of each pixel of each square image block and a second diagonal line of the M square image blocks, to obtain a first diagonal of each square image block and a first a diagonally-ordered pixel gray value sequence, and detecting a reverse-order parity of each pixel gray value sequence, obtaining a sequence of pixel gray values of the first diagonal and the second diagonal of each square image block Reverse order parity.
  • Step 4 The first diagonal of each square image block in the M square image blocks and the principle that the value of one bit of the pixel gray value sequence of each diagonal line represents the value of one bit
  • the bit value represented by the inverse order parity of the diagonal line of the two diagonal pixels is arranged in the order of each square image block to obtain a bit sequence; when the number of bits is odd, the obtained bit sequence is removed The last bit of the bit.
  • the principle of representing the value of one bit by the inverse order parity of the sequence of pixel gray values of each diagonal line is consistent with the corresponding principle described in step E of the data hiding method.
  • the density is The number of bits in the key can also be replaced by the parity of the number of bits, which have an equivalent effect.
  • Step 5 Restore the resulting bit sequence to data.
  • the present invention also provides a data hiding system, including:
  • a data conversion module 1 for converting data into a bit sequence; when the bit number of the bit sequence is odd, filling a bit at the end of the bit sequence and assigning its value to 0 or 1;
  • bit grouping module 2 configured to extract a value of two bits from the bit sequence each time as a group according to an arrangement order of the bit sequence, to obtain M bit value groups; and set each bit value group
  • the value of the previous bit in the bit value group is the first bit bit value in the bit bit value group, and the value of the latter bit bit is the second bit bit value in the bit bit value group;
  • the image dividing module 3 is configured to divide a rectangular image as a carrier of the data into P square image blocks of the same size, P ⁇ M, and extract the first M square image blocks; each of the M square image blocks Square image blocks having a first diagonal and a second diagonal;
  • the image block detecting module 4 is configured to detect gray values of the first diagonal line and the second diagonal line of each of the M square image blocks, to obtain the first of each square image block. a sequence of pixel gray values of the diagonal and the second diagonal, and detecting a reverse order parity of each pixel gray value sequence to obtain a first diagonal and a second diagonal pixel of each square image block The inverse order number parity of the gray value sequence;
  • the image block adjustment module 5 is configured to represent a value of one bit by a reverse order parity of a sequence of pixel gray values of each diagonal line, and set the M square image block and the M bit value by one Correspondingly, the inverse order parity of the first diagonal line and the second diagonal pixel gray value sequence of each square image block and the first bit value of the bit value group corresponding to the square image block and the first The principle that the two bit values respectively correspond to the values of the reverse order parity of the first diagonal line and the second diagonal pixel gray value sequence of each of the square image blocks in the M square image blocks are detected.
  • first bit value and the second bit value in the bit value group corresponding to the square image block are respectively consistent, and if not, performing pixel position adjustment on the square image block to make the first of the square image block.
  • the values represented by the inverse order parity of the diagonal gray line and the second diagonal pixel gray value sequence are identical to the first bit value and the second bit value in the bit bit value group corresponding to the square image block, respectively. .
  • the principle that the image block adjustment module 5 extracts one pixel from each of the first diagonal line and the second diagonal line of the square image block is: in the order of the difference between the gray values of the extracted two pixels, from small to large, The extraction is started from two pixels with the smallest difference in gray values.
  • the binary image data is taken as an example to illustrate the data hiding, transmitting, receiving, and extracting processes of the present invention.
  • the data to be transmitted is a binary image
  • the size of the binary image is 320*240.
  • the binary image needs to be converted into a bit sequence.
  • the binary image can be scanned by raster scanning, the gray level of each pixel in the binary image is converted into a bit value, and the bit sequence is sequentially formed.
  • the bit sequence contains 76800 bit values.
  • the bit sequence is extracted as a set of two bit values each time in the order of arrangement, thereby being divided into 38400 sets of bit values arranged in order.
  • the number of square image blocks should be no less than 38,400 sets.
  • the bit sequence grouping and the rectangular image are divided.
  • the first 38,400 square image blocks are extracted from the rectangular image, and the 38,400 square image blocks are arranged in order from left to right and top to bottom.
  • the 38400 square image blocks are in one-to-one correspondence with the aforementioned 38400 bit value groups, that is, the first square image block (the square image block in the upper left corner) corresponds to the first bit value group, and the second square image The block corresponds to the second set of bit values, and the 38400th square image block corresponds to the 38400th bit value set. Meanwhile, the reverse order parity of the first diagonal line and the second diagonal pixel gray value sequence of each square image block and the first bit value of the bit value group corresponding to the square image block and the second The bit values correspond to each other.
  • the inverse order parity of the first diagonal and the second diagonal pixel gray value sequence of each square image block is detected, respectively.
  • the inverse of the gray value sequence is defined as an odd diagonal representing a bit value of 1, and the reverse order parity of the gray value sequence is an even diagonal representing a bit value of zero.
  • the square image block shown in FIG. 4 is a square image block corresponding to the second bit value group in the bit sequence shown in FIG. 2, that is, the second square image block in FIG.
  • the size of the square image block is 16*16
  • the diagonal line from the upper left corner to the lower right corner is the first diagonal line of the square image block
  • the diagonal line from the upper right corner to the lower left corner is the second image of the square image block. diagonal.
  • the first bit value of the second bit value group is 0, and the second bit value is 1.
  • the inverse order parity of the first diagonal of the pixel diagonal value sequence in the square image block should be 0, and the reverse order parity of the second diagonal pixel gray value sequence should be 1.
  • the square image block has the following four cases: 1. If the reverse order parity of the first diagonal line of the square image block and the pixel diagonal value sequence of the second diagonal line are even and odd, respectively, the square image The block does not need to be adjusted. 2. If the inverse order parity of the first diagonal line and the second diagonal pixel gray value sequence of the square image block are even and even, respectively, the second diagonal of the square image block needs to be adjusted. The order of the pixels is arranged such that the inverse order parity of the sequence of pixel gray values of the second diagonal becomes odd. When adjusting, any two pixels with unequal gray values on the second diagonal can be interchanged to change the reverse order parity of the sequence of pixel gray values, but the image distortion is adjusted to the maximum extent.
  • the two pixels whose gradation values on the diagonal are not equal and the difference is the smallest should be interchanged. 3. If the inverse order parity of the first diagonal line and the second diagonal pixel gray value sequence of the square image block are odd and odd, respectively, the first diagonal of the square image block needs to be adjusted. The pixel arrangement order is such that the reverse order parity of the pixel diagonal value sequence of the first diagonal becomes even, and the adjustment method is the same as that in the second case, and will not be described again. 4. If the inverse order parity of the first diagonal line and the second diagonal pixel gray value sequence of the square image block are odd and even, respectively, from the first diagonal and the second diagonal Extracting one pixel separately and exchanging.
  • the difference between the gray values of the extracted two pixels is from small to large, and is extracted from two pixels with the smallest difference of gray values until the square image block
  • the inverse order parity of the sequence of pixel gray values of the first diagonal line and the second diagonal line are even and odd, respectively.
  • the sender can send the rectangular image and key with data hidden.
  • the key includes a bit number of the bit sequence converted by the binary image data, and a size of the square image block into which the rectangular image is divided, and may further include a related parameter at the time of conversion, such as a size of the binary image. .
  • the receiving end divides the rectangular image according to the size of the key, and extracts the first 38400 square image blocks according to the arrangement order of the divided square image blocks.
  • the size of the binary image is 320*240, that is, the total number of pixels is 76,800, so the number of bits in the key is 76,800, which is an even number. Therefore, there is no padding, and the obtained bit sequence is converted from the original binary image. a bit sequence in which each value in the bit sequence represents the value of a corresponding pixel in the binary image, such that, based on the size of the binary image in the key 320*240, it is easy to restore the bit sequence to a binary image.

Landscapes

  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Editing Of Facsimile Originals (AREA)
  • Compression Or Coding Systems Of Tv Signals (AREA)
  • Image Processing (AREA)

Abstract

方案涉及数据隐藏技术领域，尤其涉及一种数据隐藏方法及隐藏系统。所述方法以图像作为数据载体，发送端将秘密数据转换成比特序列后，将比特序列中每一比特位的值隐藏于图像中，得到隐藏有秘密数据的图像并发送给接收端，接收端可根据相应密钥从图像中提取出隐藏的秘密数据。隐藏数据时，每个正方形图像块可通过其两条对角线的像素灰度值序列的逆序数奇偶性隐藏两比特位的数据，这样，在图像中隐藏的数据量将是图像所拆分成的图像块数量的两倍。而且，在对正方形图像块进行像素位置调整时，由于只需调整该正方形图像块的第一对角线和第二对角线上的最多两个像素的灰度值，因此，对图像的质量影响很小，保证了图像质量。

Description

一种数据隐藏方法及隐藏系统 技术领域
本发明涉及数据隐藏技术领域，尤其涉及一种数据隐藏方法及隐藏系统。
背景技术
近年来，随着移动互联网、4G等通讯技术的飞速发展，使得信息的传输变得越来越便捷，但同时也带来了数据传输的安全保密性等问题。加密传输是一种传统的解决方法，但其同时也带来了密钥管理复杂、系统效率变低、容易引起拦截者注意等问题。数据隐藏技术可以很好地解决这些问题，通过将所要传输的秘密数据隐藏于一般的文件载体内容中，再通过公共传输信道将这些隐藏有秘密数据的一般文件载体传输给接收者，接收者通过相应的数据提取方法，获得隐藏于一般文件载体的秘密数据。这种数据隐藏传输方式可以避免引起网络拦截者的注意，在不影响系统效率，同时可减少密钥管理复杂性的情况下，提高数据传输的安全保密性。
随着多媒体处理技术的快速发展，图像、视频、音频等多媒体文件作为数据隐藏传输的载体文件，一般更为容易编辑和处理。特别是随着智能手机、IPAD、数码相机等的普遍应用，图像采集变得越来越容易，利用图像作为数据载体进行数据隐藏传输已成为最常见的一种数据隐藏传输方式。然而，现有的基于图像的数据隐藏传输方式在保证隐藏数据后载体图像的质量的前提下，图像中可以隐藏的数据量还不够大，影响了基于图像的数据隐藏传输方式在数据隐藏传输中的应用性。
 技术问题
本发明所要解决的技术问题是，提供一种数据隐藏方法及隐藏系统，利用图像作为数据隐藏载体，在保证图像质量的前提下提高隐藏于图像的数据量。
技术解决方案
本发明是这样实现的：
一种数据隐藏方法，包括如下步骤：
步骤A：将数据转换成比特序列；当所述比特序列的比特位数为奇数时，在所述比特序列的末尾填充一个比特位，并将其值赋为0或1；
步骤B：按所述比特序列的排列顺序从所述比特序列中每次提取两个比特位的值作为一组，得到M个比特位值组；设每个比特位值组中的前一个比特位的值为该比特位值组中的第一比特位值，后一个比特位的值为该比特位值组中的第二比特位值；
步骤C：将作为所述数据的载体的矩形图像划分成P个大小相同的正方形图像块，P≥M，并提取其中前M个正方形图像块；该M个正方形图像块中每个正方形图像块具有第一对角线和第二对角线；
步骤D：检测所述M个正方形图像块中每个正方形图像块的第一对角线和第二对角线上各像素的灰度值，得到各正方形图像块的第一对角线和第二对角线的像素灰度值序列，并检测每个像素灰度值序列的逆序数奇偶性，得到各正方形图像块的第一对角线和第二对角线的像素灰度值序列的逆序数奇偶性；
步骤E：以每条对角线的像素灰度值序列的逆序数奇偶性表示一个比特位的值，按所述M个正方形图像块与所述M个比特位值组一一对应，每个正方形图像块的第一对角线和第二对角线的像素灰度值序列的逆序数奇偶性与该正方形图像块对应的比特位值组的第一比特位值和第二比特位值分别对应的原则，检测所述M个正方形图像块中每个正方形图像块的第一对角线和第二对角线的像素灰度值序列的逆序数奇偶性所表示的值与该正方形图像块对应的比特位值组中的第一比特位值和第二比特位值是否分别一致，如果否，则对该正方形图像块进行像素位置调整，使该正方形图像块的第一对角线和第二对角线的像素灰度值序列的逆序数奇偶性所表示的值与该正方形图像块对应的比特位值组中的第一比特位值和第二比特位值分别一致。
进一步地，所述M不为素数。
进一步地，对正方形图像块进行像素位置调整的方法如下：
步骤E1：当该正方形图像块中仅第一对角线的像素灰度值序列的逆序数奇偶性所表示的值与该正方形图像块对应的比特位值组中的第一比特位值不一致时，从该第一对角线上提取灰度值不相等且差值最小的两个像素，并将这两个像素互换，以改变该第一对角线的像素灰度值序列的逆序数奇偶性；
步骤E2：当该正方形图像块中仅第二对角线的像素灰度值序列的逆序数奇偶性所表示的值与该正方形图像块对应的比特位值组中的第二比特位值不一致时，从该第二对角线上提取灰度值不相等且差值最小的两个像素，并将这两个像素互换，以改变该第二对角线的像素灰度值序列的逆序数奇偶性；
步骤E3：当该正方形图像块中第一对角线和第二对角线的像素灰度值序列的逆序数奇偶性所表示的值与该正方形图像块对应的比特位值组中的第一比特位值和第二比特位值分别不一致时，包括如下步骤：
步骤E3-1：从该正方形图像块的第一对角线和第二对角线上各提取一个像素，并将这两个像素互换；
步骤E3-2：互换后，检测该正方形图像块的第一对角线和第二对角线的像素灰度值序列的逆序数奇偶性是否都改变，如果否，则放弃该次互换并返回步骤E3-1，直到该正方形图像块的第一对角线和第二对角线的像素灰度值序列的逆序数奇偶性都改变。
进一步地，从正方形图像块的第一对角线和第二对角线上各提取一个像素的原则为：按所提取的两个像素的灰度值之差由小到大的顺序，从灰度值之差最小的两个像素开始提取。
进一步地，设所述正方形图像块的大小为W*W，则W为偶数，且W≥4。
一种以图像为数据载体的数据发送方法，包括上述所述的数据隐藏方法所包含的步骤，在所述数据隐藏方法所包含的步骤之后，还包括如下步骤：
步骤F：将作为所述数据的载体的矩形图像及其密钥发送出去；所述密钥包括如权利要求1中所述的大小和比特位数。
一种以上述数据发送方法发送的数据的提取方法，包括如下步骤：
步骤1：读取接收到的作为数据的载体的矩形图像及其密钥；所述密钥包括如权利要求1中所述的大小和比特位数，设所述比特位数为N；
步骤2：将所述矩形图像划分为P个具有所述大小的正方形图像块，并从中提取前M个正方形图像块，M为(N+1)/2取整；
步骤3：检测所述M个正方形图像块中每个正方形图像块的第一对角线和第二对角线上各像素的灰度值，得到各正方形图像块的第一对角线和第二对角线的像素灰度值序列，并检测每个像素灰度值序列的逆序数奇偶性，得到各正方形图像块的第一对角线和第二对角线的像素灰度值序列的逆序数奇偶性；
步骤4：以每条对角线的像素灰度值序列的逆序数奇偶性表示一个比特位的值的原则，将所述M个正方形图像块中各正方形图像块的第一对角线和第二对角线的像素灰度值序列的逆序数奇偶性所表示的比特位值按各正方形图像块的顺序排列，得到比特序列；当所述比特位数为奇数时，去掉所得到的比特序列的最后一个比特位；
步骤5：将所得到的比特序列还原为数据。
一种数据隐藏系统，包括：
数据转换模块，用于将数据转换成比特序列；当所述比特序列的比特位数为奇数时，在所述比特序列的末尾填充一个比特位，并将其值赋为0或1；
比特位分组模块，用于按所述比特序列的排列顺序从所述比特序列中每次提取两个比特位的值作为一组，得到M个比特位值组；设每个比特位值组中的前一个比特位的值为该比特位值组中的第一比特位值，后一个比特位的值为该比特位值组中的第二比特位值；
图像划分模块，用于将作为所述数据的载体的矩形图像划分成P个大小相同的正方形图像块，P≥M，并提取其中前M个正方形图像块；该M个正方形图像块中每个正方形图像块具有第一对角线和第二对角线；
图像块检测模块，用于检测所述M个正方形图像块中每个正方形图像块的第一对角线和第二对角线上各像素的灰度值，得到各正方形图像块的第一对角线和第二对角线的像素灰度值序列，并检测每个像素灰度值序列的逆序数奇偶性，得到各正方形图像块的第一对角线和第二对角线的像素灰度值序列的逆序数奇偶性；
图像块调整模块，用于以每条对角线的像素灰度值序列的逆序数奇偶性表示一个比特位的值，按所述M个正方形图像块与所述M个比特位值组一一对应，每个正方形图像块的第一对角线和第二对角线的像素灰度值序列的逆序数奇偶性与该正方形图像块对应的比特位值组的第一比特位值和第二比特位值分别对应的原则，检测所述M个正方形图像块中每个正方形图像块的第一对角线和第二对角线的像素灰度值序列的逆序数奇偶性所表示的值与该正方形图像块对应的比特位值组中的第一比特位值和第二比特位值是否分别一致，如果否，则对该正方形图像块进行像素位置调整，使该正方形图像块的第一对角线和第二对角线的像素灰度值序列的逆序数奇偶性所表示的值与该正方形图像块对应的比特位值组中的第一比特位值和第二比特位值分别一致。
进一步地，所述图像块调整模块对正方形图像块进行像素位置调整时：
当该正方形图像块中仅第一对角线的像素灰度值序列的逆序数奇偶性所表示的值与该正方形图像块对应的比特位值组中的第一比特位值不一致时，从该第一对角线上提取灰度值不相等且差值最小的两个像素，并将这两个像素互换，以改变该第一对角线的像素灰度值序列的逆序数奇偶性；
当该正方形图像块中仅第二对角线的像素灰度值序列的逆序数奇偶性所表示的值与该正方形图像块对应的比特位值组中的第二比特位值不一致时，从该第二对角线上提取灰度值不相等且差值最小的两个像素，并将这两个像素互换，以改变该第二对角线的像素灰度值序列的逆序数奇偶性；
当该正方形图像块中第一对角线和第二对角线的像素灰度值序列的逆序数奇偶性所表示的值与该正方形图像块对应的比特位值组中的第一比特位值和第二比特位值分别不一致时，包括如下步骤：
从该正方形图像块的第一对角线和第二对角线上各提取一个像素，并将这两个像素互换；
互换后，检测该正方形图像块的第一对角线和第二对角线的像素灰度值序列的逆序数奇偶性是否都改变，如果否，则放弃该次互换并再次从该正方形图像块的第一对角线和第二对角线上各提取一个像素进行互换，直到该正方形图像块的第一对角线和第二对角线的像素灰度值序列的逆序数奇偶性都改变。
进一步地，所述图像块调整模块从正方形图像块的第一对角线和第二对角线上各提取一个像素的原则为：按所提取的两个像素的灰度值之差由小到大的顺序，从灰度值之差最小的两个像素开始提取。
 有益效果
与现有技术相比，利用本发明，每个正方形图像块可通过其两条对角线的像素灰度值序列的逆序数奇偶性隐藏两比特位的数据，这样，在图像中隐藏的数据量将是图像所拆分成的图像块数量的两倍。而且，在对正方形图像块进行像素位置调整时，由于只需调整该正方形图像块的第一对角线和第二对角线上的最多两个像素的灰度值，因此，对图像的质量影响很小，保证了图像质量。
附图说明
图1：本发明提供的数据隐藏方法流程示意图；
图2：本发明提供的数据隐藏方法中比特位分组示意图；
图3：本发明提供的数据隐藏方法中图像划分示意图；
图4：正方形图像块及其对角线示意图；
图5：本发明提供的以上述数据发送方法发送的数据的提取方法流程示意图；
图6：本发明提供的数据隐藏系统组成示意图。
 本发明的实施方式
为了使本发明的目的、技术方案及优点更加清楚明白，以下结合附图及实施例，对本发明进行进一步详细说明。
为了解决现有的基于图像的数据隐藏传输方式存在的隐藏数据容量小等问题，本发明提出的数据隐藏方法是以图像作为数据载体，发送端将秘密数据转换成比特序列后，将比特序列中每一比特位的值隐藏于图像中，得到隐藏有秘密数据的图像并发送给接收端，接收端可根据相应密钥从图像中提取出隐藏的秘密数据。
如图1所示，本发明提供了一种数据隐藏方法，包括如下步骤：
步骤A：将数据转换成比特序列；当所述比特序列的比特位数为奇数时，在所述比特序列的末尾填充一个比特位，并将其值赋为0或1。
步骤B：按所述比特序列的排列顺序从所述比特序列中每次提取两个比特位的值作为一组，得到M个比特位值组；设每个比特位值组中的前一个比特位的值为该比特位值组中的第一比特位值，后一个比特位的值为该比特位值组中的第二比特位值。
比特位是计算机最小的存储单位，以0或1来表示比特位的值，计算机通过比特序列来表示数据。本发明拟通过将矩形图像划分为若干正方形图像块，每个正方形图像块隐藏两个比特位的数据的方式来隐藏数据。因此，将比特序列中的各比特位按上述方式分组，每组包含两个比特位的值。如图2所示，第1个比特位值组中包含第1比特位和第2比特位的值，分别为1和1，其中第1比特位的值为第1个比特位值组中的第一比特位值，第2个比特位的值为第1个比特位值组中的第二比特位值；第2个比特位值组中包含第3比特位和第4比特位的值，分别为0和1，其中，第3比特位的值为第2个比特位值组中的第一比特位值，第4比特位的值为第2个比特位值组中的第二比特位值；后续各比特位值组以此类推。当比特位数为奇数时，由于最后一组只包含一个比特位的值，因此，在这种情况下，为方便计算，在比特序列的末尾填充一个比特位，并将该填充的比特位的值设为0或1，使最后一个比特位值组包含两个比特位值，在从图像中提取隐藏的数据时，只需要将填充的比特位的值去除即可。
步骤C：将作为所述数据的载体的矩形图像划分成P个大小相同的正方形图像块，P≥M，并提取其中前M个正方形图像块；该M个正方形图像块中每个正方形图像块具有第一对角线和第二对角线。如图3所示，将矩形图像划分成P个正方形图像块，即该P个正方形图像块组成一副完整的前述矩形图像。如前所述，本发明拟将矩形图像划分为若干正方形图像块，每个正方形图像块隐藏两个比特位的数据，即每个正方形图像块隐藏一个比特位值组的数据，因此，所划分的正方形图像块的数量至少应该达到步骤B中所分成的比特位值组的数量，即P≥M。由于只需要M个正方形图像块即可隐藏该M个比特位值组的数据，因此，只需提取前M个正方形图像块。一般而言，可如图3所示，从矩形图像的起始位置（如右上角）开始，按顺序提取前M个正方形图像块。图3所示是一种较为理想的划分结果，矩形图像的长度和宽度都是正方形图像块的宽度的整数倍，该矩形图像刚好划分成P个正方形图像块。但是在很多情况下，确定了正方形图像块的大小后，如果矩形图像的长度和/或宽度不是正方形图像块宽度的整数倍时，对矩形图像进行划分时，在其长度和/或宽度方向的末端就会留下一部分不足以形成该大小的正方形图像的区域，这不会对数据的隐藏和提取产生实质影响。
步骤D：检测所述M个正方形图像块中每个正方形图像块的第一对角线和第二对角线上各像素的灰度值，得到各正方形图像块的第一对角线和第二对角线的像素灰度值序列，并检测每个像素灰度值序列的逆序数奇偶性，得到各正方形图像块的第一对角线和第二对角线的像素灰度值序列的逆序数奇偶性。如图4所示为一个正方形图像块的示意图。图中，由左上角到右下角的对角线定义为该正方形图像块的第一对角线，由右上角到左下角的对角线定义为该正方形图像块的第二对角线。通过检测第一对角线和第二对角线上各像素的灰度值，得到该正方形图像块的第一对角线和第二对角线的像素灰度值序列。每条对角线的像素灰度值序列都有其奇偶性，由于比特位的值要么为1，要么为0，而序列的逆序数奇偶性要么为奇，要么为偶，因此，一条对角线的像素灰度值序列的逆序数奇偶性可表示一个比特位的值，每个正方形图像块有两条对角线，可表示两个比特位的值。因此，需将每个正方形图像块的第一对角线和第二对角线的像素灰度值序列的逆序数奇偶性检测出，以便后续确定当前情况下该M个正方形图像块中的每个正方形图像块的第一对角线和第二对角线的像素灰度值序列的逆序数奇偶性所表示的比特位的值。
步骤E：以每条对角线的像素灰度值序列的逆序数奇偶性表示一个比特位的值，按所述M个正方形图像块与所述M个比特位值组一一对应，每个正方形图像块的第一对角线和第二对角线的像素灰度值序列的逆序数奇偶性与该正方形图像块对应的比特位值组的第一比特位值和第二比特位值分别对应的原则，检测所述M个正方形图像块中每个正方形图像块的第一对角线和第二对角线的像素灰度值序列的逆序数奇偶性所表示的值与该正方形图像块对应的比特位值组中的第一比特位值和第二比特位值是否分别一致，如果否，则对该正方形图像块进行像素位置调整，使该正方形图像块的第一对角线和第二对角线的像素灰度值序列的逆序数奇偶性所表示的值与该正方形图像块对应的比特位值组中的第一比特位值和第二比特位值分别一致。假设定义一条对角线的像素灰度值序列的逆序数奇偶性为奇时，表示的比特位的值为1，奇偶性为偶时，表示的比特位的值为0。以图4为例，假设该正方形图像块对应图2所示的第2个比特位值组，则该正方形图像块的第一对角线的像素灰度值序列的逆序数奇偶性应为偶，第二对角线的像素灰度值序列的逆序数奇偶性应为奇。如果经检测，该正方形图像块的第一、二对角线的像素灰度值序列的逆序数奇偶性分别为偶和奇，则表示该正方形图像块的第一、二对角线的像素灰度值序列的逆序数奇偶性所表示的值与该正方形图像块对应的比特位值组中的第一比特位值和第二比特位值分别一致，则该正方形图像块无需调整，否则，表示该正方形图像块需要进行调整。在对该正方形图像块进行调整时，只需对该正方形图像块进行像素位置调整，使该正方形图像块的第一对角线和第二对角线的像素灰度值序列的逆序数奇偶性所表示的值与该正方形图像块对应的比特位值组中的第一比特位值和第二比特位值分别一致即可。具体来说，对正方形图像块进行像素位置调整的方法如下：
步骤E1：当该正方形图像块中仅第一对角线的像素灰度值序列的逆序数奇偶性所表示的值与该正方形图像块对应的比特位值组中的第一比特位值不一致时，从该第一对角线上提取灰度值不相等且差值最小的两个像素，并将这两个像素互换，以改变该第一对角线的像素灰度值序列的逆序数奇偶性。
步骤E2：当该正方形图像块中仅第二对角线的像素灰度值序列的逆序数奇偶性所表示的值与该正方形图像块对应的比特位值组中的第二比特位值不一致时，从该第二对角线上提取灰度值不相等且差值最小的两个像素，并将这两个像素互换，以改变该第二对角线的像素灰度值序列的逆序数奇偶性。
步骤E1和步骤E2中，由于只需在第一对角线或第二对角线上提取两个像素进行互换，且提取两个像素时遵循了最小失真原则（即提取的是灰度值之差最小的那两个像素），这样，在互换后最大限度地控制了失真，对调整后的图像质量影响最小。
步骤E3：当该正方形图像块中第一对角线和第二对角线的像素灰度值序列的逆序数奇偶性所表示的值与该正方形图像块对应的比特位值组中的第一比特位值和第二比特位值分别不一致时，包括如下步骤：
步骤E3-1：从该正方形图像块的第一对角线和第二对角线上各提取一个像素，并将这两个像素互换；
步骤E3-2：互换后，检测该正方形图像块的第一对角线和第二对角线的像素灰度值序列的逆序数奇偶性是否都改变，如果否，则放弃该次互换并返回步骤E3-1，直到该正方形图像块的第一对角线和第二对角线的像素灰度值序列的逆序数奇偶性都改变。
在步骤E3中，由于只需在第一对角线和第二对角线上各取一个像素进行互换，相当于每条对角线上只需改变一个像素的灰度即可，从而控制了调整后整个矩形图像的失真，保证了调整后的图像质量。为进一步降低对调整后的矩形图像的质量的影响，在从正方形图像块的第一对角线和第二对角线上各提取一个像素进行互换时需遵循一定原则，即：按所提取的两个像素的灰度值之差由小到大的顺序，从灰度值之差最小的两个像素开始提取。 灰度值之差是指该正方形图像块中的第一对角线上的像素与第二对角线上的像素的灰度值之差。一个正方形图像块的第一对角线和第二对角线上均有若干像素，两条对角线上肯定各存在一个像素，使得这两个像素的灰度值之差小于从这两条对角线上的其他像素的灰度值之差。应从这两个像素开始，将这两个像素进行互换，并检测互换后该正方形图像块的第一对角线和第二对角线的像素灰度值序列的逆序数奇偶性所表示的值与该正方形图像块对应的比特位值组中的第一比特位值和第二比特位值是否分别一致，如果一致，则完成对该正方形图像块的调整，如果还不一致，则按前述原则所定义的顺序，继续从该正方形图像块的第一对角线和第二对角线提取像素进行互换，直到一致。由于是从灰度值最为接近的两个像素开始进行互换的，因此，第一次互换后对图像质量的影响将是最小的，以后的每次互换对图像质量的影响将逐渐增大。由此可见，通过这种对图像质量影响由小到大的像素互换方式有利于最大限度地降低对调整后图像质量的影响。
当M个正方形图像块中的所有正方形图像块都调整符合上述条件后，就完成了数据隐藏过程。
本发明还提供了一种以图像为数据载体的数据发送方法，包括上述任意一种数据隐藏方法所包含的步骤，在数据隐藏方法所包含的步骤之后，还包括步骤F：将作为数据的载体的矩形图像及其密钥发送出去。其中的密钥包括了矩形图像所划分成的正方形图像块的大小以及数据所转换成的比特序列的比特位数。
密钥是用于接收端接收到矩形图像后进行数据提取时使用的。密钥中的大小用于确定如何对接收到的矩形图像进行划分，即根据该大小进行划分，将矩形图像划分为若干具有该大小的正方形图像块，划分成的若干正方形图像块可共同组成前述的矩形图像。而比特位数是用于确定在隐藏数据时，是否对比特序列进行了填充，如果比特序列的比特位数为奇数，则表示有填充，需将还原后的比特序列的末尾的比特位去掉。
如图5所示，本发明还提供了一种以上述数据发送方法发送的数据的提取方法，包括如下步骤：
步骤1：读取接收到的作为数据的载体的矩形图像及其密钥；其中的密钥包括了矩形图像所划分成的正方形图像块的大小以及数据所转换成的比特序列的比特位数，设比特位数为N。
步骤2：将所述矩形图像划分为P个具有所述大小的正方形图像块，并从中提取前M个正方形图像块，M为(N+1)/2取整。根据前述的数据隐藏方法中的原理描述，根据该大小划分矩形图像的话，得到的正方形图像块的数量P将是不小于(N+1)/2的整数部分的，而该整数部分将正好是在数据隐藏方法的步骤中比特位值组的数量，因此，根据数据隐藏方法的步骤C，只有前M个正方形图像块才隐藏有数据，因此只需提取前M个正方形图像块。
步骤3：检测所述M个正方形图像块中每个正方形图像块的第一对角线和第二对角线上各像素的灰度值，得到各正方形图像块的第一对角线和第二对角线的像素灰度值序列，并检测每个像素灰度值序列的逆序数奇偶性，得到各正方形图像块的第一对角线和第二对角线的像素灰度值序列的逆序数奇偶性。
步骤4：以每条对角线的像素灰度值序列的逆序数奇偶性表示一个比特位的值的原则，将所述M个正方形图像块中各正方形图像块的第一对角线和第二对角线的像素灰度值序列的逆序数奇偶性所表示的比特位值按各正方形图像块的顺序排列，得到比特序列；当所述比特位数为奇数时，去掉所得到的比特序列的最后一个比特位。以每条对角线的像素灰度值序列的逆序数奇偶性表示一个比特位的值的原则需与数据隐藏方法的步骤E中所述的对应原则一致。由于密钥中的比特位数只是为了确定数据隐藏时是否有填充位，而确定是否有填充位只需确定比特位数的奇偶性即可，而无需确定比特位数的具体数值，因此，密钥中的比特位数也可以替换为比特位数的奇偶性，两者具有等同作用。
步骤5：将所得到的比特序列还原为数据。
如图6所示，本发明还提供了一种数据隐藏系统，包括：
数据转换模块1，用于将数据转换成比特序列；当所述比特序列的比特位数为奇数时，在所述比特序列的末尾填充一个比特位，并将其值赋为0或1；
比特位分组模块2，用于按所述比特序列的排列顺序从所述比特序列中每次提取两个比特位的值作为一组，得到M个比特位值组；设每个比特位值组中的前一个比特位的值为该比特位值组中的第一比特位值，后一个比特位的值为该比特位值组中的第二比特位值；
图像划分模块3，用于将作为所述数据的载体的矩形图像划分成P个大小相同的正方形图像块，P≥M，并提取其中前M个正方形图像块；该M个正方形图像块中每个正方形图像块具有第一对角线和第二对角线；
图像块检测模块4，用于检测所述M个正方形图像块中每个正方形图像块的第一对角线和第二对角线上各像素的灰度值，得到各正方形图像块的第一对角线和第二对角线的像素灰度值序列，并检测每个像素灰度值序列的逆序数奇偶性，得到各正方形图像块的第一对角线和第二对角线的像素灰度值序列的逆序数奇偶性；
图像块调整模块5，用于以每条对角线的像素灰度值序列的逆序数奇偶性表示一个比特位的值，按所述M个正方形图像块与所述M个比特位值组一一对应，每个正方形图像块的第一对角线和第二对角线的像素灰度值序列的逆序数奇偶性与该正方形图像块对应的比特位值组的第一比特位值和第二比特位值分别对应的原则，检测所述M个正方形图像块中每个正方形图像块的第一对角线和第二对角线的像素灰度值序列的逆序数奇偶性所表示的值与该正方形图像块对应的比特位值组中的第一比特位值和第二比特位值是否分别一致，如果否，则对该正方形图像块进行像素位置调整，使该正方形图像块的第一对角线和第二对角线的像素灰度值序列的逆序数奇偶性所表示的值与该正方形图像块对应的比特位值组中的第一比特位值和第二比特位值分别一致。
图像块调整模块5对正方形图像块进行像素位置调整时：
当该正方形图像块中仅第一对角线的像素灰度值序列的逆序数奇偶性所表示的值与该正方形图像块对应的比特位值组中的第一比特位值不一致时，从该第一对角线上提取灰度值不相等且差值最小的两个像素，并将这两个像素互换，以改变该第一对角线的像素灰度值序列的逆序数奇偶性；
当该正方形图像块中仅第二对角线的像素灰度值序列的逆序数奇偶性所表示的值与该正方形图像块对应的比特位值组中的第二比特位值不一致时，从该第二对角线上提取灰度值不相等且差值最小的两个像素，并将这两个像素互换，以改变该第二对角线的像素灰度值序列的逆序数奇偶性；
当该正方形图像块中第一对角线和第二对角线的像素灰度值序列的逆序数奇偶性所表示的值与该正方形图像块对应的比特位值组中的第一比特位值和第二比特位值分别不一致时，包括如下步骤：
从该正方形图像块的第一对角线和第二对角线上各提取一个像素，并将这两个像素互换；
互换后，检测该正方形图像块的第一对角线和第二对角线的像素灰度值序列的逆序数奇偶性是否都改变，如果否，则放弃该次互换并再次从该正方形图像块的第一对角线和第二对角线上各提取一个像素进行互换，直到该正方形图像块的第一对角线和第二对角线的像素灰度值序列的逆序数奇偶性都改变。
图像块调整模块5从正方形图像块的第一对角线和第二对角线上各提取一个像素的原则为：按所提取的两个像素的灰度值之差由小到大的顺序，从灰度值之差最小的两个像素开始提取。
以下以二值图像数据为例，举例说明本发明数据隐藏、发送、接收及提取过程。
假设需要发送的数据为二值图像，该二值图像的大小为320*240。如前所述，首先，需要将该二值图像转换为比特序列。可通过光栅扫描的方式扫描该二值图像，将该二值图像中各像素的灰度转化为比特位值，并按序组成比特序列。该比特序列包含76800个比特位值。然后，将比特序列按排列顺序每次提取两个比特位值作为一组，从而分成按序排列的38400组比特位值。对于作为该二值图像的载体的矩形图像，需要根据该矩形图像的大小和二值图像的比特序列的位数，将矩形图像划分为适合数量的大小相同的正方形图像块。根据前述原理，正方形图像块的数量应当不小于38400组。将比特序列分组和矩形图像分块后。从矩形图像中提取前38400个正方形图像块，这38400个正方形图像块按从左到右、从上到下的顺序排列。该38400个正方形图像块与前述38400个比特位值组按排列顺序一一对应，即第一个正方形图像块（左上角的正方形图像块）对应第一个比特位值组，第二个正方形图像块对应第二个比特位值组，第38400个正方形图像块对应第38400个比特位值组。同时，每个正方形图像块的第一对角线和第二对角线的像素灰度值序列的逆序数奇偶性与该正方形图像块对应的比特位值组的第一比特位值和第二比特位值分别对应。
将比特序列分组以及将矩形图像分块完成后，分别检测各正方形图像块的第一对角线和第二对角线的像素灰度值序列的逆序数奇偶性。定义灰度值序列的逆序数奇偶性为奇的对角线表示比特位值1，灰度值序列的逆序数奇偶性为偶的对角线表示的比特位值为0。根据前述原则检测每个正方形图像块的第一对角线和第二对角线的像素灰度值序列的逆序数奇偶性与该正方形图像块所对应的比特位值组的第一比特位值和第二比特位值是否分别对应，如不是分别对应，则根据前述调整方法调整相应正方形图像块，使其分别对应，直到所有正方形图像块调整完毕。
假设图4所示正方形图像块为与图2所示的比特序列中第2个比特位值组对应的正方形图像块，即图3中的第2正方形图像块。该正方形图像块的大小为16*16，由左上角到右下角的对角线为该正方形图像块的第一对角线，右上角到左下角的对角线为该正方形图像块的第二对角线。结合图2、图3、图4所示，第2个比特位值组的第一比特位值为0，第二比特位值为1。则该正方形图像块中的第一对角线的像素灰度值序列的逆序数奇偶性应该为0，第二对角线的像素灰度值序列的逆序数奇偶性应该为1。该正方形图像块有如下四种情况：一、如果该正方形图像块的第一对角线和第二对角线的像素灰度值序列的逆序数奇偶性分别为偶和奇，则该正方形图像块不需要进行调整。二、如果该正方形图像块的第一对角线和第二对角线的像素灰度值序列的逆序数奇偶性分别为偶和偶，则需要调整该正方形图像块的第二对角线上的像素排列顺序，使得第二对角线的像素灰度值序列的逆序数奇偶性变为奇。调整时，可将该第二对角线上的任意两个灰度值不相等的像素互换即可改变其像素灰度值序列的逆序数奇偶性，但是为最大程度控制调整后的图像失真，应将该对角线上的灰度值不相等且差值最小的两个像素进行互换。三、如果该正方形图像块的第一对角线和第二对角线的像素灰度值序列的逆序数奇偶性分别为奇和奇，则需要调整该正方形图像块的第一对角线上的像素排列顺序，使得第一对角线的像素灰度值序列的逆序数奇偶性变为偶，调整方法与第二种情况所述同理，不再赘述。四、如果该正方形图像块的第一对角线和第二对角线的像素灰度值序列的逆序数奇偶性分别为奇和偶，则从第一对角线和第二对角线上分别提取一个像素并互换，提取时，按所提取的两个像素的灰度值之差由小到大的顺序，从灰度值之差最小的两个像素开始提取，直到该正方形图像块的第一对角线和第二对角线的像素灰度值序列的逆序数奇偶性分别为偶和奇。
将数据隐藏到矩形图像中后，发送端就可将隐藏有数据的矩形图像及密钥发送出去。密钥中包含由二值图像数据所转换成的比特序列的比特位数，以及该矩形图像所划分成的正方形图像块的大小，还可进一步包括转换时的相关参数，如二值图像的大小。接收端接收到矩形图像后，根据密钥中的大小将矩形图像分块，并根据划分所得的各正方形图像块的排列顺序提取前38400个正方形图像块。然后检测这38400个正方形图像块中每个正方形图像块的第一对角线和第二对角线的像素灰度值序列的逆序数奇偶性，并根据在隐藏数据时的对应原则，确定出各正方形图像块的第一对角线和第二对角线的像素灰度值序列的逆序数奇偶性所表示的值，然后将各值按顺序排列，得到比特序列。同时，根据密钥中的比特位数的奇偶性判断在将数据转换为比特序列时是否有填充位。如为奇数，则有填充位，将排列得到的比特序列的最后一位去除。该二值图像的大小为320*240，即像素总数为76800，因此密钥中的比特位数为76800，为偶数，因此，没有填充位，得到的比特序列就为原二值图像转换所得的比特序列，该比特序列中的每一个值都代表二值图像中的一个相应像素的值，这样，根据密钥中的二值图像的大小 320*240，很容易将该比特序列再还原为二值图像。
以上所述仅为本发明的较佳实施例而已，并不用以限制本发明，凡在本发明的精神和原则之内所作的任何修改、等同替换和改进等，均应包含在本发明的保护范围之内。

Claims (9)

  1. 一种数据隐藏方法，其特征在于，包括如下步骤：
    步骤A：将数据转换成比特序列；当所述比特序列的比特位数为奇数时，在所述比特序列的末尾填充一个比特位，并将其值赋为0或1；
    步骤B：按所述比特序列的排列顺序从所述比特序列中每次提取两个比特位的值作为一组，得到M个比特位值组；设每个比特位值组中的前一个比特位的值为该比特位值组中的第一比特位值，后一个比特位的值为该比特位值组中的第二比特位值；
    步骤C：将作为所述数据的载体的矩形图像划分成P个大小相同的正方形图像块，P≥M，并提取其中前M个正方形图像块；该M个正方形图像块中每个正方形图像块具有第一对角线和第二对角线；
    步骤D：检测所述M个正方形图像块中每个正方形图像块的第一对角线和第二对角线上各像素的灰度值，得到各正方形图像块的第一对角线和第二对角线的像素灰度值序列，并检测每个像素灰度值序列的逆序数奇偶性，得到各正方形图像块的第一对角线和第二对角线的像素灰度值序列的逆序数奇偶性；
    步骤E：以每条对角线的像素灰度值序列的逆序数奇偶性表示一个比特位的值，按所述M个正方形图像块与所述M个比特位值组一一对应，每个正方形图像块的第一对角线和第二对角线的像素灰度值序列的逆序数奇偶性与该正方形图像块对应的比特位值组的第一比特位值和第二比特位值分别对应的原则，检测所述M个正方形图像块中每个正方形图像块的第一对角线和第二对角线的像素灰度值序列的逆序数奇偶性所表示的值与该正方形图像块对应的比特位值组中的第一比特位值和第二比特位值是否分别一致，如果否，则对该正方形图像块进行像素位置调整，使该正方形图像块的第一对角线和第二对角线的像素灰度值序列的逆序数奇偶性所表示的值与该正方形图像块对应的比特位值组中的第一比特位值和第二比特位值分别一致。
  2. 如权利要求1所述的数据隐藏方法，其特征在于，对正方形图像块进行像素位置调整的方法如下：
    步骤E1：当该正方形图像块中仅第一对角线的像素灰度值序列的逆序数奇偶性所表示的值与该正方形图像块对应的比特位值组中的第一比特位值不一致时，从该第一对角线上提取灰度值不相等且差值最小的两个像素，并将这两个像素互换，以改变该第一对角线的像素灰度值序列的逆序数奇偶性；
    步骤E2：当该正方形图像块中仅第二对角线的像素灰度值序列的逆序数奇偶性所表示的值与该正方形图像块对应的比特位值组中的第二比特位值不一致时，从该第二对角线上提取灰度值不相等且差值最小的两个像素，并将这两个像素互换，以改变该第二对角线的像素灰度值序列的逆序数奇偶性；
    步骤E3：当该正方形图像块中第一对角线和第二对角线的像素灰度值序列的逆序数奇偶性所表示的值与该正方形图像块对应的比特位值组中的第一比特位值和第二比特位值分别不一致时，包括如下步骤：
    步骤E3-1：从该正方形图像块的第一对角线和第二对角线上各提取一个像素，并将这两个像素互换；
    步骤E3-2：互换后，检测该正方形图像块的第一对角线和第二对角线的像素灰度值序列的逆序数奇偶性是否都改变，如果否，则放弃该次互换并返回步骤E3-1，直到该正方形图像块的第一对角线和第二对角线的像素灰度值序列的逆序数奇偶性都改变。
  3. 如权利要求2所述的数据隐藏方法，其特征在于，从正方形图像块的第一对角线和第二对角线上各提取一个像素的原则为：按所提取的两个像素的灰度值之差由小到大的顺序，从灰度值之差最小的两个像素开始提取。
  4. 如权利要求1所述的数据隐藏方法，其特征在于，设所述正方形图像块的大小为W*W，则W为偶数，且W≥4。
  5. 一种以图像为数据载体的数据发送方法，其特征在于，包括如权利要求1-4中任一所述的数据隐藏方法所包含的步骤，在所述数据隐藏方法所包含的步骤之后，还包括如下步骤：
    步骤F：将作为所述数据的载体的矩形图像及其密钥发送出去；所述密钥包括如权利要求1中所述的大小和比特位数。
  6. 一种以权利要求5所述的数据发送方法发送的数据的提取方法，其特征在于，包括如下步骤：
    步骤1：读取接收到的作为数据的载体的矩形图像及其密钥；所述密钥包括如权利要求1中所述的大小和比特位数，设所述比特位数为N；
    步骤2：将所述矩形图像划分为P个具有所述大小的正方形图像块，并从中提取前M个正方形图像块，M为(N+1)/2取整；
    步骤3：检测所述M个正方形图像块中每个正方形图像块的第一对角线和第二对角线上各像素的灰度值，得到各正方形图像块的第一对角线和第二对角线的像素灰度值序列，并检测每个像素灰度值序列的逆序数奇偶性，得到各正方形图像块的第一对角线和第二对角线的像素灰度值序列的逆序数奇偶性；
    步骤4：以每条对角线的像素灰度值序列的逆序数奇偶性表示一个比特位的值的原则，将所述M个正方形图像块中各正方形图像块的第一对角线和第二对角线的像素灰度值序列的逆序数奇偶性所表示的比特位值按各正方形图像块的顺序排列，得到比特序列；当所述比特位数为奇数时，去掉所得到的比特序列的最后一个比特位；
    步骤5：将所得到的比特序列还原为数据。
  7. 一种数据隐藏系统，其特征在于，包括：
    数据转换模块，用于将数据转换成比特序列；当所述比特序列的比特位数为奇数时，在所述比特序列的末尾填充一个比特位，并将其值赋为0或1；
    比特位分组模块，用于按所述比特序列的排列顺序从所述比特序列中每次提取两个比特位的值作为一组，得到M个比特位值组；设每个比特位值组中的前一个比特位的值为该比特位值组中的第一比特位值，后一个比特位的值为该比特位值组中的第二比特位值；
    图像划分模块，用于将作为所述数据的载体的矩形图像划分成P个大小相同的正方形图像块，P≥M，并提取其中前M个正方形图像块；该M个正方形图像块中每个正方形图像块具有第一对角线和第二对角线；
    图像块检测模块，用于检测所述M个正方形图像块中每个正方形图像块的第一对角线和第二对角线上各像素的灰度值，得到各正方形图像块的第一对角线和第二对角线的像素灰度值序列，并检测每个像素灰度值序列的逆序数奇偶性，得到各正方形图像块的第一对角线和第二对角线的像素灰度值序列的逆序数奇偶性；
    图像块调整模块，用于以每条对角线的像素灰度值序列的逆序数奇偶性表示一个比特位的值，按所述M个正方形图像块与所述M个比特位值组一一对应，每个正方形图像块的第一对角线和第二对角线的像素灰度值序列的逆序数奇偶性与该正方形图像块对应的比特位值组的第一比特位值和第二比特位值分别对应的原则，检测所述M个正方形图像块中每个正方形图像块的第一对角线和第二对角线的像素灰度值序列的逆序数奇偶性所表示的值与该正方形图像块对应的比特位值组中的第一比特位值和第二比特位值是否分别一致，如果否，则对该正方形图像块进行像素位置调整，使该正方形图像块的第一对角线和第二对角线的像素灰度值序列的逆序数奇偶性所表示的值与该正方形图像块对应的比特位值组中的第一比特位值和第二比特位值分别一致。
  8. 如权利要求7所述的数据隐藏系统，其特征在于，所述图像块调整模块对正方形图像块进行像素位置调整时：
    当该正方形图像块中仅第一对角线的像素灰度值序列的逆序数奇偶性所表示的值与该正方形图像块对应的比特位值组中的第一比特位值不一致时，从该第一对角线上提取灰度值不相等且差值最小的两个像素，并将这两个像素互换，以改变该第一对角线的像素灰度值序列的逆序数奇偶性；
    当该正方形图像块中仅第二对角线的像素灰度值序列的逆序数奇偶性所表示的值与该正方形图像块对应的比特位值组中的第二比特位值不一致时，从该第二对角线上提取灰度值不相等且差值最小的两个像素，并将这两个像素互换，以改变该第二对角线的像素灰度值序列的逆序数奇偶性；
    当该正方形图像块中第一对角线和第二对角线的像素灰度值序列的逆序数奇偶性所表示的值与该正方形图像块对应的比特位值组中的第一比特位值和第二比特位值分别不一致时，包括如下步骤：
    从该正方形图像块的第一对角线和第二对角线上各提取一个像素，并将这两个像素互换；
    互换后，检测该正方形图像块的第一对角线和第二对角线的像素灰度值序列的逆序数奇偶性是否都改变，如果否，则放弃该次互换并再次从该正方形图像块的第一对角线和第二对角线上各提取一个像素进行互换，直到该正方形图像块的第一对角线和第二对角线的像素灰度值序列的逆序数奇偶性都改变。
  9. 如权利要求7所述的数据隐藏系统，其特征在于，所述图像块调整模块从正方形图像块的第一对角线和第二对角线上各提取一个像素的原则为：按所提取的两个像素的灰度值之差由小到大的顺序，从灰度值之差最小的两个像素开始提取。
PCT/CN2016/081390 2015-10-15 2016-05-09 一种数据隐藏方法及隐藏系统 WO2017063357A1 (zh)

Priority Applications (2)

Application Number Priority Date Filing Date Title
JP2017525795A JP6453461B2 (ja) 2015-10-15 2016-05-09 データ隠蔽方法及び隠蔽システム
US15/444,308 US10311757B2 (en) 2015-10-15 2017-02-27 Data hiding method and data hiding system

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201510671142.5 2015-10-15
CN201510671142.5A CN105160694B (zh) 2015-10-15 2015-10-15 一种数据隐藏方法及隐藏系统

Related Child Applications (1)

Application Number Title Priority Date Filing Date
US15/444,308 Continuation US10311757B2 (en) 2015-10-15 2017-02-27 Data hiding method and data hiding system

Publications (1)

Publication Number Publication Date
WO2017063357A1 true WO2017063357A1 (zh) 2017-04-20

Family

ID=54801536

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2016/081390 WO2017063357A1 (zh) 2015-10-15 2016-05-09 一种数据隐藏方法及隐藏系统

Country Status (4)

Country Link
US (1) US10311757B2 (zh)
JP (1) JP6453461B2 (zh)
CN (1) CN105160694B (zh)
WO (1) WO2017063357A1 (zh)

Families Citing this family (13)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103543980B (zh) * 2013-11-07 2021-10-22 吴胜远 数字数据处理的方法及装置
CN105160694B (zh) * 2015-10-15 2017-05-03 深圳大学 一种数据隐藏方法及隐藏系统
CN105592323B (zh) * 2016-03-18 2018-08-24 深圳大学 将秘密信息写入视频的方法和系统、视频认证方法和系统
WO2017156760A1 (zh) * 2016-03-18 2017-09-21 深圳大学 将秘密信息写入视频的方法和系统、视频认证方法和系统
WO2018010118A1 (zh) * 2016-07-13 2018-01-18 深圳大学 一种数字视频内容安全认证的方法及其系统
CN106339975A (zh) * 2016-10-10 2017-01-18 中科院成都信息技术股份有限公司 一种数字图像秘密分享及恢复方法及装置
CN108777754B (zh) * 2018-06-20 2019-11-22 广西师范大学 一种基于权重的多备份图像隐藏及恢复方法
CN108959209B (zh) * 2018-07-03 2022-06-21 武汉斗鱼网络科技有限公司 一种弹幕消息的处理方法、装置、终端和存储介质
CN109635576B (zh) * 2018-11-30 2023-03-21 哈尔滨工业大学（深圳） 一种在图像中隐藏数据方法和系统
CN110769128B (zh) * 2019-10-09 2021-10-22 中山大学 一种嵌入率自适应的灰度图像信息隐写方法
CN111260532B (zh) * 2020-01-10 2023-04-28 中移（杭州）信息技术有限公司 隐私图像加密方法、装置、电子设备及计算机可读存储介质
CN111970507B (zh) * 2020-08-26 2022-02-18 安徽大学 基于像素差值编码的密文域图像的可逆数据隐藏方法
CN114745109A (zh) * 2022-04-06 2022-07-12 国网浙江省电力有限公司宁波供电公司 基于量子加密的配电终端加密通信系统及方法

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7046820B2 (en) * 2002-07-16 2006-05-16 Matsushita Electric Industrial Co., Ltd. Methods for digital watermarking of images and images produced thereby
CN103281178A (zh) * 2013-06-08 2013-09-04 深圳大学 一种隐匿通信方法及系统
CN103426141A (zh) * 2013-08-09 2013-12-04 深圳大学 一种图像内容认证方法与系统
CN103810664A (zh) * 2012-11-13 2014-05-21 中兴通讯股份有限公司 一种信息隐藏方法及装置
CN105160694A (zh) * 2015-10-15 2015-12-16 深圳大学 一种数据隐藏方法及隐藏系统

Family Cites Families (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1128535C (zh) * 1996-06-20 2003-11-19 国际商业机器公司 数据隐藏和抽取方法以及向网络传送和接受数据的系统
JP3592545B2 (ja) * 1998-08-07 2004-11-24 株式会社リコー 画像処理装置および画像処理方法および情報記録媒体
JP3166762B2 (ja) * 1999-07-08 2001-05-14 富士ゼロックス株式会社 画像処理装置
JP2002232698A (ja) * 2000-11-30 2002-08-16 Kowa Co 電子透かしの埋め込み方法および抽出方法、並びにそれら装置
JP2006505075A (ja) * 2002-10-31 2006-02-09 韓國電子通信研究院 複数のイメージフレームを有するビデオシーケンス検索のための非線形量子化及び類似度マッチング方法
JP4107063B2 (ja) * 2002-11-26 2008-06-25 日本ビクター株式会社 暗号情報の送受信システム、送受信方法、暗号情報埋め込み用プログラム及び暗号情報記録装置
FR2853792A1 (fr) * 2003-04-11 2004-10-15 France Telecom Procede de tatouage d'une sequence video a selection adaptative de la zone d'insertion du tatouage, procede de detection, dispositifs, support de donnees et programmes d'ordinateur correspondants
US20050144456A1 (en) * 2003-12-11 2005-06-30 Tinku Acharya Robust digital image watermarking utilizing a Walsh transform algorithm
CN1881384B (zh) * 2005-06-17 2010-05-26 鸿富锦精密工业（深圳）有限公司 文本加密系统及方法
US7965861B2 (en) * 2006-04-26 2011-06-21 The Board Of Regents Of The University Of Texas System Methods and systems for digital image security
US9264724B2 (en) * 2013-10-11 2016-02-16 Blackberry Limited Sign coding for blocks with transform skipped

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7046820B2 (en) * 2002-07-16 2006-05-16 Matsushita Electric Industrial Co., Ltd. Methods for digital watermarking of images and images produced thereby
CN103810664A (zh) * 2012-11-13 2014-05-21 中兴通讯股份有限公司 一种信息隐藏方法及装置
CN103281178A (zh) * 2013-06-08 2013-09-04 深圳大学 一种隐匿通信方法及系统
CN103426141A (zh) * 2013-08-09 2013-12-04 深圳大学 一种图像内容认证方法与系统
CN105160694A (zh) * 2015-10-15 2015-12-16 深圳大学 一种数据隐藏方法及隐藏系统

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
ZHAO, DONGNING ET AL.: "A Semi-fragile Image Watermarking Scheme Exploiting BTC Quantization Data", KSII TRANSACTIONS ON INTERNET AND INFORMATION SYSTEMS, vol. 8, no. 4, 29 April 2014 (2014-04-29), pages 1499 - 1513, XP055376313 *
ZHAO, DONGNING ET AL.: "High Efficiency Reversible Data Hiding for Two-stage Vector Quantization Compressed Images", JOURNAL OF INFORMATION HIDING AND MULTIMEDIA SIGNAL PROCESSING, vol. 5, no. 4, 31 October 2014 (2014-10-31), pages 625 - 641, XP055376325, ISSN: 2073-4212 *

Also Published As

Publication number Publication date
US10311757B2 (en) 2019-06-04
CN105160694A (zh) 2015-12-16
US20170169736A1 (en) 2017-06-15
JP2017536622A (ja) 2017-12-07
CN105160694B (zh) 2017-05-03
JP6453461B2 (ja) 2019-01-16

Similar Documents

Publication Publication Date Title
WO2017063357A1 (zh) 一种数据隐藏方法及隐藏系统
JP5736389B2 (ja) 軽減チャンネルフォーマットでの多チャンネル信号の送信及び検出
WO2011034378A2 (en) Method and apparatus for encoding and decoding image based on skip mode
JP2002141898A (ja) 多重暗号化キーをデータストリームに同期させる暗号化装置および方法
WO2011129624A2 (en) Method and apparatus for generating and playing animation message
WO2014003497A1 (ko) 특정 포맷을 가지는 대체 데이터의 생성 및 검증
WO2017116062A1 (ko) 파일에 대한 공증 및 검증을 수행하는 방법 및 서버
CN111970507A (zh) 基于像素差值编码的密文域图像的可逆数据隐藏方法
EP3714425A1 (en) Method and apparatus for reconstruction of original images from modified images
Yuan et al. On the security of encrypted jpeg image with adaptive key generated by invariant characteristic
CN1499770A (zh) 通信设备与通信方法
Liu et al. Blockchain privacy data protection method based on HEVC video steganography
WO2023101399A1 (ko) 대용량 데이터의 보안 처리 시스템
Salim et al. Hide text in an image using Blowfish algorithm and development of least significant bit technique
WO2012165901A2 (ko) 단말기간 보안채널화 방법
WO2013042843A1 (ko) 점진적 차이값 히스토그램 기반의 가역 워터마킹을 이용한 블록단위 영상 인증방법
WO2023101069A1 (ko) 대용량 데이터의 보안 처리 시스템
WO2017156760A1 (zh) 将秘密信息写入视频的方法和系统、视频认证方法和系统
CN111816195B (zh) 一种音频可逆隐写方法、秘密信息提取及载体音频恢复方法
WO2020256205A1 (ko) 진본성과 무결성을 제공하는 전자 문서 관리 시스템 및 그 방법
WO2020141823A1 (ko) Drm 콘텐츠 패키징 장치 및 이를 포함하는 drm 콘텐츠 패키징 시스템 및 drm 콘텐츠 패키징 방법
CN101431674A (zh) 视频监控系统
WO2009139547A2 (en) Image processing method and image processing apparatus using least significant bits
WO2024117297A1 (ko) 대용량 차량 데이터 수집 및 보안 전송 처리 방법
WO2021137392A1 (ko) 블록 체인 기반 영상 저작물 관리 방법

Legal Events

Date Code Title Description
ENP Entry into the national phase

Ref document number: 2017525795

Country of ref document: JP

Kind code of ref document: A

121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 16854746

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

32PN Ep: public notification in the ep bulletin as address of the adressee cannot be established

Free format text: NOTING OF LOSS OF RIGHTS PURSUANT TO RULE 112(1) EPC (EPO FORM 1205A DATED 02/08/2018)

122 Ep: pct application non-entry in european phase

Ref document number: 16854746

Country of ref document: EP

Kind code of ref document: A1