CN110942414B - JPEG image information hiding method - Google Patents

JPEG image information hiding method Download PDF

Info

Publication number
CN110942414B
CN110942414B CN201911230800.1A CN201911230800A CN110942414B CN 110942414 B CN110942414 B CN 110942414B CN 201911230800 A CN201911230800 A CN 201911230800A CN 110942414 B CN110942414 B CN 110942414B
Authority
CN
China
Prior art keywords
zrv
value
mcu
jpeg image
sequence
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.)
Active
Application number
CN201911230800.1A
Other languages
Chinese (zh)
Other versions
CN110942414A (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.)
Fujian Normal University
Original Assignee
Fujian 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 Fujian Normal University filed Critical Fujian Normal University
Priority to CN201911230800.1A priority Critical patent/CN110942414B/en
Publication of CN110942414A publication Critical patent/CN110942414A/en
Application granted granted Critical
Publication of CN110942414B publication Critical patent/CN110942414B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T1/00—General purpose image data processing
    • G06T1/0021—Image watermarking
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T9/00—Image coding

Landscapes

  • Engineering & Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • Multimedia (AREA)
  • Compression Or Coding Systems Of Tv Signals (AREA)
  • Compression Of Band Width Or Redundancy In Fax (AREA)

Abstract

The invention provides a JPEG image information hiding method, which comprises the steps of obtaining all ZRV value pairs and corresponding absolute values of AC coefficients in a JPEG image; selecting effective ZRV value pairs from all the ZRV value pairs according to the preset rule and the absolute value of the AC coefficient; and hiding the information of the JPEG image according to the effective ZRV value to obtain a hidden JPEG image, and taking the absolute value of an AC coefficient as a core reference characteristic, so that the load capacity of information hiding, particularly the load capacity of a texture smooth image, is simple in calculation, easy to realize, good in compatibility and capable of well keeping the file size of the bit stream of the JPEG image before and after information hiding.

Description

