• The KIPS Transactions:PartB
• /
• v.12B no.5 s.101
• /
• pp.513-520
• /
• 2005

In this paper, we propose a robust multi-watermarking method based on vector quantization using an index transform function. In contrast with the conventional watermark embedding methods to embed only one watermark at a time into the original image, we present a method to embed multiple watermarks for copyright protection. The proposed method efficiently enhances the robustness by index transform function which minimizes changes of vector quantization indices against various attacks. Experimental results show that the proposed method has a good robustness against various attacks compared with the conventional multi-watermarking method based on vector quantization.

• Proceedings of the Korean Information Science Society Conference
• /
• 2005.07b
• /
• pp.67-69
• /
• 2005

본 논문에서는 기 구축된 전자 카탈로그를 의미적 연결 관계에 기초한 확장된 전자 카탈로그로 변환하는 방법을 제안한다. 이를 통해 구축된 확장된 전자 카탈로그에서 의미적 태깅에 의한 확장된 어휘 인덱스 구축 방안과, 이를 이용한 검색 성능 향상 기법을 제안한다. 기존의 전자 카탈로그는 상품 정보가 분류별로 생성된 테이블에 저장되고 저장된 테이블로부터 생성된 키워드 인덱스로부터 검색이 이루어 졌다. 이러한 검색은 상품이 가지는 정보를 데이터베이스에 구축된 테이블에만 한정하게 되어 전자 카탈로그에 포함된 상품이나 분류간의 의미적 연결 관계들을 충분히 이용하지 못하였다 전자 카탈로그에 내재된 의미적 요소를 충분히 활용하기 위해서는 전자 카탈로그를 의미적 연결 관계에 기초한 모델로 구성할 필요가 있다. 본 논문에서는 의미적 모델 기반 전자 카탈로그 시스템으로의 전환 과정을 XML형태의 명세를 이용해 반자동적으로 전환할 수 있는 툴을 구현하며, 단순 키워드 어휘 인덱스 구축이 아닌, 어휘 인덱스의 의미적 확장을 제안하고, 이를 위한 태그 요소로써 어휘에 대한 형태소 분석 결과, 수치 환산 및 확장 요소, 속성간의 도메인 정보 등을 제시하였다. 이를 기반으로 최적의 검색 결과를 얻어 내도록 하는 인접도 평가 함수에 적용하는 방법을 제시한다.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.31B no.11
• /
• pp.78-87
• /
• 1994

In this paper, we have addressed a new approach to encode the DCT coefficients efficiently by exploiting the structural differences among the probability distribution functions of them. We have proved analytically that if signals are separated according to their source models, the entropy of the separated signals decreases below that of the unseparated signals. And simulation results show that the average codelength decrease when each (runlength, level) symbol is encoded adaptively according to the index associated with the symbol.

• Journal of KIISE:Databases
• /
• v.28 no.3
• /
• pp.344-356
• /
• 2001

This paper deals with the subsequence searching problem under time-warping in sequence databases. Our work is motivated by the observation that subsequence searches slow down quadratically as the average length of data sequences increases. To resolve this problem, the Segment-Based Approach for Subsequence Searches (SBSS) is proposed. The SBASS divides data and query sequences into a series of segments, and retrieves all data subsequences that satisfy the two conditions: (1) the number of segments is the same as the number of segments in a query sequence, and (2) the distance of every segment pair is less than or equal to a tolerance. Our segmentation scheme allows segments to have different lengths; thus we employ the time warping distance as a similarity measure for each segment pair. For efficient retrieval of similar subsequences, we extract feature vectors from all data segments exploiting their monotonically changing properties, and build a spatial index using feature vectors. Using this index, queries are processed with the four steps: (1) R-tree filtering, (2) feature filtering, (3) successor filtering, and (4) post-processing. The effectiveness of our approach is verified through extensive experiments.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2005.11a
• /
• pp.121-124
• /
• 2005

