• The KIPS Transactions:PartB
• /
• v.17B no.2
• /
• pp.163-168
• /
• 2010

A linguistic case-based fuzzy reasoning (LCBFR) based on standardized parametric membership functions (SPMF) is proposed. It provides an efficient mechanism for a fuzzy reasoning within linear time complexity. Thus, it can be used to improve the speed of fuzzy reasoning. In the process of LCBFR, linguistic case indexing and retrieval based on SPMF is suggested. It can be processed relatively fast compared to the previous linguistic approximation methods. From the engineering viewpoint, it may be a valuable advantage.

• Journal of KIISE:Software and Applications
• /
• v.29 no.11
• /
• pp.795-802
• /
• 2002

We propose a fast and powerful Question-answering (QA) system in Korean, which uses a predictive answer indexer based on 2-pass scoring method. The indexing process is as follows. The predictive answer indexer first extracts all answer candidates in a document. Then, using 2-pass scoring method, it gives scores to the adjacent content words that are closely related with each answer candidate. Next, it stores the weighted content words with each candidate into a database. Using this technique, along with a complementary analysis of questions which is based on lexico-syntactic pattern matching method, the proposed QA system saves response time and enhances the precision.

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.7
• /
• pp.799-803
• /
• 2010

The KDB-tree is a traditional indexing scheme for retrieving multidimensional data. Much research for KDB-tree family frequently addresses the low storage utilization and insufficient retrieval performance as their two bottlenecks. The bottlenecks occur due to a number of unnecessary splits caused by data insertion orders and data skewness. In this paper, we propose a novel index structure, called as $KDB_{CS}^+$-tree, to process skewed data efficiently and improve the retrieval performance. The $KDB_{CS}^+$-tree increases the number of fan-outs by exploiting bit-vectors for representing splitting information and pointer elimination. It also improves the storage utilization by representing entries as a hierarchical structure in each internal node.

• Journal of KIISE:Computing Practices and Letters
• /
• v.7 no.1
• /
• pp.12-23
• /
• 2001

Extended path expressions are used to denote multiple paths concisely by using '$\ast$' character. They are convenient for expressing OQL queries to retrieve XML data stored in OODBs. In this paper, we propose a multi-path index scheme as a new index scheme to efficiently process queries with extended path expressions. Our proposed index scheme allocates a unique path identifier for every possible single path in an extended path expression and provides functionalities of both a single path indexing and multiple path indexing through the composition of index key and path identifier while using only a index structure. The proposed index scheme provides better performance than single-path index schemes, and is practical since it can be implemented by little modification of leaf records of a B+-tree index.

• Journal of KIISE:Computing Practices and Letters
• /
• v.7 no.6
• /
• pp.582-592
• /
• 2001

Video indexing plays an important role in the applications such as digital video libraries or web VOD which archive large volume of digital videos. Video indexing is usually based on video segmentation. In this paper, we propose a software tool called V2Web Studio which can generate video clips utilizing shot boundary detection algorithm. With the V2Web Studio, the process of clip generation consists of the following four steps: 1) Automatic detection of shot boundaries by parsing the video, 2) Elimination of errors by manually verifying the results of the detection, 3) Building a modeling structure of logical hierarchy using the verified shots, and 4) Generating multiple video clips corresponding to each logically modeled segment. The aforementioned steps are performed by shot detector, shot verifier, video modeler and clip generator in the V2Web Studio respectively.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.4
• /
• pp.868-876
• /
• 1999

In this paper, an efficient automatic video parsing technique on MPEG-compressed video that is fundamental for content-based indexing is described. The proposed method detects scene changes, regardless of IPB picture composition. To detect abrupt changes, the difference measure based on the dc coefficient in I picture and the macroblock reference feature in P and B pictures are utilized. For gradual scene changes, we use the macroblock reference information in P and B pictures. the process of scene change detection can be efficiently handled by extracting necessary data without full decoding of MPEG sequence. The performance of the proposed algorithm is analyzed based on precision and recall. the experimental results verified the effectiveness of the method for detecting scene changes of various MPEG sequences.

• Journal of Korea Multimedia Society
• /
• v.17 no.10
• /
• pp.1182-1188
• /
• 2014

Recently, the research on database outsourcing has been actively done with the popularity of cloud computing. However, because users' data may contain sensitive personal information, such as health, financial and location information, the data encryption methods have attracted much interest. Existing data encryption schemes process a query without decrypting the encrypted databases in order to support user privacy protection. On the other hand, to efficiently handle the large amount of data in cloud computing, it is necessary to study the distributed index structure. However, existing index structure and query processing algorithms have a limitation that they only consider single-column query processing. In this paper, we propose a grid-based multi column indexing scheme and an encrypted query processing algorithm. In order to support multi-column query processing, the multi-dimensional index keys are generated by using a space decomposition method, i.e. grid index. To support encrypted query processing over encrypted data, we adopt the Hilbert curve when generating a index key. Finally, we prove that the proposed scheme is more efficient than existing scheme for processing the exact and range query.

• International Journal of Internet, Broadcasting and Communication
• /
• v.16 no.1
• /
• pp.140-147
• /
• 2024

In Current artificial structures, we must periodically make their safety inspections. In this process, we should consider the safety of workers and the accuracy of safety checks and also consider time and cost savings for safety inspections. Additionally, in the fields of architecture and civil engineering, we are unavoidable the use of foreign commercialized BIM model tools. To address these challenges, we propose mapping crack areas and BIM 3D design drawings based on augmented reality (AR) for the safety inspection of Huge Bridges. For this purpose, we define indexing of 2D/3D drawing models, create the tabulation of all 2D/3D drawings into a database, analyze QR codes, and finally integrate with augmented reality devices. we may expect our method to improve the efficiency of safety inspections on bridge sites. Moreover, we will enable the domestics of our pure technology.

• 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.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.34C no.5
• /
• pp.71-81
• /
• 1997

This paper proposes noun and affix extraction methods using conjunctive information for making an automatic indexing system thorugh morphological analysis and syntactic analysis. The korean language has a peculiar spacing words rule, which is different from other languages, and the conjunctive information, which is extracted from the rule, can reduce the number of multiple parts of speech at a minimum cost. The proposed algorithms also solve the problem that one word is seperated by newline charcter. We show efficiency of the proposed algorithms through the process of morhologica analyzing.