Quad-Tree Structure-Preserving Adaptive Steganography for HEVC

Modification of the optimal recursive block encoding process is commonly adopted in HEVC steganography based on block partitioning structure to embed secret messages, which inevitably disrupts the optimal rate distortion optimization process, resulting in a degradation of visual quality and an incre...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on multimedia 2024, Vol.26, p.8625-8638
Main Authors: Yang, Lin, Xu, Dawen, Qian, Jiangbo, Wang, Rangding
Format: Article
Language:English
Subjects:
Block Partitioning Structure
Costs
Distortion
Encoding
HEVC Steganography
Maintenance Principle of Quad-tree Structure
Rate-distortion
Security
Steganography
Visualization
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Modification of the optimal recursive block encoding process is commonly adopted in HEVC steganography based on block partitioning structure to embed secret messages, which inevitably disrupts the optimal rate distortion optimization process, resulting in a degradation of visual quality and an increase in bit rate. In this paper, we analyze the intra frame recursive block encoding process, categorizing modifications based on block partitioning structures into skip-level and non-skip-level modifications. Then, the rate distortion difference between these two types is compared. Additionally, the Maintenance Principle of Quad-tree Structure is introduced, which aims to preserve the stego quad-tree structure as closely as possible to the original one. Furthermore, a new cover mapping method is designed to expand the embedding capacity, and a quad-tree structure-preserving adaptive steganography is proposed. Extensive experimental results demonstrate that the proposed scheme can embed messages with fewer disruptions to the optimal rate distortion optimization process, ultimately improving the visual quality and reducing the bit rate growth.
ISSN:1520-9210
1941-0077
DOI:10.1109/TMM.2024.3380246