Image Hiding by Simple Module Substitution

Abstract

A simple, eflective data hiding method based on module substitution is proposed. A variet?, of confidential bits are embedded to each block in accordance with the base-value of the block. In addition, two fine-labeling procedures are employed in the proposed method to further alleviate the quantized error during data embedment. Simulations show that bothPSNR and hiding rate generated by the proposed method are better than those generated bv the reported methods. Since the perceived quality of the resulting mixed images is good, the hackers are hardlv noticed the existence of the secret message.the capability of recovering the original host media after the secret bits being successfully extracted. In this paper, we propose a simple data hiding method based on module substitution. More specifically, the secret bits to be embedded in a block are determined by the base-value (BV) of the block. The BV bk of a block is computed by b -max qkj -min qkj + 1, where -~~j~n x n -1 os j~n x n -1 {qk. } (rxn)-I J J=O denotes the kth n x n block of a host image and qkj represents for the jth pixel value in the kth block.