Loading…
High Capacity Image Steganography Using Curvelet Transform and Bit Plane Slicing
In order to protect copyrighted material from illegal duplication, two typical technologies have been developed.Key-based cryptographic techniques and Steganography which enable the appropriate security during the transmission process. The science and art of hiding information in unremarkable cover...
Saved in:
Published in: | International journal of advanced research in computer science 2013-03, Vol.4 (4) |
---|---|
Main Authors: | , , |
Format: | Article |
Language: | English |
Subjects: | |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | In order to protect copyrighted material from illegal duplication, two typical technologies have been developed.Key-based cryptographic techniques and Steganography which enable the appropriate security during the transmission process. The science and art of hiding information in unremarkable cover media is steganography so as not to arose an eavesdropper's suspicion. Steganography is an application under information security field. Steganography is Classified by having set of measures that rely on strengths attacks that are driven by weaknesses and uncertainty. Now a days , computer and network technologies provide easy-to-use communication channels for steganography . The curvelet transform is a multiscale directional transform that allows an almost optimal non-adaptive sparse representation of the object with edges. Bit plane slicing technique is used for data compression where the original image is sliced in to 8 planes. Steam cipher RC4 algorithm is used for hiding the message. The effectiveness of the proposed methods has been estimated by computing Mean Square Error (MSE) and Peak Signal to Noise Ratio (PSNR). The aim to propose work is to make existence of image stegangoraphy technique based on curvelet transform provide acceptable levels of imperceptibility and distortion in the cover image and high level of overall security. |
---|---|
ISSN: | 0976-5697 |