• Journal of the Korean Society for information Management
• /
• v.12 no.2
• /
• pp.85-101
• /
• 1995

Conventional indexing sytstems support only full-text indexing method for electronic documents and do not use logical structure of documents in retrieval. Most electronic documents are in different formats depending on various systems. Also, they only indicate physical style of the document without considering any logical structure. Thus, in the effort to standardize the exchange of documents. IS0 developed SGML(Stadard Generalized Markup Language) which contains information about logical structure of the documents. In this paper, to resolve the disadvantages of full-text indexing method and to use standard document format. indexing system for SGML document is designed and implemented. In this system, user can assign indexing domain on elements, thus the logical structure of document is reflected in retrieving information. Various retrieval methods can be implemented by using the structural information of the document. In addition, automatic indexing for SGML Hangul document is supported in this system

• Journal of Broadcast Engineering
• /
• v.9 no.2
• /
• pp.151-163
• /
• 2004

In this paper, we propose a content-based video indexing and retrieval system using MPEG-7 standard to retrieve and manage videos efficiently. The proposed system consists of video indexing module for a video DB and video retrieval module to allow various query methods on a web environment. Video indexing module stores metadata such as manually typed in keywords, automatically recognized character names, and MPEG-7 visual descriptors extracted by indexing module into a DB in a sever side. A user can access to retrieval module by a web and retrieve desired videos through various query methods like keywords, faces, example and sketch. For this retrieval system, we propose ATC(Adaptive Twin Comparison) as a cut detection method for efficient video indexing and QBME(Query By Modified Example) as an improved content-based query method for the convenience of users. Experimental results show that the proposed ATC method detects cuts well and the proposed QBME method provides the conveniences better than existing query methods such as QBE(Query By Example) and QBS(Query By Sketch).

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.4
• /
• pp.442-446
• /
• 2010

In this paper we propose an indexing method supporting the browsing scheme for effective image search on large photo database. The proposed method is based on M-tree, a representative indexing scheme on matrix space. While M-tree focuses on the searching efficiency by pruning, it did not consider browsing efficiency directly. This paper proposes node selection method, node splitting method and node splitting conditions for browsing efficiency. According to test results, node cohesion and clustering precision improved 1.5 and twice the original respectively and searching speed also increased twice the original speed.

• Journal of Platform Technology
• /
• v.9 no.4
• /
• pp.3-9
• /
• 2021

In this paper, a graph data model is introduced to effectively recognize the situation between each object on the road detected by vehicles or road infrastructure sensors. The proposed method builds a graph database by modeling each object on the road as a node of the graph and the relationship between objects as an edge of the graph, and updates object properties and edge properties in real time. In this case, the relationship between objects represented as edges is set when there is a possibility of approach between objects in consideration of the position, direction, and speed of each object. Finally, we propose a spatial indexing technique for graph nodes and edges to update the road object graph database represented through the proposed graph modeling method continuously in real time. To show the superiority of the proposed indexing technique, we compare the proposed indexing based database update method to the non-indexing update method through simulation. The results of the simulation show the proposed method outperforms more than 10 times to the non-indexing method.

• Journal of Korean Library and Information Science Society
• /
• v.12
• /
• pp.61-96
• /
• 1985

The human subject analysis of a document has some critical problems. The method results in the inconsistency in analysis process and the contradiction of two objects of the subject analysis (one is the identification of the content for the retrieval of specific items and the other is to identify the content for the grouping of related materials). Since the subject analysis by mechanized has been recognized to be the possible way to aggregate the problems of manual analysis, various a n.0, pproaches of automatic indexing have been studied and experimented. This study is to examine the automatic indexing as one of the promising subject analysis techniques by statistical, syntactical and semantic a n.0, pproaches. In conclusion, the reasonable a n.0, pplication time of the automatic indexing should be made a decision based on the through investigation on the cost verse effectiveness, and automatic indexing system should be developed in the close relationship with the on-line search which is a good retrieval system for information explosion society. From now on, since the machine-readable document-text will be envisaged to be more and more available due to the rapid development of computer technology, the more substantial research on the automatic indexing will be also possible, which can bring about the increasing of practical automatic indexing systems.

