• Title/Summary/Keyword: ART Algorithm

검색결과 579건 처리시간 0.029초

Enhanced RBF Network by Using Auto- Turning Method of Learning Rate, Momentum and ART2

  • Kim, Kwang-baek;Moon, Jung-wook
    • 한국산학기술학회:학술대회논문집
    • /
    • 한국산학기술학회 2003년도 Proceeding
    • /
    • 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.

  • PDF

ART2 알고리즘을 이용한 스마트폰 어플리케이션에서의 효율적인 사용자 인터페이스 (Efficient User Interface on Smartphone Application using ART2 Algorithm)

  • 김재용;우영운;윤석현;김광백
    • 한국컴퓨터정보학회:학술대회논문집
    • /
    • 한국컴퓨터정보학회 2010년도 제42차 하계학술발표논문집 18권2호
    • /
    • pp.421-423
    • /
    • 2010
  • 본 논문에서는 ART2 알고리즘을 이용하여 잠금 상태에서 스마트폰의 어플리케이션을 쉽고 빠르게 구동하기 위한 방법을 제안한다. 자신이 원하는 그림과 설치되어 있는 어플리케이션과의 대응 테이블을 만들기 위하여 학습 어플리케이션을 실행한다. 학습 어플리케이션의 동작 순서는 어플리케이션 실행 후 화면 하단에서 빠른 실행을 하고자 하는 어플리케이션을 선택하고 좌측상단에 위치하고 있는 입력 부분에 그림을 그린 후, 학습 버튼을 클릭한다. 그려진 그림의 배경은 0으로 그림은 1로 변환하고 ART2의 입력으로 사용할 수 있도록 일정한 크기로 정규화한다. 정규화 된 데이터를 팽창 연산을 통하여 학습에 용이하도록 최외각 픽셀을 확장하여 ART2의 입력 데이터로 적용한다. 학습이 끝난 후, 잠금 상태에서 액정 윗부분에 학습된 것과 같은 모양의 그림을 그리면 해당 어플리케이션이 실행된다. 제안된 방법은 기존의 방식인 잠금 해제 후, 어플리케이션을 탐색하고, 해당 어플리케이션을 실행하는 3 단계로 된 방식을 1 단계로 줄이기 때문에 원하는 어플리케이션을 실행하는데 시간이 적게 소요되는 장점이 있다.

  • PDF

화랑 문제의 최소 정점 경비원 수 알고리즘 (Minimum number of Vertex Guards Algorithm for Art Gallery Problem)

  • 이상운
    • 한국컴퓨터정보학회논문지
    • /
    • 제16권6호
    • /
    • pp.179-186
    • /
    • 2011
  • 본 논문은 화랑 문제의 최소 정점 경비원 수를 구하는 알고리즘을 제안하였다. n개의 사각형 방으로 구성된 화랑의 최소 경비원수는 정확한 해를 구하는 공식이 제안되었다. 그러나 단순하거나 장애물이 있는 다각형 또는 직각 다각형에 대해 최대 경비원수를 구하는 공식만이 제안되었으며, 최소 경비원수를 구하는 근사 알고리즘만이 제안되고 있다. n개의 정점으로 구성된 다각형 P에 대한 최대 정점 경비원 수를 구하는 방법은 Fisk가 다음과 같이 제안하였다. 첫 번째로, n-2개의 삼각형으로 구성된 삼각분할을 수행한다. 두 번째로 3색-정점색칠을 한다. 세 번째로 최소 원소를 가진 채색수를 정점 경비원의 위치로 결정한다. 본 논문에서는 지배집합으로 최소 정점 경비원 수를 구한다. 첫 번째로, 가능한 모든 가시적인 정점들 간에 간선을 그린 가시성 그래프를 얻는다. 두 번째로, 가시성그래프로부터 직접 지배집합을 얻는 방법과 가시성 행렬로부터 지배집합을 얻는 방법을 적용하였다. 다양한 화랑 문제에 적용한 결과 제안된 알고리즘은 단순하면서도 최소 정점 경비원 수를 얻을 수 있었다.

A Component-Based Localization Algorithm for Sparse Sensor Networks Combining Angle and Distance Information

  • Zhang, Shigeng;Yan, Shuping;Hu, Weitao;Wang, Jianxin;Guo, Kehua
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제9권3호
    • /
    • pp.1014-1034
    • /
    • 2015
  • Location information of sensor nodes plays a critical role in many wireless sensor network (WSN) applications and protocols. Although many localization algorithms have been proposed in recent years, they usually target at dense networks and perform poorly in sparse networks. In this paper, we propose two component-based localization algorithms that can localize many more nodes in sparse networks than the state-of-the-art solution. We first develop the Basic Common nodes-based Localization Algorithm, namely BCLA, which uses both common nodes and measured distances between adjacent components to merge components. BCLA outperforms CALL, the state-of-the-art component-based localization algorithm that uses only distance measurements to merge components. In order to further improve the performance of BCLA, we further exploit the angular information among nodes to merge components, and propose the Component-based Localization with Angle and Distance information algorithm, namely CLAD. We prove the merging conditions for BCLA and CLAD, and evaluate their performance through extensive simulations. Simulations results show that, CLAD can locate more than 90 percent of nodes in a sparse network with average node degree 7.5, while CALL can locate only 78 percent of nodes in the same scenario.

