Abstract: This work compares the results of multidimensional
function approximation using two algorithms: the classical Particle
Swarm Optimization (PSO) and the Quantum Particle Swarm
Optimization (QPSO). These algorithms were both tested on three
functions - The Rosenbrock, the Rastrigin, and the sphere functions
- with different characteristics by increasing their number of
dimensions. As a result, this study shows that the higher the function
space, i.e. the larger the function dimension, the more evident the
advantages of using the QPSO method compared to the PSO method
in terms of performance and number of necessary iterations to reach
the stop criterion.
Abstract: Recent experimental evidences have shown that because
of a fast convergence and a nice accuracy, neural networks training
via extended kalman filter (EKF) method is widely applied. However,
as to an uncertainty of the system dynamics or modeling error, the
performance of the method is unreliable. In order to overcome this
problem in this paper, a new finite impulse response (FIR) filter based
learning algorithm is proposed to train radial basis function neural
networks (RBFN) for nonlinear function approximation. Compared
to the EKF training method, the proposed FIR filter training method
is more robust to those environmental conditions. Furthermore , the
number of centers will be considered since it affects the performance
of approximation.
Abstract: A robust still image face localization algorithm
capable of operating in an unconstrained visual environment is
proposed. First, construction of a robust skin classifier within a
shifted HSV color space is described. Then various filtering
operations are performed to better isolate face candidates and
mitigate the effect of substantial non-skin regions. Finally, a novel
Bhattacharyya-based face detection algorithm is used to compare
candidate regions of interest with a unique illumination-dependent
face model probability distribution function approximation.
Experimental results show a 90% face detection success rate despite
the demands of the visually noisy environment.
Abstract: This paper proposes an efficient learning method for the layered neural networks based on the selection of training data and input characteristics of an output layer unit. Comparing to recent neural networks; pulse neural networks, quantum neuro computation, etc, the multilayer network is widely used due to its simple structure. When learning objects are complicated, the problems, such as unsuccessful learning or a significant time required in learning, remain unsolved. Focusing on the input data during the learning stage, we undertook an experiment to identify the data that makes large errors and interferes with the learning process. Our method devides the learning process into several stages. In general, input characteristics to an output layer unit show oscillation during learning process for complicated problems. The multi-stage learning method proposes by the authors for the function approximation problems of classifying learning data in a phased manner, focusing on their learnabilities prior to learning in the multi layered neural network, and demonstrates validity of the multi-stage learning method. Specifically, this paper verifies by computer experiments that both of learning accuracy and learning time are improved of the BP method as a learning rule of the multi-stage learning method. In learning, oscillatory phenomena of a learning curve serve an important role in learning performance. The authors also discuss the occurrence mechanisms of oscillatory phenomena in learning. Furthermore, the authors discuss the reasons that errors of some data remain large value even after learning, observing behaviors during learning.
Abstract: This work explores blind image deconvolution by recursive function approximation based on supervised learning of neural networks, under the assumption that a degraded image is linear convolution of an original source image through a linear shift-invariant (LSI) blurring matrix. Supervised learning of neural networks of radial basis functions (RBF) is employed to construct an embedded recursive function within a blurring image, try to extract non-deterministic component of an original source image, and use them to estimate hyper parameters of a linear image degradation model. Based on the estimated blurring matrix, reconstruction of an original source image from a blurred image is further resolved by an annealed Hopfield neural network. By numerical simulations, the proposed novel method is shown effective for faithful estimation of an unknown blurring matrix and restoration of an original source image.
Abstract: An additive fuzzy system comprising m rules with
n inputs and p outputs in each rule has at least t m(2n + 2 p + 1)
parameters needing to be tuned. The system consists of a large
number of if-then fuzzy rules and takes a long time to tune its
parameters especially in the case of a large amount of training data
samples. In this paper, a new learning strategy is investigated to cope
with this obstacle. Parameters that tend toward constant values at the
learning process are initially fixed and they are not tuned till the end
of the learning time. Experiments based on applications of the
additive fuzzy system in function approximation demonstrate that the
proposed approach reduces the learning time and hence improves
convergence speed considerably.
Abstract: In determining the electromagnetic properties of
magnetic materials, hysteresis modeling is of high importance. Many
models are available to investigate those characteristics but they tend
to be complex and difficult to implement. In this paper a new
qualitative hysteresis model for ferromagnetic core is presented,
based on the function approximation capabilities of adaptive neuro
fuzzy inference system (ANFIS). The proposed ANFIS model
combined the neural network adaptive capabilities and the fuzzy
logic qualitative approach can restored the hysteresis curve with a
little RMS error. The model accuracy is good and can be easily
adapted to the requirements of the application by extending or
reducing the network training set and thus the required amount of
measurement data.
Abstract: This paper presents a new adaptive impedance control
strategy, based on Function Approximation Technique (FAT) to
compensate for unknown non-flat environment shape or time-varying
environment location. The target impedance in the force controllable
direction is modified by incorporating adaptive compensators and the
uncertainties are represented by FAT, allowing the update law to be
derived easily. The force error feedback is utilized in the estimation
and the accurate knowledge of the environment parameters are not
required by the algorithm. It is shown mathematically that the
stability of the controller is guaranteed based on Lyapunov theory.
Simulation results presented to demonstrate the validity of the
proposed controller.
Abstract: This paper presents the Function Approximation
Technique (FAT) based adaptive impedance control for a robotic
finger. The force based impedance control is developed so that the
robotic finger tracks the desired force while following the reference
position trajectory, under unknown environment position and
uncertainties in finger parameters. The control strategy is divided into
two phases, which are the free and contact phases. Force error
feedback is utilized in updating the uncertain environment position
during contact phase. Computer simulations results are presented to
demonstrate the effectiveness of the proposed technique.
Abstract: This study is concerned with a new adaptive impedance control strategy to compensate for unknown time-varying environment stiffness and position. The uncertainties are expressed by Function Approximation Technique (FAT), which allows the update laws to be derived easily using Lyapunov stability theory. Computer simulation results are presented to validate the effectiveness of the proposed strategy.