An entropy based technique for information embedding in images

Many information hiding techniques have recently been analyzed as they could help manage part of the digital rights. Among the general framework of information hiding, the focus has been put on steganography and on watermarking techniques. This paper proposes an entropy based technique for data embedding in images with a specific target, sometimes referred to as feature location: inclusion of a maximum amount of information instead of robustness against attacks. After an introduction, we analyze the error that results from a modification of the least significant bits. Then we describe our embedding technique. Finally we examine the upper bound of information that can be embedded in the least significant bits by means of our technique and we conclude.