• Àüü
  • ÀüÀÚ/Àü±â
  • Åë½Å
  • ÄÄÇ»ÅÍ
´Ý±â

»çÀÌÆ®¸Ê

Loading..

Please wait....

Çмú´ëȸ ÇÁ·Î½Ãµù

Ȩ Ȩ > ¿¬±¸¹®Çå > Çмú´ëȸ ÇÁ·Î½Ãµù > Çѱ¹Á¤º¸°úÇÐȸ Çмú´ëȸ > CVPR 2001 Ãß°è ¿öÅ©¼¥

CVPR 2001 Ãß°è ¿öÅ©¼¥

Current Result Document : 7 / 27 ÀÌÀü°Ç ÀÌÀü°Ç   ´ÙÀ½°Ç ´ÙÀ½°Ç

ÇѱÛÁ¦¸ñ(Korean Title) A SURVEY OF STOCHASTIC ANALYSIS FOR LANGEVINE COMEPETITIVE LEARNING ALGORITHM AND OF PATTERN RECOGNITION FOR MULTISPECTRAL EARTH REMOTE SENSING DATA
¿µ¹®Á¦¸ñ(English Title) A SURVEY OF STOCHASTIC ANALYSIS FOR LANGEVINE COMEPETITIVE LEARNING ALGORITHM AND OF PATTERN RECOGNITION FOR MULTISPECTRAL EARTH REMOTE SENSING DATA
ÀúÀÚ(Author) Seok Jinwuk  
¿ø¹®¼ö·Ïó(Citation) VOL 2001 NO. 01 PP. 0221 ~ 0222 (2001. 11)
Çѱ۳»¿ë
(Korean Abstract)
¿µ¹®³»¿ë
(English Abstract)
Recently, various types of neural network modes have been used successfully to applications in pattern recognition, control, signal processing, and so on. However, the previous models are not suitable for hardware implementation due to their complexity.
In this paper, we present a survey of stochastic analysis for Langevine Comepetitive Learning Algorithm and show an experimental results of pattern recognition for multispectral earth remote sensing data. The Langevine comepetitive learning algorithm uses a time-invariant learning rate whereas the conventional competitive learning developed by Kohonen and others uses a time-varing learning rate. In the Langevine comepetitive learning, there is a binary reinforcement function in order to compensate for the lowered learning ability due to the constant learning rate.
The experimental results conducted with two different types of data indicates the superiority of the proposed method in comparison to the original comepetitive learning.
Å°¿öµå(Keyword) pattern recognition  
ÆÄÀÏ÷ºÎ PDF ´Ù¿î·Îµå