• Journal of Internet Computing and Services
• /
• v.10 no.6
• /
• pp.173-189
• /
• 2009

Recently, video data has attracted many interest. That is the reason why efficient indexing schemes are required to support the content-based retrieval of video data. But most indexing schemes are not suitable for indexing a high-dimensional data except Hybrid Spill-Tree. In this paper, we propose an efficient high-dimensional indexing scheme to support the content-based retrieval of video data. For this, we extend Hybrid Spill-Tree by using a newly designed clustering technique and by adopting a signature method. Finally, we show that proposed signature-based high dimensional indexing scheme achieves better retrieval performance than existing M-Tree and Hybrid Spill-Tree.

• Journal of Computing Science and Engineering
• /
• v.6 no.2
• /
• pp.151-160
• /
• 2012

We present a methodology that automatically selects indexing algorithms for each heading in Medical Subject Headings (MeSH), National Library of Medicine's vocabulary for indexing MEDLINE. While manually comparing indexing methods is manageable with a limited number of MeSH headings, a large number of them make automation of this selection desirable. Results show that this process can be automated, based on previously indexed MEDLINE citations. We find that AdaBoostM1 is better suited to index a group of MeSH hedings named Check Tags, and helps improve the micro F-measure from 0.5385 to 0.7157, and the macro F-measure from 0.4123 to 0.5387 (both p < 0.01).

• The KIPS Transactions:PartD
• /
• v.11D no.6
• /
• pp.1221-1230
• /
• 2004

In mobile environments, the locations of moving objects such as vehicles, airplanes and users of wireless devices continuously change over time. For efficiently processing moving object information, the database system should be able to deal with large volume of data, and manage indexing efficiently. However, previous research on indexing method mainly focused on query performance, and did not pay attention to update operation for moving objects. In this paper, we propose a novel moving object indexing method, named ACAR-Tree. For processing efficiently frequently updating of moving object location information as well as query performance, the proposed method is based on fixed grid structure with auxiliary R-Tree. This hybrid structure is able to overcome the poor update performance of R-Tree which is caused by reorganizing of R-Tree. Also, the proposed method is able to efficiently deal with skewed-. or gaussian distribution of data using auxiliary R-Tree. The experimental results using various data size and distribution of data show that the proposed method has reduced the size of index and improve the update and query performance compared with R-Tree indexing method.

• 제어로봇시스템학회:학술대회논문집
• /
• 1992.10a
• /
• pp.1096-1101
• /
• 1992

In order tominimize fixing error of workpieces, circle, prismatic, sphere, cylindrical and sculptures types. Modification Rule by Indexing Table and Modification Rule by NC Program are developed for machining centers by using touch trigger probes. The Modification Rule by Indexing Table meas the alignment of workpiece to NC program through degree of freedoms of indexing table. The Modification Rule by NC Program is the alognment of NC program to workpiece ste-tp condition via the generation of NC progarm. A postprocessing module is alos developed for generating NC-part program(User Macro) to compensate for machining errors in end milling and boring processes. Developed method are verified by experiments.

• Journal of KIISE:Databases
• /
• v.31 no.1
• /
• pp.48-60
• /
• 2004

XML documents consist of elements that are basic units of information. When the structure of XML documents is changed dynamically, we need to update structure information efficiently without changing the information of the index structure for fast retrieval. In this paper, we propose a dynamic indexing model scheme that updates the index structure in real time as the structure of XML documents is changed by insertion and deletion of elements. Our dynamic indexing model consists of a structure information representation method and a dynamic index structure. The structure information representation method supports various types of structure retrievals. Our dynamic index structure processes various structural queries efficiently. We show through various experiments that our method outperforms existing ones in processing various types of queries such as content based queries, structural queries and hybrid queries.