Iris research is focused on developing techniques for identifying and locating relevant biometric features, accurate segmentation and efficient computation while lending themselves to compression methods. Most iris segmentation methods are based on complex modelling of traits and characteristics which, in turn, reduce the effectiveness of the system being used as a real time system. This paper introduces a novel parameterized technique for iris segmentation. The method is based on a number of steps starting from converting grayscale eye image to a bit plane representation, selection of the most significant bit planes followed by a parameterization of the iris location resulting in an accurate segmentation of the iris from the origin

The quality of Global Navigation Satellite Systems (GNSS) networks are considerably influenced by the configuration of the observed baselines. Where, this study aims to find an optimal configuration for GNSS baselines in terms of the number and distribution  of baselines to improve the quality criteria of the GNSS networks. First order design problem (FOD) was applied in this research to optimize GNSS network baselines configuration, and based on sequential adjustment method to solve its objective functions.

FOD for optimum precision (FOD-p) was the proposed model which based on the design criteria of A-optimality and E-optimality. These design criteria were selected as objective functions of precision, whic

          A novel median filter based on crow optimization algorithms (OMF) is suggested to reduce the random salt and pepper noise and improve the quality of the RGB-colored and gray images. The fundamental idea of the approach is that first, the crow optimization algorithm detects noise pixels, and that replacing them with an optimum median value depending on a criterion of maximization fitness function. Finally, the standard measure peak signal-to-noise ratio (PSNR), Structural Similarity, absolute square error and mean square error have been used to test the performance of suggested filters (original and improved median filter) used to removed noise from images. It achieves the simulation based on MATLAB R2019b and the resul

Background: Although various imaging modalities are available for evaluating suspicious breast lesions, ultrasound-based Shear-Wave Elastography (SWE) is an advanced, non-invasive technique complementary to grayscale sonography. This technique evaluates the elasticity of a specific tissue by applying sonic pressure to that tissue.

Objective: The aim is to assess the role of SWE in evaluating solid breast masses in correlation to histopathological study results.

Subjects and Methods: This prospective study was done in a tertiary care teaching hospital from September 2019 to August 2020. A study population of 50 women aged 18 years or above with an

Iraq suffers from lack of water resources supply because the headwaters of the rivers located outside its borders and the influence of upstream countries on the quantities of flowing water, in addition to the increase of pressure on available water as a result of population increase and not adopting the principle of rationalization where misuse and wastage and lack of strategic vision to treat and manage water use in accordance with the economic implications fall.  This is reflected fallout on water security and subsequently on national and food security, while the issue of using water resources is development top priority in different countries in the world because of the importance of water effect on the security of indivi

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