Improving Various Reversible Data Hiding Schemes Via Optimal Codes for Binary Covers

ABSTRACT
Since several years, the protection of multimedia data is becoming very important. The protection of this multimedia data can be done with encryption or data hiding algorithms. A few solutions have been proposed to combine image encryption and compression for example. Nowadays, a new challenge consists to embed data in encrypted images. Since the entropy of encrypted image is maximal, the embedding step, considered like noise, is not possible by using standard data hiding algorithms. A new idea is to apply reversible data hiding algorithms on videos by wishing to remove the embedded data without distortion. DATA HIDING is a technique for embedding information into covers such as image, audio, and video files, which can be used for media notation, copyright protection, integrity authentication, covert communication, etc. Most data hiding methods embed messages into the cover media to generate the marked media by only modifying the least significant part of the cover and, thus, ensure perceptual transparency. Recent reversible data hiding methods have been proposed with high capacity, but these methods are not applicable on encrypted images. In reversible data hiding (RDH), the original cover can be losslessly restored after the embedded information is extracted. Reversible data hiding allows, in addition, recovering the original cover-file exactly.

Existing System:
In previous work proposes a novel reversible data hiding scheme for encrypted image. After encrypting the entire data of an uncompressed image by a stream cipher, the additional data can be embedded into the image by modifying a small proportion of encrypted data. With an encrypted image containing additional data, one may rstly decrypt it using the encryption key, and the

decrypted version is similar to the original image. According to the data-hiding key, with the aid of spatial correlation in natural image. The images are compressed and the datas are hided in the compressed image. The quality and the value of the pixels change due to data hide in the image. Due to the change in the originality the images can be easily identified by the hackers. In this proposed system we are using video files to solve this error.

Disadvantage:
In this existing system the cover file (image) compressed and then the data is hiding behind the compressed image, it will change the originality of the image. The interpolation error is high, thus it leads to low capacity. The distortion of image is higher. The existing system is cost expensive. The existing system has very low embedding capacity.

Proposed System:
The proposed binary codes, we improve three RDH schemes that use binary feature sequence as covers, i.e., an a) RS(Recursive Construction) scheme for spatial images, b) one scheme for JPEG images, and a c) Pattern substitution scheme for binary images.

Novel codes can significantly reduce the embedding distortion.

 Reversible Data hiding methods embed messages into the cover media to generate the marked

media by only modifying the least significant part of the cover and, thus, ensure perceptual transparency. In the proposed scheme, Using LSB-steganalytic methods, the hidden data can be embedded and it will change into image format (icon).

It is not viable to extract the additional data and recover the original. For ensuring the correct

data-extraction and the system may let the block side length. Introduce error correction mechanism before data hiding to protect the additional data with a cost of payload reduction.

Hardware Requirements

SYSTEM HARD DISK FLOPPY DRIVE MONITOR MOUSE RAM KEYBOARD

: Pentium IV 2.4 GHz : 40 GB : 1.44 MB : 15 VGA colour : Logitech. : 256 MB : 110 keys enhanced.

Software Requirements

OPERATING SYSTEM FRAMEWORK FRONT END CODING LANGUAGE BACK END

: Windows XP Professional. : Microsoft Visual Studio .Net 2008. : C#.net 2.0. : C#.net 2008. : Sql Server 2000.