• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2006.05a
• /
• pp.291-296
• /
• 2006

일반적으로 운송 컨테이너의 식별자들은 크기나 위치가 정형화되어 있지 않고 외부 환경으로 인한 식별자의 형태가 훼손되어 있기 때문에 일정한 규칙으로는 찾기 힘들다. 본 논문에서는 컨테이너 영상에 대해 ART2 알고리즘을 적용하여 컨테이너 영상을 양자화한다. 제안된 ART2 알고리즘 기반 양자화 기법은 컬러정보를 클러스터링 한 후, 각 클러스터의 중심 패턴을 이용하여 원 영상의 컬러정보를 분류한다. 양자화된 컨테이너 영상에서 8 방향 윤곽선 추적 알고리즘을 적용하여 개별 식별자를 추출한다. 추출된 개별 식별자는 ART2 기반 RBF 네트워크를 개선하여 인식에 적용한다. 실제 컨테이너 영상 300장에 대해 실험한 결과, 제안한 컨테이너 식별자 인식 방법의 추출 및 인식 성능이 기존의 컨테이너 식별자 인식 방법 보다 개선된 것을 확인하였다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2015.10a
• /
• pp.580-582
• /
• 2015

본 프레임워크의 기본 방향은 [공공서비스를 제공하기 위한 재난안전 정보를 구현하기 위한 5단계로 피해지역에 설치된 정보수집 장치로부터 관측된 데이터와 현장에 대한 신고 정보를 취득함으로써 1단계 현장의 상황을 감시/관측하여 피해 현황을 인지할 수 있는 정보수집체계를 구축하고 수집된 데이터 중에서 오류 데이터를 정제하고 정보 모델링의 분류와 그룹핑을 통한 2단계 상황정보를 유형화한다. 그리고 유형화된 상황정보와 관련된 사건을 대상으로 일련의 규칙이나 상호관계를 파악하는 3단계 패턴 분석 과정을 통하여 4단계 공공서비스 매체별 특성을 고려하여 변환함으로써 대국민과 유관기관에게 재난안전 정보를 전달하는 5단계 공공서비스로 구현한다.

• Journal of KIISE:Software and Applications
• /
• v.34 no.9
• /
• pp.880-888
• /
• 2007

Referential expression 'Geot' is often occurred in Korean dialogues. However, it has not been properly dealt with by the previous researchers of reference resolution, since it is not by itself the referential expression like pronoun and definite noun phrases, and it has never been discriminated from non-referring 'geot'. To resolve this problem, we establish a feature set which is based on the linguistic property of 'geot' and the discourse property of its text, and propose a method to identify referential 'geot' from non-referring 'geot' using decision tree. In the experiment, our system achieved the F-measures of 92.3% for non-referring geot and of 82.2% for referential geot and the total classification performance of 89.27%, and outperformed the classification system based on pattern rules.

• The Journal of the Acoustical Society of Korea
• /
• v.13 no.4
• /
• pp.60-68
• /
• 1994

In this paper we propose a new Hybrid learning rule applied to multilayer feedforward neural networks, which is constructed by combining Hebbian learning rule that is a good feature extractor and Back-Propagation(BP) learning rule that is an excellent classifier. Unlike the BP rule used in multi-layer perceptron(MLP), the proposed Hybrid learning rule is used for uptate of all connection weights except for output connection weigths becase the Hebbian learning in output layer does not guarantee learning convergence. To evaluate the performance, the proposed hybrid rule is applied to classifier problems in two dimensional space and shows better performance than the one applied only by the BP rule. In terms of learning speed the proposed rule converges faster than the conventional BP. For example, the learning of the proposed Hybrid can be done in 2/10 of the iterations that are required for BP, while the recognition rate of the proposed Hybrid is improved by about $0.778\%$ at the peak.

• Journal of KIISE
• /
• v.43 no.9
• /
• pp.1008-1014
• /
• 2016

Data such as Twitter, Facebook, and customer reviews belong to the informal document group, whereas, newspapers that have grammar correction step belong to the formal document group. Finding consistent rules or patterns in informal documents is difficult, as compared to formal documents. Hence, there is a need for additional approaches to improve informal document analysis. In this study, we classified Twitter data, a representative informal document, into ten categories. To improve performance, we revised and expanded features based on LDA(Latent Dirichlet allocation) word distribution. Using LDA top-ranked words, the other words were separated or bundled, and the feature set was thus expanded repeatedly. Finally, we conducted document classification with the expanded features. Experimental results indicated that the proposed method improved the micro-averaged F1-score of 7.11%p, as compared to the results before the feature expansion step.

• Journal of KIISE:Databases
• /
• v.35 no.6
• /
• pp.505-517
• /
• 2008

This paper proposes a rewriting algorithm of OWL-DL ontology query in SPARQL. Currently, to obtain inference results of given SPARQL queries, Web ontology repositories construct inference ontology models and match the SPARQL queries with the models. However, an inference model requires much larger space than its original base model, and reusability of the model is not available for other inferrable SPARQL queries. Therefore, the aforementioned approach is not suitable for large scale SPARQL query processing. To resolve tills issue, this paper proposes a novel SPARQL query rewriting algorithm that can obtain results by rewriting SPARQL queries and accomplishing query operations against the base ontology model. To achieve this goal, we first define OWL-DL inference rules and apply them on rewriting graph pattern in queries. The paper categorizes the inference rules and discusses on how these rules affect the query rewriting. To show the advantages of our proposal, a prototype system based on lena is implemented. For comparative evaluation, we conduct an experiment with a set of test queries and compare of our proposal with the previous approach. The evaluation result showed the proposed algorithm supports an improved performance in efficiency of the inferrable SPARQL query processing without loss of completeness and soundness.

• Journal of KIISE:Software and Applications
• /
• v.35 no.9
• /
• pp.562-571
• /
• 2008

For the purpose of building domain ontology, this paper proposes a methodology for building core ontology first, and then enriching the core ontology with the concepts and relations in the domain thesaurus. First, the top-level concept taxonomy of the core ontology is built using domain dictionary and general domain thesaurus. Then, the concepts of the domain thesaurus are classified into top-level concepts in the core ontology, and relations between broader terms (BT) - narrower terms (NT) and related terms (RT) are classified into semantic relations defined for the core ontology. To classify concepts, a two-step approach is adopted, in which a frequency-based approach is complemented with a similarity-based approach. To classify relations, two techniques are applied: (i) for the case of insufficient training data, a rule-based module is for identifying isa relation out of non-isa ones; a pattern-based approach is for classifying non-taxonomic semantic relations from non-isa. (ii) For the case of sufficient training data, a maximum-entropy model is adopted in the feature-based classification, where k-NN approach is for noisy filtering of training data. A series of experiments show that performances of the proposed systems are quite promising and comparable to judgments by human experts.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.17 no.7
• /
• pp.970-976
• /
• 2007

In this study, Polynomial Network Pattern Classifier(PNC) based on Fuzzy Inference Mechanism is designed and its parameters such as learning rate, momentum coefficient and fuzzification coefficient are optimized by means of Particle Swarm Optimization. The proposed PNC employes a partition function created by Fuzzy C-means(FCM) clustering as an activation function in hidden layer and polynomials weights between hidden layer and output layer. Using polynomials weights can help to improve the characteristic of the linear classification of basic neural networks classifier. In the viewpoint of linguistic analysis, the proposed classifier is expressed as a collection of "If-then" fuzzy rules. Namely, architecture of networks is constructed by three functional modules that are condition part, conclusion part and inference part. The condition part relates to the partition function of input space using FCM clustering. In the conclusion part, a polynomial function caries out the presentation of a partitioned local space. Lastly, the output of networks is gotten by fuzzy inference in the inference part. The proposed PNC generates a nonlinear discernment function in the output space and has the better performance of pattern classification as a classifier, because of the characteristic of polynomial based fuzzy inference of PNC.

• Journal of KIISE:Databases
• /
• v.28 no.4
• /
• pp.545-557
• /
• 2001

In this paper we propose a hierarchical classification algorithm based on rough membership function which can reason a new object approximately. We use the fuzzy reasoning method that substitutes fuzzy membership value for linguistic uncertainty and reason approximately based on the composition of membership values of conditional sttributes Here we use the rough membership function instead of the fuzzy membership function It can reduce the process that the fuzzy algorithm using fuzzy membership function produces fuzzy rules In addition, we transform the information system to the understandable minimal decision information system In order to do we, study the discretization of continuous valued attributes and propose the discretization algorithm based on the rough membership function and the entropy of the information theory The test shows a good partition that produce the smaller decision system We experimented the IRIS data etc. using our proposed algorithm The experimental results with IRIS data shows 96%~98% rate of classification.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.26 no.8
• /
• pp.1148-1157
• /
• 2022

In 2019, COVID-19 changed many people's lives. Among them, metaverse supports non-face-to-face services through various methods, replacing daily tasks. This phenomenon was created and formed like a culture due to the prolonged COVID-19. In this paper, the fun elements used in the existing game were organized to find out the fun factors of the metaverse, and the items and contents were reclassified according to the metaverse with five experts. Classification was classified using reproducibility, sensory fun [graphic, auditory, text, manipulation, empathy, play, perspective], challenging fun [absorbedness, challenging, discovery, thrill, reward, problem-solving], imaginative fun [new story, love, freedom, agency, expectation, change], social fun[rules, competition, social behavior, status, cooperation, participation, exchange, belonging, currency transaction], interactive fun[decision making, communication sharing, hardware, empathy, nurturing, autonomy], realistic fun[sense of unity in reality, easy of learning, adaptation, intellectual problems solving, pattern recognition, sense of reality, community], and creative fun[application, creation, customizing, virtual world].