• Journal of the Korea Society of Computer and Information
• /
• v.21 no.8
• /
• pp.1-12
• /
• 2016

In this paper, we propose a very efficient reversible data hiding algorithm using spatial locality and the surface characteristics of image. Spacial locality and a variety of surface characteristics are present in natural images. So, it is possible to precisely predict the pixel value using the locality and surface characteristics of image. Therefore, the frequency is increased significantly at the peak point of the difference histogram using the precisely predicted pixel values. Thus, it is possible to increase the amount of data to be embedded in image using the spatial locality and surface characteristics of image. By using the proposed reversible data hiding algorithm, visually high quality stego-image can be generated, the embedded data and the original cover image can be extracted without distortion from the stego-image, and the embedding data are much greater than that of the previous algorithm. The experimental results show the superiority of the proposed algorithm.

• Journal of the Korea Society of Computer and Information
• /
• v.21 no.2
• /
• pp.33-42
• /
• 2016

In this paper, an advanced reversible data hiding algorithm which takes the advantage of the spatial locality in image was proposed. Natural image has a spatial locality. The pixel value of a natural image is similar to the values of neighboring pixels. So, using the neighboring pixel values, it is possible to precisely predict the pixel value. Frequency increases significantly at the peak point of the difference histogram using the predicted values. Therefore, it is possible to increase the amount of data to be embedded. By using the proposed algorithm, visually high quality stego-image can be generated, the original cover image and the embedded data can be extracted from the stego-image without distortion. The embedding data into the cover image of the proposed algorithm is much lager than that of the previous algorithm. The performance of the proposed algorithm was verified by experiment. The proposed algorithm is very useful for the reversible data hiding.

• ETRI Journal
• /
• v.33 no.4
• /
• pp.580-588
• /
• 2011

This paper proposes reversible data hiding using minimum/maximum preserved overflow/underflow avoidance (MMPOUA). The proposed MMPOUA algorithm consists of three main steps. These steps include the minimum (or maximum) pixel fixing, pixel squeezing, and pixel isolation. The aims of pixel fixing are to keep the minimum (or maximum) pixel of a host block unchanged and prevent the occurrence of overflow/underflow. Both the pixel squeezing and pixel isolation supply hiding storage while keeping the amount of distortion low. The proposed method can avoid (or significantly reduce) the overhead bits used to overcome overflow/underflow issues. At an embedding rate of 0.15 bpp, the proposed algorithm can achieve a PSNR value of 48.52 dB, which outperforms several existing reversible data hiding schemes. Furthermore, the algorithm performed well in a variety of images, including those in which other algorithms had difficulty obtaining good hiding storage with high perceived quality.

• ETRI Journal
• /
• v.34 no.3
• /
• pp.429-438
• /
• 2012

This study presents two reversible data hiding schemes based on the coefficient shifting (CS) algorithm. The first scheme uses the CS algorithm with a mean predictor in the spatial domain to provide a large payload while minimizing distortion. To guard against manipulations, the second scheme uses a robust version of the CS algorithm with feature embedding implemented in the integer wavelet transform domain. Simulations demonstrate that both the payload and peak signal-to-noise ratio generated by the CS algorithm with a mean predictor are better than those generated by existing techniques. In addition, the marked images generated by the variant of the CS algorithm are robust to various manipulations created by JPEG2000 compression, JPEG compression, noise additions, (edge) sharpening, low-pass filtering, bit truncation, brightness, contrast, (color) quantization, winding, zigzag and poster edge distortion, and inversion.

• Journal of KIISE:Software and Applications
• /
• v.37 no.6
• /
• pp.417-429
• /
• 2010

