Improving Various
Reversible Data Hiding Schemes
Via Optimal Codes for
Binary Covers
ABSTRACT:
In reversible
data hiding (RDH), the original cover can be losslessly restored after the
embedded information is extracted. Kalker and Willems established a rate–distortion
model for RDH, in which they proved out the rate–distortion bound and proposed
a recursive code construction. In our previous paper, we improved the recursive
construction to approach the rate–distortion bound. In this paper, we
generalize the method in our previous paper using a decompression algorithm as
the coding scheme for embedding data and prove that the generalized codes can
reach the rate–distortion bound as long as the compression algorithm reaches
entropy. By the proposed binary codes, we improve three RDH schemes that use
binary feature sequence as covers, i.e., an RS scheme for spatial images, one
scheme for JPEG images, and a pattern substitution scheme for binary images.
The experimental results show that the novel codes can significantly reduce the
embedding distortion. Furthermore, by modifying the histogram shift (HS)
manner, we also apply this coding method to one scheme that uses HS, showing
that the proposed codes can be also exploited to improve
integer-operation-based schemes.
ARCHITECTURE:
EXISTING SYSTEM:
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. The
embedding process will usually introduce permanent distortion to the cover,
that is, the original cover can never be reconstructed from the marked cover.
However, in some applications, such as medical imagery, military imagery, and
law forensics, no degradation of the original cover is allowed.
DISADVANTAGES OF EXISTING SYSTEM:
In existing systems, there are still
limitations in three aspects.
·
First, the recursive code construction
is close to but cannot reach the rate–distortion bound.
·
Second, the codes in existing systems
are restricted to some discrete embedding rates and cannot approach the maximum
embedding rate at the least admissible distortion.
·
Third, the codes are restricted to
improve Type-I RDH for spatial images, and how to improve Type-II RDH by binary
codes is still a problem
PROPOSED SYSTEM:
·
We prove that the recursive code
construction can reach the rate–distortion bound when the
decompression/compression algorithms used in the code are optimal, which
establishes equivalence between source coding and RDH for binary covers.
·
With the decompression of the adaptive
arithmetic coder (AAC) as the embedding code, the proposed codes realize
continuous embedding rates and reach the maximum embedding rate at the least
admissible distortion.
·
A method is presented to improve
integer-operation-based RDH (Type II) by the proposed binary codes, which are
also applied to Type-I RDH for JPEG and binary images.
ADVANTAGESF
OF PROPOSED SYSTEM:
- Higher embedding rate
- Improve the recursive construction by using not only the joint encoding above but also a joint decoding of feature decompression and message extraction. The proposed code construction significantly outperforms previous codes and is proved to be optimal when the compression algorithm reaches entropy.
HARDWARE
REQUIREMENTS
·
SYSTEM : Pentium IV 2.4 GHz
·
HARD
DISK : 40 GB
·
FLOPPY
DRIVE : 1.44 MB
·
MONITOR :
15 VGA colour
·
MOUSE : Logitech.
·
RAM :
256 MB
·
KEYBOARD :
110 keys enhanced.
SOFTWARE
REQUIREMENTS
·
Operating system :- Windows XP
Professional
·
Front End :JAVA, Swing(JFC)
·
Tool :Eclipse 3.3
REFERENCE:
Weiming Zhang,
Biao Chen and Nenghai Yu, “Improving Various Reversible Data Hiding Schemes Via
Optimal Codes for Binary Covers”, IEEE TRANSCATIONS ON IMAGE PROCESSING,
VOL.21, NO.6, JUNE 2012.
