Minimizing the Embedding Impact Using Network Flow Algorithms
A novel method of minimizing the embedding impact is proposed in this paper.Optimal embedding is achieved using network flow algorithms by considering the modifications on the cover image as flows of pixels among different states.This method is not an independent steganographic scheme, but rather it minimizes the embedding impact after the embedding process and its compatible with the majority of embedding techniques.Due to its dependence on the embedding process, many optimization problems, such as the minimization of a globally interactive distortion function, that are intractable during the embedding process can be solved with relatively low computational cost by rectifying the modifications on the cover image after the embedding process.A distortion function based on Kullback-Leibler divergence is provided as a concrete example to illustrate the basic idea of this method.
steganography embedding impact network flows penalty function
Wanqi Li Wang Heng Che Nian Huang We You Hongyao
Computer Science and Engineering Department,Sichuan University Jinjiang College,Penshan 620860,China Computer Science and Engineering Department,Sichuan University Jinjiang College,Penshan 620860,China College of Computer Science,Sichuan University,Chengdu 610065,China
国际会议
厦门
英文
478-483
2011-07-08（万方平台首次上网日期，不代表论文的发表时间）