The Research Of Information Hiding Based On Empirical Mode Decomposition

In the recent years, the research of hiding information has become a hot issue. The purpose of hiding information is to hide the fact that the information exists. As it means that the attacker doesn't know where the information exists. Superiority of hiding information to the traditional encryption technology is that the hiding information is able not to attract the attacker's notice, thereby reducing the probability of attack. Hiding information is mainly used in stealth communication, so it emphasized on hiding capacity and high transparency. In recent years, a large number of hiding information algorithms appear, although these algorithms incline to ripe and meanwhile there exists different degree of weakness. This thesis researches on the hiding information which held the image as the carrier and based on empirical mode decomposition algorithm. The basic of empirical mode decomposition algorithm which this thesis offers has the large hiding capacity and high transparency and it fully reflects the characteristics of hiding information. There are the specific processes: firstly to use the empirical mode decomposition algorithm to make a piece of index image separate; then to embed hidden information (encryption processing of hidden information) into the recombined image after separating; and then to extract original information from the carrier image which includes hidden information and to use the NCC and the PSNR algorithm to make objective evaluation; finally to attack the image which contains hidden information. The experimental result shows that this algorithm has better robustness and transparency than others. Through a large number of experiments, the algorithm which this thesis offers has more remarkably improved in the aspect of hiding capacity than the same algorithm.