Ki-Hyun Jung

Data hiding method using image interpolation

Data hiding is to conceal the existence of secret data. A reversible data hiding method can extract the cover image without any distortion from the stego-image after the hidden data have been extracted. This paper proposes a new interpolation and a data hiding method. The proposed scaling-up neighbor mean interpolation method has a low-time complexity and high-calculation speed. The proposed data hiding method is based on interpolation. Comparison on data hiding methods is divided into reversible or not. Our experimental results show the proposed method can embed a large amount of secret data while keeping a very high visual quality, the PSNR is guaranteed to be higher than 35 dB compared with other reversible data hiding methods. And also capacity is larger than any other reversible data hiding methods and comparable to other data hiding methods.

Image Data Hiding Method Based on Multi-Pixel Differencing and LSB Substitution Methods

A novel data hiding method based on the least significant bit (LSB) substitution and the multi-pixel differencing (MPD) method is presented on the proposed method to improve the capacity of hidden secret data and to provide an imperceptible visual quality. First, a sum of different values for a four-pixel sub-block is calculated. The low value of the sum can be located on a smooth block and the high value is located on an edged block. The secret data are hidden into the cover image by the LSB method in the smooth block, while the MPD method is concealed in the edged block. The experimental results show that the proposed method has a higher capacity and maintains good visual quality.

Data hiding using edge detector for scalable images

In this paper we propose a data hiding method that utilizes image interpolation and an edge detection algorithm. Image interpolation algorithm enlarges a cover image before hiding secret data in order to embed a large amount of secret data. Edge detection algorithm is applied to improve a quality of stego-image. Experimental results show that the proposed method can embed a large amount of secret data while keeping visual quality better than previous works. We demonstrate that the average capacity is 391,115bits, and the PSNR and quality index are 44.71dB, 0.9568 for gray images when threshold value is 4 and the embedding bits are given to 2 respectively.

Data hiding method in binary images based on block masking for key authentication

Abstract This paper proposes a new data hiding method for binary images that relies on block masking to distribute keys to two parts and then authenticates the right authorized part. The proposed method divides a cover image into small sub-blocks and designs key pairs that determine both where the bit is to be embedded and whether it is possible to embed it there. Furthermore, the key pairs are required to extract the secret data from the stego-image. Experimental results demonstrate a higher capacity and less distortion compared with previous methods since almost all data are hidden in the edge areas.

A High Capacity Data Hiding Method Using PVD and LSB

This paper proposes a high capacity data hiding method using modulus function of pixel-value differencing (PVD) and least significant bit (LSB) replacement method. Many novel data hiding methods based on LSB and PVD methods were presented to enlarge hiding capacity and provide an imperceptible quality. A small difference value for two consecutive pixels is belonged to a smooth area and a large difference one is located on an edge area. In our proposed method, the secret data are hidden on the smooth area by the LSB substitution method and PVD method on the edge area. From the experimental results, the proposed method sustains a higher capacity and still a good quality compared with other LSB and modified PVD methods.

Image Steganographic Method with Variable Embedding Length

Wu and Tsaipsilas pixel-value differencing method and Chang and Tsengpsilas side-match method are based on the theory that the number of bits which can be embedded is determined by the degree of the pixelpsilas smoothness, or its proximity to the edge of the image. If pixels are located in the edge area, they may tolerate larger changes than those in smooth areas. However, both methods are subject to the fall off the boundary problem (FOBP). This study proposes a new scheme that can solve the FOBP. The experimental results demonstrate that the proposed method resolves the problem, and achieves a higher image quality index value than other methods.

High-capacity index based data hiding method

In this paper, a high-capacity data hiding method based on the index function is presented. The cover image is divided into non-overlapping sub-blocks, and the basis pixel is calculated by the index function. Difference values with other pixel-pairs are referenced to decide the number of embedding secret bits with the range table. The experimental results demonstrate that the proposed method could embed 2.45 bpp on average without distortion to the human visual system. We showed that the embedding capacity of the proposed method is 214,227 bits, 213,879 bits, 9,445 bits, 12,240 bits, and 109,253 bits larger than previous works on average for 12 test images.

High-capacity steganographic method based on pixel-value differencing and LSB replacement methods

Abstract In this paper, we propose a high capacity steganographic method using modulus function of pixel-value differencing (PVD) and least significant bit (LSB) replacement methods. Many steganographic methods based on LSB and PVD methods were presented to enlarge hiding capacity and provide an imperceptible image quality, but still have a room to improve the hiding capacity. The main idea of the proposed method is that secret data can be embedded on the smooth area by LSB substitution and on the edge area by PVD with less distortion to the human visual system and improvement of the embedding capacity. The experimental results show that the proposed method sustains a higher capacity and still a good quality compared with LSB and PVD methods.

The Hiding of Secret Data Using the Run Length Matching Method

This study proposes a data hiding method based on run length encoding. This proposed method uses the location of accumulated run length values, where the cover data run length are compared with the secret data run length. The run length matching (RLM) method uses the run length table which is constructed from the cover and secret data. The experimental results demonstrated that the RLM has advantages with respect to different types of data and run length encoding value match.

Data Hiding Method with Quality Control for Binary Images

Secret data hiding in binary images is more difficu lt than other formats since binary images require o nly one bit representation to indicate black and white. This study p roposes a new method for data hiding in binary imag es using optimized bit position to replace a secret bit. This me thod manipulates blocks, which are sub-divided. The parity bit for a specified block decides whether to change or not, t o embed a secret bit. By finding the best position to insert a secret bit for each divided block, the image quality of the re sulting stego-image can be improved, while maintain ing low computational complexity. The experimental results show that the proposed method has an improvement with re spect to a previous work.