Professional Documents
Culture Documents
An Adaptive Compressed Video Steganography Based On Pixel-Value Differencing Schemes
An Adaptive Compressed Video Steganography Based On Pixel-Value Differencing Schemes
An Adaptive Compressed Video Steganography Based On Pixel-Value Differencing Schemes
Abstract— Recent developments in both information and uncompressed video. Among the available video compression
communication security have heightened interest in standards, MPEG-2 remains the most considered because of its
enhancing the embedding capacity for data handling high quality and the availability of hardware that supports this
techniques. Although many steganographic techniques, in format. The present study investigates and analyzes the impact
the literature, have been developed for this purpose, most of embedding a large amount of data in an invisible manner
of them distort the quality of the host-signal during data into the Y components (brightness) of the YUV color space of
embedding and the changes will be become visible to the an MPEG-2 compressed video. Thus, the use of unaffected Y
human eye especially for those signals distributed via the channel instead of the U and V channels of MPEG-2 intra- and
inter-frames (I-, P- and B-frames) results in low, undesirable
Internet which must be processed by a low bit rate
color distortions that may affect the output of stego frames.
compression due to bandwidth limitations. Therefore, the
challenge is to create a steganographic technique that is The rest of the paper is organized as follows. In Section II,
able to hide acceptable amount of data without altering the the MPEG-2 video codec is presented. An overview of the
quality of the host-signal. In this paper, pixel-value previous data embedding methods related to compression
differencing (PVD) steganographic scheme and its two domain and to this video standard is reviewed in Section III.
modified versions, namely, enhanced pixel-value The implementation of the proposed system and performance
differencing (EPVD) and tri-way pixel-value differencing evaluation is presented in Section IV. Accordingly, EPVD and
(TPVD) were implemented, analyzed and compared in TPVD algorithms are described. Experimental results are
terms of invisibility, fidelity and impact of data hiding on presented and performance of the proposed method against the
existing ones is examined in Section V. Section VI offers the
the compression efficiency. Experimental results indicate
conclusion of the paper.
that the EPVD scheme is capable of providing better
performance than other compared schemes.
II. REVIEW ON MPEG-2 COMPRESSION STANDARD
Keywords: tri-way pixel-value differencing (TPVD); enhanced Due to the huge amount of the data present in motion video,
pixel-value differencing (EPVD); watermark; steganography; the MPEG-2 is designed as compressed digital video standard
MPEG-2 which removes both the temporal and spatial redundancy.
Further reduction of the redundancy data is achieved by run
I. INTRODUCTION length and variable length coding. The MPEG-2 is split into a
Data-hiding techniques are being developed to discover hierarchy layers stared with video sequence layer and ended
new methods of protecting privileged or confidential with block layer. The video sequence layer consists of a
information from public access. The process of hiding number of GOPs. The frames of each GOP in this study are
information in images and audio files has already been independently encoded and decoded. Usually, the GOP
investigated. However, embedding data in a video file is structure consists of three types of pictures: intra-frame (I-
currently the subject of several investigations to respond to the frame), bidirectional-frame (B-frame), and the predictive-frame
needs and constraints of current applications [1]. Furthermore, (P-frame) and the GOP may take different length (i.e.
large video bandwidths mean that larger volumes of data can composed of one I-frame, some B-frames and, possibly some
be embedded in video files [2]. Even though video P-frames). However, it should not be too long to avoid error
steganography schemes that embed data in uncompressed that may occur. In this study, The GOP is chosen to be length
domains have already been proposed, researchers still attempt of six with the display order of “IBBPBB,”. Each of these
to respond to application demands and embed private pictures is broken up into M number of slices where each slice
information during or after the compression process. Although is further broken up into N numbers of macro-blocks (MBs)
significant effort has been devoted to this subject by the and each MB has four 8 × 8 luminance blocks (Y) and two
scientific community, existing studies are still considered chrominance blocks (U and V). The content of each block is a
insufficient in overcoming all data-hiding problems. In most 2-D DCT coefficient that is quantized using uniform scalar
cases, the schemes used for embedding data in compressed quantizer (USQ) specified by a fixed quantization table which
video should not be compatible with the ones used in is then VLC coded. Given that Y-component (brightness)
blocks are located in an unaffected channel; these are used as better security compared with PVD-based method while still
host blocks to minimize the color distortion in the embedded retaining the advantage of hiding a large amount of data.
video.
IV. SYSTEM OVERVIEW
III. PREVIOUS WORK ON VIDEO STEGANOGRAPHY The proposed system is illustrated in Figure 1. Each frame
Numerous data-hiding methods have been proposed is first divided into N numbers of MBs each of which has four
recently for embedding information in images, sound and video 8 × 8 luminance blocks and two chrominance blocks. Each
signals. However, due to the requirements by some non-overlapped 8 × 8 block is transformed using DCT into 64
applications for larger embedding capacity and to insure better DCT coefficients (TCs). These TCs are subsequently quantized
security for both information and communication, the video using USQ. After this the selected steganographic scheme is
streams have attracted a lot attention recently. In this case, the applied where the embedding process only considers the AC-
confidential information can be hidden either into images QTCs of Y-channel of both intra- and inter-frames. Finally, all
(frames) or into audio part of the video streams. the QTCS are then zigzag scanned, and VLC coded.
Singh and Dubey [3] proposed data embedding scheme
based on the use of the quantization index modulation for
MPEG-2 video. The scheme embeds data into the DC-QTCs of
I- and P- frames during the MPEG-2 video encoding process.
Since the scheme was tested on video sequence with frame
resolution of 320 × 240, thousands of data bits were embedded
in just one selected frame type. To reduce the effect on the
visual video quality, QIM was adjusted according to the size of
DC-QTCs. To preserve the quality of the stego frame, [4]
proposed data embedding scheme in the compressed domain
based on use of the AC-QTCs with the lower frequency only.
The scheme embeds 2-D binary image watermarks into the
MPEG-2 bit streams by modifying the AC-QTCs.
The AC components with the higher frequencies in addition Figure1. Top level view of embedding process in compressed domain
to DC component were avoided. In [5] a blind video
watermarking scheme that embeds data into the I-frames in A. Embedding data using EPVD Technique
H.264 compressed domain has been proposed. Here, an To embed data bits, the selected AC-QTCs of the selected
inexpensive spatiotemporal analysis was performed to select frame are rearranged as a row vector of non-overlapping units,
the appropriate sub-MBs for embedding. As result, the
where each is composed of two consecutive QTCS (C i , C i +1 )
robustness of the watermark has increased and the impact on
visual quality has reduced. Dutta et al. [6] proposed similar as shown in Figure 2, where ݅ and ݆ represent the location of
scheme which embeds data bits into the P-frames of the coefficient in the cover. Subsequently, the difference value
H.264/AVC video. The scheme utilizes an appropriate block d is calculated by (Ci +1 − Ci ) , where the absolute difference
i
selection method to enhance the security of the method. Only value of di is used, di ∈ [0,255] , in locating the optimum
nonzero AC-QTCs in 4 x 4 blocks of P-frames are selected for
range in the range table R k , lk ≤ d i ≤ uk . The method utilized
embedding.
a modified width range of the original PVD method that
To embed larger amount of data, Sherly and Amritha [7] reduced the Rk width wk at the indexing k = 0 , and 5, as
proposed a compressed video steganographic scheme that
described in Table I. The following modified formula is used.
embeds data bits in the MBs of I-, B- and P-frames with
maximum extent of MVs. The scheme based on an
enhancement of the data hiding concept proposed in [8] which wk = (u k − l k + 1) / 2 (1)
is a modification of the original PVD method in [9]. Data
hiding operations were defined and executed entirely in the
compressed domain. Both DC- and AC frequencies
components of each employed frames are employed.
Experimental results prove that such a method can achieve
excellent performance. Another steganographic scheme based
video compressed domain is proposed by [10]. The proposed
scheme used an EPVD scheme which is another modification
of the original PVD method in [9]. The scheme reduced the
distortion drift caused by reversible data hiding within selected
AC-QTCs of both intra and inter frames for MPEG-2 video
during compression. Based on the their obtained simulation
results, the authors reported that the proposed scheme
Figure 2. Sample of vectorized 8 × 8 coefficients block in EPVD scheme.
successfully improves the perceived quality and achieves much
51
2015 International Conference on Advanced Technologies for Communications (ATC)
TABLE I. RANG TABLE selected QTCs block within a frame is classified as having
k 0 1 2 3 4 5 horizontal, vertical, or diagonal direction. Accordingly, four
[ lk uk ] 0-7 8- 15 16- 31 32- 63 64-127 128- 255 coefficients pairs in each block denoted by C(i, j ) , C(i, j +1) ,
wk 4 8 16 32 64 64 C(i +1, j ) , and C( i +1, j +1) are used for embedding. Thus, in each
ti 1 1 2 2 3 3 block, the four AC-QTCs pairs are denoted
by C0 = (C(i, j ) , C(i, j +1) ) , C1 = (C(i , j ) , C(i +1, j ) ) , C2 = (C(i, j ) , C(i +1, j +1) ) ,and
The number of data bits, n, that can be embedded within C3 = (C(i +1, j ) , C(i +1, j +1) ) . Therefore, four values
the two consecutive QTCs is determined by a new modified
related to the four pixel pairs can be derived
factor to decrease the changing of the magnitude of the
through the following equations:
coefficient value according to the following equation:
ª d i' − d i º « d i' − d i »
° (C i − « » , C i +1 + « » , if d is odd
' ' ° « 2 » «¬ 2 ¼» (4)
(C i , C i +1 ) = ®
° (C − « d i − d i » , C « d i' − d i » , if d is even
'
° i «¬ » i +1 + « »
¯ 2 ¼ «¬ 2 ¼»
The obtained b ' value is transformed into a binary string values are gained and denoted by C0' . The C0' value may affect
with n bits, where n is computed using Equation 1. Finally, the the difference di' in the other two coefficient pairs. Thus, the
processes are repeated until all embedded data bits are
extracted. TPVD scheme applies an optimal selection rule to select the
best reference pair to achieve the minimum MSE for C0' .
B. Embedding data using TPVD Technique Therefore, the coefficients values in the other two coefficient
Here, data bits are embedded in different edge directions pairs are added to offset and preserve the di' value.
of the coefficients block. Contrary to the PVD method, which
uses only 2-QTCs pairs on one-directional edge for embedding (C i − ªm 2 º, C i + 1 + ¬m 2 ¼), if C i + 1 ≥ C i & d 'i ≥ d i
°
a certain amount of bits, the TPVD method utilizes four ° (C + ¬m 2 ¼, C i + 1 − ªm 2 º), if C i + 1 ≥ C i & d 'i < d i (7)
( C i' , C i' + 1 ) = ® i
directions of four 2-QTCs pairs by portioning the QTCs block ° (C i + ªm 2 º, C i + 1 − ¬m 2 ¼), if C i + 1 < C i & d 'i ≥ d i
into a series of 2 × 2 blocks as shown in Figure 3. Each °
¯ (C i − ¬m 2 ¼, C i + 1 + ¬m 2 ¼), if C i + 1 < C i & d 'i < d i
52
2015 International Conference on Advanced Technologies for Communications (ATC)
In the process of retrieving data bits, the stego-signal is In this table, Vs is the source video file size, VP is the processed
segmented as performed in the embedding phase, and the di' video file size, Fm, n is the original frame, and Fm' ,n is the
values are calculated using Equation (3). Then, for each AC- modified frame. ȝ represents the mean intensity of the Fm, n and
QTCs block, the branch conditions are tested to check whether
the PVD or TPVD method has been applied to the block. , CS1 and CS 2 are constants. In addition, m and n are the
Fm' ,n
53
2015 International Conference on Advanced Technologies for Communications (ATC)
embedded data introduces little influence on the video to previous work, the experimental results have demostrated
sequences. This finding satisfies the fact that the distortions that the proposed EPVD provides better invisibility than the
are invisible while the rest of the techniques have a significant PVD or TPVD schemes.
influence on the video and indicating that the distortions are
visible. For the I-, P- and B-frames, the average decrease in Y-
PSNR for EPVD is 9.44, 6.61 and 6.29 dB, respectively while
it is 10.67, 10.03 and 10.23 dB, respectively, for PVD scheme
and it is 15.86, 11.33 and 11.02, respectively, for TPVD
scheme. The average decrease in Y-SSIM for EPVD is
0.0907, 0.0708 and 0.0693 for the I-, P- and B-frames, (a) MPEG-2 I-frame (e) MPEG-2 P-frame (i) MPEG-2 B-frame
respectively, while it is 0.0970, 0.0966 and 0.0967,
respectively, for the same frame types when PVD scheme is
utilized and it is 0.0958, 0.0769 and 0.0704, respectively for
TPVD scheme. The SSIM map is more consistent with
observations related to the imperceptibility performances of
stego video sequences for all embedding schemes. Generally,
brighter blocks (SSIM values are closer to 1) correspond to a
higher similarity between the stego coded frame and its (b) I-frame with PVD (f) P-frame with PVD (j) B-frame with PVD
corresponding coded frames without data embedding. From
the Figure 7, an evident observation based on the maps is that
EPVD performs best among all other embedding schemes. Y-
SSIM map for EPVD vary minimally while it is significant for
the PVD scheme especially for the top side of the frame and
the frame generated by TPVD is are heavily distorted.
(c) I-frame with EPVD (g) P-frame with EPVD (k) B-frame with TPVD
VI. CONCLUSION
An adaptive video steganography based on enhanced
pixel-value differencing (EPVD) scheme was presented and
analyzed in terms of effectiveness in concealing data in the
MPEG-2 compressed video. The proposed scheme operates
directly in the compressed domain. The scheme embeds data
bits in the AC-QTCs of luminance components for both the
intra- and inter frames without altering the MV information or (d) I-frame with TPVD (h) P-frame with TPVD (l) B-frame with TPVD
any of the critical side information. The evaluations of the Figure 4. Visual quality samples of the I-, P- and B-frames within the 3rd
algorithms were analyzed and discussed based on the main GOP of the compressed-domain video steganography for “Foreman” clip.
steganography issues, such as invisibility, fidelity and the
impact of data hiding on the compression efficiency. Compared
TABLE III. DATA HIDING RESULTS WITH THE INTRA AND THE INTER FRAMES OF THE "FOREMAN" VIDEO SEQUENCE FOR DIFFERENT STEGANOGRAPHIC
TECHNIQUES FOR THE SCENARIO THAT THE DATA PAYLOAD OF 32768 BITS ARE EMBEDDED IN THE MPEG-2 ENCODER
Method in [9] Method in [10] Method in [8]
Sequence Properties Original File Compressed File
I P B I P B I P B
File size (MB) 21.7 3.45 3.56 3.57 3.58 3.51 3.54 3.54 3.53 3.54 3.54
Foreman Bitrate (Mbps) - 5.52 5.70 5.71 5.73 5.62 5.66 5.66 5.65 5.66 5.66
CR - 6.29 6.10 6.08 6.06 6.18 6.13 6.13 6.15 6.13 6.13
Per frame Y-PSNR quality performance Per frame Y-PSNR quality performance Per frame Y-PSNR quality performance
34 38 38
32 36
36
Y-PSNR [dB]
Y-PSNR [dB]
Y-PSNR [dB]
PVD scheme 34
30 PVD scheme
EPVD scheme
32 34 EPVD scheme
28 TPVD scheme
TPVD scheme
30
PVD scheme 32
26
28 EPVD scheme
TPVD scheme
24 26 30
5 10 15 20 25 1 5 10 15 20 25 1 5 10 15 20 25
Frame no Frame no Frame no
(a) (b) (c)
Figure 5. Per frame scatter plots for Y-components PSNR quality predicted values for the 25 I-, P- and B-frames of the 25 GOPs of the stego “Foreman” MPEG-
2 video at the embedded payload rate of 32768 bpf: (a) Y-PSNR for selected I-frames, (b) Y-PSNR for selected P-frames and (c) Y-PSNR for selected B-frames.
54
2015 International Conference on Advanced Technologies for Communications (ATC)
Per frame Y-SSIM quality performance Per frame Y-SSIM quality performance Per frame Y-SSIM quality performance
0.9 0.92 0.92
Y -S S IM
Y -S S IM
Y -S S IM
Figure 6. Per frame scatter plots for Y-components SSIM quality predicted values for the 25 I-, P- and B-frames of the 25 GOPs of the stego “Foreman” MPEG-
2 video at the embedded payload rate of 32768 bpf: (a) Y-SSIM for selected I-frames, (b) Y-SSIM for selected P-frames and (c) Y-SSIM for selected B-frames.
This result can be attributed to the inability of the human eye Instrumentation and Measurement Technology Conference (I2MTC),
to distinguish a small change; thus, both stego frame and 2012 IEEE International, pp. 225-229, May 2012.
reference frame (original) would look identical. Moreover, the [5] A. Mansouri, A. M. Aznaveh, F. Torkamani-Azar, and F. Kurugollu, “A
EPVD still satisfies the capacity constraints without adversely low complexity video watermarking in H. 264 compressed domain,”
affecting the overall file size, CR, bitrate and the SSIM/PSNR
Information Forensics and Security, IEEE Transactions on, vol. 5, no. 4,
of the stego video bitstream. This achieves the optimal
pp. 649-657, 2010.
tradeoff between data payload and distortion to video quality
due to the embedded data bits. [6] T. Dutta, A. Sur, and S. Nandi, “A robust compressed domain video
watermarking in P-frames with controlled bit rate increase,” in
Communications (NCC), 2013 National Conference on, pp. 1-5,
February 2013.
REFERENCES
[7] A. Sherly and P. Amritha, “A compressed video steganography using
[1] S. Bouchama, H. Aliane, and L. Hamami, “Watermarking techniques TPVD,” International Journal of Database Management Systems
applied to H264/AVC video standard,” in Information Science and (IJDMS, vol. 2, no.3, pp. 67-80, 2010.
Applications (ICISA), 2010 International Conference on, pp. 1-7, April [8] K.-C. Chang, C.-P. Chang, P. S. Huang, and T.-M. Tu, “A novel image
2010 steganographic method using tri-way pixel-value differencing,”Journal
[2] D.-Y. Fang and L.-W. Chang, “Data hiding for digital video with phase of multimedia, vol. 3, no. 2, pp. 37-44, 2008.
of motion vector,” in Circuits and Systems, 2006. ISCAS 2006. [9] D.-C. Wu and W.-H. Tsai, “A steganographic method for images by
Proceedings. 2006 IEEE International Symposium on, pp. 1422-1425, pixel-value differencing,” Pattern Recognition Letters, vol. 24, no. 9, pp.
May 2006. 1613-1626, 2003.
[3] J. Singh and A. Dubey, “MPEG-2 video watermarking using [10] T. F. Idbeaa, S. A. Samad, and H. Husain, “Embedding Data in MPEG-2
quantization index modulation,” in Internet Multimedia Services Compressed Video using an improved Pixel-Value-Differencing
Architecture and Application (IMSAA), 2010 IEEE 4th International Scheme,” International Journal of Advancements in Computing
Conference on, pp. 1-6, , December 2010. Technology, vol. 5, no. 11, 2013.
[4] S. N. Biswas, S. Nahar, S. R. Das, E. M. Petriu, M. H. Assaf, and V.
Groza, “MPEG-2 digital video watermarking technique,” in
55