Novel Multi-bit Bitwise Adaptive Embedding Algorithms with Minimum Error for Data Hiding

Abstract

This paper presents the novel multi-bit bitwise adaptive embedding algorithms for data hiding. These embedding algorithms can embed multi-bit (k-bit, k>=1 ) secret data into cover data only introduce minimum embedding error smaller than (2^(k-1)-1)*2^(i-k) according to the embedding location i. To achieve such a goal, the proposed embedding algorithm adaptively evaluates the most similar value to replace the original one and which can be divided into three steps: (1) embed logo data into cover data, (2) adaptively adjust the least-significant bits (LSBs) of cover data, and (3) adaptively adjust the maximum-significant bits (MSBs) of cover data. The proposed embedding algorithms are not only achieving minimum error but also suitable to hardware implementation due to it is based on logic, algebraic, and bit operations. Many simulations show that the proposed embedding algorithms perform good embedding quality for watermarking and steganography applications.