• 방송공학회논문지
• /
• 제12권2호
• /
• pp.112-119
• /
• 2007

Reversible data embedding theory has marked a new epoch for data hiding and information security. Being reversible, the original data and the embedded data as well should be completely restored. Difference expansion transform is a remarkable breakthrough in reversible data hiding scheme. The difference expansion method achieves high embedding capacity and keeps the distortion low. This paper shows that the difference expansion method with simplified location map, and new expandability and changeability can achieve more embedding capacity while keeping the distortion almost the same as the original expansion method.

• 한국멀티미디어학회논문지
• /
• 제20권2호
• /
• pp.261-270
• /
• 2017

Data hiding is a way to hide the information in multimedia media such as images or video. The scheme proposed by Nguyen and Chang, was able to embed, extract, and restore the cover image and the secret data using Sudoku. But in the extracting phase, the occurrence of duplicate values in the reference matrix was found to decrease the embedding capacity of secret data. This paper has proposed a reversible data hiding scheme while maintaining the quality of the image to provide high embedding capacity using $7{\times}7$ Sudoku and Shamir's secret sharing scheme.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제6권8호
• /
• pp.1964-1981
• /
• 2012

In this paper a reversible data hiding scheme based on histogram shifting of host image blocks is presented. This method attempts to use full available capacity for data embedding by dividing the image into non-overlapping blocks. Applying histogram shifting to each block requires that extra information to be saved as overhead data for each block. This extra information (overhead or bookkeeping information) is used in order to extract payload and recover the block to its original state. A method to eliminate the need for this extra information is also introduced. This method uses maximum gap that exists between histogram bins for finding the value of pixels that was used for embedding in sender side. Experimental results show that the proposed method provides higher embedding capacity than the original reversible data hiding based on histogram shifting method and its improved versions in the current literature while it maintains the quality of marked image at an acceptable level.

• 전자공학회논문지CI
• /
• 제49권2호
• /
• pp.103-114
• /
• 2012

공간 도메인에서 많은 DE 기반의 가역정보은닉 기법과 히스토그램 쉬프팅 기반의 가역정보은닉 기법들이 제안되어 왔다. 히스토그램 쉬프팅 기반의 가역정보은닉 기법은 스테고 이미지의 왜곡이 적다는 장점을 갖는다. 하지만 비밀 데이터의 삽입용량이 적고, 추가 데이터가 많다는 단점이 있다. 이에 반해, DE 기반의 가역정보은닉 기법은 높은 삽입 용량을 갖는다는 장점이 있지만 스테고 이미지의 왜곡이 많다는 단점이 있다. 본 논문에서는 삽입 용량을 유지하지만 스테고 이미지의 왜곡을 줄이는 DE 기반의 가역정보은닉 기법을 제안한다. 본 논문에서는 비밀 데이터를 삽입하기 전에 예측 오차들을 블록으로 나눈 후, 각 블록에 비밀 데이터를 삽입할 수 있는지 확인한다. 만약 블록에한 비트의 비밀 데이터만이라도 삽입하면 블록의 픽셀들은 변화한다. 제안하는 기법은 PSNR이 50dB 이상으로 다른 DE 기반의 가역정보은닉 기법보다 스테고 이미지의 왜곡을 줄인다.

• 한국컴퓨터정보학회논문지
• /
• 제23권8호
• /
• pp.75-84
• /
• 2018

In this research, a bit correction technique of data hiding method in timestamp of MFT entry in NTFS file system is proposed. This method is proposed in two ways, depending on the number of bytes of data to hide. A basic data hiding method using a bit correction technique to solve the problems of the conventional 2-byte technique is proposed. In order to increase the capacity of the data, a 3-byte data hiding method using an extended bit correction technique is proposed. The data hiding method in the timestamps is based on the fact that is not revealed in the Windows explorer window and the command prompt window even if any data is hidden in the timestamp area of less than one second. It is shown that the validity of the proposed method through the experimental two cases of the basic data hiding method by the bit correction method and the 3-byte data hiding method by the extended bit correction method.

• International Journal of Internet, Broadcasting and Communication
• /
• 제16권1호
• /
• pp.11-16
• /
• 2024

Illegal manipulation and alteration of digital content are becoming a social issue. To address this problem, there is an increasing demand for the development of technologies to prevent the manipulation and alteration of digital content. This paper proposes a data hiding algorithm capable of embedding a larger amount of confidential data in the original cover image while minimizing the degradation of image quality in stego images. The algorithm presented in this paper analyzes the characteristics of the image to extract corner points and then uses a method to insert watermarks around these extracted corner points. Additionally, through experimentation, it has been proven that this algorithm can insert a greater amount of watermark without degrading the image quality compared to other existing algorithms.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권1호
• /
• pp.570-595
• /
• 2017

