A Dual-Reward Guided 2D Mapping Generation Network for JPEG Reversible Data Hiding

View at publisher
Authors: Rui Yan, Yao Zhao, Shaowei Weng, Lifang Yu
Cited by: 1
References: 34

Abstract

Recently, researchers have shifted focus to reversible data hiding (RDH) schemes for JPEG images. The reinforcement learning (RL) is a solution for RDH to automatically acquire the optimal two-dimensional (2D) mapping for 2D histograms of non-zero quantized alternating current coefficients. However, merely utilizing the payload-distortion reward mechanism (PDRM) in RL cannot inject the payload guidance to the 2D mapping generation process. To tackle this issue, we propose a payload supplementary reward mechanism (PSRM) and incorporate PDRM and PSRM into RL to construct DR-2DNet, a dual-reward guided 2D mapping generation network with considering additional payload guidance. DR-2DNet generates two candidate 2D mappings, one with low distortion generated by merely utilizing PDRM and the other with low distortion and high payload obtained by jointly using PDRM and PSRM. Finally, according to the required payload, the one with the lower distortion selected from two acquired 2D mappings is used for achieving data embedding. To priorly select the frequency bands with low costs for data embedding, a frequency selection strategy combining the smoothness and embedding performance of the frequency band is designed to evaluate the cost of each frequency band, reducing image distortion and preserving the file size. Extensive experiments are conducted on the Kodak dataset and 100 images randomly chosen from the BOSSBase dataset, and the results demonstrate that the proposed method is superior to several related state-of-the-art RDH schemes for JPEG images.

Fields of Study & Subjects

Advanced Steganography and Watermarking Techniques Digital Media Forensic Detection Chaos-based Image/Signal Encryption

Publication details

Journal / source
IEEE Signal Processing Letters
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Volume
33
Pages
526–530
Publication date
1 January 2026