scholarly journals Visual IoT Security: Data Hiding in AMBTC Images Using Block-Wise Embedding Strategy

Sensors ◽  
2019 ◽  
Vol 19 (9) ◽  
pp. 1974 ◽  
Author(s):  
Yu-Hsiu Lin ◽  
Chih-Hsien Hsia ◽  
Bo-Yan Chen ◽  
Yung-Yao Chen

This study investigates combining the property of human vision system and a 2-phase data hiding strategy to improve the visual quality of data-embedded compressed images. The visual Internet of Things (IoT) is indispensable in smart cities, where different sources of visual data are collected for more efficient management. With the transmission through the public network, security issue becomes critical. Moreover, for the sake of increasing transmission efficiency, image compression is widely used. In order to respond to both needs, we present a novel data hiding scheme for image compression with Absolute Moment Block Truncation Coding (AMBTC). Embedding secure data in digital images has broad security uses, e.g., image authentication, prevention of forgery attacks, and intellectual property protection. The proposed method embeds data into an AMBTC block by two phases. In the intra-block embedding phase, a hidden function is proposed, where the five AMBTC parameters are extracted and manipulated to embed the secret data. In the inter-block embedding phase, the relevance of high mean and low mean values between adjacent blocks are exploited to embed additional secret data in a reversible way. Between these two embedding phases, a halftoning scheme called direct binary search is integrated to efficiently improve the image quality without changing the fixed parameters. The modulo operator is used for data extraction. The advantages of this study contain two aspects. First, data hiding is an essential area of research for increasing the IoT security. Second, hiding in compressed images instead of original images can improve the network transmission efficiency. The experimental results demonstrate the effectiveness and superiority of the proposed method.

2019 ◽  
Vol 2019 ◽  
pp. 1-11
Author(s):  
Pyung-Han Kim ◽  
Eun-Jun Yoon ◽  
Kwan-Woo Ryu ◽  
Ki-Hyun Jung

Data hiding is a technique that hides the existence of secret data from malicious attackers. In this paper, we propose a new data-hiding scheme using multidirectional pixel-value differencing, which can embed secret data in two directions or three directions on colour images. The cover colour image is divided into nonoverlapping blocks, and the pixels of each block are decomposed into R, G, and B channels. The pixels of each block perform regrouping, and then the minimum pixel value within each block is selected. The secret data can be embedded into two directions or three directions based on the minimum pixel value by using the difference value for the block. The pixel pairs with the embedded secret data are put separately into two stego images for secret data extraction on receiver sides. In the extraction process, the secret data can be extracted using the difference value of the two stego images. Experimental results show that the proposed scheme has the highest embedding capacity when the secret data are embedded into three directions. Experimental results also show that the proposed scheme has a high embedding capacity while maintaining the degree of distortion that cannot be perceived by human vision system for two directions.


Author(s):  
Yung-Yao Chen ◽  
Yu-Chen Hu ◽  
Hsiang-Yun Kao ◽  
Yu-Hsiu Lin

AbstractVarious eHealth applications based on the Internet of Things (IoT) contain a considerable number of medical images and visual electronic health records, which are transmitted through the Internet everyday. Information forensics thus becomes a critical issue. This paper presents a data hiding algorithm for absolute moment block truncation coding (AMBTC) images, wherein secret data, or the authentication code, can be embedded in images to enhance security. Moreover, in view of the importance of transmission efficiency in IoT, image compression is widely used in Internet-based applications. To cope with this challenge, we present a novel compression method named gradient-based (GB) compression, which is compatible with AMBTC compression. Therefore, after applying the block classification scheme, GB compression and data hiding can be performed jointly for blocks with strong gradient effects, and AMBTC compression and data hiding can be performed jointly for the remaining blocks. From the experimental results, we demonstrate that the proposed method outperforms other state-of-the-art methods.


Symmetry ◽  
2020 ◽  
Vol 12 (8) ◽  
pp. 1227
Author(s):  
Yu-Song Yan ◽  
Hui-Li Cai ◽  
Bin Yan

