Abstract
A novel reversible data-hiding scheme is proposed to embed secret data into a side-matched-vector-quantization- (SMVQ-) compressed image and achieve lossless reconstruction of a vector-quantization- (VQ-) compressed image. The rather random distributed histogram of a VQ-compressed image can be relocated to locations close to zero by SMVQ prediction. With this strategy, fewer bits can be utilized to encode SMVQ indices with very small values. Moreover, no indicator is required to encode these indices, which yields extrahiding space to hide secret data. Hence, high embedding capacity and low bit rate scenarios are deposited. More specifically, in terms of the embedding rate, the bit rate, and the embedding capacity, experimental results show that the performance of the proposed scheme is superior to those of the former data hiding schemes for VQ-based, VQ/SMVQ-based, and search-order-coding- (SOC-) based compressed images.
Highlights
With the explosive growth of communication through the Internet, information processing and management at any time have become a standard service for most people, subsequently inducing security problems such as interception, modification and montage
We present the experimental results for evaluating the performance of the proposed scheme in terms
The secret data in the experiment is in binary format, 0 and 1, and which are generated by a pseudorandom number generator
Summary
With the explosive growth of communication through the Internet, information processing and management at any time have become a standard service for most people, subsequently inducing security problems such as interception, modification and montage. Data hiding techniques have attracted attentions for being able to embed secret data into a cover image with minimal perceptual degradation. For irreversible data hiding schemes, only secret data can be extracted, while restoration of cover images is unavailable. Reversible data hiding schemes can extract the secret data and recover the original cover images in the decoder. Tian [1] proposed a scheme for reversible data hiding, called difference expansion (DE). Tian’s work expands the value differences between two neighboring pixels to embed a bit. This scheme is easy to realize, yet the embedding capacity heavily depends on the smoothness of an image. Frequency domain techniques embed message by modulating the transformed coefficients of subbands with just noticeable difference (JND) according to the sensitivity of the human visual system (HVS)
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
