CN111432217A - Information hiding embedding and extracting method based on two-dimensional histogram translation - Google Patents

Information hiding embedding and extracting method based on two-dimensional histogram translation Download PDF

Info

Publication number
CN111432217A
CN111432217A CN202010225600.3A CN202010225600A CN111432217A CN 111432217 A CN111432217 A CN 111432217A CN 202010225600 A CN202010225600 A CN 202010225600A CN 111432217 A CN111432217 A CN 111432217A
Authority
CN
China
Prior art keywords
embedding
block
information
coefficient
embedded
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
CN202010225600.3A
Other languages
Chinese (zh)
Other versions
CN111432217B (en
Inventor
刘云霞
赵红国
王永浩
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Zhengzhou Normal University
Original Assignee
Zhengzhou Normal University
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 Zhengzhou Normal University filed Critical Zhengzhou Normal University
Priority to CN202010225600.3A priority Critical patent/CN111432217B/en
Publication of CN111432217A publication Critical patent/CN111432217A/en
Application granted granted Critical
Publication of CN111432217B publication Critical patent/CN111432217B/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/46—Embedding additional information in the video signal during the compression process
    • H04N19/467—Embedding additional information in the video signal during the compression process characterised by the embedded information being invisible, e.g. watermarking
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/169—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding
    • H04N19/17—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding the unit being an image region, e.g. an object
    • H04N19/176—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding the unit being an image region, e.g. an object the region being a block, e.g. a macroblock

Landscapes

  • Engineering & Computer Science (AREA)
  • Multimedia (AREA)
  • Signal Processing (AREA)
  • Image Processing (AREA)
  • Compression Or Coding Systems Of Tv Signals (AREA)

Abstract

The invention provides an information hiding, embedding and extracting method based on two-dimensional histogram translation, which comprises the steps of selecting a 4 × 4 coefficient embedding block of secret information to be embedded from an embedded carrier, and randomly selecting two coefficients Y1 and Y2 from the coefficients of the embedding block to form an embedding coefficient pair { Y1,Y2According to the embedding coefficient pair { Y }1,Y2Dividing the coefficient pairs into 19 sets which are not crossed with each other by the value of { Y }, respectively defining a two-dimensional histogram translation algorithm corresponding to each set of the 19 sets, and embedding the coefficient pairs { Y } according to the secret information to be embedded and the current embedding coefficient pair1,Y2The two-dimensional histogram translation method provided by the invention has the advantages of large embedding capacity, small embedding error, high embedding efficiency, and particularly, the two-dimensional histogram translation method provided by the invention has the advantages of large embedding capacity, small embedding error and high embedding efficiencyThe method is suitable for high-resolution videos and the like.

Description

Information hiding embedding and extracting method based on two-dimensional histogram translation
Technical Field
The invention belongs to the technical field of information processing, and particularly relates to an information hiding, embedding and extracting method based on two-dimensional histogram translation.
Background
A two-dimensional histogram translation algorithm is an extremely efficient method in the field of video information hiding, and the embedding and extraction of secret information are completed by mainly using widely distributed video information such as QDCT coefficients and motion vectors as carriers. Furthermore, the two-dimensional histogram shift algorithm mainly uses the QDCT coefficient or the peak point of the motion vector to embed data, and completes the data embedding by adding 1 or subtracting 1 to the peak point value, so that the number of coefficients or motion vectors at the peak point largely determines the embedding capacity performance of the two-dimensional histogram shift. Since video has more redundant space, QDCT coefficients or motion vector histogram distribution is sharper, the two-dimensional histogram shift algorithm has better embedding performance compared to image with video as carrier, and has become a hot spot of video information hiding research.
In the conventional histogram shift algorithm, a histogram shift algorithm based on QDCT coefficients is a highly effective information hiding method, according to statistics made by existing documents, QDCT coefficients with a value of "0" occupy 82.87% to 99.39% of all QDCT coefficients, and thus it is seen that the QDCT coefficients are very sharply distributed and thus have excellent embedding performance as histogram shift, the information hiding algorithm proposed by the prior art typically uses one-dimensional histogram shift to achieve embedding of secret information, the embedding of secret information is done by adding 1 to the absolute value of other non-peak points, and the left and right shifts are achieved by adding 1 to the absolute value of the other non-peak points.
Disclosure of Invention
Aiming at least one defect or improvement requirement in the prior art, the invention provides an information hiding, embedding and extracting method based on two-dimensional histogram translation, which has the advantages of large embedding capacity, small embedding error, higher embedding efficiency, particular suitability for high-resolution videos and the like.
To achieve the above object, according to a first aspect of the present invention, there is provided an information hiding and embedding method based on two-dimensional histogram shifting, including the steps of:
selecting an embedded block for information embedding from an embedded carrier;
randomly selecting two coefficients Y1 and Y2 from the coefficients of the embedded block to form an embedded coefficient pair { Y1,Y2The embedding coefficient pair { Y }1,Y2The secret information to be embedded is received, and the embedding coefficient pair { Y is adopted1,Y2Embedding the secret information into the embedded block by a histogram translation algorithm corresponding to the set to which the secret information belongs;
wherein the 19 non-intersecting sets include set A1-the secret information is denoted m { (0,0) }imi+1mi+2mi+3Defining set A in advance1The histogram shift algorithm of (1) is: if the current coefficient pair { Y1,Y2}∈A1And updating the coefficient pair embedded with the secret information to be { Y1′,Y2′}，
Figure BDA0002427524750000031
Preferably, the 19 non-intersecting sets further include sets: a. the2＝{(Y1,0)|Y1>0}
A3＝{(Y1,0)|Y1<0}
A4＝{(0,1)}
A5＝{(0,-1)}
A6＝{(0,Y2)|Y2>1}
A7＝{(0,Y2)|Y2<-1}
A8＝{(-1,Y2)|Y2>1}
A9＝{(1,Y2)|Y2>1}
A10＝{(1,Y2)|Y2<-1}
A11＝{(-1,Y2)|Y2<-1}
A12＝{(Y1,1)|Y1<0}
A13＝{(Y1,Y2)|Y1<-1,Y2>1}
A14＝{(Y1,1)|Y1>0}
A15＝{(Y1,Y2)|Y1>1,Y2>1}
A16＝{(Y1,-1)|Y1<0}
A17＝{(Y1,Y2)|Y1<-1,Y2<-1}
A18＝{(Y1,-1)|Y1>0}
A19＝{(Y1,Y2)|Y1>1,Y2<-1}，
The histogram translation algorithm corresponding to each set in the 19 non-intersecting sets is predefined as follows: if the embedding coefficient pair { Y1,Y2}∈A1,A1,A3,A4,A5,A8,A9,A10,A11Embedding the secret information into the embedding coefficient pair, if the embedding coefficient pair { Y }1,Y2}∈A6,A7,A12,A13,A14,A15,A16,A17,A18,A19Then histogram shifting is performed on the pair of embedded coefficients.
Preferably, the embedded block is a 4 × 4 transform quantized residual coefficient block, the pair of embedded coefficients { Y }1,Y2The high-frequency coefficients of the quantized residual coefficient block are transformed by intra and inter 4 × 4.
Preferably, the pair of embedding coefficients { Y }1,Y2Is the QDST coefficient.
Preferably, the selecting of the embedded block for information embedding specifically includes:
predefined Random function seed Random (seed1) and block threshold TblockSelecting a product satisfying Random (seed)1)≤TblockThe 4 × 4QDST small block as an embedded block.
Preferably, before embedding the secret information into the embedding block, preprocessing the secret information, the preprocessing including the steps of:
encrypting the secret information into a ciphertext by using a public key in an RSA encryption mode;
carrying out binarization processing on the ciphertext to obtain a binarization bit sequence;
and adding a start marker and an end identifier to the binary bit sequence to obtain the bit sequence.
According to a second aspect of the present invention, there is provided an information extraction method based on two-dimensional histogram translation, comprising the steps of:
receiving information embedding parameters, and selecting an extraction block for information extraction from an embedded carrier by using the embedding parameters, wherein the embedded carrier is embedded with secret information;
randomly selecting two from the coefficients of the extraction block using the embedding parametersCoefficient of Y1′，Y2' composition includes pairs of secret coefficients { Y1′,Y2′}；
Extracting secret information by performing an inverse operation of secret information embedding on the pair of secret-containing coefficients by using the embedding parameter;
wherein, if Y1′∈[-1,1]And Y is2′∈[-1,1]Then the extracted secret information m is:
Figure BDA0002427524750000051
according to a third aspect of the invention, there is provided a computer readable storage medium having stored thereon a computer program which, when executed by a processor, performs any of the methods described above.
In general, compared with the prior art, the invention has the following beneficial effects:
(1) the invention makes full use of the coefficient peak point '0' to embed more secret information into the coefficient pair position, namely, modifying one-bit coefficient to embed 4-bit secret information at most. Through the novel two-dimensional histogram translation method, the information hiding and embedding capacity is greatly improved, and compared with the existing related information hiding technology, the embedding efficiency is higher.
(2) In a common compressed video file, inter-frame prediction is more common relative to intra-frame prediction, and the positions of 4 × small blocks are all positions with violent video content motion, and the high-frequency coefficients after transformation and quantization contain less video information relative to the rest low-frequency coefficients, so that the positions are selected as candidate positions of embedded information, and the embedding performance of video information hiding can be further improved, namely compared with the embedding capacity and the video distortion.
(3) The invention fully utilizes the QDST coefficient after the transformation and quantization, and the QDST coefficient occupies most of the video code stream file, thereby the safety is higher compared with other methods.
Drawings
FIG. 1 is a schematic diagram of an information embedding process according to an embodiment of the present invention;
FIG. 2 is a schematic diagram of information-embedded secret information preprocessing according to an embodiment of the present invention;
FIG. 3 is a diagram of a histogram shift algorithm for information embedding according to an embodiment of the present invention;
FIG. 4 is a schematic diagram of an information extraction flow according to an embodiment of the present invention;
FIG. 5 is a high frequency coefficient diagram of information extraction according to an embodiment of the present invention;
fig. 6 is a schematic diagram of secret information restoration proposed by the information of the embodiment of the present invention.
Detailed Description
The present invention will be described in further detail with reference to the accompanying drawings and examples, so that the objects, aspects and advantages of the present invention will become more apparent. It should be understood that the specific embodiments described herein are merely illustrative of the invention and are not intended to limit the invention. In addition, the technical features involved in the embodiments of the present invention described below may be combined with each other as long as they do not conflict with each other.
The invention provides an information hiding, embedding and extracting method based on two-dimensional histogram translation, which is respectively executed at a secret information embedding end and a secret information extracting end.
In embedding information, a two-dimensional histogram shift algorithm is predefined, wherein the peak value point '0' of the coefficient is fully utilized, so that more secret information can be embedded in the position of the coefficient pair, preferably, the embedded block is 4 × 4 small block, namely, 4 × 4 transformation quantized residual coefficient block, the embedded coefficient pair of the embedded block is { Y1,Y2The high frequency coefficients of the intra and inter 4 × 4 transform quantized residual coefficient block1,Y2Is the QDST coefficient.
Preferably, the extraction block is a 4 × 4 small block, namely a 4 × 4 residual coefficient block after transform quantization, and contains a secret coefficientFor { Y1,Y2The high frequency coefficients of the intra and inter 4 × 4 transform quantized residual coefficient block1,Y2Is the QDST coefficient.
The information embedding method based on H.265 histogram translation of the embodiment of the invention comprises four parts of preprocessing of secret information, selection of an embedded block position, embedding of the secret information, two-dimensional histogram translation and entropy coding into a code stream file, as shown in figure 1.
And S11, preprocessing the secret information to be embedded.
The preprocessing part of the secret information comprises the steps of encryption, binarization, adding start and end bits of the secret information, and the like, as shown in fig. 2. The main purpose of the preprocessing is to encrypt the secret information to strengthen the security of the secret information, namely to ensure that the secret information is not read and known maliciously when the secret information is attacked maliciously; secondly, binarization is carried out so that secret information can be embedded into a subsequent carrier video, namely a preceding condition for embedding the secret information subsequently; finally, the start bit and the end bit of the secret information are added to ensure that the secret information can be accurately extracted at the extraction end, and irrelevant information is removed, namely, when information hiding begins and when information hiding ends in the carrier video are accurately known.
Specifically, the pretreatment comprises the steps of:
and S111, encrypting. And the RSA encryption mode is adopted, and the secret information to be embedded is encrypted into a ciphertext by using the public key so as to ensure the safety of the secret information. And the receiving end correspondingly decrypts the obtained ciphertext by using the private key.
And S112, binarization. And sequentially binarizing the ciphertexts encrypted in the step S111 to obtain a binary bit sequence. The purpose of binarization is the necessary pre-processing for embedding information in the embedding module.
And S113, adding a start bit and an end bit. In order to accurately locate the start and end positions of the secret information, the binary bit sequence obtained in step S112 needs to be added with the start identifier 0x000000 and the end identifier 0x000001 in the bit string sequence.
S12, an embedded block for embedding information is selected from the embedded carrier.
The selection of the position of the embedded block has two main purposes: firstly, in order to strengthen the safety of information hiding, namely improve the anti-steganography analysis capability of the information hiding, namely randomly selecting an embeddable block for embedding secret information; and secondly, in order to improve the embedding performance of information hiding, namely, the high visual quality of the carrier video is maintained from the perspective of visual effect by selecting an area with complex video background texture characteristics and violent motion for embedding information while maximizing the embedding capacity.
Specifically, the method comprises the following steps:
and S121, predefining a Random seed, and utilizing a Random function Random (seed1) to determine whether the current 4 × 4 block is used as the candidate embedded block in the step S122.
S122, selecting candidate embedded blocks. In particular, the selection of candidate blocks involves two aspects.
First, a block threshold value T is predefinedblockAccording to the current Random function Random (seed)1) ∈ (0,1) is less than threshold Tblock∈ (0,1) to determine whether to treat the current 4 × 4QDST tile as an embedded block1)≤TblockIf the current 4 × 4QDST block is used as a candidate embedded block for embedding the secret information of the third part, if not, the current 4 × 4QDST block is not used as a candidate embedded block, and the next 4 × 4QDST block is judged.
The second is the selection of candidate embedded block locations. The technical scheme is suitable for I, B, P frames, and particularly depends on the application scene of information hiding. For a video sequence with I frames, P frames or B frames, if the last frame of a GOP (group of picture) sequence is selected as an embedding position, the inter-frame distortion drift caused by embedded information can be effectively prevented, and the video sequence has a good effect on scenes with high requirements on video application visual quality, such as medical images and the like. Meanwhile, if the embedded information is in the I frame, distortion drift caused by embedding does not affect other I frames, but for all subsequent P frames or B frames which need to refer to the current I frame, inter-frame distortion drift still exists, but the position has larger embedding capacity, so that a video frame in which the embedded block is located is specifically dependent on which frame of the GOP, and can be flexibly adjusted according to actual needs, that is, the scheme has certain expandability.
S13, the embedded secret information is shifted with the two-dimensional histogram. That is, randomly selecting two coefficients Y1 and Y2 from the coefficients of the embedded block to form an embedded coefficient pair { Y1,Y2R, embedding coefficient pair Y1,Y2And the histogram translation algorithm corresponding to each of the 19 non-crossed sets is predefined.
Randomly selecting two coefficient composition coefficient pairs { Y ] from the selected 4 × 4QDST coefficients1,Y2}. Embedding random seed in this step2The information extraction device needs to be consistent with the extraction terminal so as to correctly extract the information. Selecting coefficient pair { Y1,Y2The steps of (1) include:
s131, firstly defining a coefficient threshold T of a 4 × 4 embedded blockembedAnd judging the direct current coefficient Y in the current 4 × 4QDST coefficient block0,0Whether or not it is greater than coefficient threshold Tembed. If Y is0,0≥TembedThen two coefficient composition coefficient pairs { Y } are selected from the high frequency coefficients in the current 4 × 4 tile according to step S1321,Y2}; if Y is0,0<TembedIf so, the current 4 × 4QDST coefficient block is not embedded, and the next coefficient block is directly traversed, and the process proceeds to step S12.
S132, establishing a simple random function f (seed)2) ∈ (0,1), sequentially traversing the high-frequency coefficients, if the random function value f (seed)2) More than or equal to 0.5, selecting corresponding coefficient to put in coefficient pair { Y ≧ 0.51,Y2}; if the random function value f (seed)2)<0.5, the coefficient of the current position is not taken as the embedding position.
S133, dividing the 4 × 4QDST coefficient pairs into 19 sets which are not intersected with each other, and predefining a two-dimensional histogram translation algorithm corresponding to each set.
According to the current coefficient pair { Y1,Y2And (4) embedding the secret information in the set to which the secret information belongs according to a histogram translation algorithm of the corresponding set. Wherein the coefficient pair { Y1,Y2Different sets can lead to different embedded bits of the secret information, namely, the technical scheme embeds more secret information by using peak points as much as possible, and maximally improves the embedding capacity on the premise of ensuring the visual quality of the carrier video.
Preferably, the two-dimensional histogram shift algorithm is as shown in fig. 3:
current coefficient pair Y1,Y2The set to which it belongs is denoted A, then 19 non-intersecting sets are denoted as follows, where the subset A is1,A2,A3,A4,A5,A8,A9,A10,A11Actually for information hiding and others for translation of coefficients.
A1＝{(0,0)}
A2＝{(Y1,0)|Y1>0}
A3＝{(Y1,0)|Y1<0}
A4＝{(0,1)}
A5＝{(0,-1)}
A6＝{(0,Y2)|Y2>1}
A7＝{(0,Y2)|Y2<-1}
A8＝{(-1,Y2)|Y2>1}
A9＝{(1,Y2)|Y2>1}
A10＝{(1,Y2)|Y2<-1}
A11＝{(-1,Y2)|Y2<-1}
A12＝{(Y1,1)|Y1<0}
A13＝{(Y1,Y2)|Y1<-1,Y2>1}
A14＝{(Y1,1)|Y1>0}
A15＝{(Y1,Y2)|Y1>1,Y2>1}
A16＝{(Y1,-1)|Y1<0}
A17＝{(Y1,Y2)|Y1<-1,Y2<-1}
A18＝{(Y1,-1)|Y1>0}
A19＝{(Y1,Y2)|Y1>1,Y2<-1}
The embedding rule depends on the current coefficient pair Y1,Y2Different sets are adopted, different embedding modes are adopted to improve the embedding capacity as much as possible, and the current coefficient pair after information is embedded is assumed to be { Y }1′,Y2' }, the secret information bit string to be embedded is mimi+1mi+2mi+3Then the specific embedding rule is as follows:
if the current coefficient pair Y1,Y2}∈A1The coefficients after embedding the information are:
Figure BDA0002427524750000101
if the current coefficient pair Y1,Y2}∈A2The coefficients after embedding the information are:
Figure BDA0002427524750000102
if the current coefficient pair Y1,Y2}∈A3The coefficients after embedding the information are:
Figure BDA0002427524750000103
if the current coefficient pair Y1,Y2}∈A4Then inlayThe coefficients after entering the information are:
Figure BDA0002427524750000104
if the current coefficient pair Y1,Y2}∈A5The coefficients after embedding the information are:
Figure BDA0002427524750000111
if the current coefficient pair Y1,Y2}∈A8The coefficients after embedding the information are:
Figure BDA0002427524750000112
if the current coefficient pair Y1,Y2}∈A9The coefficients after embedding the information are:
Figure BDA0002427524750000113
if the current coefficient pair Y1,Y2}∈A10The coefficients after embedding the information are:
Figure BDA0002427524750000114
if the current coefficient pair Y1,Y2}∈A11The coefficients after embedding the information are:
Figure BDA0002427524750000115
if the current coefficient pair Y1,Y2}∈A6,A7,A12,A13,A14,A15,A16,A17,A18,A19Then, the current coefficient is not embedded with secret information, only the histogram is translated, and the translated coefficient is mappedY1′,Y2' } is:
Figure BDA0002427524750000116
the embedding process is illustrated as one example. If the current coefficient pair Y1,Y2With {0,0}, then the current coefficient pair {0,0} can be extended to {0,0}, {1,0}, {0,1}, { -1,0}, {0, -1}, {1,1}, { -1,1}, { -1, -1}, {1, -1}, and {1, -1}, with the corresponding embedded secret information being 000, 001,010,011,100,101,110,1110,1111, respectively. From the above example, it can be seen that, in the optimal case, the scheme proposed herein can achieve the purpose of embedding 3 bits of secret information at most and modifying one bit coefficient only, i.e. adding 1 or subtracting 1, to achieve the purpose of information hiding.
After the current 4 × 4QDST coefficient completes embedding the secret information, the next 4 × 4QDST coefficient is distinguished and embedded, i.e. the process proceeds to step S12 until the secret information is embedded into the stop bit.
And S14, entropy coding into a code stream file.
The main function of this section is to embed the modified QDST coefficients { Y } after the secret information is embedded at step S131′,Y2' }, and other syntax elements such as a prediction mode, a motion vector, a partition mode and the like are entropy-coded into a code stream file one by one to form a compressed video format which can be finally transmitted by a network. The processing mode of the part is not related to a specific information hiding algorithm, but is a necessary basic condition for video files at a network transmission and information hiding extraction end.
Another embodiment of the present invention provides an information extraction method based on h.265 histogram shifting, as shown in fig. 4, the extraction end mainly includes four main processes of entropy decoding, extracting information according to a two-dimensional histogram shifting rule, decoding and reconstructing a video file, and post-processing secret information, and corresponds to the embedding end.
S21, carrying out entropy decoding on the embedded carrier and selecting an extraction block.
The main function of the part is to obtain the QDST coefficient { Y after network transmission1′,Y2'}. This is achieved byThe part consists of two steps, entropy decoding and selection of the extraction block position.
S211 entropy decoding. The extraction end firstly obtains carrier video containing secret information, namely video file with suffix of bin from the network as input of the extraction end, and QDST coefficient { Y is decoded by the entropy decoding module1′,Y2' decoding video coding parameters and residual data such as a segmentation mode, a prediction mode, a motion vector, a reference frame index and the like, and taking the decoded video coding parameters and residual data as a necessary basis for extracting subsequent secret information.
S212 extracts the selection of the block position. Receiving information embedding parameters including seed of random function used in embedding1Random seed2And a block threshold TblockAnd selecting an extraction block for information extraction from the embedded carrier by using the information embedding parameters. Seed of random function1Needs to be kept consistent with the embedded end, and the block threshold T of the block is extracted at the same timeblockWhether the current 4 × 4QDST block after entropy decoding is taken as the extracted block depends on the Random function Random (seed)1) Whether or not it is less than or equal to block threshold TblockIf Random (seed)1) Less than or equal to TblockIf the current 4 × 4QDST block is used as the extraction block of the secret information, the next part is entered to extract the information according to the two-dimensional histogram shift rule, if Random (seed)1) Greater than TblockThen the current 4 × 4QDST block is not taken as the fetch block and the next 4 × 4QDST block is traversed according to the entropy decoding flow.
S22, randomly selecting two coefficients Y from the coefficients of the selected extraction block1′，Y2' Pair of component extraction block coefficients { Y1′,Y2' }, for the extraction block coefficient pair { Y1′,Y2' } perform the inverse operation of the secret information embedding to extract the secret information.
The main function of this part is to derive the QDST coefficients Y from the secret information contained1′,Y2' } secret information is extracted. Mainly comprising two steps, the QDST coefficient pair { Y1′,Y2' } and extracting secret information according to an extraction rule.
S221, secret QDST coefficient pair { Y1′,Y2' } construction of the DNA fragment.
Step1, the extraction end firstly defines a coefficient threshold T of an extraction blockExtractHere coefficient threshold TExtractNeeds to be connected with an embedded end TembedAnd the consistency is maintained. Discriminating DC coefficient Y0,0And coefficient threshold TExtractTo determine whether the current 4 × 4 block has secret information embedded at the embedding end if Y0,0≥TExtractIf yes, the current 4 × 4QDST block is transferred to Step2 as the extraction block, if Y is not the same as the extraction block0,0<TExtractThen the current 4 × 4QDST block does not act as an extraction block for secret information and the decision of the next 4 × 4QDST block is continued, here by deciding the low frequency coefficient Y0,0And coefficient threshold TExtractMainly selects a relatively complex area of the video background as the carrier area for information hiding because of the low-frequency coefficient Y0,0The mean of the video residual energies of the current 4 × 4 block, larger Y0,0Meaning that the video content at that location changes more and the background is more complex. The operation of hiding information in the area has more visual secrecy.
Step2. for the current 4 × 4QDST coefficient block, a random seed is first defined2Seed here2High frequency coefficients in the current 4 × 4QDST coefficient block are traversed sequentially, using a random function f (seed) for each high frequency coefficient2) ∈ (0,1), if the random function value f (seed)2) Less than or equal to 0.5, the current stage coefficient is taken as the coefficient pair { Y1′,Y2' } up to coefficient pair Y1′,Y2' } finish forming; if the random function value f (seed)2)>0.5, then the current coefficient is not taken as the coefficient pair { Y1′,Y2' } composition. The reason why the high-frequency coefficient is selected as the information hiding carrier is that the high-frequency coefficient has smaller video energy, and the change of the high-frequency coefficient has little influence on the video, so that the information hiding effect is better than the visual effect of changing the low-frequency coefficient.
The high-frequency coefficient is a coefficient at the lower right position of the current 4 × 4QDST small block, as shown in fig. 5, the green labeled coefficient is the high-frequency coefficient, and the yellow labeled coefficient at the upper left corner is the low-frequency coefficient.
S221, extracts the secret information.
Extracting the secret information according to the result of the embedded end after the two-dimensional histogram translation (Y)1′,Y2' } perform the inverse operation to get the embedded information. Assuming that the extracted secret information is m, the specific extraction method is as follows:
if Y is1′∈[-1,1]And Y is2′∈[-1,1]Then the extracted secret information is determined by:
Figure BDA0002427524750000141
if Y is1' ∈ [2, + ∞) and Y2′∈[-1,1]Or Y1′∈(-∞,-2]And Y is2′∈[-1,1]Then the extracted secret information is determined by:
Figure BDA0002427524750000142
if Y is1′∈[-1,1]And | Y2' | 2, then the extracted secret information is determined by:
Figure BDA0002427524750000143
if | Y1′|∈[1,2]And | Y2′|>2, the extracted secret information is determined by:
Figure BDA0002427524750000144
if { Y1′,Y2' does not belong to any of the above cases, the extraction of secret information is not performed, because the embedding of secret information is not performed at the embedding end, only the shift operation of the histogram is performed, additionally, the shift can be used for the hiding of the reversible informationTibetan, etc.
And S23, decoding the reconstructed video file.
The main function of this part is to derive the QDST coefficients Y from the secret information contained1′,Y2' extracting the secret information, and subjecting the syntax element and the QDST coefficient decoded according to the first part of entropy to inverse transformation inverse quantization, intra-frame inter-frame prediction and other processing mechanisms to obtain a decoded yuv format video file which can be used for normal video playing and other functions.
S24, secret information post-processing.
The main function of this part is to extract the secret information bit string obtained after the operation from step S22, remove the start bit and the end bit of the secret information bit string, binarize, decrypt, and so on, to obtain the original secret information, as shown in fig. 6, including the steps of:
s241, remove the start bit and the end bit. The bit string sequence obtained by the second part extraction operation needs to be added with a start marker 0x000000 and an end marker 0x000001 in the bit string sequence, so as to obtain secret information with accurate positioning.
And S242, performing inverse binarization. And (4) performing inverse binarization on the secret information bit string obtained by removing the start bit and the end bit in the step (S241) to obtain an encrypted secret information sequence.
And S243, decrypting. And (4) decrypting the encrypted secret information sequence obtained in the step (S242) by using the private key of the extraction terminal, so as to obtain the original ciphertext.
The embodiment of the present invention further provides a computer-readable storage medium, on which a computer program is stored, where the computer program is executed by a processor to implement the technical solution of any one of the above embedding or extracting method embodiments. The implementation principle and technical effect are similar to those of the above method, and are not described herein again.
It must be noted that in any of the above embodiments, the methods are not necessarily executed in order of sequence number, and as long as it cannot be assumed from the execution logic that they are necessarily executed in a certain order, it means that they can be executed in any other possible order.
It will be understood by those skilled in the art that the foregoing is only a preferred embodiment of the present invention, and is not intended to limit the invention, and that any modification, equivalent replacement, or improvement made within the spirit and principle of the present invention should be included in the scope of the present invention.

Claims (10)

1. An information hiding and embedding method based on two-dimensional histogram translation is characterized by comprising the following steps:
selecting an embedded block for information embedding from an embedded carrier;
randomly selecting two coefficients Y1 and Y2 from the coefficients of the embedded block to form an embedded coefficient pair { Y1，Y2The embedding coefficient pair { Y }1，Y2The secret information to be embedded is received, and the embedding coefficient pair { Y is adopted1，Y2Embedding the secret information into the embedded block by a histogram translation algorithm corresponding to the set to which the secret information belongs;
wherein the 19 non-intersecting sets include set A1-the secret information is denoted m { (0,0) }imi+ 1mi+2mi+3Defining set A in advance1The histogram shift algorithm of (1) is: if the current coefficient pair { Y1，Y2}∈A1And updating the coefficient pair embedded with the secret information to be { Y1′，Y2′}，
Figure FDA0002427524740000011
。
2. The information hiding and embedding method based on two-dimensional histogram translation as claimed in claim 1, wherein among said 19 non-intersecting sets, further comprising sets:
A2＝{(Y1，0)|Y1＞0}
A3＝{(Y1，0)|Y1＜0}
A4＝{(0，1)}
A5＝{(0，-1)}
A6＝{(0，Y2)|Y2＞1}
A7＝{(0，Y2)|Y2＜-1}
A8＝{(-1，Y2)|Y2＞1}
A9＝{(1，Y2)|Y2＞1}
A10＝{(1，Y2)|Y2＜-1}
A11＝{(-1，Y2)|Y2＜-1}
A12＝{(Y1，1)|Y1＜0}
A13＝{(Y1，Y2)|Y1＜-1，Y2＞1}
A14＝{(Y1，1)|Y1＞0}
A15＝{(Y1，Y2)|Y1＞1，Y2＞1}
A16＝{(Y1，-1)|Y1＜0}
A17＝{(Y1，Y2)|Y1＜-1，Y2＜-1}
A18＝{(Y1，-1)|Y1＞0}
A19＝{(Y1，Y2)|Y1＞1，Y2＜-1}，
the histogram translation algorithm corresponding to each set in the 19 non-intersecting sets is predefined as follows: if the embedding coefficient pair { Y1，Y2}∈A1，A2，A3，A4，A5，A8，A9，A10，A11Embedding the secret information into the embedding coefficient pair, if the embedding coefficient pair { Y }1，Y2}∈A6，A7，A12，A13，A14，A15，A16，A17，A18，A19Then histogram shifting is performed on the pair of embedded coefficients.
3. A two-dimensional histogram shift based information hiding and embedding method as claimed in claim 1 or 2, wherein said embedded block is a 4 × 4 transform quantized residual coefficient block, said embedded coefficient pair { Y } is1，Y2The high-frequency coefficients of the quantized residual coefficient block are transformed by intra and inter 4 × 4.
4. The two-dimensional histogram shifting-based information hiding and embedding method as claimed in claim 3, wherein said embedding coefficient pair { Y } is1，Y2Is the QDST coefficient.
5. The information hiding and embedding method based on two-dimensional histogram translation as claimed in claim 4, wherein said selecting an embedding block for information embedding specifically comprises:
predefined random function seed random (seed) and block threshold TblockSelecting a product satisfying Random (seed)1)≤TblockThe 4 × 4QDST small block as an embedded block.
6. The information hiding and embedding method based on two-dimensional histogram translation as claimed in claim 1 or 2, wherein said secret information is preprocessed before embedding into said embedding block, said preprocessing comprising the steps of:
encrypting the secret information into a ciphertext by using a public key in an RSA encryption mode;
carrying out binarization processing on the ciphertext to obtain a binarization bit sequence;
and adding a start marker and an end identifier to the binary bit sequence to obtain the bit sequence.
7. An information extraction method based on two-dimensional histogram translation is characterized by comprising the following steps:
receiving information embedding parameters, and selecting an extraction block for information extraction from an embedded carrier by using the embedding parameters, wherein the embedded carrier is embedded with secret information;
randomly selecting two coefficients Y from the coefficients of the extraction block using the embedding parameters1′，Y2' composition includes pairs of secret coefficients { Y1′，Y2′}；
Extracting secret information by performing an inverse operation of secret information embedding on the pair of secret-containing coefficients by using the embedding parameter;
wherein, if Y1′∈[-1，1]And Y is2′∈[-1，1]Then the extracted secret information m is:
Figure FDA0002427524740000041
。
8. the two-dimensional histogram shifting-based information extraction method as claimed in claim 7, wherein said extraction block is a 4 × 4 transform quantized residual coefficient block, and said secret coefficient pair { Y } is1′，Y2' } is the high frequency coefficient of the inter or intra 4 × 4 transform quantized residual coefficient block.
9. The two-dimensional histogram shifting-based information extraction method as claimed in claim 8, wherein said pair of secret coefficients { Y } is1′，Y2' } is the QDST coefficient.
10. A computer-readable storage medium, on which a computer program is stored, which, when being executed by a processor, carries out the method according to any one of claims 1 to 9.
CN202010225600.3A 2020-03-26 2020-03-26 Information hiding embedding and extracting method based on two-dimensional histogram translation Expired - Fee Related CN111432217B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202010225600.3A CN111432217B (en) 2020-03-26 2020-03-26 Information hiding embedding and extracting method based on two-dimensional histogram translation

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202010225600.3A CN111432217B (en) 2020-03-26 2020-03-26 Information hiding embedding and extracting method based on two-dimensional histogram translation

Publications (2)

Publication Number Publication Date
CN111432217A true CN111432217A (en) 2020-07-17
CN111432217B CN111432217B (en) 2022-08-05

Family

ID=71548911

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202010225600.3A Expired - Fee Related CN111432217B (en) 2020-03-26 2020-03-26 Information hiding embedding and extracting method based on two-dimensional histogram translation

Country Status (1)

Country Link
CN (1) CN111432217B (en)

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20100177891A1 (en) * 2001-04-11 2010-07-15 Oren Keidar Digital video protection for authenticity verification
CN107333139A (en) * 2017-06-27 2017-11-07 郑州师范学院 A kind of H.265 half invertible video steganography information approach based on intra prediction mode
CN108366259A (en) * 2018-01-15 2018-08-03 华南理工大学 A kind of reversible steganography method of three coefficient of H.264/AVC video of high-fidelity

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20100177891A1 (en) * 2001-04-11 2010-07-15 Oren Keidar Digital video protection for authenticity verification
CN107333139A (en) * 2017-06-27 2017-11-07 郑州师范学院 A kind of H.265 half invertible video steganography information approach based on intra prediction mode
CN108366259A (en) * 2018-01-15 2018-08-03 华南理工大学 A kind of reversible steganography method of three coefficient of H.264/AVC video of high-fidelity

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
赵娟: "3D H.264视频可逆信息隐藏技术研究", 《博士学位论文信息科技辑》 *

Also Published As

Publication number Publication date
CN111432217B (en) 2022-08-05

Similar Documents

Publication Publication Date Title
Qin et al. Reversible data hiding in encrypted image with separable capability and high embedding capacity
Chen et al. A virtual image cryptosystem based upon vector quantization
Celik et al. Lossless generalized-LSB data embedding
Xu et al. A novel watermarking scheme for H. 264/AVC video authentication
Chen et al. Multi-MSB compression based reversible data hiding scheme in encrypted images
Qin et al. Reversible data hiding in VQ index table with lossless coding and adaptive switching mechanism
Chang et al. A reversible compression code hiding using SOC and SMVQ indices
Qin et al. Visible watermark removal scheme based on reversible data hiding and image inpainting
CN106162195B (en) A kind of 3D HEVC deep video information concealing methods based on single depth frame mode
CN109348228A (en) A kind of hiding System and method for of the image encryption domain reversible information based on image segmentation and image space correlation
Kumar et al. Reversible data hiding: A contemporary survey of state-of-the-art, opportunities and challenges
CN104581176B (en) The insertion of H.264/AVC compression domain robust video watermark and extracting method without frame in error drift
Li et al. A HEVC Video Steganalysis Algorithm Based on PU Partition Modes.
CN107333139B (en) H.265 semi-reversible video steganography information method based on intra-frame prediction mode
Wang et al. A novel high-performance reversible data hiding scheme using SMVQ and improved locally adaptive coding method
Choudry et al. A survey paper on video steganography
Chu et al. A digital image watermarking method based on labeled bisecting clustering algorithm
CN111432217B (en) Information hiding embedding and extracting method based on two-dimensional histogram translation
Ahuja et al. Robust Video Watermarking Scheme Based on Intra-Coding Process in MPEG-2 Style.
Luo et al. Security of MVD-based 3D video in 3D-HEVC using data hiding and encryption
CN114598887A (en) Anti-recompression video watermarking method for controlling bit rate increase
Li et al. High‐Capacity Reversible Data Hiding in Encrypted Images by Information Preprocessing
Bhardwaj et al. An improved dual image separable reversible data hiding algorithm for encrypted HAMBTC compressed images
Sakib et al. A robust DWT-based compressed domain video watermarking technique
Sivadasan A survey paper on various reversible data hiding techniques in encrypted images

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant
CF01 Termination of patent right due to non-payment of annual fee
CF01 Termination of patent right due to non-payment of annual fee

Granted publication date: 20220805