Corona Virus Disease-2019 (COVID-19) is a novel virus belongs to the corona virus's family. It spreads very quickly and causes many deaths around the world. The early diagnosis of the disease can help in providing the proper therapy and saving the humans' life. However, it founded that the diagnosis of chest radiography can give an indicator of coronavirus. Thus, a Corner-based Weber Local Descriptor (CWLD) for COVID-19 diagnostics based on chest X-Ray image analysis is presented in this article. The histogram of Weber differential excitation and gradient orientation of the local regions surrounding points of interest are proposed to represent the patterns of the chest X-Ray image. Support Vector Machine (SVM) and Deep Belief Network (DBN) classifiers are utilized for CWLD classification. Experimental results on a real chest X-Ray database showed that the gradient orientation gives the desired accuracy which is 100% using DBN classifier and CWLD size equals to 400.
ABSTRACT Fifty extremely halophilic bacteria were isolated from local high salient soils named Al-Massab Al-Aam in south of iraq and were identified by using numerical taxonomy. Fourty strains were belong to the genus Halobacterium which included Hb. halobium (10%). Hb. salinarium (12.5%), Hb.cutirubrum (17.5%), Hb-saccharovorum (12.5%), Hb. valismortis (10%) and Hb. volcanii (37.5%). Growth curves were determined. Generation time (hr) in complex media and logarithmic phase were measured and found to be 10.37±0.59 for Hb. salinarium. 6.49 ± 0.24 for Hb.cutirubrum. 6.70±0.48 for Hb-valismonis, and 11.24 ± 0.96 for Hb. volcanii
Recovery of time-dependent thermal conductivity has been numerically investigated. The problem of identification in one-dimensional heat equation from Cauchy boundary data and mass/energy specification has been considered. The inverse problem recasted as a nonlinear optimization problem. The regularized least-squares functional is minimised through lsqnonlin routine from MATLAB to retrieve the unknown coefficient. We investigate the stability and accuracy for numerical solution for two examples with various noise level and regularization parameter.
In this paper, a method for hiding cipher text in an image file is introduced . The
proposed method is to hide the cipher text message in the frequency domain of the image.
This method contained two phases: the first is embedding phase and the second is extraction
phase. In the embedding phase the image is transformed from time domain to frequency
domain using discrete wavelet decomposition technique (Haar). The text message encrypted
using RSA algorithm; then Least Significant Bit (LSB) algorithm used to hide secret message
in high frequency. The proposed method is tested in different images and showed success in
hiding information according to the Peak Signal to Noise Ratio (PSNR) measure of the the
original ima
In this work, satellite images for Razaza Lake and the surrounding area
district in Karbala province are classified for years 1990,1999 and
2014 using two software programming (MATLAB 7.12 and ERDAS
imagine 2014). Proposed unsupervised and supervised method of
classification using MATLAB software have been used; these are
mean value and Singular Value Decomposition respectively. While
unsupervised (K-Means) and supervised (Maximum likelihood
Classifier) method are utilized using ERDAS imagine, in order to get
most accurate results and then compare these results of each method
and calculate the changes that taken place in years 1999 and 2014;
comparing with 1990. The results from classification indicated that
In this study, dynamic encryption techniques are explored as an image cipher method to generate S-boxes similar to AES S-boxes with the help of a private key belonging to the user and enable images to be encrypted or decrypted using S-boxes. This study consists of two stages: the dynamic generation of the S-box method and the encryption-decryption method. S-boxes should have a non-linear structure, and for this reason, K/DSA (Knutt Durstenfeld Shuffle Algorithm), which is one of the pseudo-random techniques, is used to generate S-boxes dynamically. The biggest advantage of this approach is the production of the inverted S-box with the S-box. Compared to the methods in the literature, the need to store the S-box is eliminated. Also, the fabr
... Show MoreSecured multimedia data has grown in importance over the last few decades to safeguard multimedia content from unwanted users. Generally speaking, a number of methods have been employed to hide important visual data from eavesdroppers, one of which is chaotic encryption. This review article will examine chaotic encryption methods currently in use, highlighting their benefits and drawbacks in terms of their applicability for picture security.
In this paper, we designed a new efficient stream cipher cryptosystem that depend on a chaotic map to encrypt (decrypt) different types of digital images. The designed encryption system passed all basic efficiency criteria (like Randomness, MSE, PSNR, Histogram Analysis, and Key Space) that were applied to the key extracted from the random generator as well as to the digital images after completing the encryption process.
Fractal image compression depends on representing an image using affine transformations. The main concern for researches in the discipline of fractal image compression (FIC) algorithm is to decrease encoding time needed to compress image data. The basic technique is that each portion of the image is similar to other portions of the same image. In this process, there are many models that were developed. The presence of fractals was initially noticed and handled using Iterated Function System (IFS); that is used for encoding images. In this paper, a review of fractal image compression is discussed with its variants along with other techniques. A summarized review of contributions is achieved to determine the fulfillment of fractal ima
... Show MoreFractal image compression gives some desirable properties like fast decoding image, and very good rate-distortion curves, but suffers from a high encoding time. In fractal image compression a partitioning of the image into ranges is required. In this work, we introduced good partitioning process by means of merge approach, since some ranges are connected to the others. This paper presents a method to reduce the encoding time of this technique by reducing the number of range blocks based on the computing the statistical measures between them . Experimental results on standard images show that the proposed method yields minimize (decrease) the encoding time and remain the quality results passable visually.