• Journal of KIISE:Software and Applications
• /
• v.29 no.4
• /
• pp.235-247
• /
• 2002

For an efficient indexing and retrieval of digital video data, research on video caption extraction and recognition is required. This paper proposes methods for extracting artificial captions from video data and enhancing their image quality for an accurate Hangul and English character recognition. In the proposed methods, we first find locations of beginning and ending frames of the same caption contents and combine those multiple frames in each group by logical operation to remove background noises. During this process an evaluation is performed for detecting the integrated results with different caption images. After the multiple video frames are integrated, four different image enhancement techniques are applied to the image: resolution enhancement, contrast enhancement, stroke-based binarization, and morphological smoothing operations. By applying these operations to the video frames we can even improve the image quality of phonemes with complex strokes. Finding the beginning and ending locations of the frames with the same caption contents can be effectively used for the digital video indexing and browsing. We have tested the proposed methods with the video caption images containing both Hangul and English characters from cinema, and obtained the improved results of the character recognition.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.1
• /
• pp.76-86
• /
• 1997

Many information retrieval systems have a simple process structure that a client process for a user is mapped to a server process for information retrieval. That is, when using information retrieval systems, each user is allocated a big process that consists of user interfaces, retrieval automatic indexing systems and storage systems. Therefor when many users use the information retrieval systems, it might be difficult to use the information retrieval systems. This is because the system overhead is increased as enormously much as users cannot use them. In this paper, we propose a new process structure for constructing efficient information retrieval systems that solves the problem resulting from he process structure. The proposed process structure contributes to the whole operational performance improvement of information retrieval systems and the efficientnt use of computer system resources. It is constructed based on a multi-threading scheme and a transaction processing monitor.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2007.11a
• /
• pp.217-220
• /
• 2007

In this paper, we present a new anchor shot detection system which is a core step of the preprocessing process for the news video analysis. The proposed system is composed of four modules and operates sequentially: 1) skin color detection module for reducing the candidate face regions; 2) face detection module for finding the key-frames with a facial data; 3) vector representation module for the key-frame images using a non-negative matrix factorization; 4) anchor shot detection module using a support vector data description. According to our computer experiments, the proposed system shows not only the comparable accuracy to the recent other results, but also more faster detection rate than others.

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

Word processor having the functions of a typewriter and a computer together have been used as a powerful tools for office automation. The purpose of this study is to find out the possible areas of the word processing a n.0, pplication in the library operations. For the study, the general concept, developmental process, structure, functions, kinds and suggested a n.0, pplicable areas in the library operations of word processor were investigated. Then, the cases of real a n.0, pplications of word processor in the library field were examplified. In conclusion, the areas where word processor can be of benefit to library workers can be summarized as follows, 1) Orders of books and periodical acquisitions, 2) On-line searching, and storage and editing of input as required, 3) Production of catalogues, and abstracting and indexing bulletin, 4) Budget control, circulation control, and serial control.

• Journal of Information Technology Applications and Management
• /
• v.12 no.1
• /
• pp.125-140
• /
• 2005

Nowadays, we have many embedded systems which store and process multimedia data. For multimedia systems using hard disks as storage media such as DVR, existing file systems are not the right choice to store multimedia data in terms of cost. performance and reliability. In this study we designed a reliable file system with very high performance for embedded multimedia applications. The proposed file system runs with quite simple disk layout to reduce time to initialize and to recover after power failures, uses a large data block to speed up the sequential accesses, incorporates a time-based indexing scheme to improve the time-based random accesses and boosts reliability by backing up the important meta data on a small NVRAM. We implemented the file system on a Linux-based DVR and verified the performance by comparing with existing file systems.

• Journal of Information Technology Applications and Management
• /
• v.10 no.2
• /
• pp.19-31
• /
• 2003

We propose an indexing technique and an index selection algorithm for optimal OLAP query processing in object database systems, Although there are many research results on the relational database systems for OLAP Query processing, few researches have been done on the object database systems. Since OLAP queries represent complex business logic on a huge data ware-house, object database systems supporting the OLAP queries should have higher performance. Proposed bitmap index structure is an extension of conventional bitmap indexes for adapting object databases and provides higher performance with lower space overhead. We also propose a linear time solution of the index selection problem that will be used in the OLAP query optimization process.

• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.37 no.11
• /
• pp.753-761
• /
• 1988

Partial Matrix Refactorization (PR) has been available for refactorization repeatedly. But this paper aims to present Modified PR(MPR), which is faster in (re) factorization speed and simpler in program than PR, but storage is almost as big as that of PR. MPR substitutes refactorization process of PR1 for Modifide Trifactortzation (MT) and, instead of PR 2, adds to PR1 the algoritm that calculates modified element values of modified row / cols. MT, which is subalgorithm for MPR, simplifies the algorithm by applying information vectors to currently used Trifactorization, and trifactorizes and refactorizes in high speed. The test results of Fast Decoupled Load Flow (FDLF) and Contingency Analysis useing Indexing Scheme and Optimal Ordering also prove that MPR is faster than PR.

• The Bulletin of The Korean Astronomical Society
• /
• v.42 no.2
• /
• pp.88.3-89
• /
• 2017

We present our experiences with open-source NoSQL database systems in analyzing spatial and temporal astronomical data. We conduct experiments of using Redis in-memory NoSQL database system by modifying and exploiting its support of geohash for astronmical spatial data. Our experiment focuses on performance, cost, difficulty, and scalability of the database system. We also test OpenTSDB as a possible NoSQL database system to process astronomical time-series data. Our experiments include ingesting, indexing, and querying millions or billions of astronomical time-series measurements. We choose our KMTNet data and the public VVV (VISTA Variables in the Via Lactea) catalogs as test data. We discuss issues in using these NoSQL database systems in astronomy.

• Journal of information and communication convergence engineering
• /
• v.8 no.6
• /
• pp.697-701
• /
• 2010

The numbers of digital video cameras are fast increased. Accordingly, digital video data management is becoming more important. Efficient storing method and fast browsing method still remains to be one of significant issue. In this paper, an optimized data storing process without losing information and an organized appearance features indexing method are proposed. Also, the data removing policy could be used to reduce large amount of space and it facilitates fast sequential search. The appearance features index constructs key information of moving objects to answer queries about what people are doing, particularly when, where and who they move. The evaluation results showed better performance in the transfer time and the saving in storage space.

• Journal of information and communication convergence engineering
• /
• v.18 no.1
• /
• pp.33-38
• /
• 2020

Elasticsearch is an open source search and analytics engine that can search petabytes of data in near real time. It is designed as a distributed system horizontally scalable and highly available. It provides RESTful APIs, thereby making it programming-language agnostic. Full text search of multilingual text requires language-specific analyzers and field mappings appropriate for indexing and searching multilingual text. Additionally, a language detector can be used in conjunction with the analyzers to improve the multilingual text search. Elasticsearch provides more than 40 language analysis plugins that can process text and extract language-specific tokens and language detector plugins that can determine the language of the given text. This study investigates three different approaches to index and search Chinese, Japanese, and Korean (CJK) text (single analyzer, multi-fields, and language detector-based), and identifies the advantages of the language detector-based approach compared to the other two.