본 논문에서는 타임 워핑 하의 시계열 서브시퀀스 매칭을 처리하는 방법에 대하여 논의한다. 타임 워핑은 시퀀스의 길이가 서로 다른 경우에도 유사한 패턴을 갖는 시퀀스들을 찾을 수 있도록 해 주는 변환이다. 접두어 질의 기법(prefix-querying method)는 착오 기각(false dismissal) 없이 타임 워핑 하의 시계열 서브시퀀스 매칭을 처리하는 인덱스를 이용한 최초의 방식이다. 이 방법은 사용자가 질의를 편리하게 작성하도록 하기 위하여 기본 거리 함수로서 $L_{\infty}$를 사용한다. 본 논문에서는 $L_{\infty}$ 대신 타임 워핑 하의 시계열 서브시퀀스 매칭에서 기본 거리 함수로서 가장 널리 사용되는 $L_1$을 적용할 수 있도록 접두어 질의를 확장한다. 또한, 제안된 기법으로 타임 워핑 하의 시계열 서브시퀀스 매칭을 수행하는 경우 착오 기각이 발생하지 않음을 이론적으로 증명한다. 다양한 실험을 통한 성능 평가를 통하여 본 연구에서 제시하는 기법의 우수성을 검증한다. 실험 결과에 의하면, 제안된 기법은 가장 좋은 성능을 보이는 기존의 기법과 비교하여 매우 뛰어난 성능 개선 효과를 보이는 것으로 나타났다.

• The KIPS Transactions:PartD
• /
• v.13D no.3 s.106
• /
• pp.357-368
• /
• 2006

This paper discusses the way of processing time-series subsequence matching under time warping. Time warping enables finding sequences with similar patterns even when they are of different lengths. The prefix-querying method is the first index-based approach that performs time-series subsequence matching under time warping without false dismissals. This method employs the $L_{\infty}$ as a base distance function for allowing users to issue queries conveniently. In this paper, we extend the prefix-querying method for absorbing $L_1$, which is the most-widely used as a base distance function in time-series subsequence matching under time warping, instead of $L_{\infty}$. We also formally prove that the proposed method does not incur any false dismissals in the subsequence matching. To show the superiority of our method, we conduct performance evaluation via a variety of experiments. The results reveal that our method achieves significant performance improvement in orders of magnitude compared with previous methods.

• Geophysics and Geophysical Exploration
• /
• v.2 no.1
• /
• pp.26-32
• /
• 1999

Among the various seismic data processing sequences, the velocity analysis is the most time consuming and man-hour intensive processing steps. For the production seismic data processing, a good velocity analysis tool as well as the high performance computer is required. The tool must give fast and accurate velocity analysis. There are two different approches in the velocity analysis, batch and interactive. In the batch processing, a velocity plot is made at every analysis point. Generally, the plot consisted of a semblance contour, super gather, and a stack pannel. The interpreter chooses the velocity function by analyzing the velocity plot. The technique is highly dependent on the interpreters skill and requires human efforts. As the high speed graphic workstations are becoming more popular, various interactive velocity analysis programs are developed. Although, the programs enabled faster picking of the velocity nodes using mouse, the main improvement of these programs is simply the replacement of the paper plot by the graphic screen. The velocity spectrum is highly sensitive to the presence of the noise, especially the coherent noise often found in the shallow region of the marine seismic data. For the accurate velocity analysis, these noise must be removed before the spectrum is computed. Also, the velocity analysis must be carried out by carefully choosing the location of the analysis point and accuarate computation of the spectrum. The analyzed velocity function must be verified by the mute and stack, and the sequence must be repeated most time. Therefore an iterative, interactive, and unified velocity analysis tool is highly required. An interactive velocity analysis program, xva(X-Window based Velocity Analysis) was invented. The program handles all processes required in the velocity analysis such as composing the super gather, computing the velocity spectrum, NMO correction, mute, and stack. Most of the parameter changes give the final stack via a few mouse clicks thereby enabling the iterative and interactive processing. A simple trace indexing scheme is introduced and a program to nike the index of the Geobit seismic disk file was invented. The index is used to reference the original input, i.e., CDP sort, directly A transformation techinique of the mute function between the T-X domain and NMOC domain is introduced and adopted to the program. The result of the transform is simliar to the remove-NMO technique in suppressing the shallow noise such as direct wave and refracted wave. However, it has two improvements, i.e., no interpolation error and very high speed computing time. By the introduction of the technique, the mute times can be easily designed from the NMOC domain and applied to the super gather in the T-X domain, thereby producing more accurate velocity spectrum interactively. The xva program consists of 28 files, 12,029 lines, 34,990 words and 304,073 characters. The program references Geobit utility libraries and can be installed under Geobit preinstalled environment. The program runs on X-Window/Motif environment. The program menu is designed according to the Motif style guide. A brief usage of the program has been discussed. The program allows fast and accurate seismic velocity analysis, which is necessary computing the AVO (Amplitude Versus Offset) based DHI (Direct Hydrocarn Indicator), and making the high quality seismic sections.