A novel data hiding and reversible scheme using SMN blocks in VQ-compressed images

2011 ◽  
Vol 19 (2) ◽  
Author(s):  
C. Huang ◽  
W. Wang ◽  
S. Wang
Keyword(s):  
Vector Quantization ◽  
Data Hiding ◽  
Reversible Data Hiding ◽  
Multimedia Security ◽  
Experimental Results ◽  
Compression Rate ◽  
Secret Data ◽  
Compressed Images ◽  
Reversible Method ◽  
The Relationship

AbstractData hiding is a technique for embedding secret data into cover media. It is important to multimedia security and has been widely studied. Reversible data hiding methods are becoming prevalent in the area because they can reconstruct the original cover image while extracting the embedded data. In this paper, we propose a new reversible method for vector quantization (VQ) compressed images. Our method takes advantages of the relationship among the side match neighbouring (SMN) blocks to achieve reversibility. The experimental results show that the proposed method has higher compression rate and larger capacity than other existing reversible methods.

scholarly journals Reversible Data Hiding Scheme with High Embedding Capacity Using Semi-Indicator-Free Strategy

2013 ◽  
Vol 2013 ◽  
pp. 1-11
Author(s):  
Jiann-Der Lee ◽  
Yaw-Hwang Chiou ◽  
Jing-Ming Guo
Keyword(s):  
Vector Quantization ◽  
Data Hiding ◽  
Reversible Data Hiding ◽  
Embedding Capacity ◽  
Bit Rate ◽  
Secret Data ◽  
Compressed Images ◽  
Search Order ◽  
High Embedding Capacity ◽  
Embedding Rate

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.

scholarly journals A Location Map Reduced Reversible Data Hiding Method Using Prediction Error Modification

2012 ◽  
Vol 6-7 ◽  
pp. 428-433
Author(s):  
Yan Wei Li ◽  
Mei Chen Wu ◽  
Tung Shou Chen ◽  
Wien Hong
Keyword(s):  
Image Quality ◽  
Data Hiding ◽  
Prediction Error ◽  
Reversible Data Hiding ◽  
Experimental Results ◽  
Cover Image ◽  
Prediction Errors ◽  
Secret Data ◽  
Location Map ◽  
Comparable Image Quality

We propose a reversible data hiding technique to improve Hong and Chen’s (2010) method. Hong and Chen divide the cover image into pixel group, and use reference pixels to predict other pixel values. Data are then embedded by modifying the prediction errors. However, when solving the overflow and underflow problems, they employ a location map to record the position of saturated pixels, and these pixels will not be used to carry data. In their method, if the image has a plenty of saturated pixels, the payload is decreased significantly because a lot of saturated pixels will not joint the embedment. We improve Hong and Chen’s method such that the saturated pixels can be used to carry data. The positions of these saturated pixels are then recorded in a location map, and the location map is embedded together with the secret data. The experimental results illustrate that the proposed method has better payload, will providing a comparable image quality.

scholarly journals Two-Layer Reversible Data Hiding for VQ-Compressed Images Based on De-Clustering and Indicator-Free Search-Order Coding

2021 ◽  
Vol 13 (8) ◽  
pp. 215
Author(s):  
Chin-Chen Chang ◽  
Jui-Feng Chang ◽  
Wei-Jiun Kao ◽  
Ji-Hwei Horng
Keyword(s):  
Data Hiding ◽  
Reversible Data Hiding ◽  
State Of The Art ◽  
Secret Data ◽  
Compressed Images ◽  
Hide Information ◽  
Search Order ◽  
Using Data ◽  
Free Search ◽  
Index Table

During transmission of digital images, secret messages can be embedded using data hiding techniques. Such techniques can transfer private secrets without drawing the attention of eavesdroppers. To reduce the amount of transmitted data, image compression methods are widely applied. Hiding secret data in compressed images is a hot issue recently. In this paper, we apply the de-clustering concept and the indicator-free search-order coding (IFSOC) technique to hide information into vector quantization (VQ) compressed images. Experimental results show that the proposed two-layer reversible data hiding scheme for IFSOC-encoded VQ index table can hide a large amount of secret data among state-of-the-art methods with a relatively lower bit rate and high security.

An Efficient Reversible Data Hiding Scheme for Encrypted Images

