The Matching and Mosaic of the satellite imagery play an essential role in many remote sensing and image processing projects. These techniques must be required in a particular step in the project, such as remotely change detection applications and the study of large regions of interest. The matching and mosaic methods depend on many image parameters such as pixel values in the two or more images, projection system associated with the header files, and spatial resolutions, where many of these methods construct the matching and mosaic manually. In this research, georeference techniques were used to overcome the image matching task in semi automotive method. The decision about the quality of the technique can be considered i

The Traveling Salesman Problem is a story application of Atom Swarm Optimizations in this research. We have developed several novel techniques intended for solving TSP with PSO. Additionally, we introduced the notions to Swap Operative and Swap Chronological sequence and redefining the remaining operatives their foundation; that way, the study created unique PSO. Research prove it can produce satisfactory outcomes. The aim of this paper be there to assess the functioning of particle swarm optimization, for the going salesman issue TSP. The solution to this trouble is common to be NP-hard, it has N! permutations. The study's goal is to examine the capacity of both algorithms to solve intercontinental and other benchmark problems. Overall, th

The Adaptive Optics technique has been developed to obtain the correction of atmospheric seeing. The purpose of this study is to use the MATLAB program to investigate the performance of an AO system with the most recent AO simulation tools, Objected-Oriented Matlab Adaptive Optics (OOMAO). This was achieved by studying the variables that impact image quality correction, such as observation wavelength bands, atmospheric parameters, telescope parameters, deformable mirror parameters, wavefront sensor parameters, and noise parameters. The results presented a detailed analysis of the factors that influence the image correction process as well as the impact of the AO components on that process

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)

For 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, a computational method for solving optimal problem is presented, using indirect method (spectral methodtechnique) which is based on Boubaker polynomial. By this method the state and the adjoint variables are approximated by Boubaker polynomial with unknown coefficients, thus an optimal control problem is transformed to algebraic equations which can be solved easily, and then the numerical value of the performance index is obtained. Also the operational matrices of differentiation and integration have been deduced for the same polynomial to help solving the problems easier. A numerical example was given to show the applicability and efficiency of the method. Some characteristics of this polynomial which can be used for solvin

Given the importance of increasing economic openness transport companies’ face various issues arising at present time, this required importing different types of goods with different means of transport. Therefore, these companies pay great attention to reducing total costs of transporting commodities by using numbers means of transport methods from their sources to the destinations. The majority of private companies do not acquire the knowledge of using operations research methods, especially transport models, through which the total costs can be reduced, resulting in the importance and need to solve such a problem. This research presents a proposed method for the sum of Total Costs (Tc) of rows and columns, in order to arrive at the init

Background The Transportation Problem (TP) is a detailed model in operations study with applications in logistics, supply chain management, and resource allocation. The classical IBFS methods including North-West Corner, Least Cost and Vogel’s Approximation have competitive computational efficiency, but they are very sensitive to the structure of the problem and usually lead to a solution that is far from the global optimum. Classic enhancement strategies like the Generalized Distribution (MODI) and Stepping-Stone (SS) approaches have low computational complexity but may fall into a local optimum quickly, which makes them ineffective in large-scale or unbalanced problems. Methods We propose the first generic hybrid algorithm, calle

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

This 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