Application of Complexity Measure to Reversible Information Hiding

This paper proposes a technique for reversible information hiding which uses binary image processing based on the complexity measure. Using the complexity measure, we can classify blocks on bit-planes of cover images into three groups: L (Left) group, R (Right) group and M (Middle) group. By assigning a 0 to L and a 1 to R, and then scanning all blocks of the image, the status of the image is obtained as a bit sequence. Not only the additional information but also the compressed bit sequence is embedded to recover the original one. We can embed one message bit in each L and R group. To obtain a match of a bit from message and the group type of blocks, we apply to the logical operation called conjugate operation which is able to flip each group and completely recover original one. In the extraction procedure, the embedded information is easily extracted by scanning L and R blocks. From the bit-stream, we can recover the status of original image. Therefore, we can obtain the original image by applying conjugate operation so as to match group types and the status of the original image.