DocumentCode :
1068990
Title :
Toward Optimal Embedding Capacity for Permutation Steganography
Author :
Huang, Nien-Ching ; Li, Meng-Tsan ; Wang, Chung-Ming
Author_Institution :
Dept. of Comput. Sci. & Eng., Nat. Chung Hsing Univ., Taichung, Taiwan
Volume :
16
Issue :
9
fYear :
2009
Firstpage :
802
Lastpage :
805
Abstract :
Bogomjakov proposed a universal algorithm for permutation steganography. In this paper, we introduce a more effective algorithm. A theoretical analysis indicates that our algorithm achieves 99% of optimal when using 128 elements, while Bogomjakov ´s method attains only 98.34% of optimal even when employing as many as 1,048,576 elements. We conducted an experiment using a 3-D polygon dataset for comparison. The analysis and practical experiments demonstrate that our algorithm attains a capacity closer to the optimal but has the same runtime complexity as Bogomjakov´s algorithm.
Keywords :
steganography; 3D polygon dataset; Bogomjakov method; optimal embedding capacity; permutation steganography; Data hiding; permutation; steganography;
fLanguage :
English
Journal_Title :
Signal Processing Letters, IEEE
Publisher :
ieee
ISSN :
1070-9908
Type :
jour
DOI :
10.1109/LSP.2009.2024794
Filename :
5071254
Link To Document :
بازگشت