• The Journal of the Acoustical Society of Korea
• /
• v.12 no.1E
• /
• pp.71-77
• /
• 1993

패턴매칭 기법에 근거한 음성 인식 시스템은 크게 clustering 과정과 labeling 과정으로 구성된다. 본 논문에서는 Kohonen의 featrue map 알고리즘과 LVQ2 알고리즘을 각각 clusterer와 labeler로 하는 음소인식 시스템을 구성한다. 구성된 인식시스템의 성능을 향상시키기 위해서 수정된 LVQ2알고리즘(MLVQ2)을 제안한다. MLVQ2는 selective learning, LVQ2, perturbed LVQ2 그리고 기존의 LVQ2의 4단계 학습과정으로 구성된다. 제안된 음소 인식 알고리즘의 성능을 평가하기 위하여 LVQ2와 MLVQ2를 각각 사용하여 6가지의 한국어 음소군에 대한 feature map을 만든다. 음소인식 실험결과, LVQ2와 MLVQ2를 사용하는 경우 각각 60.5%와 65.4%의 인식률을 얻을 수 있었다.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.43 no.2 s.308
• /
• pp.33-39
• /
• 2006

This paper presents the modified LVQ method for performance improvement of pattern classification. The proposed method uses the skewness of probability distribution between the input vectors and the reference vectors. During training, the reference vectors are closest to the input vectors using the probabilistic distribution of the input vectors, and they are positioned to approximate the decision surfaces of the theoretical Bayes classifier. In order to verify the effectiveness of the proposed method, we performed experiments on the Gaussian distribution data set, and the Fisher's IRIS data set. The experimental results show that the proposed method considerably improves on the performance of the LVQ1, LVQ2, and GLVQ.

• Proceedings of the Acoustical Society of Korea Conference
• /
• 1994.06c
• /
• pp.378-382
• /
• 1994

HMM 세그멘테이션을 이용하여 LVQ 알고리즘에 적용시킨 하이브리드 음성인식에 관한 연구이다. LVQ 학습알고리즘은 정적 패턴 분리를 위한 참조벡터 즉, 고정차원인 벡터들을 생성하는데 유리하다. 하이브리드 알고리즘은 정적패턴 인식에 사용 되어지는 LVQ 알고리즘에 HMM 세그멘테이션을 접목시켜 입력패턴을 정규화된 의미있는 값으로서 바꾸어 사용하는데 있다. 한국어 음절중 8개 모음 아, 이, 우, 에, 오, 애, 어, 으를 추출하여 인식실험을 하였다. 인식률은 화자종속일 경우 코드북수 256개를 기준으로 LVQ1, LVQ2, LVQ3, OLVQ1 알고리즘순으로 91.7%, 91.8%, 91.1%의 인식률을 구했고 화자 독립의 경우는 83.4%, 83.9%, 86.8%, 85.3%의 인식률을 구했다.

• Proceedings of the Korea Inteligent Information System Society Conference
• /
• 2005.05a
• /
• pp.186-189
• /
• 2005

본 논문에서는 LVQ를 퍼지화한 새로운 퍼지 학습 법칙들을 제안하였다. 퍼지 LVQ 학습법칙 1은 기존의 학습률 대신에 퍼지 학습률을 사용하였는데 이는 조건 확률의 퍼지화에 기반을 두고 있다. 퍼지 LVQ 학습법칙 2는 클래스들 사이에 존재하는 입력벡터가 결정 경계선에 대한 정보를 더 가지고 있는 것을 반영한 것이다. 이 새로운 퍼지 학습 법칙들을 improved IAFC(Integrted Adaptive Fuzzy Clustering)신경회로망에 적용하였다. improved IAFC신경회로망은 ART-1 (Adaptive Resonance Theory)신경회로망과 Kohonen의 Self-Organizing Feature Map의 장점을 취합한 퍼지 신경회로망이다. 제안한 supervised IAFC 신경회로망 1과 supervised IAFC neural 신경회로망 2의 성능을 오류 역전파 신경회로망의 성능과 비교하기 위하여 iris 데이터를 사용하였는데 Supervised IAFC neural network 2가 오류 역전파 신경회로망보다 성능이 우수함을 보여주었다.

• Journal of the Korea Society of Computer and Information
• /
• v.10 no.2 s.34
• /
• pp.113-121
• /
• 2005

In this paper, we design the hybrid learning algorithm of LVQ which is to perform EMG pattern recognition. The proposed hybrid LVQ learning algorithm is the modified Counter Propagation Networks(C.p Net. ) which is use SOM to learn initial reference vectors and out-star learning algorithm to determine the class of the output neurons of LVa. The weights of the proposed C.p. Net. which is between input layer and subclass layer can be learned to determine initial reference vectors by using SOM algorithm and to learn reference vectors by using LVd algorithm, and pattern vectors is classified into subclasses by neurons which is being in the subclass layer, and the weights which is between subclass layer and class layer of C.p. Net. is learned to classify the classified subclass. which is enclosed a class . To classify the pattern vectors of EMG. the proposed algorithm is simulated with ones of the conventional LVQ, and it was a confirmation that the proposed learning method is more successful classification than the conventional LVQ.

