DocumentCode :
2461568
Title :
Employing Optimal Matrix for Efficient Matrix Embedding
Author :
Gao, Yunkai ; Li, Xiaolong ; Yang, Bin
Author_Institution :
Inst. of Comput. Sci. & Technol., Peking Univ., Beijing, China
fYear :
2009
fDate :
12-14 Sept. 2009
Firstpage :
161
Lastpage :
165
Abstract :
Embedding efficiency is a metric of steganographic security. Higher embedding efficiency is usually desired to get more secure steganography. Matrix embedding is proved an effective way to increase embedding efficiency of steganography, and meanwhile the choice of matrix plays a key role in matrix embedding. Different matrix (with the same dimension) usually results in different embedding efficiency. Therefore, it is meaningful to determine the matrix which can provide highest embedding efficiency at fixed dimension. Such a matrix is called an "optimal matrix". In this paper, some primary results about optimal matrix are given. In addition, a greedy algorithm for determining approximatively optimal matrix is also presented.
Keywords :
greedy algorithms; matrix algebra; steganography; approximative optimal matrix; greedy algorithm; information hiding; matrix embedding efficiency; steganographic security; Art; Computer science; Computer security; Data mining; Data security; Greedy algorithms; Information security; Phase change materials; Signal processing; Steganography; embedding efficiency; information hiding; matrix embedding; steganography;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Intelligent Information Hiding and Multimedia Signal Processing, 2009. IIH-MSP '09. Fifth International Conference on
Conference_Location :
Kyoto
Print_ISBN :
978-1-4244-4717-6
Electronic_ISBN :
978-0-7695-3762-7
Type :
conf
DOI :
10.1109/IIH-MSP.2009.59
Filename :
5337333
Link To Document :
بازگشت