• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.38 no.4
• /
• pp.344-352
• /
• 2001

In this paper, we propose a cross-correlation property and a related technique based on the validity of image block in a public watermarking and we embed messages into the high frequency band in the DCT domain because of its imperceptibility and fragility. As a result, we were able to inspect the identity of valid block between error corrected original images and watermarked images through experiments. And we confirmed the viability of this cross-correlation as an application for future public watermarking.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.36S no.12
• /
• pp.97-106
• /
• 1999

We propose a new watermarking method to embed a label in a video which is robust against the change of the group of picture. The proposed method embeds labels in the pixel domain, but detects the label in the DCT frequency domain. For embedding a label, the size of watermark based on the human visual system is calculated to keep a quality of videos. A lookup table haying the pixel patterns and the sequences of a sign of DCT coefficients is used for detecting a label in the DCT frequency domain. In this paper, we analyze bit error rates for labels of videos compressed by MPEG2 using the central limit theorem and compare the simulation results with previous methods.

• Journal of Korea Multimedia Society
• /
• v.15 no.7
• /
• pp.837-846
• /
• 2012

This paper presents a watermarking scheme based on the perspective distance for the secure mash-up service. The proposed scheme embeds the watermark of the location information of satellite image and the user information using edge color histogram, which is dissimilar to general digital image. Therefore, this scheme can trace the illegal distributor and can protect private information of user through the watermarking scheme that is adaptive to satellite image. Experimental results verified that our scheme has the invisibility and also the robustness against geometric attacks of rotation and translation.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.6 no.6
• /
• pp.937-942
• /
• 2002

The use of digital imaging technique and digital contents based on internet has grown rapidly for last several years, and the needs of digital image protection become more important. For the purpose of copyright protection on digital image, the verification of authentication techniques like content authentication, ownership authentication, illegal copy and etc are needed. Digital watermarking, the invisible encryption technique to insert digital watermark into image the sophisticated perceptual information should be used for providing transparency and robustness of images on watermarking process. In this paper, we implement the algorithm for preventing forged attack, ownership protection and authentication by transforming the wavelet algorithms in frequency domain in terms of human visual system.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.1B
• /
• pp.99-104
• /
• 2000

In this paper, as a digital watermark we propose to use a chaotic sequence instead of the conventional Gaussian sequence. It is relatively easy to generate the chaotic sequence and is very sensitive to the change of initial value. The chaotic sequence adopted in this paper is a modified version of logistic map to give the sequence distribution of Chebyshev map. In the experiments, we applied the Gaussian sequence and chaotic sequence to wavelet coefficients of images to compare the similarity distribution. The results show that, as id the DCT-based watermarking system, the chaotic sequence is robust for various signal processing attacks, Moreover, the similarity variance is smaller than the Gaussian sequence for iterative experiments. It also shows a better performance for compression errors than the Gaussian sequence.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.12
• /
• pp.2340-2354
• /
• 2011

A new and secure image steganographic scheme based on nonuniform discrete Fourier transform (NDFT) is proposed in this paper. First, the chaotic system is introduced to select embedding points randomly in NDFT domain suitable range, and NDFT is implemented on every non-overlapping block of eight consecutive pixels. Second, the secret messages are scrambled by chaotic systems, and embedded into frequency coefficients by quantization method. The stego-image is obtained by inverse NDFT (INDFT). Besides, in order to discriminate tampers, the low frequency wavelet coefficients of 7 most significant bits (MSBs) of the stego-image are converted into the binary sequence after nonuniform scalar quantization. Then the obtained binary sequence is scrambled by the chaotic systems, and embedded into the least significant bit (LSB) of the stego-image. Finally, the watermarked stego-image can be obtained by a new improved LSB steganographic method. The embedded secret messages can be extracted from the watermarked stego-image without the original cover image. Experimental results show the validity of the proposed scheme, and dual statistics attacks are also conducted to indicate the security.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2004.11a
• /
• pp.203-206
• /
• 2004

