Enhancing quality image fusion was proposed using new algorithms in auto-focus image fusion. The first algorithm is based on determining the standard deviation to combine two images. The second algorithm concentrates on the contrast at edge points and correlation method as the criteria parameter for the resulted image quality. This algorithm considers three blocks with different sizes at the homogenous region and moves it 10 pixels within the same homogenous region. These blocks examine the statistical properties of the block and decide automatically the next step. The resulted combined image is better in the contrast value because of the added edge points from the two combined images that depend on the suggested algorithms. This enhancement in edge regions is measured and reaches to double in enhancing the contrast. Different methods are used to be compared with the suggested method.
In this research, we studied the multiple linear regression models for two variables in the presence of the autocorrelation problem for the error term observations and when the error is distributed with general logistic distribution. The auto regression model is involved in the studying and analyzing of the relationship between the variables, and through this relationship, the forecasting is completed with the variables as values. A simulation technique is used for comparison methods depending
In this research, we studied the multiple linear regression models for two variables in the presence of the autocorrelation problem for the error term observations and when the error is distributed with general logistic distribution. The auto regression model is involved in the studying and analyzing of the relationship between the variables, and through this relationship, the forecasting is completed with the variables as values. A simulation technique is used for comparison methods depending on the mean square error criteria in where the estimation methods that were used are (Generalized Least Squares, M Robust, and Laplace), and for different sizes of samples (20, 40, 60, 80, 100, 120). The M robust method is demonstrated the best metho
... Show MoreDylan Thomas (1914-1953) is a modern poet belongs to the apocalyptic movement of the 1940's.This movement is influenced by the doctrines and techniques of surrealism.
Poetry for him should not be primarily concerned with man in society, but with the celebration of spiritual truth. It should bring to light the hidden causes, hence his personal interest is to strip darkness and explore the inward motives. To do this he uses a cluster of images: a constant building up and breaking down of images. His poetry depends on the romantic spontaneity, suggestiveness of the Symbolists and the the surrealists' mysterious liberation of the unconsciousness and
... Show MoreDylan Thomas (1914-1953) is a modern poet belongs to the apocalyptic movement of the 1940's.This movement is influenced by the doctrines and techniques of surrealism. Poetry for him should not be primarily concerned with man in society, but with the celebration of spiritual truth. It should bring to light the hidden causes, hence his personal interest is to strip darkness and explore the inward motives. To do this he uses a cluster of images: a constant building up and breaking down of images. His poetry depends on the romantic spontaneity, suggestiveness of the Symbolists and the the surrealists' mysterious liberation of the unconsciousness and the emotional involvement in the dynamics of life. In "Light Breaks
... Show MoreThis article proposes a new strategy based on a hybrid method that combines the gravitational search algorithm (GSA) with the bat algorithm (BAT) to solve a single-objective optimization problem. It first runs GSA, followed by BAT as the second step. The proposed approach relies on a parameter between 0 and 1 to address the problem of falling into local research because the lack of a local search mechanism increases intensity search, whereas diversity remains high and easily falls into the local optimum. The improvement is equivalent to the speed of the original BAT. Access speed is increased for the best solution. All solutions in the population are updated before the end of the operation of the proposed algorithm. The diversification f
... Show MoreThis study describes the preparation of new series of tetra-dentate N2O2 dinuclear complexes (Cr3+, Co2+, Cu2+) of the Schiff base derived from condensation of 1-Hydroxy-naphthalene-2-carbaldehyde with 2-amino-5-(2-hydroxy-phenyl)-1,3,4-thiadiazole. The structures of the ligands were identified using IR, UV-Vis , mass, elemental analysis and 1H-NMR techniques. All prepared complexes have been characterized by conductance measurement, magnetic susceptibility, electronic spectra, infrared spectrum, theromgravimatric analysis (TGA) and metal analysis by atomic absorption. From stoichiometry of metal to ligand and all measurements show a octahedral geometry proposed for all complexes of the (Cr3+, Co2+, Cu2+). conductivity measurement shows t
... Show MoreThis study describes the preparation of new series of tetra-dentate N2O2 dinuclear complexes (Cr3+, Co2+, Cu2+) of the Schiff base derived from condensation of 1-Hydroxy-naphthalene-2-carbaldehyde with 2-amino-5-(2-hydroxy-phenyl)-1,3,4-thiadiazole. The structures of the ligands were identified using IR, UV-Vis , mass, elemental analysis and 1H-NMR techniques. All prepared complexes have been characterized by conductance measurement, magnetic susceptibility, electronic spectra, infrared spectrum, theromgravimatric analysis (TGA) and metal analysis by atomic absorption. From stoichiometry of metal to ligand and all measurements show a octahedral geometry proposed for all
... Show More This paper describes the application of consensus optimization for Wireless Sensor Network (WSN) system. Consensus algorithm is usually conducted within a certain number of iterations for a given graph topology. Nevertheless, the best Number of Iterations (NOI) to reach consensus is varied in accordance with any change in number of nodes or other parameters of . graph topology. As a result, a time consuming trial and error procedure will necessary be applied
to obtain best NOI. The implementation of an intellig ent optimization can effectively help to get the optimal NOI. The performance of the consensus algorithm has considerably been improved by the inclusion of Particle Swarm Optimization (PSO). As a case s
This paper describes the problem of online autonomous mobile robot path planning, which is consisted of finding optimal paths or trajectories for an autonomous mobile robot from a starting point to a destination across a flat map of a terrain, represented by a 2-D workspace. An enhanced algorithm for solving the problem of path planning using Bacterial Foraging Optimization algorithm is presented. This nature-inspired metaheuristic algorithm, which imitates the foraging behavior of E-coli bacteria, was used to find the optimal path from a starting point to a target point. The proposed algorithm was demonstrated by simulations in both static and dynamic different environments. A comparative study was evaluated between the developed algori
... Show More