• Journal of the Korea Computer Industry Society
• /
• v.5 no.9
• /
• pp.859-872
• /
• 2004

With the rapid advance of computer and communication techonology, the recent trend of education environment is edveloping in the ubiquitous learning (u-learning) direction that learners select and organize the contents, time and order of learning by themselves. Since the amount of education information through the internet is increasing rapidly and it is managed in document in an effective way is necessary. The document clustering is integrated documents to subject by classifying a set of documents through their similarity among them. Accordingly, the document clustering can be used in exploring and searching a document and it can increased accuracy of search. This paper proposes an efficient incremental clustering method for a set of documents increase gradually. The incremental document clustering algorithm assigns a set of new documents to the legacy clusters which have been identified in advance. In addition, to improve the correctness of the clustering, removing the stop words can be proposed.

• Journal of Korea Game Society
• /
• v.18 no.1
• /
• pp.125-134
• /
• 2018

This paper presents a practical method to efficiently extract the rotational part of a $3{\times}3$ matrix that changes continuously in time. This is the key technique in the corotational FEM and the shape matching deformation popular in physics-based dynamic deformation. Recently, in contrast to the traditional polar decomposition methods independent of time, an iterative method was proposed that formulates the rotation extraction in a physics-based way and exploits an incremental representation of rotation. We develop an optimization method that reduces the number of iterations under the assumption that the maximum magnitude of the incremental rotation vector is limited within ${\pi}/2$. Realistic simulation of dynamic deformation employs a sufficiently small time step, and thus this assumption is not problematic in practice. We demonstrate the efficiency and practicality of our method in various experiments.

• Journal of IKEEE
• /
• v.12 no.1
• /
• pp.65-74
• /
• 2008

One of the popular methods used for pattern classification is the MBR (Memory-Based Reasoning) algorithm. Since it simply computes distances between a test pattern and training patterns or hyperplanes stored in memory, and then assigns the class of the nearest training pattern, it is notorious for memory usage and can't learn additional information from new data. In order to overcome this problem, we propose an incremental learning algorithm (iMPA). iMPA divides the entire pattern space into fixed number partitions, and generates representatives from each partition. Also, due to the fact that it can not learn additional information from new data, we present iMPA which can learn additional information from new data and not require access to the original data, used to train. Proposed methods have been successfully shown to exhibit comparable performance to k-NN with a lot less number of patterns and better result than EACH system which implements the NGE theory using benchmark data sets from UCI Machine Learning Repository.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.8A
• /
• pp.786-795
• /
• 2002

In this paper, we present a histogram and moment-based vidoe scencd change detection technique using hierarchical Hidden Markov Models(HMMs). The proposed method extracts histograms from a low-frequency subband and moments of edge components from high-frequency subbands of wavelet transformed images. Then each HMM is trained by using histogram difference and directional moment difference, respectively, extracted from manually labeled video. The video segmentation process consists of two steps. A histogram-based HMM is first used to segment the input video sequence into three categories: shot, cut, gradual scene changes. In the second stage, a moment-based HMM is used to further segment the gradual changes into a fade and a dissolve. The experimental results show that the proposed technique is more effective in partitioning video frames than the previous threshold-based methods.

• The Journal of the Korea Contents Association
• /
• v.7 no.2
• /
• pp.11-20
• /
• 2007

AAM has been successfully applied to face alignment, but its performance is very sensitive to initial values. In this paper, we propose a face alignment method using progressive AAM. The proposed method consists of two stages; modelling and relation derivation stage and fitting stage. Modelling and relation derivation stage first builds two AAM models; the inner face AAM model and the whole face AAM model and then derive the relation matrix between the inner face AAM model parameter vector and the whole face AAM model parameter vector. The fitting stage is processed progressively in two phases. In the first phase, the proposed method finds the feature parameters for the inner facial feature points of a new face, and then in the second phase it localizes the whole facial feature points of the new face using the initial values estimated utilizing the inner feature parameters obtained in the first phase and the relation matrix obtained in the first stage. Through experiments, it is verified that the proposed progressive AAM-based face alignment method is more robust with respect to pose, and face background than the conventional basic AAM-based face alignment.

• Journal of KIISE:Software and Applications
• /
• v.34 no.12
• /
• pp.1045-1055
• /
• 2007

