In this paper, we deal with the problem of general matching of two images one of them has experienced geometrical transformations, to find the correspondence between two images. We develop the invariant moments for traditional techniques (moments of inertia) with new approach to enhance the performance for these methods. We test various projections directional moments, to extract the difference between Block Distance Moment (BDM) and evaluate their reliability. Three adaptive strategies are shown for projections directional moments, that are raster (vertical and horizontal) projection, Fan-Bean projection and new projection procedure that is the square projection method. Our paper started with the description of a new algorithm that is low cost ("soft calculation"); the new procedure significantly has improved the Statistical Region Description (SRD). The new method BDM is highly accurate 98% even higher than our previous image matching modified method.
This paper proposes a new strategy to enhance the performance and accuracy of the Spiral dynamic algorithm (SDA) for use in solving real-world problems by hybridizing the SDA with the Bacterial Foraging optimization algorithm (BFA). The dynamic step size of SDA makes it a useful exploitation approach. However, it has limited exploration throughout the diversification phase, which results in getting trapped at local optima. The optimal initialization position for the SDA algorithm has been determined with the help of the chemotactic strategy of the BFA optimization algorithm, which has been utilized to improve the exploration approach of the SDA. The proposed Hybrid Adaptive Spiral Dynamic Bacterial Foraging (HASDBF)
... Show MoreThis paper is concerned with studying the numerical solution for the discrete classical optimal control problem (NSDCOCP) governed by a variable coefficients nonlinear hyperbolic boundary value problem (VCNLHBVP). The DSCOCP is solved by using the Galerkin finite element method (GFEM) for the space variable and implicit finite difference scheme (GFEM-IFDS) for the time variable to get the NS for the discrete weak form (DWF) and for the discrete adjoint weak form (DSAWF) While, the gradient projection method (GRPM), also called the gradient method (GRM), or the Frank Wolfe method (FRM) are used to minimize the discrete cost function (DCF) to find the DSCOC. Within these three methods, the Armijo step option (ARMSO) or the optimal step opt
... Show MoreFor several applications, it is very important to have an edge detection technique matching human visual contour perception and less sensitive to noise. The edge detection algorithm describes in this paper based on the results obtained by Maximum a posteriori (MAP) and Maximum Entropy (ME) deblurring algorithms. The technique makes a trade-off between sharpening and smoothing the noisy image. One of the advantages of the described algorithm is less sensitive to noise than that given by Marr and Geuen techniques that considered to be the best edge detection algorithms in terms of matching human visual contour perception.
In this paper, we consider a two-phase Stefan problem in one-dimensional space for parabolic heat equation with non-homogenous Dirichlet boundary condition. This problem contains a free boundary depending on time. Therefore, the shape of the problem is changing with time. To overcome this issue, we use a simple transformation to convert the free-boundary problem to a fixed-boundary problem. However, this transformation yields a complex and nonlinear parabolic equation. The resulting equation is solved by the finite difference method with Crank-Nicolson scheme which is unconditionally stable and second-order of accuracy in space and time. The numerical results show an excellent accuracy and stable solutions for tw
... Show MoreIn this paper, the classical continuous triple optimal control problem (CCTOCP) for the triple nonlinear parabolic boundary value problem (TNLPBVP) with state vector constraints (SVCs) is studied. The solvability theorem for the classical continuous triple optimal control vector CCTOCV with the SVCs is stated and proved. This is done under suitable conditions. The mathematical formulation of the adjoint triple boundary value problem (ATHBVP) associated with TNLPBVP is discovered. The Fréchet derivative of the Hamiltonian" is derived. Under suitable conditions, theorems of necessary and sufficient conditions for the optimality of the TNLPBVP with the SVCs are stated and proved.
In information security, fingerprint verification is one of the most common recent approaches for verifying human identity through a distinctive pattern. The verification process works by comparing a pair of fingerprint templates and identifying the similarity/matching among them. Several research studies have utilized different techniques for the matching process such as fuzzy vault and image filtering approaches. Yet, these approaches are still suffering from the imprecise articulation of the biometrics’ interesting patterns. The emergence of deep learning architectures such as the Convolutional Neural Network (CNN) has been extensively used for image processing and object detection tasks and showed an outstanding performance compare
... Show MoreThis paper addresses the use of adaptive sliding mode control for the servo actuator system with friction. The adaptive sliding mode control has several advantages over traditional sliding mode control method. Firstly, the magnitude of control effort is reduced to the minimal admissible level defined by the conditions for the sliding mode to exist. Secondly, the upper bounds of uncertainties are not required to be known in advance. Therefore, adaptive sliding mode control method can be effectively implemented. The numerical simulation via MATLAB 2014a for servo actuator system with friction is investigated to confirm the effectiveness of the proposed robust adaptive sliding mode control scheme. The results clarify, after
... Show MoreL1 adaptive controller has proven to provide fast adaptation with guaranteed transients in a large variety of systems. It is commonly used for controlling systems with uncertain time-varying unknown parameters. The effectiveness of L1 adaptive controller for position control of single axis has been examined and compared with Model Reference Adaptive Controller (MRAC). The Linear servo motor is one of the main constituting elements of the x-y table which is mostly used in automation application. It is characterized by time-varying friction and disturbance.
The tracking and steady state performances of both controllers have been assessed fo
... Show MoreIn this paper, a self-tuning adaptive neural controller strategy for unknown nonlinear system is presented. The system considered is described by an unknown NARMA-L2 model and a feedforward neural network is used to learn the model with two stages. The first stage is learned off-line with two configuration serial-parallel model & parallel model to ensure that model output is equal to actual output of the system & to find the jacobain of the system. Which appears to be of critical importance parameter as it is used for the feedback controller and the second stage is learned on-line to modify the weights of the model in order to control the variable parameters that will occur to the system. A back propagation neural network is appl
... Show MoreIn this paper, a robust adaptive sliding mode controller is designed for a mobile platform trajectory tracking. The mobile platform is an example of a nonholonomic mechanical system. The presence of holonomic constraints reduces the number of degree of freedom that represents the system model, while the nonholonomic constraints reduce the differentiable degree of freedom. The mathematical model was derived here for the mobile platform, considering the existence of one holonomic and two nonholonomic constraints imposed on system dynamics. The partial feedback linearization method was used to get the input-output relation, where the output is the error functions between the position of a certain point on the platform
... Show More