Creative digital artwork is usually the outcome of a long period of intellectual creation and labor of an artist. Similarly, computer-created digital artwork is an outcome of a large amount of machine time and computational resources. However, such intellectual properties can be easily copied by illegal users. Copyright protection of digital art is increasingly more important than before. Recently, using a computational approach to generate string art tends to be popular and attractive. To protect the illegal usage of the digital form of string art, we propose a data hiding algorithm specifically designed for string art. A digital string art image consists of a sequence of string lines, each specified by two nails fixed at the two ends of that line. The encrypted secret data (the watermark) is embedded into the list of line segments by odd–even modulation, where a bit ‘1’ is embedded by forcing the next node to be an odd node, and a bit ‘0’ is embedded by forcing the next node to be an even node. To minimize the impact of data embedding on the quality of the original string art image, a local optimization algorithm is developed to select the nodes that produce minimal distortion. To quantify the embedding distortion, we introduce a smoothing filter model for the human vision system (HVS) specifically tailored to string art image. Experimental results show that using the proposed algorithm, the distortion between the original string art image and the watermarked string art image is unnoticeable. The modified string art image is statistically indistinguishable from the original string art, and hence is secure under steganalysis. To our best knowledge, this is the first work towards data hiding and copyright protection of digital string art.


2021 ◽  
pp. 1-11
Author(s):  
Kusan Biswas

In this paper, we propose a frequency domain data hiding method for the JPEG compressed images. The proposed method embeds data in the DCT coefficients of the selected 8 × 8 blocks. According to the theories of Human Visual Systems  (HVS), human vision is less sensitive to perturbation of pixel values in the uneven areas of the image. In this paper we propose a Singular Value Decomposition based image roughness measure (SVD-IRM) using which we select the coarse 8 × 8 blocks as data embedding destinations. Moreover, to make the embedded data more robust against re-compression attack and error due to transmission over noisy channels, we employ Turbo error correcting codes. The actual data embedding is done using a proposed variant of matrix encoding that is capable of embedding three bits by modifying only one bit in block of seven carrier features. We have carried out experiments to validate the performance and it is found that the proposed method achieves better payload capacity and visual quality and is more robust than some of the recent state-of-the-art methods proposed in the literature.


2021 ◽  
Vol 13 (8) ◽  
pp. 215
Author(s):  
Chin-Chen Chang ◽  
Jui-Feng Chang ◽  
Wei-Jiun Kao ◽  
Ji-Hwei Horng

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.


2011 ◽  
Vol 230-232 ◽  
pp. 69-74
Author(s):  
Tarik Idbeaa ◽  
Kasmiran Jumari ◽  
Salina Abd. Samad ◽  
Ali Abdulgader ◽  
Nidal Eshah

Steganography is the idea of embedding a secret data in different media and has become an important regulation of methods of data integration. Although the still images are generally applied in the past, is very popular in recent years for the video. The techniques of video data hiding in recent year’s emphasis on the features generated by the video compression standard, a safer method for steganography uses MPEG-4/H.264 Bit Plane Complexity Segmentation (BPCS) algorithm is proposed in this approach. The reason for choosing such a video coverage is the enormous amount of data that can be hidden in each frame of MPEG-4 video. In other words, MPEG-4 has three types of images: I-frame, B, and P frames. Unlike other techniques used to hide data, such as the LSB algorithm, PBCS can achieve better results in both mathematics expression and human vision. In this paper, data is embedded in the videos of the I-frame until the BPCS can reach high levels of integration with low distortion based on the theory that regions of low noise-levels as in a picture can be replaced by noise without a significant loss of image quality. This approach invents data hidden in high-security environments. Experimental results show the success of hidden data in the selected and extracted data from the sequence of frames and also indicate the effectiveness of the implementation plan of steganography compressed video with high security features.


2013 ◽  
Vol 2013 ◽  
pp. 1-11
Author(s):  
Jiann-Der Lee ◽  
Yaw-Hwang Chiou ◽  
Jing-Ming Guo

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.


2011 ◽  
Vol 19 (2) ◽  
Author(s):  
C. Huang ◽  
W. Wang ◽  
S. Wang

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.


Sign in / Sign up

Export Citation Format

Share Document