Histogram-Preserving Steganography Using Maximum Flow Algorithms

Histogram-Preserving Steganography Using Maximum Flow Algorithms

A novel scheme of histogram-preserving steganography is proposed in this article. In this new scheme, the problem of statistical restoration is interpreted as a Linear programming problem and solved using maximum flow algorithms. The experimental results show that our scheme can effectively diminish...

Full description

Saved in:
Bibliographic Details
Published in:2011 Second International Conference on Digital Manufacturing & Automation pp. 590 - 593
Main Authors: Wanqi Li, Che Nian, Ren Jinlin, You Hongyue
Format: Conference Proceeding
Language:English
Published: IEEE 01-08-2011
Subjects:
Entropy
Gray-scale
histogram-preserving
Histograms
Image color analysis
Image restoration
Linear programming
maximum flows
Security
statistical restoration
steganography
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:A novel scheme of histogram-preserving steganography is proposed in this article. In this new scheme, the problem of statistical restoration is interpreted as a Linear programming problem and solved using maximum flow algorithms. The experimental results show that our scheme can effectively diminish the relative entropy between the cover and stego images even when the information is embedded at the maximum rate.
ISBN:1457707551
9781457707551
DOI:10.1109/ICDMA.2011.147