• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.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.

• Journal of Korea Multimedia Society
• /
• v.17 no.7
• /
• pp.849-857
• /
• 2014

In this paper, we propose a (2,2)-reversible secret image sharing scheme using histogram shifting and difference expansion. Two techniques are widely used in information hiding. Advantages of them are the low distortion between cover and stego images, and high embedding capacity. In secret image sharing procedure, unlike Shamir's secret sharing, a histogram generate that the difference value between the original image and copy image is computed by difference expansion. And then, the secret image is embedded into original and copy images by using histogram shifting. Lastly, two generated shadow images are distributed to each participant by the dealer. In the experimental results, we measure a capacity of a secret image and a distortion ratio between original image and shadow image. The results show that the embedding capacity and image distortion ratio of the proposed scheme are superior to the previous schemes.

• Journal of Korea Multimedia Society
• /
• v.20 no.2
• /
• pp.244-253
• /
• 2017

Reversible DNA watermarking is capable of continuous DNA storage and forgery prevention, and has the advantage of being able to analyze biological mutation processes by external watermarking by iterative process of concealment and restoration. In this paper, we propose a reversible DNA watermarking method based on histogram multiple shifting of noncoding DNA sequence that can prevent false start codon, maintain original sequence length, maintain high watermark capacity without biologic mutation. The proposed method transforms the non-coding region DNA sequence to the n-th code coefficients and embeds the multiple bits of the n-th code coefficients by the non-recursive histogram multiple shifting method. The multi-bit embedding process prevents the false start codon generation through comparison search between adjacent concealed nucleotide sequences. From the experimental results, it was confirmed that the proposed method has higher watermark capacity of 0.004-0.382 bpn than the conventional method and has higher watermark capacity than the additional data. Also, it was confirmed that false start codon was not generated unlike the conventional method.

• ETRI Journal
• /
• v.39 no.1
• /
• pp.76-86
• /
• 2017

In this study, we propose an automatic contrast enhancement method based on transfer function modification (TFM) by histogram equalization. Previous histogram-based global contrast enhancement techniques employ histogram modification, whereas we propose a direct TFM technique that considers the mean brightness of an image during contrast enhancement. The mean point shifting method using a transfer function is proposed to preserve the mean brightness of an image. In addition, the linearization of transfer function technique, which has a histogram flattening effect, is designed to reduce visual artifacts. An attenuation factor is automatically determined using the maximum value of the probability density function in an image to control its rate of contrast. A new quantitative measurement method called sparsity of a histogram is proposed to obtain a better objective comparison relative to previous global contrast enhancement methods. According to our experimental results, we demonstrated the performance of our proposed method based on generalized measures and the newly proposed measurement.

• 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.

• Journal of Korea Multimedia Society
• /
• v.15 no.5
• /
• pp.639-650
• /
• 2012

In 2009, Tsai et al. proposed reversible image hiding scheme using linear prediction coding and histogram shifting. Tsai et al.'s scheme improved the hiding capacity of Ni et al.'s scheme by using the prediction coding and two histograms. However, Tsai et al.'s scheme has problems. In the prediction coding, the basic pixel is not used from embedding procedure. Many additional communication data are generated because two peak and zero point pairs are generated by each block. To solve the problems, this paper proposes a novel reversible data hiding scheme based on modulo operation and histogram shifting. In experimental results, the hiding capacity was increased by 28% than Tsai et al.'s scheme. However, the additional communication data was decreased by 71%.

• Journal of Korea Multimedia Society
• /
• v.13 no.1
• /
• pp.76-82
• /
• 2010

Reversible watermarking hides some information in a digital image in such a way that an authorized party could decode the hidden information and also restore the image to its original state. In this paper, a high capacity reversible watermarking method using histogram shifting is proposed. In order to increase embedding capacity, the proposed method divides the image into $2{\times}2$ blocks and uses a paring(horizontal, vertical, diagonal) inside each block, then finds a maximum embedding bin which has the most frequent difference values among the parings. Also, the proposed method removes the overflow and underflow by using location map which including the maximum embedding bin and increases the embedding capacity by embedding iteratively. The experimental results show that the proposed method provides a high embedding capacity and good visual quality compared with the conventional reversible watermarking methods.

• The KIPS Transactions:PartC
• /
• v.14C no.1 s.111
• /
• pp.39-44
• /
• 2007

In this paper, we propose a reversible watermarking method to recover an original image after the watermark has been extracted. Most watermarking algorithms cause degradation of image quality in original digital content in the process of embedding watermark. In the proposed algorithm, the original image can be obtained when the degradation is removed from the watermarked image after extracting watermark information. In the proposed method, we utilize histogram shifting concept and Location Map structure. We could solve the Filp-Flop problem by using Location Map structure and enlarge the information embedding capacity by embedding recursively. Experimental results demonstrate that the embedding information as large as 120k bits can be realized while the invisibility as high as 41dB can be maintained.

• Journal of Digital Contents Society
• /
• v.19 no.2
• /
• pp.371-376
• /
• 2018

In the system security technology, the information hiding field is developed as technologies for embedding information, which are generally used as contents media. The proposed technique is a technical steganography technique which uses a technique of concealing certain information through physical / statistical change of signal values of contents. Recently, there have been various studies based on histogram shifting in reversible data concealment. In multi - peak histogram shifting, the capacity of data concealment gradually increased by applying multiple peak histogram method. In this paper, we analyze the effect of concealment in terms of adopting the histogram shift method including skipping. In addition, we propose multi - branch data concealment as a general method to improve concealment capacity. The above proposal has proved to be an example using mathematical expressions, and further improvement measures could be derived.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.53 no.12
• /
• pp.67-75
• /
• 2016

DNA computing technology makes the interests on DNA storage and DNA watermarking / steganography that use the DNA information as a newly medium. DNA watermarking that embeds the external watermark into DNA information without the biological mutation needs the reversibility for the perfect recovery of host DNA, the continuous embedding and detecting processing, and the mutation analysis by the watermark. In this paper, we propose a reversible DNA watermarking based on circular histogram shifting of DNA code values with the prevention of false start codon, the preservation of DNA sequence length, and the high watermark capacity, and the blind detection. Our method has the following features. The first is to encode nucleotide bases of 4-character variable to integer code values by code order. It makes the signal processing of DNA sequence easy. The second is to embed the multiple bits of watermark into -order coded value by using circular histogram shifting. The third is to check the possibility of false start codon in the inter or intra code values. Experimental results verified the our method has higher watermark capacity 0.11~0.50 bpn than conventional methods and also the false start codon has not happened in our method.