2018 ◽  
Vol 10 (2) ◽  
pp. 1-22 ◽  
Author(s):  
Kai Chen ◽  
Dawen Xu
Keyword(s):  
Data Hiding ◽  
Efficient Method ◽  
Reversible Data Hiding ◽  
Additional Data ◽  
Emerging Technology ◽  
Experimental Results ◽  
Cover Image ◽  
Original Image ◽  
Secret Data ◽  
Encrypted Images

Reversible data hiding in the encrypted domain is an emerging technology, as it can preserve the confidentiality. In this article, an efficient method of reversible data hiding in encrypted images is proposed. The cover image is first partitioned into non-overlapping blocks. A specific modulo addition operation and block-scrambling operation are applied to obtain the encrypted image. The data-hider, who does not know the original image content, may reversibly embed secret data based on the homomorphic property of the cryptosystem. A scale factor is utilized for selecting embedding zone, which is scalable for different capacity requirements. At the receiving end, the additional data can be extracted if the receiver has the data-hiding key only. If the receiver has the encryption key only, he/she can recover the original image approximately. If the receiver has both the data-hiding key and the encryption key, he can extract the additional data and recover the original content without any error. Experimental results demonstrate the feasibility and efficiency of the proposed scheme.

scholarly journals Histogram-based multilayer reversible data hiding method for securing secret data

2019 ◽  
Vol 8 (3) ◽  
pp. 1128-1134
Author(s):  
Chaidir Chalaf Islamy ◽  
Tohari Ahmad
Keyword(s):  
Data Hiding ◽  
Reversible Data Hiding ◽  
Experimental Results ◽  
Histogram Shifting ◽  
Secret Data ◽  
Stego Image ◽  
Sensitive Data ◽  
Modern Age ◽  
Potential Methods

In this modern age, data can be easily transferred within networks. This condition has brought the data vulnerable; so they need protection at all times. To minimize this threat, data hiding appears as one of the potential methods to secure data. This protection is done by embedding the secret into various types of data, such as an image. In this case, histogram shifting has been proposed; however, the amount of secret and the respective stego image are still challenging. In this research, we offer a method to improve its performance by performing some steps, for example removing the shifting process and employing multilayer embedding. Here, the embedding is done directly to the peak of the histogram which has been generated by the cover. The experimental results show that this proposed method has a better quality of stego image than existing ones. So, it can be one of possible solutions to protect sensitive data.

scholarly journals Generalized Reversible Data Hiding with Content-Adaptive Operation and Fast Histogram Shifting Optimization

Entropy ◽  
2021 ◽  
Vol 23 (7) ◽  
pp. 917
Author(s):  
Limengnan Zhou ◽  
Hongyu Han ◽  
Hanzhou Wu
Keyword(s):  
Data Hiding ◽  
Reversible Data Hiding ◽  
Hot Spot ◽  
Data Embedding ◽  
Histogram Shifting ◽  
Secret Data ◽  
Content Selection ◽  
Wide Range ◽  
Map Generation ◽  
Content Adaptive

Reversible data hiding (RDH) has become a hot spot in recent years as it allows both the secret data and the raw host to be perfectly reconstructed, which is quite desirable in sensitive applications requiring no degradation of the host. A lot of RDH algorithms have been designed by a sophisticated empirical way. It is not easy to extend them to a general case, which, to a certain extent, may have limited their wide-range applicability. Therefore, it motivates us to revisit the conventional RDH algorithms and present a general framework of RDH in this paper. The proposed framework divides the system design of RDH at the data hider side into four important parts, i.e., binary-map generation, content prediction, content selection, and data embedding, so that the data hider can easily design and implement, as well as improve, an RDH system. For each part, we introduce content-adaptive techniques that can benefit the subsequent data-embedding procedure. We also analyze the relationships between these four parts and present different perspectives. In addition, we introduce a fast histogram shifting optimization (FastHiSO) algorithm for data embedding to keep the payload-distortion performance sufficient while reducing the computational complexity. Two RDH algorithms are presented to show the efficiency and applicability of the proposed framework. It is expected that the proposed framework can benefit the design of an RDH system, and the introduced techniques can be incorporated into the design of advanced RDH algorithms.

