• Journal of the Korean Institute of Intelligent Systems
• /
• v.12 no.1
• /
• pp.14-18
• /
• 2002

The perceptron algorithm, which is one of a class of gradient descent techniques, has been widely used in pattern recognition to determine linear decision boundaries. However, it may not give desirable results when pattern sets are nonlinerly separable. A fuzzy version was developed to male up for the weaknesses in the crisp perceptron algorithm. This was achieved by assigning memberships to the pattern sets. However, still another drawback exists in that the pattern memberships do not consider class typicality of the patterns. Therefore, we propose a possibilistic approach to the crisp perceptron algorithm. This algorithm combines the linearly separable property of the crisp version and the convergence property of the fuzzy version. Several examples are given to show the validity of the method.

• Journal of Institute of Control, Robotics and Systems
• /
• v.18 no.3
• /
• pp.237-242
• /
• 2012

AFC (Adaptive Feedforward Control) is significantly employed for improving control performance of dynamic systems particularly involving periodic disturbance signals in engineering fields. This paper presents a novel hybrid AFC approach for discrete-time systems with multiple disturbances in terms of control input and state variables. The proposed AFC mechanism is hierarchically composed of a conventional feedforward control framework and PID auxiliary control configuration in parallel. The former is generic to decrease periodic disturbance excited to control actuators and the latter is additionally constructed to overcome control deterioration due to time-varying uncertainty under given systems. We carry out numerical simulation to test reliability of our proposed hybrid AFC system and compare its control performance to a well-known conventional AFC method with respect to time and frequency domains for proving of its superiority.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.35C no.3
• /
• pp.79-89
• /
• 1998

The Error Back-Propagation(EBP) algorithm is widely applied to train a multi-layer perceptron, which is a neural network model frequently used to solve complex problems such as pattern recognition, adaptive control, and global optimization. However, the EBP is basically a gradient descent method, which may get stuck in a local minimum, leading to failure in finding the globally optimal solution. Moreover, a multi-layer perceptron suffers from locking a systematic determination of the network structure appropriate for a given problem. It is usually the case to determine the number of hidden nodes by trial and error. In this paper, we propose a new algorithm to efficiently train a multi-layer perceptron. OUr algorithm uses stochastic perturbation in the weight space to effectively escape from local minima in multi-layer perceptron learning. Stochastic perturbation probabilistically re-initializes weights associated with hidden nodes to escape a local minimum if the probabilistically re-initializes weights associated with hidden nodes to escape a local minimum if the EGP learning gets stuck to it. Addition of new hidden nodes also can be viewed asa special case of stochastic perturbation. Using stochastic perturbation we can solve the local minima problem and the network structure design in a unified way. The results of our experiments with several benchmark test problems including theparity problem, the two-spirals problem, andthe credit-screening data show that our algorithm is very efficient.

• International Journal of Internet, Broadcasting and Communication
• /
• v.14 no.1
• /
• pp.136-141
• /
• 2022

A very complex task in deep learning such as image classification must be solved with the help of neural networks and activation functions. The backpropagation algorithm advances backward from the output layer towards the input layer, the gradients often get smaller and smaller and approach zero which eventually leaves the weights of the initial or lower layers nearly unchanged, as a result, the gradient descent never converges to the optimum. We propose a two-factor non-saturating activation functions known as Bea-Mish for machine learning applications in deep neural networks. Our method uses two factors, beta (𝛽) and alpha (𝛼), to normalize the area below the boundary in the Mish activation function and we regard these elements as Bea. Bea-Mish provide a clear understanding of the behaviors and conditions governing this regularization term can lead to a more principled approach for constructing better performing activation functions. We evaluate Bea-Mish results against Mish and Swish activation functions in various models and data sets. Empirical results show that our approach (Bea-Mish) outperforms native Mish using SqueezeNet backbone with an average precision (AP50val) of 2.51% in CIFAR-10 and top-1accuracy in ResNet-50 on ImageNet-1k. shows an improvement of 1.20%.

• Journal of Auto-vehicle Safety Association
• /
• v.14 no.2
• /
• pp.26-38
• /
• 2022

This paper proposes multiple RLS and actuator performance index-based adaptive actuator fault-tolerant control and detection algorithms for longitudinal autonomous driving. The proposed algorithm computes the desired acceleration using feedback law for longitudinal autonomous driving. When actuator fault or performance degradation exists, it is designed that the desired acceleration is adjusted with the calculated feedback gains based on multiple RLS and gradient descent method for fault-tolerant control. In order to define the performance index, the error between the desired and actual accelerations is used. The window-based weighted error standard deviation is computed with the design parameters. Fault level decision algorithm that can represent three fault levels such as normal, warning, emergency levels is proposed in this study. Performance evaluation under various driving scenarios with actuator fault was conducted based on co-simulation of Matlab/Simulink and commercial software (CarMaker).

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.28 no.10
• /
• pp.794-801
• /
• 2017

