• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.21 no.12
• /
• pp.2333-2340
• /
• 2017

Recently industry is suffering severe losses of important internal information, and most of the leaks result from the insiders. Thus, various technological counter measures are being studied in order to protect private organization information. In this paper, among various internal information leakage path protection mechanisms, we propose a technique for preventing files which are defined as confidential from being copied or moved through USB. The implemented confidential file loss prevention system is composed of both signature insert manager and confidential file detect manager. The signature insert manager allows a system administrator to insert a special pattern specifying a classified confidential file, while the confidential file detect manager protects confidential file leakage when a user attempts to move or copy a confidential file to the USB memory. This results would be contributed to reducing the damage caused by leakage of confidential files outside of the company via USB.

• 전자공학회논문지 IE
• /
• v.43 no.2
• /
• pp.87-92
• /
• 2006

Many watermarking methods for protecting the intellectual property right and authentication multimedia data have been proposed in recent years. In image authentication watermarking, watermark is inserted into an image to detect any malicious alteration. So, watermark for authentication and integrity should be erased easily when the image is changed by scaling or cropping etc. We propose in this paper a fragile watermarking algorithm for image integrity verification and tamper localization proofing using special hierarchical structure. In the proposed method, the image to be watermarked is divided into blocks in a multi-level hierarchy and calculating block digital signatures in thus hierarchy. At each level of the hierarchy, a digital signature for each block is calculated using the seven most significant bit(MSBs)-plane values of all pixels within the block. And the resulting signature is incorporated into the LSBs of selected pixels within the block. We provide experimental results to demonstrate the effectiveness of the proposed method.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.40 no.6
• /
• pp.41-50
• /
• 2003

For copyright protection of digital contents, we employ watermarking techniques to embed watermark signals into digital host data. In this paper we propose an adaptive watermarking algorithm for three-dimensional (3-D) mesh models. Watermark signals are inserted into vertex coordinates adaptively according to changes of their position values. While we embed strong watermarks in the areas of large variations, watermarks are weakly inserted in other areas. After we generate triangle strips by traversing the 3-D model and convert the Cartesian coordinates to the spherical coordinate system, we calculate variations of vertex positions along the traversed strips. Then, we insert watermark signals into the vertex coordinates adaptively according to the calculated variations. We demonstrate that imperceptibility of the inserted watermark is significantly improved and show the bit error rate (BER) for robustness.

• Journal of Broadcast Engineering
• /
• v.26 no.3
• /
• pp.296-307
• /
• 2021

A digital hologram (DH) is an ultra-high value-added video content that includes 3D information in 2D data. Therefore, its intellectual property rights must be protected for its distribution. For this, this paper proposes a watermarking method of DH using a deep neural network. This method is a watermark (WM) invisibility, attack robustness, and blind watermarking method that does not use host information in WM extraction. The proposed network consists of four sub-networks: pre-processing for each of the host and WM, WM embedding watermark, and WM extracting watermark. This network expand the WM data to the host instead of shrinking host data to WM and concatenate it to the host to insert the WM by considering the characteristics of a DH having a strong high frequency component. In addition, in the training of this network, the difference in performance according to the data distribution property of DH is identified, and a method of selecting a training data set with the best performance in all types of DH is presented. The proposed method is tested for various types and strengths of attacks to show its performance. It also shows that this method has high practicality as it operates independently of the resolution of the host DH and WM data.

• Journal of Korea Multimedia Society
• /
• v.6 no.3
• /
• pp.397-408
• /
• 2003

Existing indexing mechanisms of XML data using numbering scheme have a drawback of rebuilding the entire index structure when insertion, deletion, and update occurs on the data. We propose a new indexing mechanism based on split blocks to cope with this problem. The XML data are split into blocks, where there exists at most a relationship between two blocks, and numbering scheme is applied to each block. This mechanism reduces the overhead of rebuilding index structures when insertion, deletion, and update occurs on the data. We also propose two algorithms, Parent-Child Block Merge Algorithm and Ancestor-Descendent Algorithm which retrieve the relationship between two entities in the XML hierarchy using this indexing mechanism. We also propose a mechanism in which the identifier of a block has the information of its Parents' block to expedite retrieval process of the ancestor-descendent relationship and also propose two algorithms. Parent-Child Block Merge Algorithm and Ancestor-Descendent Algorithm using this indexing mechanism.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.8 no.2
• /
• pp.1-8
• /
• 2008

