• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.42 no.6
• /
• pp.27-32
• /
• 2005

An effective video watermarking algorithm is proposed to protect the copyright. The watermarking procedure is based on a three-dimensional discrete wavelet transform (3D DWT) and spread spectrum sequences. Two perceptual binary watermarks are preprocessed using mixing and pseudorandom permutation. After dividing the video sequence into video shots, the 3D DWT is performed, then the preprocessed watermarks are embedded into the 3D DWT coefficients, while considering robustness and invisibility, using two spread spectrum sequences defined as the user key. Experimental results show that the watermarked frames are subjectively indistinguishable from the original frames, plus the proposed video watermarking algorithm is sufficiently robust against such attacks as low pass filtering, frame dropping, frame average, and MPEG coding.

• The Journal of the Korea Contents Association
• /
• v.5 no.6
• /
• pp.331-342
• /
• 2005

In this paper, we propose an efficient watermarking algorithm using block indexing. The proposed algorithm is a novel blind watermarking scheme using the indexed watermark value based on the spread spectrum method. The watermark insertion is allocated into index value of each block after dividing original image into sub-blocks. The watermark embedded in mappinged with index values of blocks, And the mappinged blocks convert to DCT and then the PN sequence embedded to middle frequency band. Consequently the watermark is expressed by index value of sub-blocks. The watermark extracted from the correlation of between PN sequence and watermarked image. Experimental results demonstrate that the watermarked image has a good quality in terms of imperceptibility and is robust against various attacks.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.10 no.4
• /
• pp.145-150
• /
• 2010

In this paper, we propose additional data transmission system for spectrum efficiency improvement and derive channel capacity formula as a approximated closed-form. Spread spectrum watermarking scheme is selected for the watermarking embedder. Nakagami-q (Hoyt) model is considered as a multipath fading channel. Numerical results show the channel capacity variation of the proposed system in wireless fading channel. From the results, we confirm that the channel capacity of the watermarking system is affected by the fading coefficient and system parameters such that host sampling frequency, host-to-watermark ratio, watermark-to-noise ratio, and PN sequence length.

• Proceedings of the IEEK Conference
• /
• 2003.07d
• /
• pp.1487-1490
• /
• 2003

This paper shows the watermarking system that inserts copyright holder's logo in music file. In other words, a sound file is able to have an image information like a logo or letters. The watermarking system converts a sound file into an image file using spectrogram. In the spectrogram domain, a logo is inserted using spread spectrum. The proposed technique shows that the verification of copyright is better than the method using PN-Sequence.

• ETRI Journal
• /
• v.25 no.1
• /
• pp.52-54
• /
• 2003

We propose an improved algorithm for detecting audio watermarks based on a spread spectrum in the spectral domain. Since the energy of a watermark is much smaller than that of the cover audio data, pre-processing to reduce the effect of the cover data is needed to reliably extract watermarks. We introduce a spectral envelope filter as a pre-process that enhances detecting performance by filtering out the intrinsic spectral character of cover data. The proposed watermarking structure can be easily included in the compression system and can extract watermarks from partially decompressed spectral data. Our experimental results demonstrate that with a bit error rate of around 10 dB against general attacks, the proposed detecting scheme works better than detectors without the spectral filter.

• The Journal of the Acoustical Society of Korea
• /
• v.21 no.8
• /
• pp.719-726
• /
• 2002

In this paper, we present a layered watermarking technique for digital audio data that is capable of detecting timing change and adapting complexity in detection. The proposed watermarking uses echo hiding as the first layer, which enables the detector to estimate linear speed change. The spread spectrum watermark is then inserted in the second layer which includes additional information like copyright data. We use two kinds of sequences in the second layer, one of which is for synchronization and the other is for data. The results of previous layer are used to make estimate of timing change in the next layer. The detector in the presented method can select detecting range form the first layer to the first layer, second pre-layer, or second main-layer due to the required system specification. Experimental results show that the proposed watermarking technique is robust to several processing attacks including timing change.

• Proceedings of the IEEK Conference
• /
• 1999.06a
• /
• pp.716-719
• /
• 1999

In this Paper, we Present a method for embedding digital watermarks into digital audio signals. The watermarking must be imperceptible and should be robust to attacks, such as filtering and compression etc. In our method, we adaptively embedded the watermarks changing the scale factor using the spread spectrum and MPEG-2 AAC psychoacoustic model.

• Journal of Intelligence and Information Systems
• /
• v.15 no.4
• /
• pp.201-212
• /
• 2009

Even though the spread spectrum method is known as most robust algorithm to general attacks, it has a drawback to the time axis attack. In this paper, I proposed a robust audio copyright protection algorithm which is robust to the time axis attack and has advantages of the spread spectrum method. Time axis attack includes the audio length variation attack with same pitch and the audio frequency variation attack. In order to detect the embedded watermark by the spread spectrum method, the detection algorithm should know the exact rate of the time axis attack. Even if there is a method to know the rate, it needs heavy computational resource and it is not possible to implement. In this paper, solving this problem, the audio signal is transformed into time-invariant domain, and the spread spectrum watermark is embedded into the audio in the domain. Therefore the proposed algorithm has the advantages of the spread spectrum method and it is also robust to the time axis attack. The time-invariant domain process is that the audio is arranged by log scale time axis, and then, the Fourier transform is taken to the audio in the log scale time axis. As a result, the algorithm can get the time-invariant watermark signal.

• Journal of Broadcast Engineering
• /
• v.6 no.1
• /
• pp.3-12
• /
• 2001

Over the last few years, digital audio watermarking has become an interesting issue In many application areas, including digital broadcasting. This is primarily motivated by a need to provide copyright protection of digital audio content. Digital watermarking is a technique to embed copyright or other information int? the underlying data. Several possible audio watermarking techniques have been developed including spread spectrum watermarking, echo watermarking, phase coding, and patchwork. In this paper, we describe some requirements of digital audio watermarking as a tool for copyright protection of broadcasting content, and compare popular audio watermarking algorithms in some significant aspects.

• The Journal of the Korea Contents Association
• /
• v.10 no.6
• /
• pp.55-63
• /
• 2010

In this paper, a new video watermarking algorithm using 3D wavelet transform and position encoding of spread spectrum correlation is proposed as a method for ensuring enough payload in order to protect copyright for video contents. This algorithm provides better robustness than other watermarking methods in bit error and rotation because it uses the position encoding and $4{\times}4$ sample space instead of $1{\times}1$ pixel to express a digit. The evaluation result over 6 video clips shows that the PSNR is over 31dB at strength 11 when histogram is narrow and it satisfies the transparency. Also, it shows the robustness of the proposed watermark algorithm that the BER is 0% to three codecs.