• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2008.05a
• /
• pp.527-530
• /
• 2008

The watermarking method was suggested to protect the right of the copyright and the right of property, data loss is yes or not, copy prevention and pursuit about the brainchild(music, image, video and so on) in the early 1990. In this paper, we suggest the watermarking algorithm against the geometrical transformation of the medical images applied the Watershed algorithm. The robust watermarking methodology is being suggested using the several algorithm against the attacks such as compression, filtering, noise and geometrical transformation of the medical image.

• 전자공학회논문지 IE
• /
• v.43 no.4
• /
• pp.37-42
• /
• 2006

This paper proposes a adaptive video watermarking algorithm according to bitrate and motion vector size in MPEG2 system. The watermark strength in the I-frames is adapted for quantization step size and the strength in the P-B-frames is adapted for quantization step size and motion vector of macroblock to make the watermark more robust against the accompanying degradation due to aggressively compression. A realtime watermark extraction is done directly in the DCT domain during MPEG decoding without full decoding of MPEG video. The experimental simulations show that the video quality results almost invisible difference between the watermarked frames and the original frames and the watermark is resistant to frame dropping, MPEG compression, GoP conversion and low pass filter attacks.

• Journal of Advanced Navigation Technology
• /
• v.11 no.3
• /
• pp.329-336
• /
• 2007

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 digital watermarking 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 the Acoustical Society of Korea
• /
• v.32 no.1
• /
• pp.64-70
• /
• 2013

In this paper, we suggest a new audio watermarking method for audio contents copyrights that can efficiently provide protection from MP3 compression attacks. Watermarks were inserted at the coefficients repeatedly from low frequencies to high frequencies after DCT transform in commonly used Cox's spread spectrum method. Because the methods using arbitrary coefficients are not effective, we use the new weight functions that make small losses for the watermark coefficients during attacks, using psychological acoustics. In the results of various sound clips, the suggested method had overall better outcomes than the Cox's method by preserving watermarks and reducing distortions of the original sounds.

• Spatial Information Research
• /
• v.11 no.1
• /
• pp.73-88
• /
• 2003

Geographical data sets are expensive to create and are very easy to copy because the intellectual property rights for the distribution should be protected. The main object of copyright law is to encourage expression of ideas in tangible form and it extend only to original works, it is limited to control the balance of interests between data producers and user. Because the development of a useful legal framework for both private and public activity in this field is an important issue. This paper presents an intial attempt at such a the effective management strategy intended to support continuing research into the legal protection of geographical information.

• 제어로봇시스템학회:학술대회논문집
• /
• 2004.08a
• /
• pp.788-793
• /
• 2004

Internet-based distribution of digital contents provides great opportunities for producers, distributors and consumers, but it may seriously threaten users' privacy. The Digital Rights Management (DRM) systems which one of the major issues, concern the protection of the ownership/copyright of digital content. However, the most recent DRM systems do not support the protection of the user's personal information. This paper examines the lack of privacy in DRM systems. We describe a privacy policy and user's privacy preferences model that protect each user's personal information from privacy violation by DRM systems. We allow DRM privacy agent to automatically negotiate between the DRM system policy and user's privacy preferences to be disclosed on behalf of the user. We propose an effective negotiation algorithm for the DRM system. Privacy rules are created following the negotiation process to control access of the user's personal information in the DRM system. The proposed privacy negotiation algorithm can be adapted appropriately to the existing DRM systems to solve the privacy problem effectively.

• Journal of Digital Convergence
• /
• v.11 no.5
• /
• pp.1-11
• /
• 2013

To make the DRM technology protect adequately the copy right of digital contents, DRM software should have high quality and no defects when DRM is added to digital contents. It can be a basis for the effective protection of the copyright of digital contents to develop a quality evaluation model of DRM SW. First of all, the security of DRM SW is the most critical quality characteristic that DRM software must have. In this paper, we conducted research on how to measure the quality of security of DRM SW.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.9 no.1
• /
• pp.1-9
• /
• 2009

In this paper, proposed digital image watermarking technique with lifting wavelet transformation. This watermark technique can be easily extended in video content fields. Therefore, we apply this watermark technique to layered depth image structure that is efficient compression method of multi-view video with depth images. This application steps are very simple, because watermark is inserted only reference image. And watermarks of the other view images borrow from reference image. Each view image of multi-view video may be guaranteed authentication and copyright.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.67 no.10
• /
• pp.1358-1363
• /
• 2018

As the usage of the Internet grows and digital media become more diversified, it has become much easier for digital contents to be distributed and shared. This makes easier to access the desired digital contents. On the other hand, there is an increasing need to protect the copyright of digital works. There are some prevalent ways to protect ownership, but they accompany several disadvantages. Among those ways, watermarking methods have the advantage of ensuring invisibility, but they also have a disadvantage that they are vulnerable to external attacks such as a noise and signal processing. In this paper, we propose the detecting method of illegal contents that is robust against external attacks to protect digital works. We extract HSV and LBP features from images and use Euclidian-based hashing techniques to shorten the searching time on high-dimensional and near-duplicate videos. According to the results, the proposed method showed higher detection rates than that of the Watermarking techniques in terms of the images with fabrications or deformations.

• Journal of Korea Multimedia Society
• /
• v.22 no.12
• /
• pp.1404-1414
• /
• 2019

Educational books commonly use some copyrighted images with various kinds of deformation for helping students understanding. When using several copyrighted images made by merging or editing distortion in legal, we need to pay a charge to original copyright holders for each image. In this paper, we propose an efficient matching algorithm by separating each copyrighted image with the merged and edited type including rotation, illumination change, and change of size. We use the Oriented FAST and Rotated BRIEF (ORB) method as a basic feature matching scheme. To improve the matching accuracy, we design a new MIN-MAX similarity in matching stage. With the distorted dataset, the proposed method shows up-to 97% of precision in experiments. Also, we demonstrate that the proposed similarity measure also outperforms compared to other measure which is commonly used.