DocumentCode
1940385
Title
Histogram-Preserving Steganography Using Maximum Flow Algorithms
Author
Wanqi Li ; Che Nian ; Ren Jinlin ; You Hongyue
Author_Institution
Comput. Sci. & Eng. Dept., Sichuan Univ., Penshan, China
fYear
2011
fDate
5-7 Aug. 2011
Firstpage
590
Lastpage
593
Abstract
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.
Keywords
linear programming; statistical analysis; steganography; histogram-preserving steganography; linear programming problem; maximum flow algorithms; relative entropy; statistical restoration; stego images; Entropy; Gray-scale; Histograms; Image color analysis; Image restoration; Linear programming; Security; Linear programming; histogram-preserving; maximum flows; statistical restoration; steganography;
fLanguage
English
Publisher
ieee
Conference_Titel
Digital Manufacturing and Automation (ICDMA), 2011 Second International Conference on
Conference_Location
Zhangjiajie, Hunan
Print_ISBN
978-1-4577-0755-1
Electronic_ISBN
978-0-7695-4455-7
Type
conf
DOI
10.1109/ICDMA.2011.147
Filename
6051916
Link To Document