본 논문에서는 오디오 워터마킹 기술을 이용하여 중앙방송국과 지방방송국간의 방송전환을 용이하게 할 수 있는 시스템을 구현하였다. 방송전환을 위한 동기화 시스템에서의 오 검출은 방송사고를 일으키기 때문에, 오디오 워터마크기술을 이용할 때 신뢰성이 매우 높아야 한다. 달 논문에서는 방송동기화 시스템에 효율적으로 적용할 수 있는 오디오 워터마킹 알고리즘을 개발하고, 이를 실시간으로 적용하여 방송전환에 사용할 수 있는 시스템을 구현하였다. 개발된 오디오 워터마킹 알고리즘에 의해서 워터마크가 삽입된 방송신호의 SNR은 66.1dB로서 워터마크 삽입전의 방송신호와의 구분이 어려웠다. 강인성 테스트에서는 96kbps와 128kbps의 MP3 압축을 하였을 때에도 $100\%$의 검출율을 보였으며, -50dB 이하의 잡음첨가에 대해서도 $100\%$ 검출율을 보였다. 구현된 시스템은 240시간의 실제 방송상황에서 워터마크가 삽입된 방송신호에 대한 검출율이 $100\%$이고, 오검출율이 $0\%$로 방송시스템으로서의 신뢰성을 확보하였다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.12
• /
• pp.4588-4603
• /
• 2014

In this paper, we present a high-quality image authentication scheme based on absolute moment block truncation coding. In the proposed scheme, we use the parity of the bitmap (BM) to generate the authentication code for each compressed image block. Data hiding is used to authenticate whether the content has been altered or not. For image authentication, we embed the authentication code to quantization levels of each image block compressed by absolute moment block truncation coding (AMBTC) which will be altered when the host image is manipulated. The embedding position is generated by a pseudo-random number generator for security concerned. Besides, to improve the detection ability we use a hierarchical structure to ensure the accuracy of tamper localization. A watermarked image can be precisely inspected whether it has been tampered intentionally or incautiously by checking the extracted watermark. Experimental results demonstrated that the proposed scheme achieved high-quality embedded images and good detection accuracy, with stable performance and high expansibility. Performance comparisons with other block-based data hiding schemes are provided to demonstrate the superiority of the proposed scheme.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.5
• /
• pp.2741-2761
• /
• 2017

With the purpose of copyright protection for digital video, a novel H.264/AVC watermarking algorithm based on JND model is proposed. Firstly, according to the characteristics of human visual system, a new and more accurate JND model is proposed to determine watermark embedding strength by considering the luminance masking, contrast masking and spatial frequency sensitivity function. Secondly, a new embedding strategy for H.264/AVC watermarking is proposed based on an analysis on the drift error of energy distribution. We argue that more robustness can be achieved if watermarks are embedded in middle and high components of $4{\times}4$ integer DCT since these components are more stable than dc and low components when drift error occurs. Finally, according to different characteristics of middle and high components, the watermarks are embedded using different algorithms, respectively. Experimental results demonstrate that the proposed watermarking algorithm not only meets the imperceptibility and robustness requirements, but also has a high embedding capacity.

• Journal of Ubiquitous Convergence Technology
• /
• v.2 no.1
• /
• pp.18-26
• /
• 2008

The invariance relation existing in the non-negative matrix factorization (NMF) is used for constructing robust image hashes in this work. The image is first re-scaled to a fixed size. Low-pass filtering is performed on the luminance component of the re-sized image to produce a normalized matrix. Entries in the normalized matrix are pseudo-randomly re-arranged under the control of a secret key to generate a secondary image. Non-negative matrix factorization is then performed on the secondary image. As the relation between most pairs of adjacent entries in the NMF's coefficient matrix is basically invariant to ordinary image processing, a coarse quantization scheme is devised to compress the extracted features contained in the coefficient matrix. The obtained binary elements are used to form the image hash after being scrambled based on another key. Similarity between hashes is measured by the Hamming distance. Experimental results show that the proposed scheme is robust against perceptually acceptable modifications to the image such as Gaussian filtering, moderate noise contamination, JPEG compression, re-scaling, and watermark embedding. Hashes of different images have very low collision probability. Tampering to local image areas can be detected by comparing the Hamming distance with a predetermined threshold, indicating the usefulness of the technique in digital forensics.