• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2022.05a
• /
• pp.701-703
• /
• 2022

In this paper, we present a multi-class image scene classification method based on map learning. We were able to learn from the convolutional neural network model in the dataset, classify facial scene images of multiclass people, and classify the optimized CNN model into the Google image dataset in the experiment with significant results.

• Journal of the Korea Society of Computer and Information
• /
• v.20 no.2
• /
• pp.21-28
• /
• 2015

In this paper, we propose a prototype-based classification learning by using the nearest-neighbor rule. The nearest-neighbor is applied to segment the class area of all the training data into spheres within which the data exist from the same class. Prototypes are the center of spheres and their radii are computed by the mid-point of the two distances to the farthest same class point and the nearest another class point. And we transform the prototype selection problem into a set covering problem in order to determine the smallest set of prototypes that include all the training data. The proposed prototype selection method is based on a greedy algorithm that is applicable to the training data per class. The complexity of the proposed method is not complicated and the possibility of its parallel implementation is high. The prototype-based classification learning takes up the set of prototypes and predicts the class of test data by the nearest neighbor rule. In experiments, the generalization performance of our prototype classifier is superior to those of the nearest neighbor, Bayes classifier, and another prototype classifier.

• Journal of the Korea Society of Computer and Information
• /
• v.10 no.2 s.34
• /
• pp.113-121
• /
• 2005

In this paper, we design the hybrid learning algorithm of LVQ which is to perform EMG pattern recognition. The proposed hybrid LVQ learning algorithm is the modified Counter Propagation Networks(C.p Net. ) which is use SOM to learn initial reference vectors and out-star learning algorithm to determine the class of the output neurons of LVa. The weights of the proposed C.p. Net. which is between input layer and subclass layer can be learned to determine initial reference vectors by using SOM algorithm and to learn reference vectors by using LVd algorithm, and pattern vectors is classified into subclasses by neurons which is being in the subclass layer, and the weights which is between subclass layer and class layer of C.p. Net. is learned to classify the classified subclass. which is enclosed a class . To classify the pattern vectors of EMG. the proposed algorithm is simulated with ones of the conventional LVQ, and it was a confirmation that the proposed learning method is more successful classification than the conventional LVQ.

• Journal of the Korea Society of Computer and Information
• /
• v.17 no.7
• /
• pp.45-52
• /
• 2012

In this paper, an crowd density in elevator estimation method based on multi-class Adaboost classifier is proposed. The SOM (Self-Organizing Map) based conventional methods have shown insufficient performance in practical scenarios and have weakness for low reproducibility. The proposed method estimates the crowd density using multi-class Adaboost classifier with texture features, namely, GLDM(Grey-Level Dependency Matrix) or GGDM(Grey-Gradient Dependency Matrix). In order to classify into multi-label, weak classifier which have better performance is generated by modifying a weight update equation of general Adaboost algorithm. The crowd density is classified into four categories depending on the number of persons in the crowd, which can be 0 person, 1-2 people, 3-4 people, and 5 or more people. The experimental results under indoor environment show the proposed method improves detection rate by about 20% compared to that of the conventional method.

• The KIPS Transactions:PartB
• /
• v.8B no.4
• /
• pp.335-342
• /
• 2001

본 논문은 보로노이 공간분류를 활용하여 원격탐사 영상인식을 위한 다층 신경망 분류기를제안한다. 제안된 다층 신경망 분류기는 보로노이 다각형 영역으로 클래스를 구분하며, 초평면 방정식의 계수를 오류 역전과 학습 초기의 연결 강도, 임계치 그리고 은닉층의 노드 수로 결정한다. 제안된 방법은 오류역전과 학습 알고리즘에서 임의로 정해주던 초기 정보를 사전 분석에 의해 공학적으로 결정함으로써 느린 수렴 속도와 학습실패 등의 단점을 피할 수 있는 장점이 있다. 보로노이 다이어그램에 대한 경계선의 초평면 방정식은 훈련집합의 클래스별 평균값을 구하여 Mathematica 패키지로 계산하였다. 제안된 다층 신경망에 의한 영상분류기의 인식능력을 평가하기 위하여 원격탐사 영상인식에서 자주 활용되는 최소거리 분류 방법과 최대우도 분류 방법으로 처리해서 비교한 결과, 최소거리 분류 방법은 실험화상에 대해 81.4%, 최대우도 부류기에 의한 분류는 87.8%, 제안한 방법은 92.2% 정확성을 가진 분류결과를 나타냈다.

• 한국IT서비스학회:학술대회논문집
• /
• 2002.11a
• /
• pp.411-416
• /
• 2002

인터넷의 발전과 더불어 전자메일 사용자가 증가하게 되고, 기업의 고객접촉채널로서 전자메일에 대한 중요성 또한 증가되고 있다. 고객의 요구에 대해 적시에 적절하게 응답하지 못하면 고객의 불만족이 증가하게 되고, 충성도를 감소시켜 결국 장기적 매출 및 수익성 악화를 초래하게 된다. 따라서 고객의 전자메일에 신속, 정확하게 응답할 수 있는 전자 메일 자동관리 시스템의 필요성이 증가되고 있다. 본 연구에서는 나이브 베이지안 학습과 중심점 기반 분류 방법을 이용하여 전자메일 자동관리 시스템에서 전자메일 분류를 수행하는 분류기를 구현한다. 구현된 분류기를 이용하여 실제 기업의 고객 전자메일을 분류하는 실험을 수행하고 두 분류기의 성능을 비교하였다. 실험결과 두 분류기 모두 전자메일 분류에 비교적 우수한 성능을 보였다. 그러나, 클래스 수가 적은 경우 중심점 기반 분류기가 좋은 성능을 보였으나, 학습집합이 작아지면서 두 분류기의 성능 차이는 없었으며, 클래스의 수가 많아지면서 나이브 베이지안 분류기가 더 우수한 성능을 보였다.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.1
• /
• pp.16-22
• /
• 2010

