• Journal of Intelligence and Information Systems
• /
• v.24 no.2
• /
• pp.21-35
• /
• 2018

Since the introduction of MP3 players, CD recordings have gradually been vanishing, and the music consuming environment of music users is shifting to mobile devices. The introduction of smart devices has increased the utilization of music through music playback, mass storage, and search functions that are integrated into smartphones and tablets. At the time of initial MP3 player supply, the bitrate of the compressed music contents generally was 128 Kbps. However, as increasing of the demand for high quality music, sound quality of 384 Kbps appeared. Recently, music content of FLAC (Free License Audio Codec) format using lossless compression method is becoming popular. The download service of many music sites in Korea has classified by unlimited download with technical protection and limited download without technical protection. Digital Rights Management (DRM) technology is used as a technical protection measure for unlimited download, but it can only be used with authenticated devices that have DRM installed. Even if music purchased by the user, it cannot be used by other devices. On the contrary, in the case of music that is limited in quantity but not technically protected, there is no way to enforce anyone who distributes it, and in the case of high quality music such as FLAC, the loss is greater. In this paper, the author proposes an audio watermarking technology for copyright protection of high quality stereo music. Two kinds of information, "Copyright" and "Copy_free", are generated by using the turbo code. The two watermarks are composed of 9 bytes (72 bits). If turbo code is applied for error correction, the amount of information to be inserted as 222 bits increases. The 222-bit watermark was expanded to 1024 bits to be robust against additional errors and finally used as a watermark to insert into stereo music. Turbo code is a way to recover raw data if the damaged amount is less than 15% even if part of the code is damaged due to attack of watermarked content. It can be extended to 1024 bits or it can find 222 bits from some damaged contents by increasing the probability, the watermark itself has made it more resistant to attack. The proposed algorithm uses quantization in DCT so that watermark can be detected efficiently and SNR can be improved when stereo music is converted into mono. As a result, on average SNR exceeded 40dB, resulting in sound quality improvements of over 10dB over traditional quantization methods. This is a very significant result because it means relatively 10 times improvement in sound quality. In addition, the sample length required for extracting the watermark can be extracted sufficiently if the length is shorter than 1 second, and the watermark can be completely extracted from music samples of less than one second in all of the MP3 compression having a bit rate of 128 Kbps. The conventional quantization method can extract the watermark with a length of only 1/10 compared to the case where the sampling of the 10-second length largely fails to extract the watermark. In this study, since the length of the watermark embedded into music is 72 bits, it provides sufficient capacity to embed necessary information for music. It is enough bits to identify the music distributed all over the world. 272 can identify $4*10^{21}$, so it can be used as an identifier and it can be used for copyright protection of high quality music service. The proposed algorithm can be used not only for high quality audio but also for development of watermarking algorithm in multimedia such as UHD (Ultra High Definition) TV and high-resolution image. In addition, with the development of digital devices, users are demanding high quality music in the music industry, and artificial intelligence assistant is coming along with high quality music and streaming service. The results of this study can be used to protect the rights of copyright holders in these industries.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.12
• /
• pp.3885-3895
• /
• 2000

The emergence of digital imaging and digital networks has made duplication of original artwork easier. In order to protect these creations, new methods for signing and copyrighting visual data are needed. In the last few years, a large number of schemes have heen proposed for hiding copyright marks and other information in digital image, video, audio and other multimedia objects. In this paper, we propose a technique for embedding the watermark of visually recognizable patterns into the frequency domain of images. The embedded watermark can be retrieved from the decoded sequence witbout knowledge of the original. Because the source image is not required to extract the watermark, one cannot make the fake original that is invertible to watermarking scheme from the waternlarked image. In order to recover the embedded signature data without knowledge of the original, a prediction of the original value of the pixel containing the information is needed. The prediction is based on a averaging of amplitude values in a neighborhood around the pixel itself. Additionally the projxJsed technique could survive several kinds of image processings including JPEG lossy compression.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.8 no.4
• /
• pp.263-269
• /
• 2015

Digital watermarking is imperceptible and statistically undetectable information embeds into digital data. Most information in digital audio watermarking schemes have used binary random sequences. The embedded binary random sequence distorts and modifies the original data while it plays a vital role in security. In this paper, a binary random sequence to improve imperceptibility in perceptual region of the human auditory system is proposed. The basic idea of this work is a modification of a binary random sequence according to the frequency analysis of adjacent binary digits that have different signs in the sequence. The canonical signed digit code (CSDC) is also applied to modify a general binary random sequence and the pair-matching function between original and its modified version. In our experiment, frequency characteristics of the proposed binary random sequence was evaluated and analyzed by Bark scale representation of frequency and frequency gains.

• Journal of Korea Multimedia Society
• /
• v.14 no.11
• /
• pp.1431-1437
• /
• 2011

This paper proposes a novel watermarking algorithm that protects digital copyrights and is robust to attacks. Watermarks are embedded in the subband including the significant part of the signal such as a pitch. Generally, the subband containing the pitch has the biggest energy. In order to find this subband, wavelet packet transform is used to decompose the subbands and their energy are calculated. The signal of the selected subbands is transformed in frequency domain using FFT. The watermarks are embedded using QIM for samples higher than a certain threshold. The blind detection uses the Euclidean distance. The proposed method shows less than 5% BER in the audio watermark benchmarking.

• The KIPS Transactions:PartB
• /
• v.8B no.5
• /
• pp.579-586
• /
• 2001

