King JUNG's History

Advanced Science Letters (SCOPUS)

In this paper, a new reversible data hiding method based on sorting and prediction in digital images is proposed. The proposed method can embed two bits in the 3 × 1 subblock at maximum by dividing into two groups - min and max groups. The pixel pairs of the min group and max group are firstly predicted and then are modified to embed the secret bits. The reversibility is guaranteed since the order of pixel pairs of the sub-block is not changed after embedding a secret bit into two groups. The experimental results show that the proposed method provides high embedding capacity than the previous works.

Multimedia Tools and Applications
DOI 10.1007/s11042-016-3739-x

A reversible data hiding method allows recovery of the cover image after the secret data have been extracted. In this paper, a novel reversible data hiding method is proposed using neighboring interpolation and pixel-value differencing on block expansion. A consecutive embedding technique for a sub-block is proposed to maintain a higher embedding capacity, and a neighboring pixel-value  diffrencing is also proposed to maintain a good visual quality in stego-images. The results of experiment demonstrate that the proposed method has higher capacity and maintains a better image quality than previous reversible data hiding methods.

Journal of Real-Time Image Processing : Special issue on real-time data hiding and visual cryptography

The previous secret image sharing schemes did not provide a copyright and privacy for cover images. The reason is that a dealer selects a cover image by itself and embeds directly the secret data into the cover image. In this paper, a reversible secret image sharing scheme in encrypted images is proposed in order to provide the copyright and privacy of the cover image. We divide a role of the dealer into an image provider and a data hider. The image provider encrypts the cover image and transmits the encrypted image to the data hider, and the standard stream cipher as one-time pad (OTP) with a random secret key is used. The data hider embeds the secret data into the encrypted image, and the encrypted shadow images are transmitted to the corresponding participant. We utilize the polynomial arithmetic operation over GF(28) during the sharing of the encrypted shadow images, and the coefficient of the highest-order term is fixed to one in order to prevent the overflow and the security problem. In the reconstruction procedure, the secret data can be extracted and the cover image can be reconstructed exactly from t or more encrypted shadow images with Lagrange interpolation. In experimental results, the proposed method shows that the PSNR is sustained close to 44 dB regardless of the embedding capacity, where the embedding capacity is 524,288 bits on average.

Multimedia Tools and Applications 75(21), 13931-13949, 2016

Security systems become the first consideration to prevent illegal access as interest of information
security has increased recently. Information hiding is one of the methods for secret communication,
where the existence of the secret data is hidden. The embedding capacity and visual quality are
important issues to measure the performance. In this survey, reversible data hiding methods in dual
images are described and comparisons of these techniques are provided in terms of embedding
capacity and visual quality.

IETE TECHNICAL REVIEW (SCIE), 2016

online access with up to 50 colleagues http://www.tandfonline.com/eprint/wcRz4Its5NgRr4y9rdtM/full

Dual image-based reversible data hidings are recently proposed where dual copies of a cover image are used to embed the secret data. In this paper, a novel reversible data hiding method based on neighboring pixel-value differencing is proposed to increase embedding capacity with a good image quality. The mean value of neighboring pixels and the difference values are used to decide the size of embedding bits per the sub-block. The receiver can extract the secret data and recover the cover image from dual stego-images. The experimental results show that the proposed method has a higher capacity and still a good image quality where it could embed 767,922 bits and maintain 45.58 dB and 45.33 dB for dual images.

The Imaging Science Journal(SCIE), Vol. 63(7) (9.2015) 398-407

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.

Multimedia Tools and Applications, 2014 (SCIE)

This paper proposes a new data hiding method for binary images using block masking to distribute keys to two parts and authenticate the right authorized part. The proposed method divides a cover image into a small sub-blocks and design key pairs that decide the position of the embedding bit and determine whether it is possible to embed or not. Also, key pairs are required to extract secret data from the stego-image. The experimental results have a higher capacity and less distortion since almost all data were hidden into edge areas.

Information Sciences, Vol 277, 1 September 2014, pp. 188-196 (SCIE)

A data hiding method using 3-directional pixel-value differencing for gray images is presented in this paper. The cover image is divided into non-overlapping 2 x 2 sub-blocks and the basis pixel is selected to calculate different three values of a sub-block. Difference values are replaced by embedding the number of secret bits that is referenced by the range table. For three pixel pairs in the sub-block, the optimal pixel adjustment is preceded to reduce the distortion of visual quality. The experimental results demonstrate that the proposed method provides a high capacity and good visual quality.

