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.
One of the most difficult issues in the history of communication technology is the transmission of secure images. On the internet, photos are used and shared by millions of individuals for both private and business reasons. Utilizing encryption methods to change the original image into an unintelligible or scrambled version is one way to achieve safe image transfer over the network. Cryptographic approaches based on chaotic logistic theory provide several new and promising options for developing secure Image encryption methods. The main aim of this paper is to build a secure system for encrypting gray and color images. The proposed system consists of two stages, the first stage is the encryption process, in which the keys are genera
... Show MoreIn order to select the optimal tracking of fast time variation of multipath fast time variation Rayleigh fading channel, this paper focuses on the recursive least-squares (RLS) and Extended recursive least-squares (E-RLS) algorithms and reaches the conclusion that E-RLS is more feasible according to the comparison output of the simulation program from tracking performance and mean square error over five fast time variation of Rayleigh fading channels and more than one time (send/receive) reach to 100 times to make sure from efficiency of these algorithms.
Some maps of the chaotic firefly algorithm were selected to select variables for data on blood diseases and blood vessels obtained from Nasiriyah General Hospital where the data were tested and tracking the distribution of Gamma and it was concluded that a Chebyshevmap method is more efficient than a Sinusoidal map method through mean square error criterion.
The aim of this study was to evaluate ovarian masses with conventional grey scale ultrasonography and colour Doppler flow imaging and to assess the diagnostic reliability of these methods in differentiating benign and malignant ovarian masses.
We assessed 56 patients with an ovarian mass. Morphological characterisation of the mass was performed utilising the Sassone score. Colour Doppler parameters were recorded for each patient, and the Caruso vascular score was also applied. The results were compared with surgical/pathological and/or follow-up scans.
Using the Sassone score, overall reliability in differentiating ovaria
Carbon dioxide geo-sequestration (CGS) into sediments in the form of (gas) hydrates is one proposed method for reducing anthropogenic carbon dioxide emissions to the atmosphere and, thus reducing global warming and climate change. However, there is a serious lack of understanding of how such CO2 hydrate forms and exists in sediments. We thus imaged CO2 hydrate distribution in sandstone, and investigated the hydrate morphology and cluster characteristics via x-ray micro-computed tomography in 3D in-situ. A substantial amount of gas hydrate (∼17% saturation) was observed, and the stochastically distributed hydrate clusters followed power-law relations with respect to their size distributions and surface area-volume relationships. The layer-
... Show MoreObjective: The study aimed to 1) measure the prevalence of depression and anxiety among Iraqi pharmacy and medical students at a number of universities in Baghdad using Hospital Anxiety and Depression Scale (HADS) and 2) investigate the association between various sociodemographic factors and students’ HADS scores. Methods: This study was based on a cross-sectional descriptive design in four universities in Baghdad, Iraq. Depression and anxiety were screened using an Arabic version of the HADS. An online survey was administered via Qualtrics to convenience samples of students at four colleges of pharmacy and a college of medicine between March and June 2018. Multiple linear regression was used to identify factors associated
... Show MoreLK Abood, RA Ali, M Maliki, International Journal of Science and Research, 2015 - Cited by 2
Recently, a new secure steganography algorithm has been proposed, namely, the secure Block Permutation Image Steganography (BPIS) algorithm. The new algorithm consists of five main steps, these are: convert the secret message to a binary sequence, divide the binary sequence into blocks, permute each block using a key-based randomly generated permutation, concatenate the permuted blocks forming a permuted binary sequence, and then utilize a plane-based Least-Significant-Bit (LSB) approach to embed the permuted binary sequence into BMP image file format. The performance of algorithm was given a preliminary evaluation through estimating the PSNR (Peak Signal-to-Noise Ratio) of the stego image for limited number of experiments comprised hiding
... Show MoreIn digital images, protecting sensitive visual information against unauthorized access is considered a critical issue; robust encryption methods are the best solution to preserve such information. This paper introduces a model designed to enhance the performance of the Tiny Encryption Algorithm (TEA) in encrypting images. Two approaches have been suggested for the image cipher process as a preprocessing step before applying the Tiny Encryption Algorithm (TEA). The step mentioned earlier aims to de-correlate and weaken adjacent pixel values as a preparation process before the encryption process. The first approach suggests an Affine transformation for image encryption at two layers, utilizing two different key sets for each layer. Th
... Show More