Electrocardiogram(ECG) analysis and arrhythmia recognition are critical for diagnosis and treatment of ill patients. Cardiac arrhythmia is a condition in which heart beat may be irregular and presents a serious threat to the patient recovering from ventricular tachycardia (VT) and ventricular fibrillation (VF). Other arrhythmias like atrial premature contraction (APC), Premature ventricular contraction (PVC) and superventricular tachycardia (SVT) are important in diagnosing the heart diseases. This paper presented new method to classify various arrhythmias contrary to other techniques which are limited to only two or three arrhythmias. ECG is decomposed into Intrinsic Mode Functions (IMFs) by Empirical Mode Decomposition (EMD). Burg algorithm was performed on IMFs to obtain AR coefficients which can reduce the dimension of feature vector and utilized as Multi-class SVM inputs which is basically extended from binary SVM. We chose optimal parameters for SVM classifier, applied to arrhythmias classification and achieved the accuracies of detecting NSR, APC, PVC, SVT, VT and VP were 96.8% to 99.5%. The results showed that EMD was useful for the preprocessing and feature extraction and multi-class SVM for classification of cardiac arrhythmias, with high usefulness.

• Journal of the Korea Society for Simulation
• /
• v.19 no.1
• /
• pp.143-151
• /
• 2010

Fingerprint classification is a step to increase the efficiency of an 1:N fingerprint recognition system and plays a role to reduce the matching time of fingerprint and to increase accuracy of recognition. It is difficult to classify fingerprints, because the ridge pattern of each fingerprint class has an overlapping characteristic with more than one class, fingerprint images may include a lot of noise and an input condition is an exceptional case. In this paper, we propose a novel approach to design a stochastic model and to accomplish fingerprint classification using a directional characteristic of fingerprints for an effective classification of various qualities. We compute the directional value by searching a fingerprint ridge pixel by pixel and extract a directional characteristic by merging a computed directional value by fixed pixels unit. The modified Markov model of each fingerprint class is generated using Markov model which is a stochastic information extraction and a recognition method by extracted directional characteristic. The weight list of classification model of each class is decided by analyzing the state transition matrixes of the generated Markov model of each class and the optimized value which improves the performance of fingerprint classification using GA (Genetic Algorithm) is estimated. The performance of the optimized classification model by GA is superior to the model before the optimization by the experiment result of applying the fingerprint database of various qualities to the optimized model by GA. And the proposed method effectively achieved fingerprint classification to exceptional input conditions because this approach is independent of the existence and nonexistence of singular points by the result of analyzing the fingerprint database which is used to the experiments.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.46 no.1
• /
• pp.112-120
• /
• 2009

Face membership authentication is to decide whether an incoming person is an enrolled member or not using face recognition, and basically belongs to two-class classification where support vector machine (SVM) has been successfully applied. The previous SVMs used for face membership authentication have been trained and tested using image feature vectors extracted from member face images of each class (enrolled class and unenrolled class). The SVM so trained using image feature vectors extracted from members in the training set may not achieve robust performance in the testing environments where configuration and size of each class can change dynamically due to member's joining or withdrawal as well as where testing face images have different illumination, pose, or facial expression from those in the training set. In this paper, we propose an effective class discriminating feature vector-based SVM for robust face membership authentication. The adopted features for training and testing the proposed SVM are chosen so as to reflect the capability of discriminating well between the enrolled class and the unenrolled class. Thus, the proposed SVM trained by the adopted class discriminating feature vectors is less affected by the change in membership and variations in illumination, pose, and facial expression of face images. Through experiments, it is shown that the face membership authentication method based on the proposed SVM performs better than the conventional SVM-based authentication methods and is relatively robust to the change in the enrolled class configuration.

• Proceedings of the Korean Information Science Society Conference
• /
• 1999.10a
• /
• pp.195-197
• /
• 1999

본 연구에서는 인터넷 상의 많은 문서들 중에서 사용자에게 보다 적합한 문서를 제공하기 위해 퍼지 관계성을 이용하여 검색 결과 집합의 문서에서 추출한 키워드간의 유사클래스를 생성한다. 또한, 기존의 키워드 직접 매칭에 의한 검색 방법의 단점이라 할 수 있는 의미적 관계를 가지는 문서에 대한 검색 방법도 제안한다. 생성된 유사 클래스는 사용자의 질의를 확장하여 사용자의 관심도를 보다 많이 반영하게 되고, 그 질의어가 포함된 단어나 구의 발생 빈도수가 높은 문서에 대해 의미적으로 서로 연결시켜 분류한다. 본 연구에서 제안한 알고리즘에 의해 문서를 사용자 관심 정도로 분류, 카테고리를 생성하여 검색 효율을 증대시키고 사용자의 요구에 적합한 결과를 제공하고자 한다.