Digital watermarking is to embed imperceptible mark into image, video, audio, and text data to prevent the illegal copy of multimedia data. arbitrary modification, and also illegal sales of the copies without agreement of copyright ownership. In this paper, we study for the embedding and extraction of watermark key using wavelet in the luminance signal in order to implement the system to protect the copyright for image MPEG. First, the original image is analyzed into frequency domain by discrete wavelet transform. The RSA(Rivest, Shamir, Aldeman) public key of the coded target is RUN parameter of VLD(variable length coding). Because the high relationship among the adjacent RUN parameters effect the whole image, it prevents non-authorizer not to possess private key from behaving illegally. The Results show that the proposed method provides better moving picture and the distortion more key of insert than direct coded method on low-frequency domain based DCT.

• The Journal of the Acoustical Society of Korea
• /
• v.22 no.7
• /
• pp.612-621
• /
• 2003

As the use of MP3 audio compression increased, the demand for the insertion of additive data about copyright or information on music contents has been groved and the related research has been progressed actively. When an additive data is inserted into MP3 bitstream, it should not to happen any distortion of music quality or the change of file size, due to the modification of MP3 bitstream structure. In our study, to make these conditions satisfied, we inserted some additive data to bitstream by modifying some bits of linbits among the quantized integer coefficients having big values. At this time, we consider the characteristics of linbits and their distributions. As a result of subjective sound quality test through MOS test, we confirmed that the quality of MOS 4.6 can be achieved at the data insertion rate of 60 bytes/sec. Using the proposed method, it is possible to effectively insert an additive data such as copyright information or information about media itself, so that various applications like audio database management can be realized.

• The Journal of the Acoustical Society of Korea
• /
• v.33 no.6
• /
• pp.400-406
• /
• 2014

This paper describes a robust watermark decoding model using a SVM(Support Vector Machine). First, the embedding process is performed inversely for a watermarked signal. And then the watermark is extracted using the proposed model. For SVM training of the proposed model, data are generated that are watermarks extracted from sounds containing watermarks by four different embedding schemes. BER(Bit Error Rate) values of the data are utilized to determine a threshold value employed to create training set. To evaluate the robustness, 14 attacks selected in StirMark, SMDI and STEP2000 benchmarking are applied. Consequently, the proposed model outperformed previous method in PSNR(Peak Signal to Noise Ratio) and BER. It is noticeable that the proposed method achieves BER 1% below in the case of PSNR greater than 10 dB.

• Proceedings of the Acoustical Society of Korea Conference
• /
• spring
• /
• pp.355-358
• /
• 2004

최근 웨이블릿 변환을 이용하여 저주파수 부대역 신호를 반복적으로 분해하고 삽입된 워터마크 비트에 따라 특정 부대역 신호에 두개의 다른 반향 중 하나를 삽입하는 반향 삽입 기법을 제안하였다. 이 기법은 오디오 신호의 주파수 특성을 고려했기 때문에 시간 영역에서의 기존의 반향 삽입 기법에 비해 비가청성(inaudibility), 워터마크의 강인성(robustness) 및 용적성(capacity)을 모두 증가시킬 수 있다. 기존의 부대역 신호 기반 반향 삽입 기법이 단일 반향 커널만을 이용하였으나, 본 논문에서는 부대역 신호에 다중 반향 커널을 이용한 반향 삽입 기법을 제안한다. 이 기법은 주관적 왜곡(perceptibility)과 SNR(signal to Noise Ratio)과 같은 객관적인 왜곡 면에서, 원본 오디오 신호의 왜곡을 줄일 수 있다. 실험 결과를 통하여 기존의 방법에 비해 제안된 방법이 SNR과 DR(Detection Rate) 모두 좋은 성능을 보여 제안된 방법의 유효성을 입증하였다.

• 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\%$로 방송시스템으로서의 신뢰성을 확보하였다.

• Proceedings of the Acoustical Society of Korea Conference
• /
• spring
• /
• pp.335-338
• /
• 2002

본 연구에서는 주파수 영역에서의 확산 스펙트럼 방식을 이용한 오디오 워터마킹 기법을 사용하고 있다. 워터마크 삽입은 오디오 신호를 MCLT(Modulated Complex Lapped Transform)로 분석한 후, 특정 주파수 영역의 진폭에 삽입되며 추출은 상관도를 이용하여 추출하게 된다. 워터마크 삽입은 44.1 kHz의 음악에 80 bits의 정보가 4초 단위로 반복적으로 삽입되며, 추출에서는 무작위로 추출된 8초 분량의 오디오 신호로부터 80 bits 비트 열과의 상관도를 계산하여 선정된 문턱 값을 초과하게 되면 워터마크가 존재하는 것으로 판단하게 된다 피치 스케일에 대응하기 위하여 120개 정도의 탐색을 수행하며, 시간 스케일에 대응하기 위하여 상관도의 지역 최대 점을 추출하고, 이러한 지역 최대 점들로부터 추출된 비트 열과 실제 비트 열과의 상관도를 계산하게 된다. 그러나 추출된 비트 열은 삽입 에러와 삭제 에러를 가질 수 있기 때문에 이러한 비트 열과의 최대 상관도를 구하기 위하여 본 연구에서는 동적계획법에 의한 최대 상관도 추출 알고리즘을 제시한다. 제안된 방법은 피치 및 시간 스케일링 변환 뿐만 아니라, 오디오 압축에도 견고함을 보인다.