Compression and Data Hiding System Based On SMVQ
Compression and Data Hiding System Based On SMVQ
NOVATEUR PUBLICATIONS
International Journal of Research Publications in Engineering and Technology [IJRPET]
ISSN: 2454-7875
VOLUME 3, ISSUE 4, April-2017
COMPRESSION AND DATA HIDING SYSTEM BASED ON SMVQ
MISS SAPATNEKAR APARNA A.
Department of Electronics and Telecommunication,V.V.P Institute of Engg & Technology, Solapur
University, Solapur, Ms, India. [email protected]
PROF MANTRI D. B.
Department of Electronics and Telecommunication,V.V.P Institute of Engg & Technology, Solapur
University, Solapur, Ms, India. [email protected]
ABSTRACT: this may give attacker on opportunity to intercept the
There are many digital multimedia compressed image so this two independent modules
transmissions on the network. Therefore to protect may cause lower efficiency in applications. In this system
the secret messages during transmission is an focus is on the high hiding capacity and recovery quality
important issue. For assurance of communication and also establishes joint data hiding and compression
efficiency and save network bandwidth compression into single module. This can avoid the risk of the attack
techniques can be implemented to reduce from interceptors and increase the implementation
redundancy and the quality of the decompressed efficiency.
versions should also be preserved. Here a novel W. C. Du Ni et.al. Proposed a reversible data
system is shown for compression and data hiding hiding based on adaptive compresses method. In this
using side match vector quantization (SMVQ). On the method the VQ codebook was separated into two or
sender side, except for the blocks in the leftmost and three sub codebooks and the best one of the sub
topmost of the image, each of the other residual codebooks was found out to conceal the bits. This
blocks in raster-scanning order can be embedded method increased the hiding capacity. Major drawback
with secret data and compressed simultaneously by of this method was more distortion of extraction stage
SMVQ. and recovered image. To overcome this problem side
KEYWORDS: Data hiding, Image compression, Side match vector quantization (SMVQ) is used in the
match vector quantization. proposed system.
I .INTRODUCTION: II. METHODOLOGY:
With the fastest development of internet First the image gets divided into 4x4 blocks,
technology people can easily transmit and share the where the top most and left most columns are
information with each other conveniently. Compression compulsorily compressed using vector quantization. The
techniques can be implemented on digital content to left over blocks are compressed using SMVQ and image
reduce redundancy and the quality of the decompressed inpainting according to the mean square error (MSE)
versions should also be preserved. Most digital content, value. If the compression is done using SMVQ or
especially digital images and videos are converted into inpainting then watermark bits are added to the block.
the compressed forms for transmission. Another For all the residual blocks, except those top most rows
important issue in an open network environment is how and leftmost column a mean square error (MSE) value or
to transmit secret or private data securely. Even though distortion value is calculated and this value is compared
traditional cryptographic methods can encrypt the with threshold value. If MSE is greater than the threshold
plaintext into the ciphertext the meaningless random value then block is directly compressed using vector
data of the ciphertext may also arouse the suspicion quantization index and if MSE is less than or equal to the
from the attacker. To solve this problem, information threshold value, then embedded watermark bit is
hiding techniques have been widely developed in both checked. If the embedded watermark bit is 0 then it is
academia and industry, which can embed secret data clear that block is compressed using SMVQ index and if
into the cover data imperceptibly. Due to the prevalence the embedded watermark bit is 1 then it can be said that
of digital images on the Internet, how to compress image inpainting is used for compression. Thus blocks in
images and hide secret data into the compressed images the image are compressed by adaptively using vector
efficiently deserves in-depth study. quantization, side match vector quantization or image
On the sender side we have to perform the inpainting.
image compression and data hiding process separately
20 | P a g e
NOVATEUR PUBLICATIONS
International Journal of Research Publications in Engineering and Technology [IJRPET]
ISSN: 2454-7875
VOLUME 3, ISSUE 4, April-2017
Algorithm of compression and secret data embedding 4. After decomposing the image to hide the data into
Step1: Read input image image by entering the password
Step2: Take luminance component of the image
Step3: Split the image into 4x4 blocks
Step4: Top most row and left most column compressed
by VQ and embedding 0
Step5: For all residual blocks calculate E r (Mean Square
Error) and set threshold
Step6: If Er > T then block is compressed by VQ
Step7: If Er ≤ T embedded secret bit is 0 then block is
compressed by SMVQ and if embedded secret bit is 1
block is compressed by image inpainting
Step8: Stego image
III.EXPERIMENTAL RESULT:
1. First read the input image IV.CONCLUSION:
A joint data-hiding and compression (JDHC) concept can
integrate the two functions of data hiding and image
compression into a single module, which can avoid the
risk of attack from interceptors and increase the
implementation efficiency, recovery quality.
REFERENCES:
1) Xinmiao Zhang, Student Member, IEEE, and Keshab
K. Parhi, Fellow, IEEE “High-Speed VLSI Architectures
for the AES Algorithm” IEEE TRANSACTIONS, VOL.
12, NO. 9, SEPTEMBER 2004.
2. Split image into 4x4 block 2) Tim Good, Student Member, IEEE, and Mohammed
Benaissa, “Very Small FPGA Application-Specific
Instruction Processor for AES” IEEE TRANSACTIONS
ON CIRCUITS AND SYSTEMS, VOL. 53, NO. 7, JULY
2006.
3) Ashwini M. Deshpande, Mangesh S. Deshpande and
Devendra N. Kayatanavar,“FPGA Implementation of
AES Encryption and Decryption” International
Conference on Control, Automation, Communication
and Energy Conservation-2009, 4th-6th June 2009.
4) Chen-Hsing Wang, Chieh-Lin Chuang, and Cheng-
Wen Wu “An Efficient Multimode Multiplier
3. Perform SMVQ and decompose the image Supporting AES and Fundamental Operations of
Public-Key Cryptosystems” IEEE TRANSACTIONS,
VOL. 18 NO. 4, April 2010.
5) Issam Hammad, Student Member, IEEE, Kamal
Sankary, Member “High-Speed AES Encryptor with
Efficient Merging Techniques” IEEE EMBEDDED
SYSTEMS LETTERS VOL. 2, NO. 3, SEPTEMBER 2010.
21 | P a g e
