There is a great deal of systems dealing with image processing that are being used and developed on a daily basis. Those systems need the deployment of some basic operations such as detecting the Regions of Interest and matching those regions, in addition to the description of their properties. Those operations play a significant role in decision making which is necessary for the next operations depending on the assigned task. In order to accomplish those tasks, various algorithms have been introduced throughout years. One of the most popular algorithms is the Scale Invariant Feature Transform (SIFT). The efficiency of this algorithm is its performance in the process of detection and property description, and that is due to the fact that it operates on a big number of key-points, the only drawback it has is that it is rather time consuming. In the suggested approach, the system deploys SIFT to perform its basic tasks of matching and description is focused on minimizing the number of key-points which is performed via applying Fast Approximate Nearest Neighbor algorithm, which will reduce the redundancy of matching leading to speeding up the process. The proposed application has been evaluated in terms of two criteria which are time and accuracy, and has accomplished a percentage of accuracy of up to 100%, in addition to speeding up the processes of matching and description.
Two dimensional meso-scale concrete modeling was used in finite element analysis of plain concrete beam subjected to bending. The plane stress 4-noded quadrilateral elements were utilized to model coarse aggregate, cement mortar. The effect of aggregate fraction distribution, and pores percent of the total area – resulting from air voids entrapped in concrete during placement on the behavior of plain concrete beam in flexural was detected. Aggregate size fractions were randomly distributed across the profile area of the beam. Extended Finite Element Method (XFEM) was employed to treat the discontinuities problems result from double phases of concrete and cracking that faced during the finite element analysis of concrete beam. Crac
... Show MoreA new blind restoration algorithm is presented and shows high quality restoration. This
is done by enforcing Wiener filtering approach in the Fourier domains of the image and the
psf environments
Some nonlinear differential equations with fractional order are evaluated using a novel approach, the Sumudu and Adomian Decomposition Technique (STADM). To get the results of the given model, the Sumudu transformation and iterative technique are employed. The suggested method has an advantage over alternative strategies in that it does not require additional resources or calculations. This approach works well, is easy to use, and yields good results. Besides, the solution graphs are plotted using MATLAB software. Also, the true solution of the fractional Newell-Whitehead equation is shown together with the approximate solutions of STADM. The results showed our approach is a great, reliable, and easy method to deal with specific problems
... Show MoreInthisstudy,FourierTransformInfraredSpectrophotometry(FTIR),XRay Diffraction(XRD)andlossonignition(LOI),comparativelyemployedtoprovideaquick,relativelyinexpensiveandefficientmethodforidentifyingandquantifyingcalcitecontentofphosphateoresamplestakenfromAkashatsiteinIraq.Acomprehensivespectroscopicstudyofphosphate-calcitesystemwasreportedfirstintheMid-IRspectra(4004000cm-1)usingShimadzuIRAffinity-1,fordifferentcutsofphosphatefieldgradeswithsamplesbeneficiatedusingcalcinationandleachingwithorganicacidatdifferenttemperatures.Thenusingtheresultedspectratocreateacalibrationcurverelatesmaterialconcentrationstotheintensity(peaks)ofFTIRabsorbanceandappliesthiscalibrationtospecifyphosphate-calcitecontentinIraqicalcareousphosphateore.Theirpeakswereass
... Show MoreImage compression is one of the data compression types applied to digital images in order to reduce their high cost for storage and/or transmission. Image compression algorithms may take the benefit of visual sensitivity and statistical properties of image data to deliver superior results in comparison with generic data compression schemes, which are used for other digital data. In the first approach, the input image is divided into blocks, each of which is 16 x 16, 32 x 32, or 64 x 64 pixels. The blocks are converted first into a string; then, encoded by using a lossless and dictionary-based algorithm known as arithmetic coding. The more occurrence of the pixels values is codded in few bits compare with pixel values of less occurre
... Show MoreThis paper is concerned with combining two different transforms to present a new joint transform FHET and its inverse transform IFHET. Also, the most important property of FHET was concluded and proved, which is called the finite Hankel – Elzaki transforms of the Bessel differential operator property, this property was discussed for two different boundary conditions, Dirichlet and Robin. Where the importance of this property is shown by solving axisymmetric partial differential equations and transitioning to an algebraic equation directly. Also, the joint Finite Hankel-Elzaki transform method was applied in solving a mathematical-physical problem, which is the Hotdog Problem. A steady state which does not depend on time was discussed f
... Show MoreThe Population growth and decay issues are one of the most pressing issues in many sectors of study. These issues can be found in physics, chemistry, social science, biology, and zoology, among other subjects.
We introduced the solution for these problems in this paper by using the SEJI (Sadiq- Emad- Jinan) integral transform, which has some mathematical properties that we use in our solutions. We also presented the SEJI transform for some functions, followed by the inverse of the SEJI integral transform for these functions. After that, we demonstrate how to use the SEJI transform to tackle population growth and decay problems by presenting two applications that demonstrate how to use this transform to obtain solutions.
Fin
... Show MoreGumbel distribution was dealt with great care by researchers and statisticians. There are traditional methods to estimate two parameters of Gumbel distribution known as Maximum Likelihood, the Method of Moments and recently the method of re-sampling called (Jackknife). However, these methods suffer from some mathematical difficulties in solving them analytically. Accordingly, there are other non-traditional methods, like the principle of the nearest neighbors, used in computer science especially, artificial intelligence algorithms, including the genetic algorithm, the artificial neural network algorithm, and others that may to be classified as meta-heuristic methods. Moreover, this principle of nearest neighbors has useful statistical featu
... Show MoreA new human-based heuristic optimization method, named the Snooker-Based Optimization Algorithm (SBOA), is introduced in this study. The inspiration for this method is drawn from the traits of sales elites—those qualities every salesperson aspires to possess. Typically, salespersons strive to enhance their skills through autonomous learning or by seeking guidance from others. Furthermore, they engage in regular communication with customers to gain approval for their products or services. Building upon this concept, SBOA aims to find the optimal solution within a given search space, traversing all positions to obtain all possible values. To assesses the feasibility and effectiveness of SBOA in comparison to other algorithms, we conducte
... Show MoreThe first successful implementation of Artificial Neural Networks (ANNs) was published a little over a decade ago. It is time to review the progress that has been made in this research area. This paper provides taxonomy for classifying Field Programmable Gate Arrays (FPGAs) implementation of ANNs. Different implementation techniques and design issues are discussed, such as obtaining a suitable activation function and numerical truncation technique trade-off, the improvement of the learning algorithm to reduce the cost of neuron and in result the total cost and the total speed of the complete ANN. Finally, the implementation of a complete very fast circuit for the pattern of English Digit Numbers NN has four layers of 70 nodes (neurons) o
... Show More