SECURE STEGANOGRAPHY BASED ON BINARY PARTICLE SWARM OPTIMIZATION  

作　　者：Guo Yanqing Kong Xiangwei You Xingang 

机构地区：[1]School of Electronic and Information Engineering Dalian University of Technology Dalian 116024 China [2]Beijing Institute of Electronic Technology and Application Beijing 100091 China

出　　处：《Journal of Electronics(China)》2009年第2期285-288,共4页电子科学学刊（英文版）

基　　金：Supported by the National Natural Science Foundation of China (No.60572111)

摘　　要：The objective of steganography is to hide message securely in cover objects for secret communication.How to design a secure steganographic algorithm is still major challenge in this re-search field.In this letter,developing secure steganography is formulated as solving a constrained IP(Integer Programming) problem,which takes the relative entropy of cover and stego distributions as the objective function.Furthermore,a novel method is introduced based on BPSO(Binary Particle Swarm Optimization) for achieving the optimal solution of this programming problem.Experimental results show that the proposed method can achieve excellent performance on preserving neighboring co-occurrence features for JPEG steganography.The objective of steganography is to hide message securely in cover objects for secret communication.How to design a secure steganographic algorithm is still major challenge in this re-search field.In this letter,developing secure steganography is formulated as solving a constrained IP（Integer Programming） problem,which takes the relative entropy of cover and stego distributions as the objective function.Furthermore,a novel method is introduced based on BPSO（Binary Particle Swarm Optimization） for achieving the optimal solution of this programming problem.Experimental results show that the proposed method can achieve excellent performance on preserving neighboring co-occurrence features for JPEG steganography.

关 键 词：Secure steganography Integer Programming（IP） Binary Particle Swarm Optimization（BPSO） 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]