scholarly journals Efficient Reversible Data Hiding Scheme for AMBTC-Compressed Images

2021 ◽  
Vol 11 (15) ◽  
pp. 6741
Author(s):  
Chia-Chen Lin ◽  
Thai-Son Nguyen ◽  
Chin-Chen Chang ◽  
Wen-Chi Chang
Keyword(s):  
Data Hiding ◽  
Free Space ◽  
Reversible Data Hiding ◽  
Secret Message ◽  
Embedding Capacity ◽  
Absolute Moment ◽  
Compressed Images ◽  
High Embedding Capacity ◽  
Significant Attention ◽  
Efficiency Rate

Reversible data hiding has attracted significant attention from researchers because it can extract an embedded secret message correctly and recover a cover image without distortion. In this paper, a novel, efficient reversible data hiding scheme is proposed for absolute moment block truncation code (AMBTC) compressed images. The proposed scheme is based on the high correlation of neighboring values in two mean tables of AMBTC-compressed images to further losslessly encode these values and create free space for containing a secret message. Experimental results demonstrated that the proposed scheme obtained a high embedding capacity and guaranteed the same PSNRs as the traditional AMBTC algorithm. In addition, the proposed scheme achieved a higher embedding capacity and higher efficiency rate than those of some previous schemes while maintaining an acceptable bit rate.

scholarly journals Reversible Data Hiding in Encrypted Images Using Median Edge Detector and Two’s Complement

Symmetry ◽  
2021 ◽  
Vol 13 (6) ◽  
pp. 921
Author(s):  
Rui Wang ◽  
Guohua Wu ◽  
Qiuhua Wang ◽  
Lifeng Yuan ◽  
Zhen Zhang ◽  
...  
Keyword(s):  
Data Hiding ◽  
Reversible Data Hiding ◽  
Personal Information ◽  
Rapid Development ◽  
Prediction Method ◽  
Prediction Errors ◽  
Edge Detector ◽  
Secret Data ◽  
Encrypted Images ◽  
Cloud Servers

With the rapid development of cloud storage, an increasing number of users store their images in the cloud. These images contain many business secrets or personal information, such as engineering design drawings and commercial contracts. Thus, users encrypt images before they are uploaded. However, cloud servers have to hide secret data in encrypted images to enable the retrieval and verification of massive encrypted images. To ensure that both the secret data and the original images can be extracted and recovered losslessly, researchers have proposed a method that is known as reversible data hiding in encrypted images (RDHEI). In this paper, a new RDHEI method using median edge detector (MED) and two’s complement is proposed. The MED prediction method is used to generate the predicted values of the original pixels and calculate the prediction errors. The adaptive-length two’s complement is used to encode the most prediction errors. To reserve room, the two’s complement is labeled in the pixels. To record the unlabeled pixels, a label map is generated and embedded into the image. After the image has been encrypted, it can be embedded with the data. The experimental results indicate that the proposed method can reach an average embedding rate of 2.58 bpp, 3.04 bpp, and 2.94 bpp on the three datasets, i.e., UCID, BOSSbase, BOWS-2, which outperforms the previous work.

scholarly journals Taylor expansion based stereo image reversible data hiding

2020 ◽  
Author(s):  
Xinyang Ying ◽  
Guobing Zhou
Keyword(s):  
Data Hiding ◽  
Reversible Data Hiding ◽  
Taylor Expansion ◽  
Stereo Image ◽  
Embedding Capacity ◽  
Stereo Images ◽  
Secret Data ◽  
Stego Image ◽  
Multi Level

Abstract The reversible data hiding allows original image to be completely recovered from the stego image when the secret data has been extracted, it is has drawn a lot of attentions from researchers. In this paper, a novel Taylor Expansion (TE) based stereo image reversible data hiding method is presented. Since the prediction accuracy is essential to the data hiding performance, a novel TE based predictor using correlations of two views of the stereo image is proposed. TE can fully exploit strong relationships between matched pixels in the stereo image so that the accuracy of the prediction can be improved. Then, histogram shifting is utilized to embed data to decrease distortion of stereo images, and multi-level hiding can increase embedding capacity. Experimental results show that the proposed method is superior to some existing data hiding methods considering embedding capacity and the quality of the stego stereo images.

Sign in / Sign up

Export Citation Format

Share Document