• Title/Summary/Keyword: ART Algorithm

Search Result 579, Processing Time 0.022 seconds

Passports Recognition Using ART2-Based RBF Network (ART2 기반 RBF 네트워크를 이용한 여권 인식)

  • Kim Kwang-Baek;Oh Am-Suk
    • Journal of Korea Multimedia Society
    • /
    • v.8 no.5
    • /
    • pp.700-706
    • /
    • 2005
  • The immigration control system authorizes the immigration of travelers by means of passport inspections such as the judgment of forged passports, the search for a wanted criminal or a person disqualified for immigration, etc. The judgment of forged passports plays an important role in the immigration control system. Therefore, as the pre-phase for the judgment of forged passports, this paper proposed a novel method for the recognition of passport using ART2-based RBF network. The proposed method extracts the area of code and individual codes by applying the Sobel masking, the smearing and the contour tracking algorithm in turn to the passport image. This paper proposed the RBF network that applies the ART2 algorithm to the middle layer, and applied the enhanced RBF network to the recognition of individual codes. The results of the experiments for performance evaluation on the real passport images showed that the proposed method has the better performance compared with other approaches.

  • PDF

Fault Diagnostics Algorithm of Rotating Machinery Using ART-Kohonen Neural Network

  • An, Jing-Long;Han, Tian;Yang, Bo-Suk;Jeon, Jae-Jin;Kim, Won-Cheol
    • Transactions of the Korean Society for Noise and Vibration Engineering
    • /
    • v.12 no.10
    • /
    • pp.799-807
    • /
    • 2002
  • The vibration signal can give an indication of the condition of rotating machinery, highlighting potential faults such as unbalance, misalignment and bearing defects. The features in the vibration signal provide an important source of information for the faults diagnosis of rotating machinery. When additional training data become available after the initial training is completed, the conventional neural networks (NNs) must be retrained by applying total data including additional training data. This paper proposes the fault diagnostics algorithm using the ART-Kohonen network which does not destroy the initial training and can adapt additional training data that is suitable for the classification of machine condition. The results of the experiments confirm that the proposed algorithm performs better than other NNs as the self-organizing feature maps (SOFM) , learning vector quantization (LYQ) and radial basis function (RBF) NNs with respect to classification quality. The classification success rate for the ART-Kohonen network was 94 o/o and for the SOFM, LYQ and RBF network were 93 %, 93 % and 89 % respectively.

Recognition of Identifiers from Shipping Container Image by Using Fuzzy Binarization and ART2-based RBF Network

  • Kim, Kwang-baek;Kim, Young-ju
    • Proceedings of the KAIS Fall Conference
    • /
    • 2003.11a
    • /
    • pp.88-95
    • /
    • 2003
  • The automatic recognition of transport containers using image processing is very hard because of the irregular size and position of identifiers, diverse colors of background and identifiers, and the impaired shapes of identifiers caused by container damages and the bent surface of container, etc. We proposed and evaluated the novel recognition algorithm of container identifiers that overcomes effectively the hardness and recognizes identifiers from container images captured in the various environments. The proposed algorithm, first, extracts the area including only all identifiers from container images by using CANNY masking and bi-directional histogram method. The extracted identifier area is binarized by the fuzzy binarization method newly proposed in this paper and by applying contour tracking method to the binarized area, container identifiers which are targets of recognition are extracted. We proposed and applied the ART2-based RBF network for recognition of container identifiers. The results of experiment for performance evaluation on the real container images showed that the proposed algorithm has more improved performance in the extraction and recognition of container identifiers than the previous algorithms.

  • PDF

An Enhanced Fuzzy ART Algorithm for Effective Image Recognition (효과적인 영상 인식을 위한 개선된 퍼지 ART 알고리즘)

  • Kim, Kwang-Baek;Park, Choong-Shik
    • 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 알고리즘보다 클러스터의 수가 적게 생성되었고 인식 성능도 기존의 방법들보다 우수한 성능이 있음을 확인하였다.

  • PDF

