Data hiding using adaptive embedding in two dimensional histogram approach

Two dimensional histogram scheme has been found to be very important for data hiding. A sequence consisting of difference values between pixel pair and a sequence consisting of prediction error is computed and histogram is made. Differential pair mapping is used to hide the secret data in the cover image. One most important characteristic of proposed hiding scheme is to use adaptive embedding means hiding two bits together in one pixel pair. One major drawback of two dimensional histogram scheme is that only one bit can be hidden in one pixel pair but proposed scheme offers high hiding capacity and good marked image quality. Another advantage of proposed scheme is that no location map is required for this scheme hence overhead information reduces.