• Proceedings of the Korean Society of Computer Information Conference
• /
• 2016.01a
• /
• pp.343-345
• /
• 2016

본 논문에서는 아동이 그린 그림에 대해 ART2 알고리즘을 적용하여 색채 정보를 군집화하고, 군집화 된 색채 정보의 중심 벡터 값들을 퍼지화 한다. 퍼지화 된 색채 정보의 소속도를 퍼지 추론 규칙에 적용한 후에 비퍼지화 한다. 비퍼지화 된 결과를 적용하여 아동의 심리 상태를 분석한다. 제안된 방법을 실험하여 알슐러와 해트윅(Alschuler and Hattwick)의 색채에 따른 심리 상태와 비교한 결과, 제안된 심리 분석 방법이 알슐러와 해트윅의 색채에 따른 심리 상태 분석 결과와 거의 일치하는 것을 확인하였다.

• Proceedings of the KAIS Fall Conference
• /
• 2003.11a
• /
• pp.84-87
• /
• 2003

This paper proposes the enhanced REF network, which arbitrates learning rate and momentum dynamically by using the fuzzy system, to arbitrate the connected weight effectively between the middle layer of REF network and the output layer of REF network. ART2 is applied to as the learning structure between the input layer and the middle layer and the proposed auto-turning method of arbitrating the learning rate as the method of arbitrating the connected weight between the middle layer and the output layer. The enhancement of proposed method in terms of learning speed and convergence is verified as a result of comparing it with the conventional delta-bar-delta algorithm and the REF network on the basis of the ART2 to evaluate the efficiency of learning of the proposed method.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.22 no.11
• /
• pp.1428-1434
• /
• 2018

Canine cataract is developed with aging and can cause the blindness or surgical treatment if not treated timely. In this paper, we propose a method for extracting cataract suspicious areas automatically with FCM(Fuzzy C_Means) algorithm to overcome the weakness of previously attempted ART2 based method. The proposed method applies the fuzzy stretching technique and the Max-Min based average binarization technique to the dog eye images photographed by simple devices such as mobile phones. After applying the FCM algorithm in quantization, we apply the brightness average binarization method in the quantized region. The two binarization images - Max-Min basis and brightness average binarization - are ANDed, and small noises are removed to extract the final cataract suspicious areas. In the experiment with 45 dog eye images with canine cataract, the proposed method shows better performance in correct extraction rate than the ART2 based method.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.12 no.3
• /
• pp.129-139
• /
• 2002

As internet expands, the possibility of attack through the network is increasing. So we need the technology which can detect the attack to the system or the network spontaneously. The purpose of this paper proposes the system to detect intrusion automatically using the Adaptive Resonance Theory2(ART2) which is one of artificial neural network The parameters of the system was tunned by ART2 algorithm using a lot of normal packets and various attack packets which were intentionally generated by attack tools. The results were compared and analyzed with conventional methods.

• Journal of the Korea Society of Computer and Information
• /
• v.15 no.2
• /
• pp.27-34
• /
• 2010

Recently, lots of internet service companies provide on-line health diagnosis systems. But general persons not having expert knowledge are difficult to use, because most of the health diagnosis systems present prescriptions or dietetic treatments for diseases based on western medicine. In this paper, a self health diagnosis system of oriental medicine coinciding with physical characteristics of Korean using fuzzy ART algorithm, is proposed. In the proposed system, three high rank of diseases having high similarity values are derived by comparing symptoms presented by a user with learned symptoms of specific diseases based on treatment records using neural networks. And also the proposed system shows overall symptoms and folk remedies for the three high rank of diseases. Database on diseases and symptoms is built by several oriental medicine books and then verified by a medical specialist of oriental medicine. The proposed self health diagnosis system of oriental medicine showed better performance than conventional health diagnosis systems by means of learning diseases and symptoms using treatment records.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.14 no.7
• /
• pp.830-837
• /
• 2004

Neural networks-based fault diagnosis algorithm to detect and isolate faults in the nonlinear systems is proposed. In the proposed method, the fault is detected when the errors between the system output and the multilayer neural network-based nominal model output cross a Predetermined threshold. Once a fault in the system is detected, the system outputs are transferred to the fault classifier by nultilayer/ART2 NN (adaptive resonance theory 2 neural network) for fault isolation. From the computer simulation results, it is verified that the proposed fault diagonal method can be performed successfully to detect and isolate faults in a nonlinear system.

• Transactions of the Korean Society of Automotive Engineers
• /
• v.25 no.1
• /
• pp.92-102
• /
• 2017

