By Topic

A lossless data hiding scheme on video raw data robust against H.264/AVC compression

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Mohammad Ali Alavianmehr ; Department of Electrical and Computer Engineering, University of Sistan and Baluchestan, Zahedan, Iran ; Mehdi Rezaei ; Mohammad Sadegh Helfroush ; Ashkan Tashk

In this paper, a robust lossless data hiding scheme on uncompressed video data based on histogram distribution constrained (HDC) scheme is proposed. The proposed method is a reversible data hiding algorithm which enables exact recovery of the original video without any distortion after extracting hidden information, if the watermarked video is not affected by any other process. The algorithm is robust against H.246/AVC video compression. In the proposed method, the luminance components of video frames are used to embed the watermark data bits. The luminance component is divided into non-overlapping blocks and the arithmetic difference of each block is computed. In the next step, the hiding data are embedded into the blocks by shifting the arithmetic difference values. The performance of the proposed algorithm is evaluated with respect to imperceptibility, robustness against H.264 video coding and data payload capacity by simulations. Simulation results demonstrate a high performance for the proposed method.

Published in:

Computer and Knowledge Engineering (ICCKE), 2012 2nd International eConference on

Date of Conference:

18-19 Oct. 2012