Image Hiding Based on Compressive Autoencoders and Normalizing Flow

Image hiding aims to hide the secret data in the cover image for secure transmission. Recently, with the development of deep learning, some deep learning-based image hiding methods were proposed. However, most of them do not achieve outstanding hiding performance yet. To address this issue, we propo...

Full description

Saved in:
Bibliographic Details
Published inIEEE signal processing letters Vol. 31; pp. 2810 - 2814
Main Authors Chen, Liang, Zhang, Xianquan, Yu, Chunqiang, Tang, Zhenjun
Format Journal Article
LanguageEnglish
Published New York IEEE 2024
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects
Online AccessGet full text

Cover

Loading…
More Information
Summary:Image hiding aims to hide the secret data in the cover image for secure transmission. Recently, with the development of deep learning, some deep learning-based image hiding methods were proposed. However, most of them do not achieve outstanding hiding performance yet. To address this issue, we propose a new image hiding framework called CAE-NF, which consists of compressive autoencoders (CAE) and normalizing flow (NF). Specifically, CAE's encoder respectively maps the secret image and cover image into the corresponding feature vectors. Image hiding and recovery can be modelled as the forward and backward processes of NF since NF is an invertible neural network. NF maps two feature vectors to a stego-image by its forward process. On the recovery side, the stego-images are mapped to two feature vectors by NF's backward process. Finally, the secret image is recovered by CAE's decoder. The proposed framework can achieve a good trade-off between the stego-image quality and recovered secret image quality, and meanwhile, improve the hiding and recovery performances. The experimental results demonstrate that the proposed framework significantly outperforms some state-of-the-art methods in terms of invisibility, security, and recovery accuracy on various datasets.
ISSN:1070-9908
1558-2361
DOI:10.1109/LSP.2024.3465350