• Journal of Service Research and Studies
• /
• v.6 no.1
• /
• pp.71-81
• /
• 2016

An efficient reversible data hiding algorithm was proposed in this paper. The original image can be recovered from the stego-image without distortion during the embedded data are extracted from the stego-image. The embedding data are greater than that of the previous algorithm and the PSNR value of the stego-image is guaranteed to be greater than 48dB. The performance of the proposed algorithm was proved by experimental results.

• ETRI Journal
• /
• v.37 no.5
• /
• pp.990-1000
• /
• 2015

This paper presents an overlapping pattern substitution (PS) method. The original overlapping PS method as a reversible data hiding scheme works well with only four pattern pairs among fifteen possible such pairs. This paper generalizes the original PS method so that it will work well with an optimal pair from among the fifteen possible pattern pairs. To implement such an overlapping PS method, changeable and embeddable patterns are first defined. A class map is virtually constructed to identify the changeable and embeddable pairs. The run-lengths between consecutive least probable patterns are recorded. Experiments show that an implementation of our overlapping PS method works well with any possible type of pairs. Comparison results show that the proposed method achieves more embedding capacity, a higher PSNR value, and less human visual distortion for a given embedding payload.

• Journal of Information Processing Systems
• /
• v.19 no.6
• /
• pp.756-766
• /
• 2023

To effectively track the illegal use of digital images and maintain the security of digital image communication on the Internet, this paper proposes a reversible multipurpose image watermarking algorithm based on a deep residual network (ResNet) and perceptual hashing (also called MWR). The algorithm first combines perceptual image hashing to generate a digital fingerprint that depends on the user's identity information and image characteristics. Then it embeds the removable visible watermark and digital fingerprint in two different regions of the orthogonal separation of the image. The embedding strength of the digital fingerprint is computed using ResNet. Because of the embedding of the removable visible watermark, the conflict between the copyright notice and the user's browsing is balanced. Moreover, image authentication and traitor tracking are realized through digital fingerprint insertion. The experiments show that the scheme has good visual transparency and watermark visibility. The use of chaotic mapping in the visible watermark insertion process enhances the security of the multipurpose watermark scheme, and unauthorized users without correct keys cannot effectively remove the visible watermark.

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

• 한국정보통신설비학회:학술대회논문집
• /
• 2006.08a
• /
• pp.274-279
• /
• 2006

대부분의 컬러 영상들은 코드북의 일부분만으로 표현할 수 있는 영상의 영역이 상당히 크므로 이러한 특징을 이용하는 효율적인 Reversible 워터마킹 기법을 제안한다. 팔레트(컬러맵) 영상에서의 워터마킹 기술에 대한 연구는 많이 있지만 Reversibility에 대한 관심은 상대적으로 낮았다. 제안하는 기법은 가상적으로 확장한 코드북에 의한 압축 영역에서 동작한다. 확장된 코드북은 높은 Payload 용량을 가진다. Reversibility를 구현하면서 왜곡(Distortion)과 삽입용량(Embedding capacity)사이의 절충점을 실험을 통해 보인다.

• The KIPS Transactions:PartB
• /
• v.18B no.1
• /
• pp.1-10
• /
• 2011

Reversible watermarking inserts watermark into digital media in such a way that visual transparency is preserved, which enables the restoration of the original media from the watermarked one without any loss of media quality. It has various applications, where high capacity and high visual quality are major requirements. This paper presents a new effective multi-round embedding scheme for the differential histogram-based reversible watermarking that satisfies high capacity requirements of the application. The proposed technique exploits the row-column cross scanning to fully utilize the locality of images when multi-round embedding phase to the message inserted image. Through experiments using multiple kinds of test images, we prove that the presented algorithm provides 100% reversibility, effectiveness of multi-round embedding, and higher visual quality, while maintaining the induced-distortion low.

• KIPS Transactions on Software and Data Engineering
• /
• v.4 no.5
• /
• pp.231-240
• /
• 2015

Medical imagery require to protect the privacy with preserving the quality of the original contents. Therefore, reversible watermarking is a solution for this purpose. Previous researches have focused on general imagery and achieved high capacity and high quality. However, they raise a distortion over entire image and hence are not applicable to medical imagery which require to preserve the quality of the objects. In this paper, we propose a novel reversible watermarking for medical imagery, which preserve the quality of the objects and achieves high capacity. First, object and background region is segmented and then predicted error histogram-based reversible watermarking is applied for each region. For the efficient watermark embedding with small distortion in the object region, the embedding level at object region is set as low while the embedding level at background region is set as high. In experiments, the proposed algorithm is compared with the previous predicted error histogram-based algorithm in aspects of embedding capacity and perceptual quality. Results support that the proposed algorithm performs well over the previous algorithm.

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

• Journal of Korea Multimedia Society
• /
• v.16 no.7
• /
• pp.841-851
• /
• 2013

The infectious information hiding system(IIHS) is proposed for secure distribution of high quality video contents by applying optimized watermark embedding and detection algorithms to video codecs. And the watermark as infectious information is transmitted while target video is displayed or edited by codecs. This paper proposes a fast and effective reversible watermarking and infectious information generation for IIHS. Our reversible watermarking scheme enables video decoder to control video quality and watermark strength actively for by adding control code and expiration date with the watermark. Also, we designed our scheme with low computational complexity to satisfy it's real-time processing in a video codec, and to prevent time or frame delay during watermark detection and video restoration, we embedded one watermark and one side information within a macro-block. Experimental results verify that our scheme satisfy real-time watermark embedding and detection and watermark error is 0% after reversible watermark detection. Finally, we conform that the quality of restored video contens is almost same with compressed video without watermarking algorithm.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.12
• /
• pp.4024-4041
• /
• 2022

Robust reversible watermarking has attracted widespread attention in the field of information hiding in recent years. It should not only have robustness against attacks in transmission but also meet the reversibility of distortion-free transmission. According to our best knowledge, the most recent robust reversible watermarking methods adopt a single image as the carrier, which might lead to low efficiency in terms of carrier utilization. To address the issue, a novel dual-image robust reversible watermarking framework is proposed in this paper to effectively utilize the correlation between both carriers (namely dual images) and thus improve the efficiency of carrier utilization. In the dual-image robust reversible watermarking framework, a two-layer robust watermarking mechanism is designed to further improve the algorithm performances, i.e., embedding capacity and robustness. In addition, an optimization model is built to determine the parameters. Finally, the proposed framework is applied in different domains (namely domain-independent), i.e., Slantlet Transform and Singular Value Decomposition domain, and Zernike moments, respectively to demonstrate its effectiveness and generality. Experimental results demonstrate the superiority of the proposed dual-image robust reversible watermarking framework.