The issue of image captioning, which comprises automatic text generation to understand an image’s visual information, has become feasible with the developments in object recognition and image classification. Deep learning has received much interest from the scientific community and can be very useful in real-world applications. The proposed image captioning approach involves the use of Convolution Neural Network (CNN) pre-trained models combined with Long Short Term Memory (LSTM) to generate image captions. The process includes two stages. The first stage entails training the CNN-LSTM models using baseline hyper-parameters and the second stage encompasses training CNN-LSTM models by optimizing and adjusting the hyper-parameters of the previous stage. Improvements include the use of a new activation function, regular parameter tuning, and an improved learning rate in the later stages of training. The experimental results on the flickr8k dataset showed a noticeable and satisfactory improvement in the second stage, where a clear increment was achieved in the evaluation metrics Bleu1-4, Meteor, and Rouge-L. This increment confirmed the effectiveness of the alterations and highlighted the importance of hyper-parameter tuning in improving the performance of CNN-LSTM models in image caption tasks.
The increasing availability of computing power in the past two decades has been use to develop new techniques for optimizing solution of estimation problem. Today's computational capacity and the widespread availability of computers have enabled development of new generation of intelligent computing techniques, such as our interest algorithm, this paper presents one of new class of stochastic search algorithm (known as Canonical Genetic' Algorithm ‘CGA’) for optimizing the maximum likelihood function strategy is composed of three main steps: recombination, mutation, and selection. The experimental design is based on simulating the CGA with different values of are compared with those of moment method. Based on MSE value obtained from bot
... Show MoreStumpff functions are an infinite series that depends on the value of z. This value results from multiplying the reciprocal semi-major axis with a universal anomaly. The purpose from those functions is to calculate the variation of the universal parameter (variable) using Kepler's equation for different orbits. In this paper, each range for the reciprocal of the semi-major axis, universal anomaly, and z is calculated in order to study the behavior of Stumpff functions C(z) and S(z). The results showed that when z grew, Stumpff functions for hyperbola, parabola, and elliptical orbits were also growing. They intersected and had a tendency towards zero for both hyperbola and parabola orbits, but for elliptical orbits, Stumpff functions
... Show MoreThe aim of this paper to find Bayes estimator under new loss function assemble between symmetric and asymmetric loss functions, namely, proposed entropy loss function, where this function that merge between entropy loss function and the squared Log error Loss function, which is quite asymmetric in nature. then comparison a the Bayes estimators of exponential distribution under the proposed function, whoever, loss functions ingredient for the proposed function the using a standard mean square error (MSE) and Bias quantity (Mbias), where the generation of the random data using the simulation for estimate exponential distribution parameters different sample sizes (n=10,50,100) and (N=1000), taking initial
... Show MoreIn this study, we used Bayesian method to estimate scale parameter for the normal distribution. By considering three different prior distributions such as the square root inverted gamma (SRIG) distribution and the non-informative prior distribution and the natural conjugate family of priors. The Bayesian estimation based on squared error loss function, and compared it with the classical estimation methods to estimate the scale parameter for the normal distribution, such as the maximum likelihood estimation and th
... Show MoreMost available methods for unit hydrographs (SUH) derivation involve manual, subjective fitting of
a hydrograph through a few data points. The use of probability distributions for the derivation of synthetic
hydrographs had received much attention because of its similarity with unit hydrograph properties. In this
paper, the use of two flexible probability distributions is presented. For each distribution the unknown
parameters were derived in terms of the time to peak(tp), and the peak discharge(Qp). A simple Matlab
program is prepared for calculating these parameters and their validity was checked using comparison
with field data. Application to field data shows that the gamma and lognormal distributions had fit well.<
Let G be a graph, each edge e of which is given a weight w(e). The shortest path problem is a path of minimum weight connecting two specified vertices a and b, and from it we have a pre-topology. Furthermore, we study the restriction and separators in pre-topology generated by the shortest path problems. Finally, we study the rate of liaison in pre-topology between two subgraphs. It is formally shown that the new distance measure is a metric
Researchers are increasingly using multimodal biometrics to strengthen the security of biometric applications. In this study, a strong multimodal human identification model was developed to address the growing problem of spoofing attacks in biometric security systems. Through the use of metaheuristic optimization methods, such as the Genetic Algorithm(GA), Ant Colony Optimization(ACO), and Particle Swarm Optimization (PSO) for feature selection, this unique model incorporates three biometric modalities: face, iris, and fingerprint. Image pre-processing, feature extraction, critical image feature selection, and multibiometric recognition are the four main steps in the workflow of the system. To determine its performance, the model wa
... Show MoreAmong a variety of approaches introduced in the literature to establish duality theory, Fenchel duality was of great importance in convex analysis and optimization. In this paper we establish some conditions to obtain classical strong Fenchel duality for evenly convex optimization problems defined in infinite dimensional spaces. The objective function of the primal problem is a family of (possible) infinite even convex functions. The strong duality conditions we present are based on the consideration of the epigraphs of the c-conjugate of the dual objective functions and the ε-c-subdifferential of the primal objective functions.
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
... Show More