MARIAPPAN
M.ASHOK KUMAR
SRI RAMAKRISHNA ENGINEERING COLLEGE
COIMBATORE
STEGANOGRAPHY – VECTORISED AND SCALING APPROACH
B. Quantization
Even and odd quantization are used to
represent “0” and “1,” respectively. In other
words, if the projection is quantized to an even
number then this block represents “0” and if it
is quantized to an odd number then it
represents “1”. The receiver performs the same
process to recover the hidden information. In
particular, each block is projected onto the Fig.7 Quantization step
corresponding subspace and a rounding C. Embedding
operation is performed in order to recover the Let ϋ be the embedded vector, then we
hidden bit. Let є be the rounding error, then, in are going to embed a binary bit i є {0,1}.
order to correctly retrieve the hidden data, one Here, masking is implicitly introduced
must have є < 0.5. To achieve this bound, first by Δ. In particular, there is a tradeoff between
rescale the projection by a scale factor Δ and the robustness of the embedded data and its
transparency. As the value of Δ increases, the
robustness increases but the transparency
decreases and vice versa. In principle, Δ may
take any integer value, typical values for Δ
range from 1 to 20 and up to 30 in severe
attacks. The value of Δ is chosen based on the
anticipated severity of attacks and the required
transparency. For example, in applications
where the hidden information cannot be
compromised, such as in military situations,
high is recommended, while in situations
where attacks are performed unintentionally, (a)
such as transmission over noisy channels, low
values could be chosen.
In order to compute the embedded data
rate, suppose that the image size is and each 8
× 8 block hides one bit of information. Then
the number of bits k that can be hidden is
k = (⌊N/8⌋2-1). It should be noted that the
initial block does not convey any information
as it is considered the initial subspace. Thus,
for a 256×256 image k=1023 and k=4095 for a
512 × 512 image. Fig.8 (a) shows the
embedded Pot image using Δ=10, while Fig.
8(b) illustrates a heavily watermarked image (b)
with Δ=40. The corresponding PSNR with Fig.8. Demonstrating the effect of increasing Δ.
respect to the original image are 45 and 32.9 (a) Embedded using Δ=10.
dB, respectively. In the latter case, blocking (b) Embedded using Δ=40.
artifacts are visible due to quantization effect.
IV. PERFORMANCE
(a)
(a)
(b) (b)
Fig.12. BER versus Δ for different PSNR. desynchronization effect produced by the
(a)F16. (b)Tea pot estimation error. Hence, the fine tuning step
introduced in Section IV-B is important to
maintain low BER. Finally, Fig. 16 shows the
contour plot of the 2-D autocorrelation function
of the original pot image and the corresponding
watermark embedded with Δ=40. It is clear that
the watermark power spectrum1 follows that of
the original image, i.e., the power spectrum
condition is satisfied.
(a)
Fig. 14. BER after combined scaling and rotation
attacks after correction. (a)Cameraman, Δ=20.
(b)Lena, Δ=30.
(b)
Fig.13. BER versus Δ for different JPEG-Q.
(a) F16 (b) Mandrill.
Fig.15. BER versus angle and scaling factor estimation
error for cameraman with Δ = 30.
exhaustive search technique uses pre embedded
training sequence for locking to the right scale
and orientation. On the other hand, scaling
factors and rotation angles are estimated with
the aid of wavelet maxima. Performance
analysis and robustness tests were also
presented.
The drawback of this algorithm is, it
(a) can not overcome the blurring attack and also
very sensitive to estimate errors.
VI. REFERENCES
1. M. Swanson, M.
Kobayashi, and A. H. Tewfik, “Multimedia
data embedding and watermarking
(b) technologies,” Proc. IEEE, vol. 86, no. 6,
Fig.16. Contour plot of the autocorrelation of pp. 1064–1087, Jun. 1998.
the watermark and the original pot. 2. P. Bas, J.-M. Chassery, and B. Macq,
“Geometrically invariant watermarking
using feature points,” IEEE Trans. Image
V. CONCLUSION Processing, vol. 11, no. 9, pp. 1014–1028,
Sep. 2002.
A new data-hiding technique has been 3. Masoud Alghoniemy and Ahmed H.
presented in this paper. Data is embedded by Tewfik, Fellow, IEEE, “Projection
quantizing the projection of the 8 × 8 blocks approach to Data hiding”, VOL. 15, NO.
onto the eigen subspaces extracted from the 2, FEBRUARY 2006.
image. The proposed data embedding
algorithm assumes blind detection where no
overhead is required for detection. The