JPEG image information hiding method
Technical Field
The invention relates to the technical field of multimedia information security, in particular to a JPEG image information hiding method.
Background
In 2018, He et al proposed an A Novel High-Capacity Reversible Data High Scheme for Encrypted JPEG Bitstreams (an algorithm to achieve High-reserve information Hiding on Encrypted JPEG Bitstreams) in IEEE Transactions on Circuits and Systems for Video Technology. First, a DC and AC separated image encryption method based on permutation is proposed. The encryption method is mainly characterized in that the image can be scrambled while certain characteristics of the AC coefficient are kept unchanged. On this basis, strategies are proposed to hide the information on the AC coefficients.
According to the JPEG encoding standard, all MCUs are first parsed from the received encrypted JPEG bit stream and decoded into a zero-run/value pair form, denoted as ZRV. For convenience of description, for the l-th MCU, it is assumed that the decoded zero-runs/value pair ZRVlIs represented as follows:
Figure GDA0003553819110000011
wherein
Figure GDA0003553819110000012
Represents the k zero-run/value pair in the l MCU,
Figure GDA0003553819110000013
representing the AC coefficient value to which the current value pair corresponds,
Figure GDA0003553819110000014
is shown in
Figure GDA0003553819110000015
Previous to last non-zero coefficient
Figure GDA0003553819110000016
Number of zero coefficients in between. K is the number of zero-runs/value pairs in the l-th MCU.
He et al found that for most MCUs, the ZRVlIn (1)
Figure GDA0003553819110000017
Usually, a relatively (maximum) value is obtained for a non-zero coefficient located relatively back. More specifically, in each MCU, the zero-run of the last non-zero AC coefficient (i.e., the
Figure GDA0003553819110000018
) The large probability is the largest in this MCU. And just this feature can be used for information hiding. Therefore, He et al classifies all MCUs into conventional MCUs, singular MCUs and non-storable MCUs. The singular MCU and the unconcerable MCU are not used for hiding information, and the number of the singular MCU and the unconceable MCU is relatively small; meanwhile, the conventional MCU and the singular MCU need to be recorded and saved. Conventional MCU means
Figure GDA0003553819110000021
And obtaining the MCU with the only maximum value in the last ZRV, wherein K is more than or equal to N + 1. (for Tibetan logs)2N bitsInformation)
For a conventional MCU, different numbers of bits (log) can be buried depending on the K of each MCU2N) secret information. Specifically, a value pair sequence with the length of N is temporarily constructed from the current MCU, and comprises a 2 nd ZRV value pair, an Nth ZRV value pair and a last ZRV value pair. The value pair sequence with the length of N is subjected to right shift rotation, so that N middle states can be obtained, each state can be used for representing certain secret information, and therefore log can be realized2N bits of information hiding capability.
In the stage of extracting the secret information, the ZRV value pair of each MCU can be analyzed from the received JPEG bit stream; then, a sequence of pairs of temporary length N (including the 2 nd to nth ZRV pairs and the last ZRV pair) is constructed in the same way. Since the hidden information is selected in the embedding stage from the MCUs that get the unique maximum value in the last ZRV value pair, the secret information is derived and extracted from this feature when decrypting. While the sequence of the current MCU can be restored (derotated) to the pre-embedding state (with the maximum in the last pair of ZRV values)
Figure GDA0003553819110000022
Value).
The above method still has the following disadvantages:
the disadvantage 1 is that the loading capacity (reserve) of the carrier is limited and can be further improved. Proposed by He et al to
Figure GDA0003553819110000023
In
Figure GDA0003553819110000024
The size of the value is used as a core reference characteristic for designing each state sequence, so that secret information hiding is realized. In particular, from the experimental data given by its method, an average of about 53.56% of the MCUs are available for hiding information (see Table 1), which greatly limits its hiding power. Especially on images with relatively smooth texture, the available MCU drops significantly.
Disclosure of Invention
Technical problem to be solved
In order to solve the above problems in the prior art, the present invention provides a JPEG image information hiding method, which can improve the load capacity of information hiding, especially improve the load capacity of texture smooth images.
(II) technical scheme
In order to achieve the purpose, the invention adopts the main technical scheme that:
a JPEG image information hiding method comprises the following steps:
s1, acquiring all ZRV value pairs and absolute values of corresponding AC coefficients in the JPEG image;
s2, selecting effective ZRV value pairs from all the ZRV value pairs according to the preset rule and the absolute value of the AC coefficient;
and S3, hiding the information of the JPEG image according to the effective ZRV value to obtain a hidden JPEG image.
(III) advantageous effects
The invention has the beneficial effects that: acquiring all ZRV value pairs and corresponding absolute values of AC coefficients in a JPEG image; selecting effective ZRV value pairs from all the ZRV value pairs according to the preset rule and the absolute value of the AC coefficient; and hiding the information of the JPEG image according to the effective ZRV value to obtain a hidden JPEG image, and taking the absolute value of an AC coefficient as a core reference characteristic, so that the load capacity of information hiding, particularly the load capacity of a texture smooth image, is simple in calculation, easy to realize, good in compatibility and capable of well keeping the file size of the bit stream of the JPEG image before and after information hiding.
Drawings
FIG. 1 is a flow chart of a JPEG image information hiding method according to the invention;
fig. 2 is a mapping table of ZRV state-secret information according to an embodiment of the present invention.
Detailed Description
For the purpose of better explaining the present invention and to facilitate understanding, the present invention will be described in detail by way of specific embodiments with reference to the accompanying drawings.
Example one
Referring to fig. 1 to 2, a method for hiding JPEG image information includes the steps of:
s1, acquiring all ZRV value pairs and absolute values of corresponding AC coefficients in the JPEG image;
step S1 includes:
s11, acquiring a JPEG image, and analyzing all MCUs from the bit stream of the JPEG image;
s12, decoding all ZRV value pairs and corresponding AC coefficients from each MCU in sequence, generating the absolute value of the AC coefficients through the AC coefficients, and recording all ZRV values in the first MCU as
Figure GDA0003553819110000041
Wherein the content of the first and second substances,
Figure GDA0003553819110000042
denoted as the kth ZRV value pair for the lth MCU,
Figure GDA0003553819110000043
the coefficients representing the k-th ZRV,
Figure GDA0003553819110000044
representing coefficients
Figure GDA0003553819110000045
The number of the first continuous zero coefficients, l, is in the value range of [1, M]And M denotes the total number of all MCUs.
S2, selecting effective ZRV value pairs from all the ZRV value pairs according to the preset rule and the absolute value of the AC coefficient;
step S2 includes:
s21, calculating according to all ZRV value pairs in the I MCU
Figure GDA0003553819110000046
And judging whether N is greater than 2, if yes, executing step S22;
s22, selecting N ZRV value pairs from all ZRV value pairs in the first MCU to form the second MCUThe temporary ZRV value pair sequence of the I MCUs comprises a 1 st ZRV value pair
Figure GDA0003553819110000047
K thl-N +1 ZRV value pairs
Figure GDA0003553819110000048
To Kl-1 ZRV value pairs
Figure GDA0003553819110000049
S23, judging whether the temporary ZRV value pair sequence meets a preset condition, and if so, selecting the temporary ZRV value pair sequence as an effective ZRV value pair sequence in the l MCU.
The specific step of judging whether the sequence of the temporary ZRV value pair meets the preset condition is as follows:
judgment of
Figure GDA00035538191100000410
Absolute value of AC coefficient of
Figure GDA00035538191100000411
Whether greater than 1;
judgment of
Figure GDA00035538191100000412
Whether it is the maximum of the absolute values of all AC coefficients in the sequence of the temporary ZRV values and the value
Figure GDA00035538191100000413
Whether it is unique;
if it is
Figure GDA00035538191100000414
Greater than 1 and said
Figure GDA00035538191100000415
Is the maximum of the absolute values of all AC coefficients in the sequence of said temporary ZRV values and is unique, then it is satisfied whether or notThen, it is not satisfied.
And S3, hiding the information of the JPEG image according to the effective ZRV value to obtain a hidden JPEG image.
Step S3:
s31, constructing a mapping relation between the ZRV state and the secret information according to the effective ZRV value;
step S31 specifically includes:
and constructing a ZRV state-secret information mapping relation according to the effective ZRV value in the l MCU to the sequence.
And S32, hiding the information of the JPEG image according to the mapping relation to obtain a hidden JPEG image.
Step S32 includes:
s321: rotating the effective ZRV value pair sequence in the l MCU according to the mapping relation to obtain a ZRV value pair sequence hiding secret information in the l MCU;
s322: replacing the temporary ZRV value sequence of the first MCU according to the ZRV value sequence hiding the secret information in the first MCU to obtain a recombined first MCU;
s323: circulating all the MCUs to obtain the recombined MCUs corresponding to all the MCUs;
s324: and respectively carrying out entropy coding on all the recombined MCUs to obtain a hidden JPEG image.
Example two
The difference between this embodiment and the first embodiment is that this embodiment will further explain how the JPEG image information hiding method of the present invention is implemented by combining with a specific application scenario:
s1, acquiring all ZRV value pairs and absolute values of corresponding AC coefficients in the JPEG image;
step S1 includes:
s11, acquiring a JPEG image, and analyzing all MCUs from a bit stream JS of the JPEG image;
s12, decoding all ZRV value pairs and corresponding AC coefficients from each MCU in sequence, generating absolute values of the AC coefficients through the AC coefficients, and enabling all ZRV values in the first MCU to be in accordance with JPEG standardsPair is marked as
Figure GDA0003553819110000061
Wherein the content of the first and second substances,
Figure GDA0003553819110000062
denoted as the kth ZRV value pair for the lth MCU,
Figure GDA0003553819110000063
the coefficients representing the k-th ZRV,
Figure GDA0003553819110000064
representing coefficients
Figure GDA0003553819110000065
The number of the first continuous zero coefficients, l, is in the value range of [1, M]And M denotes the total number of all MCUs.
Step S2 includes:
s21, calculating according to all ZRV value pairs in the I MCU
Figure GDA0003553819110000066
Judging whether N is greater than 2, if so, executing step S22, otherwise, judging that the current MCU is a non-hidden MCU and executing step S21 on the l +1 MCU;
s22, selecting N ZRV value pairs from all ZRV value pairs in the I MCU to form a temporary ZRV value pair sequence of the I MCU, wherein the temporary ZRV value pair sequence comprises a 1 st ZRV value pair
Figure GDA0003553819110000067
K thl-N +1 ZRV value pairs
Figure GDA0003553819110000068
To Kl-1 ZRV value pairs
Figure GDA0003553819110000069
S23, judging whether the temporary ZRV value pair sequence meets a preset condition, and if so, selecting the temporary ZRV value pair sequence as an effective ZRV value pair sequence in the l MCU.
The specific step of judging whether the sequence of the temporary ZRV value pair meets the preset condition is as follows:
judgment of
Figure GDA00035538191100000610
Absolute value of AC coefficient of
Figure GDA00035538191100000611
Whether greater than 1;
judgment of
Figure GDA00035538191100000612
Whether it is the maximum of the absolute values of all AC coefficients in the sequence of the temporary ZRV values and the value
Figure GDA00035538191100000613
Whether it is unique;
if it is
Figure GDA00035538191100000614
Greater than 1 and said
Figure GDA00035538191100000615
If the absolute value of the temporary ZRV value is the maximum value of the absolute values of all AC coefficients in the sequence and is unique, the current MCU is judged to be a conventional MCU if the absolute value is satisfied, otherwise, the current MCU is judged to be an abnormal MCU if the absolute value is not satisfied, and the current MCU is recalculated
Figure GDA00035538191100000616
It jumps to step S21.
And S3, hiding the information of the JPEG image according to the effective ZRV value to obtain a hidden JPEG image.
Step S3:
s31, constructing a mapping relation between the ZRV state and the secret information according to the effective ZRV value;
step S31 specifically includes:
and constructing a ZRV state-secret information mapping relation according to the effective ZRV value pair sequence in the l MCU.
And S32, hiding the information of the JPEG image according to the mapping relation to obtain a hidden JPEG image.
Step S32 includes:
s321: rotating the effective ZRV value pair sequence in the l MCU according to the mapping relation to obtain a ZRV value pair sequence hiding secret information in the l MCU;
s322: replacing the temporary ZRV value sequence of the first MCU according to the ZRV value sequence hiding the secret information in the first MCU to obtain a recombined first MCU;
specifically, as shown in fig. 2, wherein,
Figure GDA0003553819110000071
representing the kth ZRV rotation state, the number in the corresponding secret information column represents the corresponding hidden secret information (log)2N bits). According to the secret information to be hidden, rotating the effective ZRV value to obtain a ZRV value pair sequence hidden in the secret information, wherein (a) is a mapping relation table of ZRV state-secret information, and (b) is an example of the mapping relation table of ZRV state-secret information in FIG. 2;
s323: circulating all the MCUs to obtain the recombined MCUs corresponding to all the MCUs;
s324: and respectively carrying out entropy coding on all the recombined MCUs to obtain the bit stream of the hidden JPEG image.
Table 1 is a table comparing experimental data of the present invention and He et al
Figure GDA0003553819110000072
Figure GDA0003553819110000081
TABLE 2 is a comparison table of the results of the He et al method and the present invention experiment
Figure GDA0003553819110000082
As can be seen from table 2, the absolute value of the AC coefficient is used as the core reference feature in the present invention, so that the load capacity of information hiding, especially the load capacity of texture smooth image, is improved.
TABLE 3 comparison of load capacities of He et al method and the present invention after encryption
Figure GDA0003553819110000083
The above description is only an embodiment of the present invention, and not intended to limit the scope of the present invention, and all equivalent changes made by using the contents of the present specification and the drawings, or applied directly or indirectly to the related technical fields, are included in the scope of the present invention.

