Reversible Data Hiding in JPEG Images Using Quantized DC

Kim, Suah; Huang, Fangjun; Kim, Hyoung Joong

doi:10.3390/e21090835

Cited by 10 publications

(6 citation statements)

References 61 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Fig. 2 in JPEG encoder block depicts the essential phases of the JPEG compression process [22,30,31,39,40]. It is one such application of grayscale picture compression.…”

Section: Jpeg Compression Processmentioning

confidence: 99%

“…There have been two interesting information security schemes proposed: one based on the International Journal of Intelligent Engineering and Systems, Vol. 16 watermarking scheme in DCT transform domain [8,16,17,21] and the other on reversible data hiding (RDH) scheme [24][25][26][27][28][29][30][31]. Both show the same correlation regarding JPEG images [32], It was among the first and most extensively used digital image formats in everyday life [32].…”

Section: Introductionmentioning

confidence: 99%

“…Three main strategies of RDH images in JPEG format have been explored. They are RDHs based on fiddling with quantization tables [35], experimenting with Huffman codes [36], and experimenting with quantized DCT coefficients [30]. The three reversible data hiding algorithms have each been successful in achieving various performances due to their unique properties.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

A Block-Based Image Characteristics Robust Watermarking with Optimal Embeddable AC Coefficient

2023

IJIES

View full text Add to dashboard Cite

Due to extensive Internet usage, digital media can be quickly altered, copied, and distributed via information networks. As a result, digital information's illicit reproduction became a serious issue. As a means of copyright protection for digital media, digital watermarking has been demonstrated to be effective. Based on a discrete cosine transform (DCT), an improved robust watermarking technique considering image characteristics, a 1-D linear transformation, and an optimal embeddable AC coefficient is proposed in this paper. The host image is first divided into 8 x 8 non-overlapping block and block selection for DCT transformation is performed. The variance in each block is used to identify the embedding watermark location. A linear map is used to scramble the watermark image, which is embedded into the AC coefficients which has a maximum difference between embeddable and non-embeddable non-zero AC coefficients. Experiment results show that the suggested approach can withstand a range of a nonmalicious attack with very satisfactory results for BER close to 0, and NC near to 1.

show abstract

“…Fig. 2 in JPEG encoder block depicts the essential phases of the JPEG compression process [22,30,31,39,40]. It is one such application of grayscale picture compression.…”

Section: Jpeg Compression Processmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

A Block-Based Image Characteristics Robust Watermarking with Optimal Embeddable AC Coefficient

2023

IJIES

View full text Add to dashboard Cite

show abstract

“…Evolutionary algorithms for optimizing secret bit substitution orders to reduce the number of modified pixels in a cover image are used in several approaches such as particle swarm optimization in [159], GA in [160,161], cohort intelligence and multi random start local search in [162,163]. The works in [164,165] algorithms in the DCT domain is proposed in [166,167].…”

Section: Transform Domainmentioning

confidence: 99%

LSB Data Hiding in Digital Media: A Survey

Tran¹,

Zepernick²,

Chu³

2022

EAI Endorsed Transactions on Industrial Networks and Intelligen

View full text Add to dashboard Cite

Data hiding or information hiding is a prominent class of information security that aims at reliably conveying secret data embedded in a cover object over a covert channel. Digital media such as audio, image, video, and three-dimensional (3D) media can act as cover objects to carry such secret data. Digital media security has acquired tremendous significance in recent years and will be even more important with the development and delivery of new digital media over digital communication networks. In particular, least significant bit (LSB) data hiding is easy to implement and to combine with other hiding techniques, offers high embedding capacity for data, can resist steganalysis and several types of attacks, and is well suited for real-time applications. This article provides a comprehensive survey on LSB data hiding in digital media. The fundamental concepts and terminologies used in data hiding are reviewed along with a general data hiding model. The five attributes of data hiding, i.e., capacity, imperceptibility, robustness, detectability, and security, and the related performance metrics used in this survey to compare the characteristics of the different LSB data hiding methods are discussed. Given the classification of data hiding methods with respect to audio, image, video, and 3D media, a comprehensive survey of LSB data hiding for each of these four digital media is provided. In particular, landmark studies, state-of-the-art approaches, and applications of LSB data hiding are described for each of the four digital media. Their performance is compared with respect to the data hiding attributes which illustrates benefits and drawbacks of the reviewed LSB data hiding methods. The article concludes with summarizing main findings and suggesting directions for future research. This survey will be helpful for researchers and practitioners to keep abreast about the potential of LSB data hiding in digital media and to develop novel applications based on suitable performance trade-offs between data hiding attributes.

show abstract

“…As used in the work of Huang et al [24] which choose coefficient +1 and -1 in each block as an embedding field. An illustration using the Lena image of 512 x 512, we can see the histogram for all the quantized dc and ac coefficients of the Lena image with quality factor 80 at figures 2a and 2b.…”

Section: Robust Watermark Embeddingmentioning

confidence: 99%

Blind Robust and Self-Embedding Fragile Image Watermarking for Image Authentication and Copyright Protection with Recovery Capability

Rakhmawati¹,

Suwadi²,

Wirawan³

2020

IJIES

View full text Add to dashboard Cite

This paper proposes a dual watermarking scheme that can integrate the functions of authentication, copyright protection, and image recovery in the same cover image. The robust watermarking utilizes a single watermark using the discrete cosine transform (DCT) domain for copyright protection, while the fragile scheme utilizes two self-embedding watermarks in a spatial domain for authenticating and restoring digital image content. The mechanism of the two schemes is carried out sequentially and uses a block-based approach. A new blind robust watermarking is proposed using a quantitative property of intermediate frequency coefficient for embedding and adaptive embedding strength selection to balance transparency and robustness. Fragile watermarks are inserted into a robust watermarked image based on the improved replacement approach of the least significant bits. Experimental results show that the proposed method can withstand various processing attacks; enhance the accuracy of deceptive localization with good visual quality of image recovery.

show abstract

Reversible Data Hiding in JPEG Images Using Quantized DC

Cited by 10 publications

References 61 publications

A Block-Based Image Characteristics Robust Watermarking with Optimal Embeddable AC Coefficient

A Block-Based Image Characteristics Robust Watermarking with Optimal Embeddable AC Coefficient

LSB Data Hiding in Digital Media: A Survey

Blind Robust and Self-Embedding Fragile Image Watermarking for Image Authentication and Copyright Protection with Recovery Capability

Contact Info

Product

Resources

About