2.5D Quick Turnaround Engraving System through Recognition of Boundary Curves in 2D Images (2D 이미지의 윤곽선 인식을 통한 2.5D 급속 정밀부조시스템)

  • Shin, Dong-Soo;Chung, Sung-Chong
    • Journal of the Korean Society of Manufacturing Technology Engineers
    • /
    • v.20 no.4
    • /
    • pp.369-375
    • /
    • 2011
  • Design is important in the IT, digital appliance, and auto industries. Aesthetic and art images are being applied for better quality of the products. Most image patterns are complex and much lead-time is required to implement them to the product design process. A precise reverse engineering method generating 2.5D engraving models from 2D artistic images is proposed through the image processing, NURBS interpolation and 2.5D reconstruction methods. To generate 2.5D TechArt models from the art images, boundary points of the images are extracted by using the adaptive median filter and the novel MBF (modified boundary follower) algorithm. Accurate NURBS interpolation of the points generates TechArt CAD models. Performance of the developed system has been confirmed through the quick turnaround 2.5D engraving simulation linked with the commercial CAD/CAM system.

Self Health Diagnosis System of Oriental Medicine Using Enhanced Fuzzy ART Algorithm (개선된 퍼지 ART 알고리즘을 이용한 한방 자가 진단 시스템)

  • Kim, Kwang-Baek;Woo, Young-Woon
    • 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.

ART2 Based Fuzzy Binarization Method with Low Information Loss (정보손실이 적은 ART2 기반 퍼지 이진화 방법)

  • Kim, Kwang-Baek
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.18 no.6
    • /
    • pp.1269-1274
    • /
    • 2014
  • In computer vision research, binarization procedure is one of the most frequently used tools to discriminate target objects from background in grey level binary image. Fuzzy binarization is a reliable technique in environment with high uncertainty such as medical image analysis by setting the threshold as the average of minimum and maximum brightness with triangle type fuzzy membership function. However, this technique is also known as contrast sensitive method thus its discrimination power is not so great when the image has low contrast difference between objects and backgrounds and suffer from information loss as a result. Thus, in this paper, we propose a fuzzy binarization using ART2 algorithm to handle such low contrast image analysis. Proposed ART2 algorithm is applied to determine the medium point of membership function in the fuzzy binarization paradigm. The proposed methods shows low information loss rate in our experiment.

The Estimation of Link Travel Speed Using Hybrid Neuro-Fuzzy Networks (Hybrid Neuro-Fuzzy Network를 이용한 실시간 주행속도 추정)

  • Hwang, In-Shik;Lee, Hong-Chul
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.26 no.4
    • /
    • pp.306-314
    • /
    • 2000
  • In this paper we present a new approach to estimate link travel speed based on the hybrid neuro-fuzzy network. It combines the fuzzy ART algorithm for structure learning and the backpropagation algorithm for parameter adaptation. At first, the fuzzy ART algorithm partitions the input/output space using the training data set in order to construct initial neuro-fuzzy inference network. After the initial network topology is completed, a backpropagation learning scheme is applied to optimize parameters of fuzzy membership functions. An initial neuro-fuzzy network can be applicable to any other link where the probe car data are available. This can be realized by the network adaptation and add/modify module. In the network adaptation module, a CBR(Case-Based Reasoning) approach is used. Various experiments show that proposed methodology has better performance for estimating link travel speed comparing to the existing method.

  • PDF

Fault Detection of Ceramic Imaging using ART2 Algorithm (ART2 알고리즘을 이용한 세라믹 영상에서의 결함 검출)

  • Kim, Kwang Baek
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.17 no.11
    • /
    • pp.2486-2491
    • /
    • 2013
  • There are invisible defects by naked eyes in ceramic material images such as internal stomata, cracks and foreign substances. In this paper we propose a method to detect and extract such defects from ceramic pipe weld zone by applying ART2 learning. In pre-processing, we apply Ends-in Search Stretching to enhance the intensity and then perform fuzzy binarization with triangle type membership function followed by enhanced ART2 that interacts with random input patterns to extract such invisible defects. The experiment verifies that this proposed method is sufficiently effective.

Adaptive Random Testing through Iterative Partitioning with Enlarged Input Domain (입력 도메인 확장을 이용한 반복 분할 기반의 적응적 랜덤 테스팅 기법)

  • Shin, Seung-Hun;Park, Seung-Kyu
    • 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.