Claims (3)

1. A JPEG image information hiding method is characterized by comprising the following steps:
s1, acquiring all ZRV value pairs and absolute values of corresponding AC coefficients in the JPEG image, wherein the ZRV is in a zero-run/value pair form;
s2, selecting effective ZRV value pairs from all the ZRV value pairs according to a preset rule and the absolute value of an AC coefficient;
s3, hiding the information of the JPEG image according to the effective ZRV value to obtain a hidden JPEG image;
step S1 includes:
s11, acquiring a JPEG image, and analyzing all MCUs from the bit stream of the JPEG image;
s12, decoding all ZRV value pairs and corresponding AC coefficients from each MCU in sequence, generating the absolute value of the AC coefficients through the AC coefficients, and recording all ZRV values in the first MCU as
Figure FDA0003553819100000011
Wherein the content of the first and second substances,
Figure FDA0003553819100000012
denoted as the kth ZRV value pair for the lth MCU,
Figure FDA0003553819100000013
the coefficients representing the k-th ZRV,
Figure FDA0003553819100000014
representing coefficients
Figure FDA0003553819100000015
The number of the first continuous zero coefficients, l, is in the value range of [1, M]M represents the total number of all MCUs;
step S2 includes:
s21, calculating according to all ZRV value pairs in the I MCU
Figure FDA0003553819100000016
And judging whether N is greater than 2, if yes, executing step S22;
s22, selecting N ZRV value pairs from all ZRV value pairs in the I MCU to form a temporary ZRV value pair sequence of the I MCU, wherein the temporary ZRV value pair sequence comprises a 1 st ZRV value pair
Figure FDA0003553819100000017
K thl-N +1 ZRV value pairs
Figure FDA0003553819100000018
To Kl-1 ZRV value pairs
Figure FDA0003553819100000019
S23, judging whether the temporary ZRV value pair sequence meets a preset condition, and if so, selecting the temporary ZRV value pair sequence as an effective ZRV value pair sequence in the l MCU;
the specific step of judging whether the sequence of the temporary ZRV value pair meets the preset condition is as follows:
judgment of
Figure FDA00035538191000000110
Absolute value of AC coefficient of
Figure FDA00035538191000000111
Whether greater than 1;
judgment of
Figure FDA00035538191000000112
Whether it is the maximum of the absolute values of all AC coefficients in the sequence of the temporary ZRV values and the value
Figure FDA00035538191000000113
Whether it is unique;
if it is
Figure FDA0003553819100000021
Greater than 1 and said
Figure FDA0003553819100000022
Is the maximum of the absolute values of all the AC coefficients in the sequence of the temporary ZRV value, and is unique, then it is satisfied, otherwise, it is not satisfied;
step S3:
s31, constructing a mapping relation between the ZRV state and the secret information according to the effective ZRV value;
and S32, hiding the information of the JPEG image according to the mapping relation to obtain a hidden JPEG image.
2. The method for hiding JPEG image information according to claim 1, wherein the step S31 specifically includes:
and constructing a ZRV state-secret information mapping relation according to the effective ZRV value pair sequence in the l MCU.
3. The method for hiding JPEG image information according to claim 2, characterized in that step S32 includes:
s321: rotating the effective ZRV value pair sequence in the l MCU according to the mapping relation to obtain a ZRV value pair sequence hiding secret information in the l MCU;
s322: replacing the temporary ZRV value sequence of the first MCU according to the ZRV value sequence hiding the secret information in the first MCU to obtain a recombined first MCU;
s323: circulating all the MCUs to obtain the recombined MCUs corresponding to all the MCUs;
s324: and respectively carrying out entropy coding on all the recombined MCUs to obtain a hidden JPEG image.
CN201911230800.1A 2019-12-05 2019-12-05 JPEG image information hiding method Active CN110942414B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201911230800.1A CN110942414B (en) 2019-12-05 2019-12-05 JPEG image information hiding method

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201911230800.1A CN110942414B (en) 2019-12-05 2019-12-05 JPEG image information hiding method

