Lossless data hiding in JPEG bitstream using alternative embedding

Qiu, Yingqiang; He, Han; Qian, Zhenxing; Li, Sheng; Zhang, Xinpeng

doi:10.1016/j.jvcir.2018.02.005

Cited by 33 publications

(21 citation statements)

References 26 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Experimental results are shown in Table 8, [insert Table 8] In Table 8, compared with papers [30] [33], this approach outperforms them in EC. In [30], an alternative data hiding algorithm was proposed that in each category the maximum hiding capacity could be obtained. In category C i with i bits, mapping efficiency was improved greatly that an used VLC was mapped to a specific unused VLC.…”

Section: Resultsmentioning

confidence: 99%

“…Qian and Zhang [28] proposed the mapping algorithm to relate used VLCs to unused VLCs, and modified the Huffman Table in JPEG header. Hu [29] improved the algorithm of Qian and Zhang [28] to calculate occurrence frequencies in used VLCs and map VLCs according to frequencies, thus further improved hiding capacity. Qiu [30] constructed an optimal mapping between used and unused VLCs in each category to achieve a high embedding rate, while it was quite complex. Chang [33] proposed a scheme that in framework of reserving-room-before-encryption by Ma [34], a part of JPEG bitstreams was compressed and encrypted to leave spare space to embed secret data.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Lossless data hiding in JPEG images with segment coding

Zhang

Zhou

2019

J. Electron. Imag.

View full text Add to dashboard Cite

In this paper, we propose a lossless data hiding scheme in JPEG images. After quantified DCT transform, coefficients have characteristics that distribution in high frequencies is relatively sparse and absolute values are small. To improve encoding efficiency, we put forward an encoding algorithm that searches for a high frequency as terminate point and recode the coefficients above, so spare space is reserved to embed secret data and appended data with no file expansion. Receiver can obtain terminate point through data analysis, extract additional data and recover original JPEG images lossless. Experimental results show that the proposed method has a larger capacity than state-of-the-art works.

show abstract

Section: Resultsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Lossless data hiding in JPEG images with segment coding

Zhang

Zhou

2019

J. Electron. Imag.

View full text Add to dashboard Cite

show abstract

“…For the advantages of low complexity and high efficiency, Joint Photographic Experts Group (JPEG) is used as a major image compression technique [15] [16]. Four kinds of RDH methods are established independently in JPEG images, VLC mapping [17][18][19][20], quantified DCT coefficients modification [21][22][23][24][25] and concealment in encrypted JPEG bitstreams [26] [27].…”

Section: Introductionmentioning

confidence: 99%

“…In the improved method, mapping is sorted in occurrence frequencies, so in a category the most used VLC is mapped to several unused VLCs, while others are mapped to only one unused VLC. Qiu et al [20] proposed a RDH scheme in JPEG images, and established an alternative embedding algorithm using code mapping and reordering. In such method, different combination of unused VLCs and used VLCs remapping will increase hiding capacity, but marked images can be recovered only after secret data is fully extracted.…”

Section: Introductionmentioning

confidence: 99%

A reversible data hiding scheme in JPEG bitstreams using DCT coefficients truncation

2020

KSII TIIS

View full text Add to dashboard Cite

A reversible data hiding scheme in JPEG compressed bitstreams is proposed, which could avoid decoding failure and file expansion by means of removing of bitstreams corresponding to high frequency coefficients and embedding of secret data in file header as comment part. We decode original JPEG images to quantified 8×8 DCT blocks, and search for a high frequency as an optimal termination point, beyond which the coefficients are set to zero. These blocks are separated into two parts so that termination point in the latter part is slightly smaller to make the whole blocks available in substitution. Then spare space is reserved to insert secret data after comment marker so that data extraction is independent of recovery in receiver. Marked images can be displayed normally such that it is difficult to distinguish deviation by human eyes. Termination point is adaptive for variation in secret size. A secret size below 500 bits produces a negligible distortion and a PSNR of approximately 50 dB, while PSNR is also mostly larger than 30 dB for a secret size up to 25000 bits. The experimental results show that the proposed technique exhibits significant advantages in computational complexity and preservation of file size for small hiding capacity, compared to previous methods. .

show abstract

“…The cryptography deals with techniques that change the original secret message into another form of data to make it incomprehensible to unauthorized users [12,13]. The steganography hides the data of a secret message into cover media to prevent drawing any suspicion to the secret data [14,15]. In the literature, there are many researches in the cryptography field.…”

Section: Introductionmentioning

confidence: 99%

A New and Adaptive Security Model for Public Communication Based on Correlation of Data Frames

et al. 2019

View full text Add to dashboard Cite

Recent developments in communication and information technologies, plus the emerging of the Internet of Things (IoT) and machine to machine (M2M) principles, create the need to protect data from multiple types of attacks. In this paper, a secure and high capacity data communication model is proposed to protect the transmitted data based on identical frames between a secret and cover data. In this model, the cover data does not convey any embedded data (as in normal steganography system) or modify the secret message (as in traditional cryptography techniques). Alternatively, the proposed model sends the positions of the cover frames that are identical with the secret frames to the receiver side in order to recover the secret message. One of the significant advantages of the proposed model is the size of the secret key message which is considerably larger than the cover size, it may be even hundred times larger. Accordingly, the experimental results demonstrate a superior performance in terms of the capacity rate as compared to the traditional steganography techniques. Moreover, it has an advantage in terms of the required bandwidth to send the data or the required memory for saving when compared to the steganography methods, which need a bandwidth or memory up to 3-5 times of the original secret message. Where the length of the secret key (positions of the identical frames) that should be sent to the receiver increases by only 25% from the original secret message. This model is suitable for applications with a high level of security, high capacity rate and less bandwidth of communication or low storage devices.

show abstract

Lossless data hiding in JPEG bitstream using alternative embedding

Cited by 33 publications

References 26 publications

Lossless data hiding in JPEG images with segment coding

Lossless data hiding in JPEG images with segment coding

A reversible data hiding scheme in JPEG bitstreams using DCT coefficients truncation

A New and Adaptive Security Model for Public Communication Based on Correlation of Data Frames

Contact Info

Product

Resources

About