• ETRI Journal
• /
• 제28권1호
• /
• pp.59-66
• /
• 2006

Learning behaviors of a radial basis function network (RBFN) using a singular value decomposition (SVD) and stochastic gradient (SG) algorithm, together named RBF-SVD-SG, for odor sensing systems are analyzed, and a fast training method is proposed. RBF input data is from a conducting polymer sensor array. It is revealed in this paper that the SG algorithm for the fine-tuning of centers and widths still shows ill-behaving learning results when a sufficiently small convergence coefficient is not used. Since the tuning of centers in RBFN plays a dominant role in the performance of RBFN odor sensing systems, our analysis is focused on the center-gradient variance of the RBFN-SVD-SG algorithm. We found analytically that the steadystate weight fluctuation and large values of a convergence coefficient can lead to an increase in variance of the center-gradient estimate. Based on this analysis, we propose to use the least mean square algorithm instead of SVD in adjusting the weight for stable steady-state weight behavior. Experimental results of the proposed algorithm have shown faster learning speed and better classification performance.

• 한국통신학회논문지
• /
• 제30권3C호
• /
• pp.141-146
• /
• 2005

The authors investigate the convergence speed problem of nonlinear adaptive equalization. Convergence constraints and time constant of radial basis function network using stochastic gradient (RBF-SG) algorithm is analyzed and a method of making time constant independent of hidden-node output power by using sample-by-sample node output power estimation is derived. The method for estimating the node power is to use a single-pole low-pass filter. It is shown by simulation that the proposed algorithm gives faster convergence and lower minimum MSE than the RBF-SG algorithm.

• Journal of Communications and Networks
• /
• 제12권6호
• /
• pp.600-604
• /
• 2010

A method of width adaptation in the radial basis function network (RBFN) using stochastic gradient (SG) algorithm is introduced. Using Taylor's expansion of error signal and differentiating the error with respect to the step-size, the optimal time-varying step-size of the width in RBFN is derived. The proposed approach to adjusting widths in RBFN achieves superior learning speed and the steady-state mean square error (MSE) performance in nonlinear channel environment. The proposed method has shown enhanced steady-state MSE performance by more than 3 dB in both nonlinear channel environments. The results confirm that controlling over step-size of the width in RBFN by the proposed algorithm can be an effective approach to enhancement of convergence speed and the steady-state value of MSE.

• 센서학회지
• /
• 제20권3호
• /
• pp.151-155
• /
• 2011

A variety of pattern recognition algorithms including neural networks may be applicable to the identification of odors. In this paper, an identification technique for an electronic odor sensing system applicable to wound state monitoring is presented. The performance of the radial basis function(RBF) network is highly dependent on the choice of centers and widths in basis function. For the fine tuning of centers and widths, those parameters are initialized by an ill-conditioned genetic fuzzy c-means algorithm, and the distribution of input patterns in the very first stage, the stochastic gradient(SG), is adapted. The adaptive RBF network with singular value decomposition(SVD), which provides additional adaptation capabilities to the RBF network, is used to process data from array-based gas sensors for early detection of wound infection in burn patients. The primary results indicate that infected patients can be distinguished from uninfected patients.

• 한국인터넷방송통신학회논문지
• /
• 제19권5호
• /
• pp.47-54
• /
• 2019

본 논문에서는 간단한 시공간 블록 부호 (STBC)를 적용한 MC-CDMA 시스템에서 상수 모듈러스 (CM) 기반의 블라인드 적응 수신기를 설계하는 방법을 제시한다. 전송 심볼들을 검파하기 위하여 사용되는 여파기 계수 벡터들을 부분 벡터들로 분할하고, CM 메트릭을 최소화시키는 최적의 부분 벡터들 간의 특별한 관계식을 유도한다. 이러한 특별한 관계를 이용하여 변형된 CM 메트릭을 제시한다. 그리고 나서, 변형된 CM 메트릭을 최소화시키는 블라인드 적응형 통계적 변화율 CM 알고리즘 (SG-CMA)을 제안한다. 제안하는 기법의 여파기 계수 벡터들은 유도한 특별한 관계를 만족하는 영역에서만 갱신되기 때문에, 제안하는 블라인드 적응 SG-CMA 기법이 기존의 SG-CMA 기법보다 더 빠른 수렴 속도를 갖는다. 그리고, 컴퓨터 모의실험을 통하여, 제안하는 SG-CMA 기법의 우수성을 검증한다.

• 센서학회지
• /
• 제25권6호
• /
• pp.431-434
• /
• 2016

Currently, the radial basis function network (RBFN) and various other neural networks are employed to classify gases using chemical sensors arrays, and their performance is steadily improving. In particular, the identification performance of the RBFN algorithm is being improved by optimizing parameters such as the center, width, and weight, and improved algorithms such as the radial basis function network-stochastic gradient (RBFN-SG) and radial basis function network-normalized stochastic gradient (RBFN-NSG) have been announced. In this study, we optimized the number of centers, which is one of the parameters of the RBFN-NSG algorithm, and observed the change in the identification performance. For the experiment, repeated measurement data of 8 samples were used, and the elbow method was applied to determine the optimal number of centers for each sample of input data. The experiment was carried out in two cases(the only one center per sample and the optimal number of centers obtained by elbow method), and the experimental results were compared using the mean square error (MSE). From the results of the experiments, we observed that the case having an optimal number of centers, obtained using the elbow method, showed a better identification performance than that without any optimization.

• 센서학회지
• /
• 제24권6호
• /
• pp.368-372
• /
• 2015

In this paper, we proposed a post-processing technique for improving classification performance of electronic nose (E-Nose) system which may be occurred drift signals from sensor array. An adaptive radial basis function network using stochastic gradient (SG) and singular value decomposition (SVD) is applied to process signals from sensor array. Due to drift from sensor's aging and poisoning problems, the final classification results may be showed bias and fluctuations. The predicted classification results with drift are quantized to determine which identification level each class is on. To mitigate sharp fluctuations moving-averaging (MA) technique is applied to quantized identification results. Finally, quantization and some edge correction process are used to decide levels of the fluctuation-smoothed identification results. The proposed technique has been indicated that E-Nose system was shown correct odor identification results even if drift occurred in sensor array. It has been confirmed throughout the experimental works. The enhancements have produced a very robust odor identification capability which can compensate for decision errors induced from drift effects with sensor array in electronic nose system.