Publications (2)

Publication Number Publication Date
CN110942414A CN110942414A (en) 2020-03-31
CN110942414B true CN110942414B (en) 2022-05-03

Family

ID=69909668

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201911230800.1A Active CN110942414B (en) 2019-12-05 2019-12-05 JPEG image information hiding method

Country Status (1)

Country Link
CN (1) CN110942414B (en)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112308756B (en) * 2020-10-30 2023-08-29 中山大学 Reversible information hiding method for encrypted JPEG image

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106530203A (en) * 2016-10-28 2017-03-22 武汉大学 Texture complexity-based JPEG image adaptive steganography method
CN109151486A (en) * 2018-09-06 2019-01-04 西南交通大学 The jpeg image bit stream encrypted domain reversible data concealing method of large capacity

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107040787B (en) * 2017-03-30 2019-08-02 宁波大学 A kind of 3D-HEVC inter-frame information hidden method of view-based access control model perception

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106530203A (en) * 2016-10-28 2017-03-22 武汉大学 Texture complexity-based JPEG image adaptive steganography method
CN109151486A (en) * 2018-09-06 2019-01-04 西南交通大学 The jpeg image bit stream encrypted domain reversible data concealing method of large capacity

Non-Patent Citations (3)

* Cited by examiner, † Cited by third party
Title
"A Novel High-Capacity Reversible Data Hiding Scheme for Encrypted JPEG Bitstreams";Junhui He，Junxi Chen，Weiqi Luo，Shaohua Tang，Jiwu Huang;《IEEE Transactions on Circuits and Systems for Video Technology 》;20181122;全文 *
"基于2_k修正和Canny边缘检测的图像隐写";孙树亮，郭永宁;《图学学报》;20150228;全文 *
"面向社交网络的图片信息隐藏";熊金波，马蓉，张媛媛，戴睿煜;《信息网络安全》;20170331;全文 *

