• Journal of Industrial Technology
• /
• v.20 no.B
• /
• pp.213-218
• /
• 2000

The nearest neighbor query is an important operation widely used in multimedia databases for finding the object that is most similar to a given query object. Most of techniques for processing nearest neighbor queries employ multidimensional indexes for effective indexing of objects. However, the performance of previous multidimensional indexes, which use N-dimensional rectangles or spheres for representing the capsule of the object cluster, deteriorates seriously as the number of dimensions gets higher. This paper proposes a new index structure based singular value decomposition resolving this problem and the query processing method using it. We also verify the superiority of our approach through performance evaluation by performing extensive experiments.

• The Transactions of the Korea Information Processing Society
• /
• v.1 no.3
• /
• pp.409-417
• /
• 1994

In extracting contours from elevation matrix, the most important problem is to solve the degenerate case where four cross point arise in a grid. This paper describes a technique which performs the checking of degenerate case and determination of next point simultaneously. It requires minimum number of array indexing. Also this paper proposes a technique which reduces the number of array indexing by using LOWER/HIGHER information of a cross point designated according to height difference of grid vertices. In addition, we describe a data structure which is proper for representing cross points and tracing them.

• Journal of the Korea Society of Computer and Information
• /
• v.24 no.5
• /
• pp.35-40
• /
• 2019

In this paper, we design and implement a partial denoising boundary matching system using indexing techniques. Converting boundary images to time-series makes it feasible to perform a fast search using indexes even on a very large image database. Thus, using this converting method we develop a client-server system based on the previous partial denoising research in the GUI(graphical user interface) environment. The client first converts a query image given by a user to a time-series and sends denoising parameters and the tolerance with this time-series to the server. The server identifies similar images from the index by evaluating a range query, which is constructed using inputs given from the client and sends the resulting images to the client. Experimental results show that our system provides many intuitive and accurate matching results.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 1998.06b
• /
• pp.122-127
• /
• 1998

In this paper, we focus on the information retrieval of human individuals who are recorded on the video database. Our purpose is to index persons by their faces or voice and to retrieve their existing time sections on the video data. The database system can track as well as extract a face or voice of a certain person and construct a model of the individual person in self-organization mode. If he appears again at different time, the system can put the mark of the same person to the associated frames. In this way, the same person can be retrieved even if the system does not know his exact name. As the face and speaker modeling, a subspace method is employed to improve the indexing accuracy.

• Proceedings of the IEEK Conference
• /
• 2001.06c
• /
• pp.47-50
• /
• 2001

This paper took advantage of SVD (Singular value Decomposition) techniques of LSI(Latent Semantic Indexing) to grasp easily terminology distribution. Existent LSI did to static database, propose that apply to dynamic database in this paper. But, if dynamic applies LSI to database, updating problem happens. Existent updating way is Recomputing method, Folding-in method, SVD-updating method. Proposed QR decomposition method to show performance improvement than existent three methods in this paper.

• Journal of KIISE:Computing Practices and Letters
• /
• v.9 no.1
• /
• pp.1-12
• /
• 2003

Recently, many researches into distributed processing on Internet, and multimedia data processing have been performed. Rapid and convenient multimedia services supplied with high quality and high speed are to be needed. In this paper, we design and implement clip-based video retrieval system on the Web enviroment in real-time. Our system consists of the content-based indexing system supporting convenient services for video content providers, and the Web-based retrieval system in order to make it easy and various information retrieval for users in the Web. Three important methods are used in the content-based indexing system, key frame extracting method by dividing video data, clip file creation method by clustering related information, and video database construction method by using clip unit. In Web-based retrieval system, retrieval method ny using a key word, two dimension browsing method of key frame, and real-time display method of the clip are used. In this paper, we design and implement the system that supports real-time display method of the clip are used. In this paper, we design and implement the system that supports real-time retrieval for video clips on Web environment and provides the multimedia service in stability. The proposed methods show a usefulness of video content providing, and provide an easy method for serching intented video content.

• Journal of Korea Multimedia Society
• /
• v.15 no.2
• /
• pp.215-225
• /
• 2012

In multimedia database, a multidimensional space-based indexing has been used to increase search efficiency. However, this method is inefficient in terms of ubiquity because it uses Euclidean distance as a scale of distance calculation. On the contrary, a metric space-based indexing method, in which metric axiom is prerequisite is widely available because a metric scale other than Euclidean distance could be used. This paper is attempted to propose a way of improving VP-tree, one of the metric space indexing methods. The VP-tree calculates the distance with an object which is ultimately linked to the a leaf node depending on the node fit for the search range from a root node and examines if it is appropriate with the search range. Because search speed decreases as the number of distance calculations at the leaf node increases, however, this paper has proposed a method which uses the latest interface on query object as the base point of trigonometric inequality for improvement after focusing on the trigonometric inequality-based range compression method in a leaf node. This improvement method would be able to narrow the search range and reduce the number of distance calculations. According to a system performance test using 10,000 video data, the new method reduced search time for similar videos by 5-12%, compared to a conventional method.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2002.11b
• /
• pp.343-346
• /
• 2002

관계데이터베이스를 이용한 XML 데이터저장방법에서 데이터가 삽입, 삭제, 갱신될 경우 인덱스를 제정의해야 하는 부담을 줄여주는 인덱스 기법을 제안한다. XML 데이터를 블록과 블록사이에 많아야 하나의 관계가 유지되도록 블록단위로 나누어 각 블록에 대해 Numbering 스킴을 적용하여 인덱스를 정의한다. 또한 정의된 인덱스를 이용하여 XML 질의 처리하기 Parent-Child Block Merge Algorithm과 Ancestor-Descendent Block Merge Algorithm을 제안한다.

• Proceedings of the IEEK Conference
• /
• 1998.10a
• /
• pp.919-922
• /
• 1998

A content-base search method is required for video which has an unformatted and huge size of data. The index techniue is necessary for the content-based search of the video data. The first step of the video indexing is a cut detection. We propose a dynamic threshold method which change a threshold value during the cut detection process. We demonstrate that the proposed method is more efficient than the existing methods.

• Proceedings of the IEEK Conference
• /
• 2002.06d
• /
• pp.157-160
• /
• 2002

Scene change detection is the fundamental process of automatic video indexing and retrieving. In this paper we propose a method which utilizes both compressed and uncompressed domain methods to detect scene change in a video. Candidate locations for scene change are estimated from DC images and motion vector information in compressed domain. And candidate frames are verified using edge histogram distance and color histogram distance, in uncompressed domain. The experimental results show that scene change can be detected fast and correctly by proposed method.