For an automotive surveillance radar system, fast-chirp train based FMCW (Frequency Modulated Continuous Wave) radar is a very effective method, because clutter and moving targets are easily separated in a 2D range-velocity map. However, pedestrians with low echo signals may be masked by strong clutter in actual field. To address this problem, we proposed in the previous work a clutter cancellation and moving target indication algorithm using the coherent phase method. In the present paper, we initially composed the test set-up using a 24 GHz FMCW transceiver and a real-time data logging board in order to verify this algorithm. Next, we created two indoor test environments consisting of moving human and stationary targets. It was found that pedestrians and strong clutter could be effectively separated when the proposed method is used. We also designed and implemented these algorithms in FPGA (Field Programmable Gate Array) in order to analyze the hardware and time complexities. The results demonstrated that the complexity overhead was nearly zero compared to when the typical method was used.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2008.05a
• /
• pp.369-374
• /
• 2008

음악 연구에 따른 컴퓨터의 역할이 점자 중요한 비중을 차지함에 따라 보다 효과적인 악보 인식과 효율적인 악보의 편집 및 수정 방법이 요구된다. 기존의 수동 입력 방식에서는 악보를 부정확하게 입력하여 수정하는 경우에는 작업 시간이 많이 소요되며, 각 수정 프로그램에서 만든 악보는 특정 프로그램에서만 재수정이 가능하다는 단점이 있다. 본 논문에서는 이러한 단점을 보완하기 위하여 이미 작성 되어있는 악보들을 자동으로 인식하는 방법을 제안한다. 제안된 악보 인식 방법은 수평 히스토그램을 이용하여 악보 이미지의 오선을 제거한 후, 4방향 윤곽선 추적 알고리즘을 적용하여 잡음을 제거하고 Grassfire 알고리즘을 적용하여 악보 구성 기호들을 추출한다. 추출된 악보 구성 기호들은 Hierarchical ART2 알고리즘을 적용하여 인식한다. 인식된 악보구성 기초들을 이용하여 악보 구성 기호들이 속하는 마디의 위치 정보를 각각 저장하고 향후에 악보 구성 기호의 편집과 수정이 용이하게 한다. 제안된 악보 인식 방법의 성능을 평가하기 위해 100장의 악보 영상을 대상으로 실험한 결과, 제시된 Hierarchical ART2 알고리즘을 이용한 악보 영상의 인식 방법이 실험을 통해서 효율적인 것을 확인하였다.

• The KIPS Transactions:PartD
• /
• v.15D no.4
• /
• pp.531-540
• /
• 2008

An Adaptive Random Testing(ART) is one of test case generation algorithms, which was designed to get better performance in terms of fault-detection capability than that of Random Testing(RT) algorithm by locating test cases in evenly spreaded area. Two ART algorithms, such as Distance-based ART(D-ART) and Restricted Random Testing(RRT), had been indicated that they have significant drawbacks in computations, i.e., consuming quadratic order of runtime. To reduce the amount of computations of D-ART and RRT, iterative partitioning of input domain strategy was proposed. They achieved, to some extent, the moderate computation cost with relatively high performance of fault detection. Those algorithms, however, have yet the patterns of non-uniform distribution in test cases, which obstructs the scalability. In this paper we analyze the distribution of test cases in an iterative partitioning strategy, and propose a new method of input domain enlargement which makes the test cases get much evenly distributed. The simulation results show that the proposed one has about 3 percent of improvement in terms of mean relative F-measure for 2-dimension input domain, and shows 10 percent improvement for 3-dimension space.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2007.06a
• /
• pp.262-267
• /
• 2007

퍼지 ART 알고리즘에서 경계 변수는 패턴들을 클러스터링하는데 있어서 반지름 값이 되며 임의의 패턴과 저장된 패턴과의 불일치(mismatch) 허용도를 결정한다. 이 경계 변수가 크면 입력 벡터와 기대 벡터 사이에 약간의 차이가 있어도 새로운 카테고리(category)로 분류하게 된다. 반대로 경계 변수가 작으면 입력 벡터와 기대 벡터 사이에 많은 차이가 있더라도 유사성이 인정되어 입력 벡터들을 대략적으로 분류한다. 따라서 영상 인식에 적용하기 위해서는 경험적으로 경계 변수를 설정해야 단점이 있다. 그리고 연결 가중치를 조정하는 과정에서 학습률의 설정에 따라 저장된 패턴들의 정보들이 손실되는 경우가 발생하여 인식율을 저하시킨다. 본 논문에서는 퍼지 ART 알고리즘의 문제점을 개선하기 위하여 퍼지 논리 접속 연산자를 이용하여 경계 변수를 동적으로 조정하고 저장 패턴들과 학습 패턴간의 실제적인 왜곡 정도를 충분히 고려하여 승자 노드로 선택된 빈도수를 학습률로 설정하여 가중치 조정에 적용한 개선된 퍼지 ART 알고리즘을 제안하였다. 제안된 방법의 성능을 확인하기 위해서 실제 영문 명함에서 추출한 영문자들을 대상으로 실험한 결과, 기존의 ART1과 ART2 알고리즘이나 퍼지 ART 알고리즘보다 클러스터의 수가 적게 생성되었고 인식 성능도 기존의 방법들보다 우수한 성능이 있음을 확인하였다.