Position control of servo motor systems is a challenging task because of inevitable factors such as uncertainties, nonlinearities, parametric variations, and external perturbations. In this article, to alleviate the above issues, a practical adaptive fast terminal sliding mode control (PAFTSMC) is proposed for better tracking performance of the servo motor system by using a state observer and bidirectional adaptive law. First, a smooth-tangent-hyperbolic-function-based practical fast terminal sliding mode control (PFTSM) surface is designed to ensure not only fast finite time tracking error convergence but also chattering reduction. Second, the PAFTSMC is proposed for the servo motor, in which a two-way adaptive law is designed to further suppress the chattering and overestimation problems. More importantly, the proposed adaptive technique can update the switching gain according to the system uncertainties, which can provide high gain in the reaching phase and then decrease to the smallest value in the sliding phase to avoid the monotonically increasing gain that exists in most adaptation methods. Third, the finite-time stability of the closed-loop system is proved based on the Lyapunov theorem. Finally, the simulation studies and experimental tests verify the effectiveness of the proposed control in terms of better tracking, strong robustness, and reduced chattering, compared to existing algorithms.
The aim of this paper, is to discuss several high performance training algorithms fall into two main categories. The first category uses heuristic techniques, which were developed from an analysis of the performance of the standard gradient descent algorithm. The second category of fast algorithms uses standard numerical optimization techniques such as: quasi-Newton . Other aim is to solve the drawbacks related with these training algorithms and propose an efficient training algorithm for FFNN
In many video and image processing applications, the frames are partitioned into blocks, which are extracted and processed sequentially. In this paper, we propose a fast algorithm for calculation of features of overlapping image blocks. We assume the features are projections of the block on separable 2D basis functions (usually orthogonal polynomials) where we benefit from the symmetry with respect to spatial variables. The main idea is based on a construction of auxiliary matrices that virtually extends the original image and makes it possible to avoid a time-consuming computation in loops. These matrices can be pre-calculated, stored and used repeatedly since they are independent of the image itself. We validated experimentally th
... Show MoreAbstract
This paper presents an intelligent model reference adaptive control (MRAC) utilizing a self-recurrent wavelet neural network (SRWNN) to control nonlinear systems. The proposed SRWNN is an improved version of a previously reported wavelet neural network (WNN). In particular, this improvement was achieved by adopting two modifications to the original WNN structure. These modifications include, firstly, the utilization of a specific initialization phase to improve the convergence to the optimal weight values, and secondly, the inclusion of self-feedback weights to the wavelons of the wavelet layer. Furthermore, an on-line training procedure was proposed to enhance the control per
... Show MoreAs s widely use of exchanging private information in various communication applications, the issue to secure it became top urgent. In this research, a new approach to encrypt text message based on genetic algorithm operators has been proposed. The proposed approach follows a new algorithm of generating 8 bit chromosome to encrypt plain text after selecting randomly crossover point. The resulted child code is flipped by one bit using mutation operation. Two simulations are conducted to evaluate the performance of the proposed approach including execution time of encryption/decryption and throughput computations. Simulations results prove the robustness of the proposed approach to produce better performance for all evaluation metrics with res
... Show MoreAbstract
For sparse system identification,recent suggested algorithms are -norm Least Mean Square (
-LMS), Zero-Attracting LMS (ZA-LMS), Reweighted Zero-Attracting LMS (RZA-LMS), and p-norm LMS (p-LMS) algorithms, that have modified the cost function of the conventional LMS algorithm by adding a constraint of coefficients sparsity. And so, the proposed algorithms are named
-ZA-LMS,
In this study, the performance of the adaptive optics (AO) system was analyzed through a numerical computer simulation implemented in MATLAB. Making a phase screen involved turning computer-generated random numbers into two-dimensional arrays of phase values on a sample point grid with matching statistics. Von Karman turbulence was created depending on the power spectral density. Several simulated point spread functions (PSFs) and modulation transfer functions (MTFs) for different values of the Fried coherent diameter (ro) were used to show how rough the atmosphere was. To evaluate the effectiveness of the optical system (telescope), the Strehl ratio (S) was computed. The compensation procedure for an AO syst
... Show MoreSpatial and frequency domain techniques have been adopted in this search. mean
value filter, median filter, gaussian filter. And adaptive technique consists of
duplicated two filters (median and gaussian) to enhance the noisy image. Different
block size of the filter as well as the sholding value have been tried to perform the
enhancement process.
In this paper, we devoted to use circular shape sliding block, in image edge determination. The circular blocks have symmetrical properties in all directions for the mask points around the central mask point. Therefore, the introduced method is efficient to be use in detecting image edges, in all directions curved edges, and lines. The results exhibit a very good performance in detecting image edges, comparing with other edge detectors results.