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

Represent the current study and tagged (the credibility of digital image and its reflection on the process of cognitive picture releases) scientific effort is designed to detect realizing press releases and the extent affected the credibility of the digital image by selecting the relationship between digital photo and the extent of their credibility on the one hand and between the process of cognition and Press Photo of the hand Other than the consequent establishment researcher collects materials to serve the scientific research topic in three chaptersCombine the first one methodological framework for the search of the research problem and its significance and the desired objective be achieved together with the definition of the most im

   Chaotic features of nuclear energy spectrum in ⁶⁸Ge nucleus are investigated by nuclear shell model. The energies are calculated through doing shell model calculations employing the OXBASH computer code with effective interaction of F5PVH. The ⁶⁸Ge nucleus is supposed to have an inert core of ⁵⁶Ni with 12 nucleons (4 protons and 8 neutrons) move in the f5p-model space ( and ). The nuclear level density of considered classes of states is seen to have a Gaussian form, which is in accord with the prediction of other theoretical studies. The statistical fluctuations of the energy spectrum (the level spacing P(s) and the Dyson-Mehta (or statistics) are well described by the Gaussian orthogonal ens

Background: Few updated retrospective histopathological-based studies in Iraq evaluate a comprehensive spectrum of oro-maxillofacial lesions. Also, there was a need for a systematic way of categorizing the diseases and reporting results in codes according to the WHO classification that helps occupational health professionals in the clinical-epidemiological approach.

Objectives: to establish an electronic archiving database according to the ICD-10 that encompasses oro-maxillofacial lesions in Sulaimani city for the last 12 years, then to study the prevalence trend and correlation with clinicopathological parameters.

Subjects and Methods:  A descri

Some of the main challenges in developing an effective network-based intrusion detection system (IDS) include analyzing large network traffic volumes and realizing the decision boundaries between normal and abnormal behaviors. Deploying feature selection together with efficient classifiers in the detection system can overcome these problems.  Feature selection finds the most relevant features, thus reduces the dimensionality and complexity to analyze the network traffic.  Moreover, using the most relevant features to build the predictive model, reduces the complexity of the developed model, thus reducing the building classifier model time and consequently improves the detection performance.  In this study, two different sets of select

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