Fingerprint recognition is one among oldest procedures of identification. An important step in automatic fingerprint matching is to mechanically and dependably extract features. The quality of the input fingerprint image has a major impact on the performance of a feature extraction algorithm. The target of this paper is to present a fingerprint recognition technique that utilizes local features for fingerprint representation and matching. The adopted local features have determined: (i) the energy of Haar wavelet subbands, (ii) the normalized of Haar wavelet subbands. Experiments have been made on three completely different sets of features which are used when partitioning the fingerprint into overlapped blocks. Experiments are conducted on FVC2004 databases that have a four database; every database is eighty fingers and eight impressions per finger. The implemented recognition results of the proposed system show high recognition performance which is 100%.
The calibration of a low-speed wind tunnel (LSWT) test section had been made in the present work. The tunnel was designed and constructed at the Aerodynamics Lab. in the Mechanical Engineering Department/University of Baghdad. The test section design speed is 70 m/s. Frictional loses and uniformity of the flow inside the test section had been tested and calibrated based on the British standards for flow inside ducts and conduits. Pitot-static tube, boundary layer Pitot tube were the main instruments which were used in the present work to measure the flow characteristics with emphasize on the velocity uniformity and boundary layer growth along the walls of the test section. It is found that the maximum calibrated velocity for empty test sect
... Show MoreThe calibration of a low-speed wind tunnel (LSWT) test section had been made in the present work. The tunnel was designed and constructed at the Aerodynamics Lab. in the Mechanical Engineering Department/University of Baghdad. The test section design speed is 70 m/s. Frictional loses and uniformity of the flow inside the test section had been tested and calibrated based on the British standards for flow inside ducts and conduits. Pitot-static tube, boundary layer Pitot tube were the main instruments which were used in the present work to measure the flow characteristics with emphasize on the velocity uniformity and boundary layer growth along the walls of the test section. It is found that the maximum calibrated velocity for empty test s
... Show More
(1)
(16)
(14)
The aim of this research is to estimate the parameters of the linear regression model with errors following ARFIMA model by using wavelet method depending on maximum likelihood and approaching general least square as well as ordinary least square. We use the estimators in practical application on real data, which were the monthly data of Inflation and Dollar exchange rate obtained from the (CSO) Central Statistical organization for the period from 1/2005 to 12/2015. The results proved that (WML) was the most reliable and efficient from the other estimators, also the results provide that the changing of fractional difference parameter (d) doesn’t effect on the results.
In this paper, our aim is to study variational formulation and solutions of 2-dimensional integrodifferential equations of fractional order. We will give a summery of representation to the variational formulation of linear nonhomogenous 2-dimensional Volterra integro-differential equations of the second kind with fractional order. An example will be discussed and solved by using the MathCAD software package when it is needed.
Orthogonal polynomials and their moments serve as pivotal elements across various fields. Discrete Krawtchouk polynomials (DKraPs) are considered a versatile family of orthogonal polynomials and are widely used in different fields such as probability theory, signal processing, digital communications, and image processing. Various recurrence algorithms have been proposed so far to address the challenge of numerical instability for large values of orders and signal sizes. The computation of DKraP coefficients was typically computed using sequential algorithms, which are computationally extensive for large order values and polynomial sizes. To this end, this paper introduces a computationally efficient solution that utilizes the parall
... Show More
(2)
(53)
(54)
The 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 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