In this paper, we proposed airborne target recognition using multi-channel combining method in DTV-based passive radar. By combining multi-channel signals, we obtained the HRRP with sufficient range resolution. HRRP was obtained by AR method or zero-padding. From the obtained HRRP, we extracted scattering centers by CLEAN algorithm using the gradient descent. We extracted feature vectors and performed target recognition after training neural network using the extracted feature vectors. To verify performance of proposed methods, we assumed frequency bands of three broadcasting transmitters operated in Korea(Mt. Gwan-ak, Mt. Yong-moon, Kyeon-wol-ak) and used full scale 3D CAD model of four targets. Also we compared the target recognition performance of the proposed method with that of using only single-channel of three broadcasting transmitters. As a result, proposed methods showed better performance than using only single-channel at three broadcasting transmitters.

• Journal of the Korean earth science society
• /
• v.37 no.5
• /
• pp.277-285
• /
• 2016

We introduce a depth scaling strategy to improve the accuracy of frequency-domain elastic full waveform inversion (FWI) using the new pseudo-Hessian matrix for seismic data without low-frequency components. The depth scaling strategy is based on the fact that the damping factor in the Levenberg-Marquardt method controls the energy concentration in the gradient. In other words, a large damping factor makes the Levenberg-Marquardt method similar to the steepest-descent method, by which shallow structures are mainly recovered. With a small damping factor, the Levenberg-Marquardt method becomes similar to the Gauss-Newton methods by which we can resolve deep structures as well as shallow structures. In our depth scaling strategy, a large damping factor is used in the early stage and then decreases automatically with the trend of error as the iteration goes on. With the depth scaling strategy, we can gradually move the parameter-searching region from shallow to deep parts. This flexible damping factor plays a role in retarding the model parameter update for shallow parts and mainly inverting deeper parts in the later stage of inversion. By doing so, we can improve deep parts in inversion results. The depth scaling strategy is applied to synthetic data without lowfrequency components for a modified version of the SEG/EAGE overthrust model. Numerical examples show that the flexible damping factor yields better results than the constant damping factor when reliable low-frequency components are missing.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.17 no.2 s.105
• /
• pp.158-164
• /
• 2006

In this paper, we proposed a new algorithm of the inverse scattering for the reconstruction of unknown dielectric scatterers using the finite-difference time-domain method and the design sensitivity analysis. We introduced the design sensitivity analysis based on the gradient information for the fast convergence of the reconstruction. By introducing the adjoint variable method for the efficient calculation, we derived the adjoint variable equation. As an optimal algorithm, we used the steepest descent method and reconstructed the dielectric targets using the iterative estimation. To verify our algorithm, we will show the numerical examples for the two-dimensional $TM^2$ cases.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.9 no.12
• /
• pp.1447-1454
• /
• 2014

In H.264 standard, an intra frame is the first frame of a GOP (Group of Pictures) and all macroblocks of an intra frame are encoded using the same quantization parameter. In addition, an intra frame is used for encoding the following frames of the same GOP so the encoding results of an intra frame affect the encoding results of the entire GOP. Thus, it is important to find the optimal quantization parameter of an intra frame for improving the quality of a GOP. In this paper, we propose an searching method for an optimal quantization parameter of an intra frame in real time. The proposed method uses a gradient descent method to find the optimal value based on characteristics of the optimal quantization parameters. Experimental results show that the proposed method captures the characteristics of the optimal quantization parameter and accurately estimates the optimal value.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.61 no.5
• /
• pp.744-752
• /
• 2012

In this study, the Polynomial-based Radial Basis Function Neural Networks is proposed as an one of the recognition part of overall face recognition system that consists of two parts such as the preprocessing part and recognition part. The design methodology and procedure of the proposed pRBFNNs are presented to obtain the solution to high-dimensional pattern recognition problems. In data preprocessing part, Principal Component Analysis(PCA) which is generally used in face recognition, which is useful to express some classes using reduction, since it is effective to maintain the rate of recognition and to reduce the amount of data at the same time. However, because of there of the whole face image, it can not guarantee the detection rate about the change of viewpoint and whole image. Thus, to compensate for the defects, Linear Discriminant Analysis(LDA) is used to enhance the separation of different classes. In this paper, we combine the PCA&LDA algorithm and design the optimized pRBFNNs for recognition module. The proposed pRBFNNs architecture consists of three functional modules such as the condition part, the conclusion part, and the inference part as fuzzy rules formed in 'If-then' format. In the condition part of fuzzy rules, input space is partitioned with Fuzzy C-Means clustering. In the conclusion part of rules, the connection weight of pRBFNNs is represented as two kinds of polynomials such as constant, and linear. The coefficients of connection weight identified with back-propagation using gradient descent method. The output of the pRBFNNs model is obtained by fuzzy inference method in the inference part of fuzzy rules. The essential design parameters (including learning rate, momentum coefficient and fuzzification coefficient) of the networks are optimized by means of Differential Evolution. The proposed pRBFNNs are applied to face image(ex Yale, AT&T) datasets and then demonstrated from the viewpoint of the output performance and recognition rate.