• Journal of Internet Computing and Services
• /
• v.8 no.3
• /
• pp.19-32
• /
• 2007

This paper present a new face recognition method based on LVQ neural net to construct a real time face recognition system. The previous researches which used PCA, LDA combined neural net usually need much time in training neural net. The supervised LVQ neural net needs much less time in training and can maximize the separability between the classes. In this paper, the proposed method transforms the input face image by PCA and LDA sequentially into low-dimension feature vectors and recognizes the face through LVQ neural net. In order to make the system robust to external light variation, light compensation is performed on the detected face by max-min normalization method as preprocessing. PCA and LDA transformations are applied to the normalized face image to produce low-level feature vectors of the image. In order to determine the initial centers of LVQ and speed up the convergency of the LVQ neural net, the K-Means clustering algorithm is adopted. Subsequently, the class representative vectors can be produced by LVQ2 training using initial center vectors. The face recognition is achieved by using the euclidean distance measure between the center vector of classes and the feature vector of input image. From the experiments, we can prove that the proposed method is more effective in the recognition ratio for the cases of still images from ORL database and sequential images rather than using conventional PCA of a hybrid method with PCA and LDA.

• International Journal of Computer Science & Network Security
• /
• v.24 no.3
• /
• pp.101-106
• /
• 2024

This article aims to compare the accuracy of the Backpropagation Neural Network (BPNN) and Learning Vector Quantization (LVQ) approaches in recognizing Sundanese characters. Based on experiments, the level of accuracy that has been obtained by the BPNN technique is 95.23% and the LVQ technique is 66.66%. Meanwhile, the learning time that has been required by the BPNN technique is 2 minutes 45 seconds and then the LVQ method is 17 minutes 22 seconds. The results indicated that the BPNN technique was better than the LVQ technique in recognizing Sundanese characters in accuracy and learning time.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.12A
• /
• pp.1333-1339
• /
• 2004

In IS-95 and IMT-2000 systems using variable code rates and constraint lengths, this paper limits code rate 1/2 and constraint length 3 and states the effective reduction of PM(Path Metric) and BM(Branch Metric) memories and arithmetic comparative calculations with appling PVSL(Prototype Vector Selecting Logic) and LVQ(Learning Vector Quantization) in neural network to simplify systems and to decode forwardly. Regardless of extension of constraint length, this paper presents the new Vierbi decoder and the appied algorithm because new structure and algorithm can apply to the existing Viterbi decoder using only uncomplicated application and verifies the rationality of the proposed Viterbi decoder through VHDL simulation and compares the performance between the proposed Viterbi decoder and the existing.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.19 no.39
• /
• pp.47-61
• /
• 1996

We propose a parallel neural network model in which patterns are clustered and patterns in a cluster are studied in a parallel neural network. The learning algorithm used in this paper is based on LVQ algorithm of Kohonen(1990) for clustering and ADALINE(Adaptive Linear Neuron) network of Widrow and Hoff(1990) for parallel learning. The proposed algorithm consists of two parts. First, N patterns to be learned are categorized into C clusters by LVQ clustering algorithm. Second, C patterns that was selected from each cluster of C are learned as input pattern of ADALINE(Adaptive Linear Neuron). Data used in this paper consists of 250 patterns of ASCII characters normalized into $8\times16$ and 1124. The proposed algorithm consists of two parts. First, N patterns to be learned are categorized into C clusters by LVQ clustering algorithm. Second, C patterns that was selected from each cluster of C are learned as input pattern of ADALINE(Adaptive Linear Neuron). Data used in this paper consists 250 patterns of ASCII characters normalized into $8\times16$ and 1124 samples acquired from signals generated from 9 car models that passed Inductive Loop Detector(ILD) at 10 points. In ASCII character experiment, 191(179) out of 250 patterns are recognized with 3%(5%) noise and with 1124 car model data. 807 car models were recognized showing 71.8% recognition ratio. This result is 10.2% improvement over backpropagation algorithm.

• Proceedings of the Acoustical Society of Korea Conference
• /
• 1996.10a
• /
• pp.76-79
• /
• 1996

본 논무에서는 한국어 음소를 대상으로 Kohonen 이 제안한 LVQ2 방법의 결저을 보완한 MLVQ2 방법으로 인식실험을 행하고 MLVQ2 알고리즘의 유효성을 검토하고자 한다. 인식실험을 위한 음성자료는 ETRI 611단어로부터 추출한 49음소를 사용하였다. 그리고 인식실험에 있어서는 먼저 파열음을 대상으로 학습회수, 표준패턴의 수, 샘플수에 따른 인식률의 변화를 조사하였으며, 이 결과 표준패턴의 수 15개, 학습회수 10회 이하, 샘플 수 3000 개일 경우가 가장 좋은 인식률을 보였다. 이 결과를 참고로 음소군별 인식실험 결과 모음 69.11%, 파열음 74.69%, 마찰음 및 파찰음 86.31%비음 및 유음 74.51%의 평균 인식률을 얻었다. 또한 , 한국어 49음소 전음소에 대한 인식실험 결과 71.2%의 인식률 얻어 MLVQ2의 유효성을 확인하였다.