• Title/Summary/Keyword: 코호넨 네트워크

Search Result 13, Processing Time 0.031 seconds

Reconstruction of Partially Damaged face for Improving a Face Recognition Rate (얼굴 인식률 향상을 위한 손상된 얼굴 영역의 복원)

  • 최재영;황승호;김낙빈
    • Journal of Korea Multimedia Society
    • /
    • v.7 no.3
    • /
    • pp.308-318
    • /
    • 2004
  • A subject to recognize the damaged facial image is becoming an important issue in commercialization of automatic face recognition. The method to recognize a face on a damaged image is divided into two types. The one is to recognize remainders after removing the damaged information and the other is to recognize a total face after recovering the damaged information. On this paper, we present the reconstruction method by analyzing the main materials after extracting the damaged region through Kohonen network. The suggested algorithm in this paper estimates feature vectors of the damaged region using eigen-faces in PCA and then reconstructs the damaged image. This allows also the reconstruction under the untrained images. Through testing the artificial images where the eye and the mouth which have many effects to face recognition are damaged, the recognition rate of the proposed results showed similar results with the method which used Kohonen network, and improved about 11.8% more than symmetrical property method. Also, in case of the untrained image, our results improved about 14% more than that of the Kohonen method and about 7% more than that of the symmetrical property method.

  • PDF

Adaptive Self Organizing Feature Map (적응적 자기 조직화 형상지도)

  • Lee , Hyung-Jun;Kim, Soon-Hyob
    • The Journal of the Acoustical Society of Korea
    • /
    • v.13 no.6
    • /
    • pp.83-90
    • /
    • 1994
  • In this paper, we propose a new learning algorithm, ASOFM(Adaptive Self Organizing Feature Map), to solve the defects of Kohonen's Self Organiaing Feature Map. Kohonen's algorithm is sometimes stranded on local minima for the initial weights. The proposed algorithm uses an object function which can evaluate the state of network in learning and adjusts the learning rate adaptively according to the evaluation of the object function. As a result, it is always guaranteed that the state of network is converged to the global minimum value and it has a capacity of generalized learning by adaptively. It is reduce that the learning time of our algorithm is about $30\%$ of Kohonen's.

  • PDF

Kohonen Clustring Network Using The Fuzzy System (퍼지 시스템을 이용한 코호넨 클러스터링 네트웍)

  • 강성호;손동설;임중규;박진성;엄기환
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2002.05a
    • /
    • pp.322-325
    • /
    • 2002
  • We proposed a method to improve KCN's problems. Proposed method adjusts neighborhood and teaming rate by fuzzy logic system. The input of fuzzy logic system used a distance and a change rate of distance. The output was used by site of neighborhood and learning rate. The rule base of fuzzy logic system was taken by using KCN simulation results. We used Anderson's Iris data to illustrate this method, and simulation results showed effect of performance.

  • PDF

A Study on Center Detection and Motion Analysis of a Moving Object by Using Kohonen Networks and Time Delay Neural Networks (코호넨 네트워크 및 시간 지연 신경망을 이용한 움직이는 물체의 중심점 탐지 및 동작특성 분석에 관한 연구)

  • Hwang, Jung-Ku;Kim, Jong-Young;Jang, Tae-Jeong
    • Journal of Industrial Technology
    • /
    • v.21 no.B
    • /
    • pp.91-98
    • /
    • 2001
  • In this paper, center detection and motion analysis of a moving object are studied. Kohonen's self-organizing neural network models are used for the moving objects tracking and time delay neural networks are used for dynamic characteristic analysis. Instead of objects brightness, neuron projections by Kohonen Networks are used. The motion of target objects can be analyzed by using the differential neuron image between the two projections. The differential neuron image which is made by two consecutive neuron projections is used for center detection and moving objects tracking. The two differential neuron images which are made by three consecutive neuron projections are used for the moving trajectory estimation. It is possible to distinguish 8 directions of a moving trajectory with two frames and 16 directions with three frames.

  • PDF

KOHONEN NETWORK FOR ADAPTIVE IMAGE COMPRESSION (영상압축을 위한 코넨네트워크)

  • 손형경;이영식;배철수
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2001.10a
    • /
    • pp.571-574
    • /
    • 2001
  • In our paper, We propose an efficient adaptive coding method using kohonen neural network. An efficient adaptive encoding method using Kohonen net work is discribed through the analysis of those compression methods with the application of the neural network. In order to increase the compression ratio, a image is first divided into 8*8 subimages, then all subimages are transformed by DCT. These DCT sub-blocks are divided into N(4) classes by Kohonen network. Hits are distributed according to the variance of the DCT sub-block. Thus we get N(4)bit allocation matrices. Excellent performance is shown by the computer simulation. so we found that our proposed method is better then classifing subimages by AC energy.

  • PDF