Also Published As

Publication number Publication date
CN110942414A (en) 2020-03-31

Similar Documents

Publication Publication Date Title
US9946723B2 (en) Data embedding in run length encoded streams
US20190200025A1 (en) Coded-block-flag coding and derivation
US6606393B1 (en) Message authentication code using image histograms
RU2503138C2 (en) Embedded graphics coding for images with sparse histograms
US8509310B2 (en) Method, medium, and system encoding and/or decoding an image
US11049283B2 (en) Lossless compression of fragmented image data
JP5399416B2 (en) Video coding system with reference frame compression
Chang et al. Lossless recovery of a VQ index table with embedded secret data
CN106023053B (en) High capacity file encryption steganography and extracting method based on jpeg image
CN100493185C (en) Method and device for modifying source material
Wang et al. A novel high-performance reversible data hiding scheme using SMVQ and improved locally adaptive coding method
WO2009041843A1 (en) Method of encoding digital signals (variants), method of decoding digital signals (variants), device for implementation thereof (variants), and system for image transmission via limited throughput communication channels (variants)
Jangid et al. High PSNR based video steganography by MLC (multi-level clustering) algorithm
CN110942414B (en) JPEG image information hiding method
US6665420B1 (en) Message authentication code with improved error tolerance
Fu et al. Adaptive embedding combining LBE and IBBE for high-capacity reversible data hiding in encrypted images
US7372963B2 (en) Device for compression and encryption, and device for decompression and decryption
Singh et al. A Review on Latest Techniques of Image Compression
WO2011046681A2 (en) Joint scalar embedded graphics coding for color images
Chai et al. TPE-ADE: Thumbnail-Preserving Encryption Based on Adaptive Deviation Embedding for JPEG Images
CN108683921B (en) Video reversible information hiding method based on zero quantization DCT coefficient group
Qin et al. Reversible data embedding for vector quantization compressed images using search‐order coding and index parity matching
Chandra et al. LOSS LESS COMPRESSION OF IMAGES USING BINARY PLANE, DIFFERENCE AND HUFFMAN CODING (BDH TECHNIQUE).
Chen et al. Reversible watermarking in JPEG images based on modified RZL codes and histogram shift
CN111432217B (en) Information hiding embedding and extracting method based on two-dimensional histogram translation

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