No. Techniques 1 LSB Hiding data in images Good hidden Worst MSE Substitution by simple LSB capacity and low between the substitution and complexity stego-image applying an optimal and cover- pixel Adjustment image is derived 2 Pixel value Data gets hide based This method Visibility of Differencing upon difference hides large data the hiding between the two with the help of effect consecutive pixels in LSB substitution present in cover image at edge area of the PVD image method 3 Matrix Each pattern bit is Provides high Suffers Embedding matched with message security from low bit, if satisfied it hidden modifies the LSB bits capacity by data bits 4 Exploiting At most, only one Provides Stable It does not Modification pixel is increased or and convenient work Direction decreased by 1 to security properly on embed in (2p+1) high notational system payload 5 Double Based on greyscale This achieves the Does not Layered value of pixel upper bound on give better Plus-Minus adding/subtracting one the embedding result on One Data to/from the image is efficiency low quality Embedding done to hide data images Scheme 6 RGB It chooses one colour Almost Same Hidden Intensity channel among red, histogram of capacity Based green and blue and stego-image depended Variable-Bits embeds data into against cover on cover Image variable LSB of image image pixel Steganograph chosen channel intensities y 7 Texture It divides the texture Provides high High hidden Based Image areas into two groups, hidden capacity capacity Steganograph simple and complex degrade the y and these are used to visual hide the information quality PSNR 8 Bit Depth RGB images are Provides lossless, Not Embedding transformed to YCrCb reversible data supported to for colour space, and hiding scheme for Gray and JPEG2000 then, wavelet binary images Color image transform, as well as quantization and suffers from entropy coding are alteration performed to extract detection LSB then hides the secret data 9 Data Hiding Diamond Provides high It suffers Scheme with characteristic value of quality stego- from higher Diamond each non-overlapping image and distortion Encoding block of two conceals large for various consecutive pixels is amount of data payload as calculated and which well as it is used to concealed does not message digit. provide more compact Neighborho od Set. 10 LSB It divides the image Provides Integrity It hides Modification pixels ranging 0-255 of secret hidden extra bits of Based on and generates a information with with hidden Private private stego-key High Capacity message Stego-Keys based on 5 different gray level ranges of image. 11 Reversible Divides the image in This method It Data smooth and complex provides better introduces Embedding regions then more data image quality and little using is embedded in embedding distortion in Interpolation complex region than capacity and smooth and simple one PSNR. regions Reference Pixel Distribution Mechanism PROBLEM DEFINITION The steganography technique has certain weakness are as shown in table. Steganography Weakness Technique Substitution Systems Low robustness, filtering, lossy compression attacks, format file dependent. Transform domain An attacker can simply apply signal processing Technique techniques in order to destroy the secret information. In many cases even the small changes resulting out of loose compression system yield total information loss. Spread Spectrum (SS) Increase in complexity, higher costs and more Technique stringent timing a) Direct Spread Spectrum: To produce the spectrum is complex, it requires a large bandwidth channel and requires long acquisition time since PN codes are long b) Frequency Hopping Scheme: Weakness with both fast and slow hopping. In Slow hopping, data can be lost if single frequency hop channel is jammed. In fast hopping, due to phase discontinuities, coherent data detection is not possible. Distortion Technique It can reconstruct secret message entirely by attacker when embedding and encoding functions are public and do not depend on stego-key. Cover Generation They have heavy and complexity process for Technique algorithm comparison with other techniques. This is due to delay time for finished (hiding or extract) process operation.
To overcome the above weakness, the proposed system uses interpolation
technique. The interpolation technique provides the advantages of both low-time complexity and high computing speed. Experiments indicated that this method can embed a large amount of bits into the host image while still keeping distortion low.