• Journal of Internet Computing and Services
• /
• v.8 no.4
• /
• pp.159-171
• /
• 2007

This paper proposes a software tool MADE that is useful to develop a practical Korean morphological analyzer. A morphological analysis is performed by using adjacency conditions provided by a morphological dictionary. This means that developing a morphological analyzer is reduced merely to constructing a morphological dictionary. No programming skill is required in this process, MADE provides with useful functions that facilitate the construction of a dictionary. Once a dictionary is constructed, the morphological analysis engine embedded in MADE may be used as a stand-alone morphological analyzer or be integrated into an application software which requires a Korean morphological analysis module.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.18 no.1
• /
• pp.133-138
• /
• 2008

In this paper, we propose a novel anchor shot detection system, named to MASD (Multi-phase Anchor Shot Detection), 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) one class SVM module for determining the anchor shots using a support vector data description. Besides the qualitative analysis, our experiments validate that the proposed system shows not only the comparable accuracy to the recently developed methods, but also more faster detection rate than those of others.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.10b
• /
• pp.43-45
• /
• 2003

Nowadays, with numerous emerging applications (e.g., traffic control, meteorology monitoring, mobile computing, etc.), access methods to process current and future queries for moving objects are becoming increasingly important. Among these methods, the time-parameterized R-tree (TPR-tree) seems likely the most flexible method in one, two, or three-dimensional space. A key point of TPR-tree is that the (conservative) bounding rectangles are expressed by functions of time. In this paper, we propose a new method, which takes into account positions of its moving objects against the rectangle's bounds. In proposed method, the size of bounding rectangle is significantly smaller than the traditional bounding rectangle in many cases. By this approach, we believe that the TPR-tree can improve query performance considerably.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.7
• /
• pp.1955-1961
• /
• 1999

비디오 데이터는 비정형 데이터이고 정보의 양이 방대하기 때문에 내용기반 검색 방법이 필요하다. 비디오 데이터의 내용기반 검색을 위해서는 동영상 데이터의 색인이 필요한데, 일반적으로 비디오 색인을 하기 위한 시작점은 컷 검출이다. 본 논문에서는 컷 검출의 효율성을 향상시키기 위해서 컷 검출 과정 중 임계값이 동적으로 변화하는 동적 임계값 기법을 제안한다. 구현과 실험을 통하여 제안하는 방법이 기존의 방법보다 효율적임을 보였다. 6a A content-based search method is required for video which has an unformatted and huge size of data. The index technique 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 changes a threshold value during the cut detection process. We demonstrate that the proposed method is more efficient than the existing methods.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2004.05a
• /
• pp.113-116
• /
• 2004

웹의 출현으로 XML 데이터에 대한 관심은 더욱 커지고 있다. XPath와 XQuery 같은 XML 질의 언어는 비정규적인 데이터를 탐색하기 위해 경로에 라벨을 붙여 사용한다. 이러한 XML 데이터에 대한 질의를 효율적으로 처리하기 위해서는 효율적인 색인 기법이 필요하다. 그 동안 제안되어 왔던 기존의 색인은 일반적으로 XML 데이터 안에 루트 원소로부터 모든 경로의 라벨을 기록한다. 그런 경로 색인들은 자손을 찾는 "//"와 같은 상대 경로를 포함한 질의 경우 지나친 탐색으로 질의 수행의 성능을 저하시키게 된다. 이를 극복하기 위해 효율적인 색인 기법을 제안하고자 한다.

• Korean Journal of Remote Sensing
• /
• v.39 no.1
• /
• pp.111-127
• /
• 2023

In visual slam and 3D data modeling, the Iterative Closest Point method is a primary fundamental algorithm, and many technical fields have used this method. However, it relies on search methods that take a high search time. This paper solves this problem by applying an effective point cloud refinement method. And this paper also accelerates the point cloud registration process with an indexing scheme using the spatial decomposition method. Through some experiments, the results of this paper show that the proposed point cloud refinement method helped to produce better performance.

• International journal of advanced smart convergence
• /
• v.12 no.1
• /
• pp.1-8
• /
• 2023

Smart IoT over high speed network and high performance smart devices explodes the ubiquitous services and applications. Nearest Neighbor(NN) query is one of the important type of queries that have to be supported for ubiquitous information services. In order to process efficiently NN queries in the wireless broadcast environment, it is important that the clients determine quickly the search space and filter out NN from the candidates containing the search space. In this paper, we propose a hybrid index of Voronoi and grid partition to provide quick search space decision and rapid filtering out NN from the candidates. Grid partition plays the role of helping quick search space decision and Voronoi partition providing the rapid filtering. We show the effectiveness of the proposed index by comparing the existing indexing schemes in the access time and tuning time. The evaluation shows the proposed index scheme makes the two performance parameters improved than the existing schemes.

• Journal of the Daesoon Academy of Sciences
• /
• v.19
• /
• pp.21-45
• /
• 2005

The purpose of this study is to examine the establishment and development of Daesoon Thought Thesaurus. Specifically, this study examined the matters to be considered in the stage of Thesauri planning according to the Thesauri Construction process : presents the methods and standards of Thesauri Construction according to processes such as identification of the indexing policy, establishment of Thesauri system, collection of vocabulary, selection of preferred term, clustering of the terms, establishment of term relationships, overall adjustment, Thesauri test, proofreading by professional display, maintenance and updating. Since religion information is unique or totally different from the information in other areas, it is most important to construct the Thesauri suitable for system after carefully recognizing the concept of religion terms.

• Journal of the Korean Society of Safety
• /
• v.27 no.3
• /
• pp.189-196
• /
• 2012

Fire is one of the greatest threats to historical buildings not only to the building's occupants but also to the building's structure and contents. The purpose of this research is to evaluate fire risk in historical buildings in Korea through a series of survey and review. In this research, a multicriteria decision-making approach involving Analytical Hierarchy Process has been designed to determine a weighted index to identify factors and quantify fire risk. Fire risk ranking systems of historical building has been developed in some applications, for example, BOCA, WISCONSIN, FSES and HFRI. According to the such derived fire risk indexing, the Human Activity index showed the highest risk, followed by Historic Buildings, Fire Safety Systems, and then Natural Environmental Causes. Comparison of these factors indicates that the derived risk values differ from case to case. It is proposed that a performance-based design approach should consider the building & occupant characteristics, locations and historical significance, resulting in a more accurate and effective evaluation of fire risk.

• Journal of the Society of Naval Architects of Korea
• /
• v.35 no.4
• /
• pp.109-117
• /
• 1998

In a preliminary design available information is limited, so it makes attractive to rely on the design cases of existing ships to design new ships. In this paper a prototype of the case-based conceptual design system of a ship is developed to support systematically the design process. This system not only generates design candidates through a case indexing, but also determines the priorities of the candidates by using nearest neighbor matching algorithm. The final solution is presented through adaptation process. The validation of the system was examined and verified by applying to conceptual ship design stage.