You are on page 1of 7

SYSTEM SPECIFICATION

Hardware Requirement:

• System : Core i3.

• Hard Disk : 40 GB.

• Ram : 2 GB.

Software Requirement:

• Operating system : Windows 7 Professional.

• Simulator Uses : MATLAB R2014a


DATA FLOW DIAGRAM

USER INPUT COVER AND PREPROCESSING THE INPUT


HIDING IMAGE IMAGE

FEATURES SUCH AS HIDE


THE IMAGE RETRIEVE LSB ALGORITHM
THE SAME VALUE AS
SIZE

DCT,AWG

CLASSIFIER
SYSTEM DESIGN:
START

ENCRYPTION DECRYPTION

IMAGE FILE
IMAGE MESSAGE FILE

IMAGE MESSAGE FILE

IMAGE FILE
INTRODUCTION
Image processing is any form of signal processing for which the input is an image, such as
a photograph or video frame the output of image processing may be either an image or a set of
characteristics or parameters related to the image. Most image-processing techniques involve
treating the image as a two-dimensional signal and applying standard signal-processing
techniques to it. Image processing usually refers to digital image processing, but optical and
analog image processing also are possible. This article is about general techniques that apply to
all of them. The acquisition of images (producing the input image in the first place) is referred to
as imaging.

The data hiding process links two sets of data, a set of the embedded data and another set
of the cover media data. In most cases of data hiding, the cover media become distorted due to
data hiding and cannot be reversed back to the original media For instance, in covert
communications, the hidden data may often be irrelevant to the cover media. During
authentication, however, the embedded data are closely associated with the cover media. In these
two types of applications, the invisibility of hidden data is a significant demand. In some
applications, such as medical diagnosis and law enforcement, it is critical to reverse the marked
media back to the original cover media after the hidden data are recovered for some legal
considerations. In other applications, such as remote sensing and high-energy particle physical
experimental investigation, it is also coveted that the original cover media can be recovered
because of the required high-exactitude nature. Reversible data hiding alleviates huge possibility
of applications to link two sets of data in such a way that the cover media can be losslessly
recovered after the hidden data have been extracted out, thus providing an additional street of
handling two different sets of data. As is well known, Encryption is an effective means of
privacy protection. To share a secret image with another person, a content owner may encrypt
the image before transmission. In some cases, a channel administrator needs to add some
additional message, such as the origin information, image notation or authentication data, within
the encrypted image however he does not know the original image content. It may be also
expected that the original content can be recovered without any error after decryption and
recover of additional message at the receiver side. That means a reversible data hiding scheme
for encrypted image is suitable.
EXISTING SYSTEM

The existing system presented an reversible watermarking scheme based on lsb, because it
can insert more data. This technique is preferred, because it is more efficient and simple. It offers
a very good compromise in terms of capacity and image quality.

DRAWBACKS:

• Very expensive in computation

• Can not tackle random bending attacks

• Does not perform well against signal processing attacks and some geometric attacks such
as scaling and rotation.
PROPOSED SYSTEM

In this paper, the lsb shape of image is explicitly exploited in hiding and retrieving. At the
embedding phase, a Gaussian low-pass filter is first applied to the host image to extract the
image feature robust to signal processing attacks. Then, we construct the lsb of the filtered image
in relation to a number of gray levels randomly selected using a secret key.lsb mean, we define a
lsb-shape-related index to select pixel groups with the highest number of pixels and propose to
build a safe band between the selected and nonselected pixel groups, which will be beneficial to
robustness. A watermark bit is inserted into a selected group by moving some pixels to certain
gray levels within the pixel group. Moreover, during watermark embedding, a novel high
frequency component modification (HFCM) scheme is implemented to compensate the side
effect of Gaussian filtering, which further enhances robustness. At the decoding phase, using the
secret key, one can find the watermarked pixel groups from the received image and then extract
watermarks from them. Compared with other lsb-based watermarking methods, the major
contributions of our paper are the propositions of a new histogram-shape related index for pixel
group selection assisted by a secret key, a new pixel transfer approach to reduce the extent of
pixel movements, a safe band to create an error buffer between the selected and nonselected
pixel groups, and an HFCM scheme to compensate the side effect of Gaussian filtering. The
performance of the proposed image-watermarking method is illustrated by simulation examples
and compared with recent works.