Reversible watermarking inserts watermark into digital media in such a way that visual transparency is preserved and then enables to restore the original media from the marked one without any loss of media quality. This watermarking can be applied to quality-sensitive imaging such as medical imaging, military imaging, remote-sensing imaging, and precious artwork, where the original media should be preserved during image processing and analysis. In this paper, a reversible image watermarking technique that embeds message bits by modifying the differential histogram of adjacent pixels is presented. In order to satisfy both high embedding capacity and visual quality, the proposed technique exploits the fact that adjacent pixels in the image have highly spatial correlation. Also, we prevent overflow/underflow problem and salt-and-pepper artifacts by employing a predicted error compensation scheme. Through experiments using various test images, we prove that the presented technique provides perfect reversibility and high embedding capacity, while maintaining the induced-distortion low.

• Journal of Electrical Engineering and Technology
• /
• v.10 no.1
• /
• pp.422-428
• /
• 2015

This paper proposes a high performance reversible watermarking (RW) scheme based on a novel compensation strategy. RW embeds data into a host image by modifying its pixel values slightly. It is found that certain modified pixels can be compensated to their original values during the proposed embedding procedure. The compensation effect in the RW scheme can improve the marked image quality significantly. By incorporating the pixel selection method, a higher quality image is obtained, which is verified by extensive experiments.

• Journal of The Institute of Information and Telecommunication Facilities Engineering
• /
• v.5 no.1
• /
• pp.37-42
• /
• 2006

A reversible audio watermarking algorithm is presented in this paper. This algorithm transforms the audio signal with the integer wavelet transform first in order to enhance the correlation between neighbor audio samples. Audio signal has low correlation between neighbor samples, which makes it difficult to apply difference expansion scheme. Second, a novel difference expansion scheme is used to embed more data by reducing the size of location map. Therefore, the difference expansion scheme used in this paper theoretically secures high embedding capacity under low perceptual distortion. Experiments show that this scheme can hide large number of information bits and keeps high perceptual quality.

• Proceedings of the IEEK Conference
• /
• 2006.06a
• /
• pp.407-408
• /
• 2006

In this paper, we propose a new reversible image authentication technique based on watermarking where if the image is authentic, the distortion due to embedding can be completely removed from the watermarked image after the hidden data has been extracted. This technique utilizes histogram characteristics of the difference image and modifies pixel values slightly to embed more data than other reversible data hiding algorithm. The proposed scheme is quite simple and the execution time is rather short. Experimental results demonstrate that the proposed scheme can detect any modifications of the watermarked image.

• Journal of Broadcast Engineering
• /
• v.16 no.5
• /
• pp.801-810
• /
• 2011

This paper proposes a new lossless data embedding algorithm on spatial domain of digital images. A single key parameter is required to embed and extract data in the algorithm instead of embedding any additional information such as the location map. A $3{\times}3$ window slides over the cover image by one pixel unit, and one bit can be embedded at each position of the window. So, the ideal embedding capacity equals to the number of pixels in an image. For further increase of embedding capacity, new weight parameters for the estimation of embedding target pixels have been used. As a result, significant increase in embedding capacity and better quality of the message-embedded image in high capacity embedding have been achieved. This algorithm is verified with simulations.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.1
• /
• pp.269-281
• /
• 2014

Compared to hiding information into digital image, hiding information into digital text file requires less storage space and smaller bandwidth for data transmission, and it has obvious universality and extensiveness. However, text files have low redundancy, so it is more difficult to hide information in text files. To overcome this difficulty, Wang et al. proposed a reversible information hiding scheme using left-right and up-down representations of Chinese characters, but, when the scheme is implemented, it does not provide good visual steganographic effectiveness, and the embedding and extracting processes are too complicated to be done with reasonable effort and cost. We observed that a lot of traditional and simplified Chinese characters look somewhat the same (also called lookalike), so we utilize this feature to propose a novel information hiding scheme for hiding secret data in lookalike Chinese characters. Comparing to Wang et al.'s scheme, the proposed scheme simplifies the embedding and extracting procedures significantly and improves the effectiveness of visual steganographic images. The experimental results demonstrated the advantages of our proposed scheme.