• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.4
• /
• pp.856-873
• /
• 2011

Reversible watermarking is an open problem in information hiding field, with embedding the encoded bit '1' or '0' into some sensitive images, such as the law enforcement, medical records and military images. The technique can retrieve the original image without distortion, after the embedded message has been extracted. Histogram-based scheme is a remarkable breakthrough in reversible watermarking schemes, in terms of high embedding capacity and low distortion. This scheme is lack of capacity control due to the requirement for embedding large-scale data, because the largest hidden capacity is decided by the amount of pixels with the peak point. In this paper, we propose a reversible watermarking scheme to enlarge the number of pixels with the peak point as large as possible. This algorithm is based on an adaptive edge-guided interpolation, furthermore, hides messages by interpolation-error, i.e. the difference between the original and interpolated image value. Simulation results compared with other state-of-the-art reversible watermarking schemes in this paper demonstrate the validity of the proposed algorithm.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.23 no.3
• /
• pp.359-370
• /
• 2013

Lin and Chan proposed a reversible secret image sharing scheme in 2010. The advantages of their scheme are as follows: the low distortion ratio, high embedding capacity of shadow images and usage of the reversible. However, their scheme has some problems. First, the number of participants is limited because of modulus prime number m. Second, the overflow can be occurred by additional operations (quantized value and the result value of polynomial) in the secret sharing procedure. Finally, if the coefficient of (t-1)th degree polynomial become zero, (t-1) participants can access secret data. In this paper, an improved reversible secret image sharing scheme which solves the problems of Lin and Chan's scheme while provides the low distortion ratio and high embedding capacity is proposed. The proposed scheme solves the problems that are a limit of a total number of participants, and occurrence of overflow by new polynomial operation over GF($2^8$). Also, it solve problem that the coefficient of (t-1)th degree polynomial become zero by fixed MSB 4-bit constant. In the experimental results, PSNR of their scheme is decreased with the increase of embedding capacity. However, even if the embedding capacity increase, PSNR value of about 45dB or more is maintained uniformly in the proposed scheme.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.4 no.4
• /
• pp.655-670
• /
• 2010

To be reversible as a data hiding method, the original content and hidden message should be completely recovered. One important objective of this approach is to achieve high embedding capacity and low distortion. Using predicted errors is very effective for increasing the embedding capacity. Sorting the predicted errors has a good influence on decreasing distortion. In this paper, we present an improved reversible data hiding scheme using upgraded histogram shifting based on sorting the predicted errors. This new scheme is characterized by the algorithm which is able to find the optimum threshold values and manage the location map effectively. Experimental results compared with other methods are presented to demonstrate the superiority of the proposed method.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.9
• /
• pp.3348-3364
• /
• 2021

Magic matrix-based data hiding schemes are applied to transmit secret information through open communication channels safely. With the development of various magic matrices, some higher dimensional magic matrices are proposed for improving the security level. However, with the limitation of computing resource and the requirement of real time processing, these higher dimensional magic matrix-based methods are not advantageous. Hence, a kind of data hiding scheme based on a single or a group of multi-dimensional flexible magic matrices is proposed in this paper, whose magic matrix can be expanded to higher dimensional ones with less computing resource. Furthermore, an adaptive mechanism is proposed to reduce the embedding distortion. Adapting to the secret data, the magic matrix with least distortion is chosen to embed the data and a marker bit is exploited to record the choice. Experimental results confirm that the proposed scheme hides data with high security and a better visual quality.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.43 no.4 s.310
• /
• pp.27-36
• /
• 2006

Lossless data embedding is a method to insert information into a host image that guarantees complete restoration when the extraction has been done. In this paper, we propose a noble reversible data embedding algorithm for images in wavelet domain. The proposed embedding technique, which modifies histogram of wavelet coefficient, is composed of two inserting steps. Data is embedded to wavelet coefficient using modification of histogram in first embedding process. Second embedding step compensates the distortion caused by the first embedding process as well as hides more information. Hence we achieve higher inserting capacity. In view of the relationship between the embedding capacity and the PSNR value, our proposed method shows considerably higher performance than the current reversible data embedding methods.

• Proceedings of the IEEK Conference
• /
• 2002.07a
• /
• pp.172-175
• /
• 2002

This paper presents perceptual model with a stochastic rnultiresolution characteristic that can be applied with watermark embedding in the biorthogonal wavelet domain. The perceptual model with adaptive watermarking algorithm embed at the texture and edge region for more strongly embedded watermark by the SSQ(successive subband quantization). The watermark embedding is based on the computation of a NVF(noise visibility function) that have local image properties. This method uses non-stationary Gaussian model stationary Generalized Gaussian model because watermark has noise properties. In order to determine the optimal NVF, we consider the watermark as noise. The particularities of embedding in the stationary GG model use shape parameter and variance of each subband regions in multiresolution. To estimate the shape parameter, we use a moment matching method. Non-stationary Gaussian model use the local mean and variance of each subband. The experiment results of simulation were found to be excellent invisibility and robustness. Experiments of such distortion are executed by Stirmark benchmark test.

• Journal of Korea Multimedia Society
• /
• v.8 no.6
• /
• pp.783-789
• /
• 2005

This paper is proposed a watermarking technique for copyright protection of multimedia contents. We proposed adaptive watermark detection algorithm using stochastic perceptual model and statistical decision method in DMWT(discrete multi wavelet transform) domain. The stochastic perceptual model calculates NVF(noise visibility function) based on statistical characteristic in the DMWT. Watermark detection algorithm used the likelihood ratio depend on Bayes' decision theory by reliable detection measure and Neyman-Pearson criterion. To reduce visual artifact of image, in this paper, adaptively decide the embedding number of watermark based on DMWT, and then the watermark embedding strength differently at edge and texture region and flat region embedded when watermark embedding minimize distortion of image. In experiment results, the proposed statistical decision method based on multiwavelet domain could decide watermark detection.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.13 no.2
• /
• pp.268-274
• /
• 2010

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

• Journal of The Institute of Information and Telecommunication Facilities Engineering
• /
• v.10 no.2
• /
• pp.46-52
• /
• 2011

This paper presents adaptive spread-spectrum watermarking scheme on the H.264/AVC video. The H.264/AVC has become popular video coding since it's compression performance has been improved greatly. That is why there is not enough space for embedding watermark using the spread-spectrum method. To overcome this problem, we propose selective block embedding scheme. The blocks which don't contain non-zero DCT (Discrete Cosine Transform) coefficients are selected by value. So we have enough space to embed watermarks. Experimental result shows that proposed scheme improves recovery rates of watermark about 12% and reduces distortion of watermarked video.

• Journal of Korea Society of Industrial Information Systems
• /
• v.14 no.3
• /
• pp.37-43
• /
• 2009

Steganography conceals the fact that hidden message is being sent on the internet. Steganalysis can be detected the abrupt changes in the statistics of a stego-data. After message embedding, I have analyzed for the statistical significance of the fact the occurrence of differences among the four-neighboring pixels. In this case, when a embedding messages within a images is small, use EC value and chi-square test to determine whether a distribution in an images matches a distribution that shows distortion from stego-data.