Cyptologia 38(2), 178-191, 2014 (SCIE)

Steganography is the method of hiding secret data in other data, such as video or an image. A reversible data hiding method can extract the cover image from a stego-image without distortion after extracting the hidden data. In this paper a semi-reversible data hiding method that utilizes interpolation and the least significant substitution technique is proposed. First, interpolation methods are used to scale up and down the cover image before hiding secret data for a higher capacity and quality. Secondly, the LSB substitution method is used to embed secret data. Experimental results show that the proposed method can embed a large amount of secret data while keeping very high visual quality, where the PSNR is guaranteed to be 37.54dB (k=3) and 43.94dB (k=2).

Multimedia Tools and Applications, 2014 (SCIE) (online)

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.

Multimedia Tools and Applications 2014 (SCIE) (online)

Data hiding in two-colour images is difficult since 1 pixel requires only 1 bit representation and it is easy to detect for pixel distortion. In this paper, we describe a new data hiding method for two-colour images by two-stage referencing. The cover image is partitioned into n x n non-overlapping sub-blocks, and we calculate difference values by two stages for all pixels to find the suitable replacement pixel. The two-stage referencing is to obtain difference values that are different with the current pixel value for neighbouring pixels with n x n and
(n+2) x (n+2). These two difference values are used to embed a secret bit on the sub-block. The experimental results show that the proposed method achieves a good visual quality for the stego-image.

The Imaging Science Journal, vol. 61 (2013) 475-483 (SCI)
ISSN : 1368-2199 (http://www.maney.co.uk)

  Data hiding in binary images is difficult since only 1 bit is used to represent 1 pixel and distortion is conspicuous. In this paper, we propose a data hiding method in binary images by checking the bit position and parity bit to hide a secret bit in binary images. The cover image is divided intoM6N sub-blocks and the parity bit of sub-block pixels are referenced to embed a secret bit for the suitable pixel. By finding the suitable pixel position to insert a secret bit for each sub-block, the image quality of the stego-image can be improved, while maintaining a low computational complexity. The experimental results show that the proposed method has a higher capacity and better visual quality as increasing a size of sub-block.

The Imaging Science Journal, Volume 60, 2012, pp. 329-337 (SCI)

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. 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 Imaging Science Journal, Vol. 58, 2010, pp.213~221 (SCI)
ISSN : 1368-2199 (http://www.maney.co.uk)

The EMD method proposed by Zhang and Wang fully exploited modification directions. Modifications in different directions were used to represent different secret data, where only one secret digit is embedded for each two pixels. To improve an embedding capacity, Chang et al. proposed two-stage EMD method, Lee et al. restricted to 8-ary embedding for the EMD method, and also Lee et al. segmented the pair of cover data into two parts to embed higher secret data. But still have a room for hiding more secret data. This paper proposes an improved method of the EMD method to hide more secret data while maintaining a high PSNR value. The proposed method can embed secret bit on every pixel of cover data.

International Journal of Signal Processing, Image Processing and Pattern, Vol. 2, No.1, March, 2009. pp. 79-88

Secret data hiding in binary images is more difficult than other formats since binary images require only one bit representation to indicate black and white. This study proposes a new method for data hiding in binary images using optimized bit position to replace a secret bit. This method manipulates blocks, which are sub-divided. The parity bit for a specified block decides whether to change or not, to embed a secret bit. By finding the best position to insert a secret bit for each divided block, the image quality of the resulting stego-image can be improved, while maintaining low computational complexity.

Journal of Software Engineering and Applications, April 2009 pp. 20-24

We have proposed two data hiding methods based on the RLM encoding. All of the proposed method used the length of the location, which compared the run length of the cover data and that of the secret data. The RLM method used the run length table constructed from the cover and secret data, whereas the RRLM method used the difference value of the cover and secret data before making the run length encoding table. Our experimental results have shown that the proposed methods provided a better way to hide secret data compared with four other methods.

International Journal of Intelligent Information and Database Systems, Vol. 3, No. 3, 2009, pp.311–325 (SCOPUS)

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.

Computer Standards & Interfaces, volume 31, Issue 2 (Feb 2009) pp. 465-470 (SCIE)