King JUNG's History

This research was supported by Brain Pool program funded by the Ministry of Science and ICT through the National Research Foundation of Korea (No. 2018H1D3A2065993)

2018.7 ~ 2019.6

본 논문에서는 하나의 서브블럭내에서 픽셀값정렬과 예측오차확장기법을 확장한 새로운 가역 정보은닉기법을 제안한다. 각 2x2 서브블록에서 최소값 그룹과 최대값 그룹으로 나누고, 최소값 그룹에서는 제일 작은 값에 비밀자료를 숨기고, 최대값 그룹에서는 제일 큰 값에 비밀자료를 숨긴다. 제안한 알고리즘은 평균 13,900 비트의 삽입용량을 가지는데 이 결과는 31.39dB의 시각적인 왜곡을 유지하면서 기존 알고리즘보다 4,553 비트 더 많이 숨길 수 있음을 실험을 통해서 보여주고 있다.

A novel reversible data hiding method using pixel value ordering and prediction error expansion in the sub-block is resented in this paper. For each non-overlapping 2x2 sub-block, we divide into two groups. In the min group, the lowest value is changed to embed a secret bit and the highest value is changed in the max group. The experimental results show that the proposed method achieves a good visual quality and high capacity. The proposed method can embed 13,900 bits on average, it is higher 4,553 bits than the previous method and the visual quality is maintained 31.39dB on average.

전자공학회 논문지 제51권 제4호, 2014 745-751

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)

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)

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)