A new algorithm of gray-image watermark based on bit-plane compression coding

A random serial string was used as the watermark in many watermark algorithms in general. We propose an algorithm with more visibility: use gray-level image as the watermark to embed into original image. It process the gray-level image with bit-plane encoding, and only intercept bit values of the higher as watermark data to embed into image. So it can obtain the purpose of compressing watermark data. At the same time, it propose that in order to reduce the vision breaking of original image, we can merely modify the wavelet coefficient only when whose corresponding bit of watermark data is '1', when embedding the watermark in wavelet domain. Since it embedded the watermark into significant coefficients, the robustness and invisibility of watermark can be balanced. The emulational experiment has verified that this algorithm can resist many generally attack.