Robust and perceptually-adaptive image watermarking algorithms have mainly targeted gray-scale images either at the modeling or embedding levels despite the widespread availability of color images. Only few of the existing algorithms are specifically designed for color images where color correlation and perception are constructively exploited. In this paper, a new perceptual and high-capacity color image watermarking solution is proposed based on the extension of Tsui et al. algorithm. The $CIEL^*a^*b^*$ space and the spatio-chromatic Fourier transform (SCFT) are combined along with a perceptual model to hide watermarks in color images where the embedding process reconciles between the conflicting requirements of digital watermarking. The perceptual model, based on an emerging color image model, exploits the non-uniform just-noticeable color difference (NUJNCD) thresholds of the $CIEL^*a^*b^*$ space. Also, spread-spectrum techniques and semi-random low-density parity check codes (SR-LDPC) are used to boost the watermark robustness and capacity. Unlike, existing color-based models, the data hiding capacity of our scheme relies on a game-theoretic model where upper bounds for watermark embedding are derived. Finally, the proposed watermarking solution outperforms existing color-based watermarking schemes in terms of robustness to standard image/color attacks, hiding capacity and imperceptibility.

• Journal of Electrical Engineering and Technology
• /
• 제11권4호
• /
• pp.974-986
• /
• 2016

Reversible image watermarking, a type of digital data hiding, is capable of recovering the original image and extracting the hidden message with precision. A number of reversible algorithms have been proposed to achieve a high embedding capacity and a low distortion. While numerous algorithms for the achievement of a favorable performance regarding a small embedding capacity exist, the main goal of this paper is the achievement of a more favorable performance regarding a larger embedding capacity and a lower distortion. This paper therefore proposes a reversible data hiding algorithm for which a novel piecewise 2D auto-regression (P2AR) predictor that is based on a rhombus-embedding scheme is used. In addition, a minimum description length (MDL) approach is applied to remove the outlier pixels from a training set so that the effect of a multiple linear regression can be maximized. The experiment results demonstrate that the performance of the proposed method is superior to those of previous methods.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제6권4호
• /
• pp.1248-1266
• /
• 2012

This paper presents a multilevel reversible data hiding method based on histogram shifting which can recover the original image losslessly after the hidden data has been extracted from the stego-image. The method of prediction is adopted in our proposed scheme and prediction errors are produced to explore the similarity of neighboring pixels. In this article, we propose two different predictors to generate the prediction errors, where the prediction is carried out using the center prediction method and the JPEG-LS median edge predictor (MED) to exploit the correlation among the neighboring pixels. Instead of the original image, these prediction errors are used to hide the secret information. Moreover, we also present an improved method to search for peak and zero pairs and also talk about the analogy of the same to improve the histogram shifting method for huge embedding capacity and high peak signal-to-noise ratio (PSNR). In the one-level hiding, our method keeps image qualities larger than 53 dB and the ratio of embedding capacity has 0.43 bpp (bit per pixel). Besides, the concept with multiple layer embedding procedure is applied for obtaining high capacity, and the performance is demonstrated in the experimental results. From our experimental results and analytical reasoning, it shows that the proposed scheme has higher PSNR and high data embedding capacity than that of other reversible data hiding methods presented in the literature.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제14권1호
• /
• pp.404-421
• /
• 2020

A reversible data hiding scheme in JPEG compressed bitstreams is proposed, which could avoid decoding failure and file expansion by means of removing of bitstreams corresponding to high frequency coefficients and embedding of secret data in file header as comment part. We decode original JPEG images to quantified 8×8 DCT blocks, and search for a high frequency as an optimal termination point, beyond which the coefficients are set to zero. These blocks are separated into two parts so that termination point in the latter part is slightly smaller to make the whole blocks available in substitution. Then spare space is reserved to insert secret data after comment marker so that data extraction is independent of recovery in receiver. Marked images can be displayed normally such that it is difficult to distinguish deviation by human eyes. Termination point is adaptive for variation in secret size. A secret size below 500 bits produces a negligible distortion and a PSNR of approximately 50 dB, while PSNR is also mostly larger than 30 dB for a secret size up to 25000 bits. The experimental results show that the proposed technique exhibits significant advantages in computational complexity and preservation of file size for small hiding capacity, compared to previous methods.