The Optimal Column Grouping Technique for the Compensation of Column Shortening (기둥축소량 보정을 위한 기둥의 최적그루핑기법)

  • Kim, Yeong-Min
    • Journal of the Computational Structural Engineering Institute of Korea
    • /
    • v.24 no.2
    • /
    • pp.141-148
    • /
    • 2011
  • This study presents the optimal grouping technique of columns which groups together columns of similar shortening trends to improve the efficiency of column shortening compensation. Here, Kohonen's self-organizing feature map which can classify patterns of input data by itself with unsupervised learning was used as the optimal grouping algorithm. The Kohonen network applied in this study is composed of two input neurons and variable output neurons, here the number of output neuron is equal to the column groups to be classified. In input neurons the normalized mean and standard deviation of shortening of each columns are inputted and in the output neurons the classified column groups are presented. The applicability of the proposed algorithm was evaluated by applying it to the two buildings where column shortening analyses had already been performed. The proposed algorithm was able to classify columns with similar shortening trends as one group, and from this we were able to ascertain the field-applicability of the proposed algorithm as the optimal grouping of column shortening.

A Purchase Pattern Analysis Using Bayesian Network and Neural Network (베이지안 네트워크와 신경망을 이용한 구매 패턴 분석)

  • Hwang Jeong-Sik;Pi Su-Young;Son Chang-Sik;Chung Hwan-Mook
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 2005.04a
    • /
    • pp.323-326
    • /
    • 2005
  • 실세계에서 일어나는 문제는 매우 복잡하고 다양하기 때문에 예측하기가 어렵고 다양한 상황들이 발생한다. 특히, 소비자의 구매에 따르는 행동을 분석하고 소비자의 다양한 기호를 예측하기 위해서는 구매자의 심리적 요인과 내적 요인이 많은 영향을 미치게 된다. 이러한 요인들은 직접적인 정보 처리가 어렵기 때문에 정보의 불확실성을 취급하는 기술이 필요하다. 따라서 본 논문에서는 상품 구매에 따르는 소비자의 구매행동 패턴을 분석하기 위해 판매자의 노하우와 소비자의 구매의식을 조사하여 이 데이터를 바탕으로 베이지안 네트워크를 구성하고 구매패턴을 분류하는 방법을 제안하였다. 특히, 베이지안 네트워크를 이용하여 불필요한 속성을 가진 데이터를 제거한 후 코호넨의 SOM을 이용하여 소비자의 구매 패턴을 분류하도록 하였다.

  • PDF

Expansible & Reconfigurable Neuro Informatics Engine : ERNIE (대규모 확장이 가능한 범용 신경망 연산기 : ERNIE)

  • 김영주;동성수;이종호
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.40 no.6
    • /
    • pp.56-68
    • /
    • 2003
  • Difficult problems In implementing digital neural network hardware are the extension of synapses and the programmability for relocating neurons. In this paper, the structure of a new hardware is proposed for solving these problems. Our structure based on traditional SIMD can be dynamically and easily reconfigured connections of network without synthesizing and mapping original design for each use. Using additional modular processing unit the numbers of neurons find synapses increase. To show the extensibility of our structure, various models of neural networks : multi-layer perceptrons and Kohonen network are formed and tested. The performance comparison with software simulation shows its superiority in the aspects of performance and flexibility.

Unsupervised Machine Learning based on Neighborhood Interaction Function for BCI(Brain-Computer Interface) (BCI(Brain-Computer Interface)에 적용 가능한 상호작용함수 기반 자율적 기계학습)

  • Kim, Gui-Jung;Han, Jung-Soo
    • Journal of Digital Convergence
    • /
    • v.13 no.8
    • /
    • pp.289-294
    • /
    • 2015
  • This paper proposes an autonomous machine learning method applicable to the BCI(Brain-Computer Interface) is based on the self-organizing Kohonen method, one of the exemplary method of unsupervised learning. In addition we propose control method of learning region and self machine learning rule using an interactive function. The learning region control and machine learning was used to control the side effects caused by interaction function that is based on the self-organizing Kohonen method. After determining the winner neuron, we decided to adjust the connection weights based on the learning rules, and learning region is gradually decreased as the number of learning is increased by the learning. So we proposed the autonomous machine learning to reach to the network equilibrium state by reducing the flow toward the input to weights of output layer neurons.

Structure-Adaptive Self-Organizing Neural Network : Application to Hangul Character Recognition (구조적응 자기조직화 신경망 : 한글 문자인식에의 적용)

  • Lee, Kyoung-Mi;Cho, Sung-Bae;Lee, Yill-Byung
    • Annual Conference on Human and Language Technology
    • /
    • 1995.10a
    • /
    • pp.137-142
    • /
    • 1995
  • 코호넨의 SOFM(Self-Organizing Feature Map)온 빠른 검증 학습이 가능하여 다층 퍼셉트론의 단점을 보완할 수 있는 패턴분류기로 부각되고 있다. 그러나 기본적으로 고정된 크기와 구조의 네트워크를 사용하기 때문에 실재 문제에 적용하기가 쉽지 않다는 문제가 있다. 본 논문에서는 패턴에 대한 사전 정보없이 복잡한 패턴공간을 적응적으로 분할하기 위해 구조적응되는 자기조직화 신경망을 소개하고 이를 인쇄체 한글 문자의 인식에 적용한 결과를 보여준다. 여기에서 제안하는 신경망은 SOFM의 각 셀이 좀더 자세한 SOFM으로 확장될 수 있도록하며, 확률분포가 0인 셀을 제거함으로써 패턴 공간에 보다 근사한 분류를 가능하게 한다. 실제로 이러한 방식이 한글과 같은 복잡한 분류 문제에서 어떻게 작동하는지 설명하고, 한글 완성형 2350자에 대해 실험한 결과를 보여준다.

  • PDF