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

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

• The KIPS Transactions:PartB
• /
• v.19B no.2
• /
• pp.83-92
• /
• 2012

Multimedia contents can be copied and manipulated without quality degradation. Therefore, they are vulnerable to digital forgery and illegal distribution. In these days, with increasing the importance of multimedia security, various multimedia security techniques are studied. In this paper, we propose a content authentication algorithm based on reversible watermarking which supports JPEG compression commonly used for multimedia contents. After splitting image blocks, a specific authentication code for each block is extracted and embedded into the quantized coefficients on JPEG compression which are preserved against lossy processing. At a decoding process, the watermarked JPEG image is authenticated by extracting the embedded code and restored to have the original image quality. To evaluate the performance of the proposed algorithm, we analyzed image quality and compression ratio on various test images. The average PSNR value and compression ratio of the watermarked JPEG image were 33.13dB and 90.65%, respectively, whose difference with the standard JPEG compression were 2.44dB and 1.63%.

• 한국정보통신설비학회:학술대회논문집
• /
• 2009.08a
• /
• pp.253-257
• /
• 2009

정보가 가역적으로 숨기어 졌다는 말은, 숨기고자 하는 정보가 삽입된 컨텐츠에서 비밀 정보를 찾아내고 또한 원본 컨텐츠를 완벽하게 복구할 수 있다는 말이다. 여러 가지 컨텐츠에 정보를 숨길 수 있으나 그 중에서 특히 이미지에 정보를 숨기고자 할 때는 두 가지 목표가 있다. 첫째는, 숨기고자 하는 데이터의 용량을 극대화 시키는 것이고 둘째는, 정보를 숨긴 다음에 생긴 이미지와 원본 이미지와의 차이를 줄이는 것이다. 본 논문은 데이터를 삽입시키는 차분값으로서 예측 오류 값을 이용하여 정보를 숨기는 개선된 방법을 제안하려고 한다.

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

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.15 no.3
• /
• pp.7-13
• /
• 2015

Generally, watermarking can be used copyright for contents such as audios, videos, images, and texts. With the development of Internet, many malicious attackers illegally copy relational databases synchronized applications Therefore, it is needed for the protection of databases copyright, because databases involve various sensitive information such as personal information, information industry, and secret national intelligence. Thus, the protection of relational databases is a major research field in the databases research topics. In this paper, we will review previous researches related the protection of relational databases and propose new method for relational data. Especially, we propose watermarking scheme for databases using reversible method in this paper. As an experimental result, the proposed scheme is very strong to malicious attacks. In addition, we proved our proposed scheme is to apply real application.

• Journal of Electrical Engineering and Technology
• /
• v.11 no.4
• /
• pp.974-986
• /
• 2016

Reversible image watermarking, a type of digital data hiding, is capable of recovering the original image and extracting the hidden message with precision. A number of reversible algorithms have been proposed to achieve a high embedding capacity and a low distortion. While numerous algorithms for the achievement of a favorable performance regarding a small embedding capacity exist, the main goal of this paper is the achievement of a more favorable performance regarding a larger embedding capacity and a lower distortion. This paper therefore proposes a reversible data hiding algorithm for which a novel piecewise 2D auto-regression (P2AR) predictor that is based on a rhombus-embedding scheme is used. In addition, a minimum description length (MDL) approach is applied to remove the outlier pixels from a training set so that the effect of a multiple linear regression can be maximized. The experiment results demonstrate that the performance of the proposed method is superior to those of previous methods.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2009.01a
• /
• pp.572-577
• /
• 2009

This paper proposes a novel reversible image authentication method that requires neither location map nor memorization of parameters. The proposed method detects image tampering and further localizes tampered regions. Though this method once distorts an image to hide data for tamper detection, it recovers the original image from the distorted image unless no tamper is applied to the image. The method extracts hidden data and recovers the original image without memorization of any location map that indicates hiding places and of any parameter used in the algorithm. This feature makes the proposed method practical. Simulation results show the effectiveness of the proposed method.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.8
• /
• pp.2984-3004
• /
• 2015

Designing a new reversible data hiding technique with a high embedding rate and a low compression rate for vector quantization (VQ) compressed images is encouraged. This paper proposes a novel lossless data hiding scheme for VQ-compressed images based on the joint neighboring coding technique. The proposed method uses the difference values between a current VQ index and its left and upper neighboring VQ indexes to embed n secret bits into one VQ index, where n = 1, 2, 3, or 4. The experimental results show that the proposed scheme achieves the embedding rates of 1, 2, 3, and 4 bits per index (bpi) with the corresponding average compression rates of 0.420, 0.483, 0.545, and 0.608 bit per pixel (bpp) for a 256 sized codebook. These results confirm that our scheme performs better than other selected reversible data hiding schemes.

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