The object of watermarking is to prevent from copying and distributing without the copyright or right of ownership. In case of using watermark as an image data we can detect watermark whether an original image exists or not. In this paper, we proposed that an image data is used for watermark and the watermark is detected without an original image. After the original image is transformed with DWT and the watermark is transformed with DCT, they are transformed with binary number. We calculate an optimal bit position for concealing watermark of an original binary image and insert the watermark and determine the best position for robustness against JPEG compression, filtering, and resampling attacks within inserted watermark image. In this paper, we are able to confirm the right of copyright and ownership easily while using invisible watermark and also we can detect a watermark without an original image.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.12A
• /
• pp.1939-1947
• /
• 1999

This paper proposes new line code BIM (Bit Insertion and Manipulation) that is designed to overcome the problems of existing line codes. The block code, one of typical existing line code, has good transmission performance but difficulty in implementation. The other typical existing line code, bit insertion code, is easy to implementation but has bad transmission performance. BIM code in this paper could provide not only good performance but also provides simplicity in the implementation by combining the good points of block code into it of bit insertion code properly. In this paper, 5B6B type BIM code is designed. Designed 5B6B BIM code shows good transmission performance such $\pm$2 DSV, 0 RSD, 7 maximum run length and also it can be implemented under 2000 gates and need only 1 bit redundancy.

• Journal of Korea Multimedia Society
• /
• v.9 no.5
• /
• pp.564-575
• /
• 2006

With the rapid increase of the number of multimedia contents, people consume a lot of multimedia contents through various distribution channels. Content-based image retrieval uses visual features that represent the contents of images. And users can retrieve or filter images based on the contents of the images using the features. But, the editing of the multimedia contents distorts the original visual features of the multimedia contents, thereby the performance of content-based image retrieval system could be lowered. In this paper, we describe the image editing effects that lower the performance of the retrieval system and propose algorithms that can remove the image editing effect and improve content-based image retrieval system.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.10b
• /
• pp.154-156
• /
• 2004

최근 XML은 인터넷상의 데이터의 표현 및 교환의 표준으로 인식되면서 XML에 대한 많은 연구가 이루어지고 있다 특히 XML문서의 정보량이 방대해짐에 따라 빠른 검색의 필요로 많은 인덱싱 기법들이 제안되었다. 최근의 연구 중, 패스를 기반으로 하는 인덱싱 기법들은 중간노드와 최하위노드의 검색, 조상-후손관계의 조인연산 등에서 성능이 떨어지는 경향이 있다. 이를 보완하기 위해 연구된 Numbering-Scheme 기반의 인덱싱 기법들은 대부분의 검색에서 우수한 성능을 보인다. 그러나 하위 노드가 늘어나는 경우엔 검색 오버헤드가 커질 수 있으며, 대량의 XML 문서나 구조가 다른 XML 문서가 추가되면 인덱스와 데이터 값의 재조정이 필요하게 된다. 이러한 문제를 해결하기 위하여 본 논문은 Numbering-Scheme을 기반으로 각 노드별 노드범위(Node-Range)와 Pre-Order List물 추가하여 검색성능을 높이고, 데이터의 삽입, 삭제에 효과적인 인덱싱 기법을 제안한다.

• 한국정보교육학회:학술대회논문집
• /
• 2004.08a
• /
• pp.721-729
• /
• 2004

최근에 학교 현장에서 제공하는 홈페이지는 학교의 정보화 능력을 가늠하는 척도가 되고 있으며 학생과 학부모 그리고 학교가 상호 의사소통 할 수 있는 좋은 장을 마련해주고 있다. 그러나 끊임없이 변화하는 학생들의 검색 패턴에 대해서 학교 홈페이지가 적절히 대처하지 못하고 있으며, 그들의 방문 목적 달성을 위한 충분한 안내를 제공함에 있어 한계를 가지고 있는 것이 사실이다. 본 논문에서는 사이트 접속자들의 행동 패턴 분석을 위해 웹서버 로그 데이터를 이용하고, 데이터 마이닝의 한 기법인 연관규칙을 적용하여 로그 데이터를 분석함으로써 사용자들의 의미 있는 행동패턴을 추출하는 알고리즘을 제안하였다. 이렇게 추출된 행동패턴을 기반으로 하이퍼링크가 자동으로 생성되어 해당 웹페이지에 삽입됨으로써 특정 개인뿐만 아니라 공통의 다수가 편리하게 이용할 수 있는 적응형 학교 웹사이트 구축 방안을 제시한다.