• The KIPS Transactions:PartB
• /
• v.19B no.1
• /
• pp.9-18
• /
• 2012

Many audio watermarking researches which have been adapted to authenticate contents can not recover the original media after watermark removal. Therefore, reversible watermarking can be regarded as an effective method to ensure the integrity of audio data in the applications requiring high-confidential audio contents. Reversible watermarking inserts watermark into digital media in such a way that perceptual transparency is preserved, which enables the restoration of the original media from the watermarked one without any loss of media quality. This paper presents a new interval-based audio integrity authentication algorithm which can detect malicious tampering. To provide complete reversibility, we used differential histogram-based reversible watermarking. To authenticate audio in parts, not the entire audio at once, the proposed algorithm processes audio by dividing into intervals and the confirmation of the authentication is carried out in each interval. Through experiments using multiple kinds of test data, we prove that the presented algorithm provides over 99% authenticating rate, complete reversibility, and higher perceptual quality, while maintaining the induced-distortion low.

• The KIPS Transactions:PartB
• /
• v.17B no.4
• /
• pp.275-286
• /
• 2010

Reversible watermarking which can preserve the original quality of the digital contents and protect the copyright has been studied actively. Especially, in medical, military, and art fields, the need for reversible watermarking is increasing. This paper proposes a high-capacity reversible watermarking through predicted error expansion and error estimation compensation. Watermark is embedded by expanding the difference histogram between the original value and the predicted value. Differently from previous methods calculating the difference between adjacent pixels, the presented method calculates the difference between the original value and the predicted value, and that increases the number of the histogram value, where the watermark is embedded. As a result, the high capacity is achieved. The inserted watermark is extracted by restoring the histogram between the original value and the predicted value. To prove the performance, the presented algorithm is compared with other previous methods on various test images. The result supports that the presented algorithm has a perfect reversibility, a high image quality, and a high capacity.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.48 no.2
• /
• pp.32-40
• /
• 2011

Reversible data hiding, which can recover the original image without any distortion after the extraction of the hidden data, has drawn considerable attention in recent years. However, underflow and overflow problems have occurred occasionally in the embedded image. To overcome these problems, we propose a new reversible data hiding algorithm which embeds a compressed location map used to identify these underflow and overflow points. In addition, the proposed algorithm allows for multilevel data hiding to increase the hiding capacity. The simulation results demonstrate that the proposed algorithm generates good performances in the PSNR, the embedding capacity, and the size of side information.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.52 no.11
• /
• pp.66-78
• /
• 2015

With the development of bio computing technology, DNA watermarking to do as a medium of DNA information has been researched in the latest time. However, DNA information is very important in biologic function unlikely multimedia data. Therefore, the reversible DNA watermarking is required for the host DNA information to be perfectively recovered. This paper presents a reversible DNA watermarking using least square based prediction error expansion for noncodng DNA sequence. Our method has three features. The first thing is to encode the character string (A,T,C,G) of nucleotide bases in noncoding region to integer code values by grouping n nucleotide bases. The second thing is to expand the prediction error based on least square (LS) as much as the expandable bits. The last thing is to prevent the false start codon using the comparison searching of adjacent watermarked code values. Experimental results verified that our method has more high embedding capacity than conventional methods and mean prediction method and also makes the prevention of false start codon and the preservation of amino acids.

• Asia pacific journal of information systems
• /
• v.26 no.3
• /
• pp.427-448
• /
• 2016

The stochastic phenomena of traffic network condition, such as traffic speed and density, are affected not only by exogenous traffic control but also by endogenous changes in service time during congestion. In this paper, we propose a mixed M/G/1 queuing model by introducing a condition-varying parameter of traffic congestion to reflect structural changes in the traffic network. We also develop congestion indices to evaluate network efficiency in terms of traffic flow and economic cost in traffic operating system using structure-changing queuing model, and perform scenario analysis according to various traffic network improvement policies. Empirical analysis using Korean highway traffic operating system shows that our suggested model better captures structural changes in the traffic queue. The scenario analysis also shows that occasional reversible lane operation during peak times can be more efficient and feasible than regular lane extension in Korea.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.52 no.7
• /
• pp.51-62
• /
• 2015

Of recent interests on high capacity DNA storage, DNA watermarking for DNA copyright protection, and DNA steganography for DNA secret communication are augmented, the reversible DNA watermarking is much needed both to embed the watermark without changing the functionality of organism and to perfectly recover the host DNA sequence. In this paper, we address two ways of DE based reversible DNA watermarking using noncoding DNA sequence. The reversible DNA watermarking should consider the string structure of a DNA sequence, the organism functionality, the perfect recovery, and the high embedding capacity. We convert the string sequence of four characters in noncoding region to the decimal coded values and embed the watermark bit into coded values by two ways; DE based multiple bits embedding (DE-MBE) using pairs of neighbor coded values and consecutive DE-MBE (C-DE-MBE). Two ways process the comparison searching to prevent the false start codon that produces false coding region. Experimental results verified that our ways have more high embedding capacity than conventional methods and produce no false start codon and recover perfectly the host sequence without the reference sequence. Especially C-DE-MBE can embed more high two times than DE-MBE.

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

• Journal of the Institute of Electronics and Information Engineers
• /
• v.51 no.4
• /
• pp.69-75
• /
• 2014

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 $2{\times}2$ 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.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2007.02a
• /
• pp.127-133
• /
• 2007

We propose new reversible watermarking method for images. Being reversibility, original image and watermarked message should be recovered exactly. We propose different technique for hiding data to pairs. We use new type of histogram (pair histogram), which shows frequencies of each pair in image. We use histogram shift method for data embedding to pairs. We also propose improved version of method which allow hiding data with good performance for high capacities. This algorithm has better result compare to Tian's difference expansion method based on the Haar wavelet decomposition. For proposed algorithm capacity is higher under same PSNR.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.10a
• /
• pp.415-417
• /
• 2004

저작권보호를 목적으로 사용하는 워터마킹 기술은 원본 이미지에 특정 워터마크 정보를 삽입하는데 이러한 경우, 원본이미지는 다시 복구할 수 없다. 의료영상 데이터베이스나 군사용 이미지 시스템과 같은 특정된 응용에서는 이미지 열화가 시스템 전체에 미치는 영향이 크기 때문에 이러한 워터마크 알고리즘을 사용할 수 없다. 본 연구에서는 Hadamard Matrix(HM)을 이용하여 디지털 이미지에 워터마크를 삽입하며, 가역적인 연산에 기초하여 원 이미지의 복구가 가능하도록 워터마크 알고리즘을 개발한다. 본 연구에서는 Hadamard Coefficients의 규칙적인 연관성을 이용하여 2D HM을 알고리즘 개발에 적용한다.