Latent topic models are statistical models which automatically captures salient patterns or correlation among features underlying a data collection in a probabilistic way. They are gaining an increased popularity as an effective tool in the application of automatic semantic feature extraction from text corpus, multimedia data analysis including image data, and bioinformatics. Among the important issues for the effectiveness in the application of latent topic models to the massive data set is the efficient learning of the model. The paper proposes an accelerated learning technique for PLSA model, one of the popular latent topic models, by an incremental EM algorithm instead of conventional EM algorithm. The incremental EM algorithm can be characterized by the employment of a series of partial E-steps that are performed on the corresponding subsets of the entire data collection, unlike in the conventional EM algorithm where one batch E-step is done for the whole data set. By the replacement of a single batch E-M step with a series of partial E-steps and M-steps, the inference result for the previous data subset can be directly reflected to the next inference process, which can enhance the learning speed for the entire data set. The algorithm is advantageous also in that it is guaranteed to converge to a local maximum solution and can be easily implemented just with slight modification of the existing algorithm based on the conventional EM. We present the basic application of the incremental EM algorithm to the learning of PLSA and empirically evaluate the acceleration performance with several possible data partitioning methods for the practical application. The experimental results on a real-world news data set show that the proposed approach can accomplish a meaningful enhancement of the convergence rate in the learning of latent topic model. Additionally, we present an interesting result which supports a possible synergistic effect of the combination of incremental EM algorithm with parallel computing.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2003.11c
• /
• pp.1669-1672
• /
• 2003

이 논문은 레거시 시스템에 대한 도메인 분석을 통한 소프트웨어 컴포넌트 식별을 제안하고자 한다. 이 방법은 공통/비공통 프로세스 컴포넌트를 추출하기 위한 워크플로우 기반의 도메인 모델링으로, 점진적, 반복적으로 각각의 사용자(개발자, 설계자, 시험자 등등)에게 적당한 크기의 프로세스 컴포넌트를 추출하고 마지막 단계에서 UML 기법으로 컴포넌트 내의 객체를 추출하고자 한다. 그래서 기존의 워크플로우 메커니즘의 확장 보완을 제시한다. 이 방법 적용 예로써 학생 학위 허가 시스템(Student Degree Matriculation System)을 적용 사례로 이용한다. 그리고 이 확장된 워크플로우 메커니즘은 IT 분야나 비즈니스 모델링은 물론 병렬 시스템, 텔레 통신 시스템, 실시간 시스템까지도 모델링 할 수 있으리라 본다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2003.05b
• /
• pp.1031-1034
• /
• 2003

XML은 통합된 데이터 모델을 지원하기 위한 언어로, 특정 분야의 데이터에 대한 친환 및 통합의 필요성이 증대되어지고 있다. 일반적으로 데이터 교환은 다양한 공급자에 의해 독립적으로 운용 및 서비스됨으로서 개별적으로 데이터를 수집해야 하며 재배포 과정 또한 어렵다. 따라서 데이터 재배포 과정을 간소화하고 데이터 교환의 최적화를 위해 데이터 통합을 위한 재구성 방법이 필요하다. 본 논문에서는 특정 분야의 유사한 구조로 구성된 여러 문서를 입력받아 하나의 통합된 문서로 재구성할 수 있는 시스템을 제안한다. 제안된 시스템은 색인기법을 기반으로 추출된 정보를 하나의 문서로 매핑하기 위해 데이터 사전을 선계하고, 하나의 통합된 문서를 점진적인 과정을 통하여 재구성한다 따라서 재구성된 문서는 재배포 과정을 간소화할 수 있으며, 데이터 교환의 최적화는 물론 전자문서교환(EDI)에 있어서 정보교환 능력을 증가시킬 수 있다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2017.11a
• /
• pp.861-864
• /
• 2017

사이버 ISR을 통하여 정보를 획득하는 과정에서 데이터를 추출하고 이를 스스로 가공하여 의사결정에 도움을 줄 수 있는 에이전트를 연구하는 과정에서 폐쇄망에 침투했을 경우 이를 효과적으로 감시 정찰할 수 있는 방법을 논의한다. 폐쇄망으로 인하여 침투한 컴퓨터에 심어진 에이전트는 C&C서버와 원활한 교류가 불가능하게 되는데, 이때 스스로 살아남아 지속적으로 데이터를 수집하며, 분석을 하기 위해서는 한정된 자원과 시간을 활용하여야 발각되지 않고 계속하여 임무를 수행할 수 있다. 특히 분석하는 과정에서 많은 자원과 시간을 활용하는 때 이를 해결하기 위해 본인은 점진적 학습방법을 이용하는 것을 제안하며, 일괄학습 방법과 함께 비교하는 실험을 해보았다.

• Journal of the Korea Computer Industry Society
• /
• v.3 no.9
• /
• pp.1287-1294
• /
• 2002

The algorithm method for progressive image coding based on discrete wavelet transform presented in a paper. After discrete wavelet transform and extract edge information through edge detection, and then designed efficient coding method more then established embedded coding algorithm using expanded EZW algorithm. Generally, edges have a relatively higher influence on image reconstruction. Occurred DWT on image, and can classify significant coefficients and non-significant coefficients. Using property that edge part has appeared significant coefficient in the paper. Especially, we confirmed that higher frequency sub region on DWT image present homogenous direction property. And on embedded coding, which are effective and well-directed information have higher priority to image reconstruction on transmission. Therefore, our technique algorithm system perform better than that of the conventional method such as progressive image coding application.