Study of Spectral Reflectance Reconstruction Based on an Algorithm for Improved Orthogonal Matching Pursuit

  • Leihong, Zhang;Dong, Liang;Dawei, Zhang;Xiumin, Gao;Xiuhua, Ma
    • Journal of the Optical Society of Korea
    • /
    • 제20권4호
    • /
    • pp.515-523
    • /
    • 2016
  • Spectral reflectance is sparse in space, and while the traditional spectral-reconstruction algorithm does not make full use of this characteristic sparseness, the compressive sensing algorithm can make full use of it. In this paper, on the basis of analyzing compressive sensing based on the orthogonal matching pursuit algorithm, a new algorithm based on the Dice matching criterion is proposed. The Dice similarity coefficient is introduced, to calculate the correlation coefficient of the atoms and the residual error, and is used to select the atoms from a library. The accuracy of Spectral reconstruction based on the pseudo-inverse method, Wiener estimation method, OMP algorithm, and DOMP algorithm is compared by simulation on the MATLAB platform and experimental testing. The result is that spectral-reconstruction accuracy based on the DOMP algorithm is higher than for the other three methods. The root-mean-square error and color difference decreases with an increasing number of principal components. The reconstruction error decreases as the number of iterations increases. Spectral reconstruction based on the DOMP algorithm can improve the accuracy of color-information replication effectively, and high-accuracy color-information reproduction can be realized.

C++ Class Restructuring Using the Neural Networks

  • Kim, Kwang-Baek;Jun, Bong-Gi;Kim, Young-Ju
    • Journal of information and communication convergence engineering
    • /
    • 제1권3호
    • /
    • pp.99-103
    • /
    • 2003
  • Classes are apt to include useless codes and inadequate inheritance relationship between them when they are being updated, inserted and deleted during the evolution process of object-oriented software, leading to lots of errors. Conventional class restructuring methods degrade the effectiveness of reusability since they go with preprocesses such as dependency analysis and estimation of class cohesion and run statically. In this paper, we propose a new C++ class-restructuring algorithm that does not require those preprocesses and runs dynamically by improving ART learning algorithm in the artificial neural networks.

Implementation of Lighting Technique and Music Therapy for Improving Degree of Students Concentration During Lectures

  • Han, ChangPyoung;Hong, YouSik
    • International Journal of Internet, Broadcasting and Communication
    • /
    • 제12권3호
    • /
    • pp.116-124
    • /
    • 2020
  • The advantage of the distance learning universities based on the 4th Industrial Revolution is that anyone can conveniently take lectures anytime, anywhere on the web. In addition, research has been actively conducted on the effect of light color and temperature control upon student performance during online classes. However, research on how the conditions of subjects, lighting colors, and music selection improve the degree of a student's concentration during online lectures has not been completed. To solve these problems in this paper, we have developed automatic analysis system SW for the weak subjects of learners by applying intelligent analysis algorithm, have proposed and simulated music therapy and art therapy. Moreover, It proposed in this paper an algorithm for an automatic analysis system, which shows the weak subjects of learners by adopting intelligence analysis algorithms. We also have presented and simulated a music therapy and art therapy algorithms, based on the blended learning, in order to increase students concentration during lecture.

적응공명이론에 의한 자동 부분형상 인식시스템 (Automatic partial shape recognition system using adaptive resonance theory)

  • 박영태;양진성
    • 전자공학회논문지B
    • /
    • 제33B권3호
    • /
    • pp.79-87
    • /
    • 1996
  • A new method for recognizing and locating partially occluded or overlapped two-dimensional objects regardless of their size, translation, and rotation, is presented. Dominant points approximating occuluding contoures of objects are generated by finding local maxima of smoothed k-cosine function, and then used to guide the contour segment matching procedure. Primitives between the dominant points are produced by projecting the local contours onto the line between the dominant points. Robust classification of primitives. Which is crucial for reliable partial shape matching, is performed using adaptive resonance theory (ART2). The matched primitives having similar scale factors and rotation angles are detected in the hough space to identify the presence of the given model in the object scene. Finally the translation vector is estimated by minimizing the mean squred error of the matched contur segment pairs. This model-based matching algorithm may be used in diveerse factory automation applications since models can be added or changed simply by training ART2 adaptively without modifying the matching algorithm.

  • PDF

Robust control using Analog Adaptive Resonance Theory

  • 손준혁;서보혁
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 2006년도 심포지엄 논문집 정보 및 제어부문
    • /
    • pp.93-95
    • /
    • 2006
  • In many control system applications, the system designed must not only satisfy the damping and accuracy specifications, but the control must also yield performance that is robust to external disturbance and parameter variations. We have shown that feedback in conventional control systems has the inherent ability of reducing the effects of external disturbance and parameter variations. Unfortunately, robustness with the conventional feedback configuration is achieved only with a high loop gain, which is normally detrimental to stability. The design of intelligent, autonomous machines to perform tasks that are dull, repetitive, hazardous, or that require skill, strength, or dexterity beyond the capability of humans is the ultimate goal of robotics research. This paper prove the robust control using Analog Adaptive Resonance Theorv(ART2) Algorithm about case study.

  • PDF

웹 카메라에서 블록정합기법을 이용한 헤어커팅 포인트 분석 및 개선 (Haircutting Point Analysis and Improvement the Block Matching Algorithm Using in Web Camera)

  • 강남순
    • 디지털산업정보학회논문지
    • /
    • 제5권4호
    • /
    • pp.189-197
    • /
    • 2009
  • This paper suggests the system for searching and application is to be in combination between existing hair art area and Image/Video processing area. This proposed system usually saves various hair types into a database, then, users send images of their face over the internet by using WebCam. Finally, they can find the hair types for users. Hair cutting is technology that form draft to make hair style. Man cut must decide how in image of sinciput, image of side bean curd, after lower image must operate. Silhouette is produced as is different by change of this three places. Customer increases in the beauty salon and beauty salon chain being changed, research about beauty art is necessary point of time. In this treatise, our country of when swim and operate haircut about problem that happen sample survey and analysis.