Ultrasound imaging has some problems with image properties output. These affects the specialist decision. Ultrasound noise type is the speckle noise which has a grainy pattern depending on the signal. There are two parts of this study. The first part is the enhancing of images with adaptive Weiner, Lee, Gamma and Frost filters with 3x3, 5x5, and 7x7 sliding windows. The evaluated process was achieved using signal to noise ratio (SNR), peak signal to noise ratio (PSNR), mean square error (MSE), and maximum difference (MD) criteria. The second part consists of simulating noise in a standard image (Lina image) by adding different percentage of speckle noise from 0.01 to 0.06. The supervised classification based minimum di

Spatial and frequency domain techniques have been adopted in this search. mean
value filter, median filter, gaussian filter. And adaptive technique consists of
duplicated two filters (median and gaussian) to enhance the noisy image. Different
block size of the filter as well as the sholding value have been tried to perform the
enhancement process.

String matching is seen as one of the essential problems in computer science. A variety of computer applications provide the string matching service for their end users. The remarkable boost in the number of data that is created and kept by modern computational devices influences researchers to obtain even more powerful methods for coping with this problem. In this research, the Quick Search string matching algorithm are adopted to be implemented under the multi-core environment using OpenMP directive which can be employed to reduce the overall execution time of the program. English text, Proteins and DNA data types are utilized to examine the effect of parallelization and implementation of Quick Search string matching algorithm on multi-co

The performance quality and searching speed of Block Matching (BM) algorithm are affected by shapes and sizes of the search patterns used in the algorithm. In this paper, Kite Cross Hexagonal Search (KCHS) is proposed. This algorithm uses different search patterns (kite, cross, and hexagonal) to search for the best Motion Vector (MV). In first step, KCHS uses cross search pattern. In second step, it uses one of kite search patterns (up, down, left, or right depending on the first step). In subsequent steps, it uses large/small Hexagonal Search (HS) patterns. This new algorithm is compared with several known fast block matching algorithms. Comparisons are based on search points and Peak Signal to Noise Ratio (PSNR). According to resul

Many researchers consider Homogeneous Charge Compression Ignition (HCCI) engine mode as a promising alternative to combustion in Spark Ignition and Compression Ignition Engines. The HCCI engine runs on lean mixtures of fuel and air, and the combustion is produced from the fuel autoignition instead of ignited by a spark. This combustion mode was investigated in this paper. A variable compression ratio, spark ignition engine type TD110 was used in the experiments. The tested fuel was Iraqi conventional gasoline (ON=82).

The results showed that HCCI engine can run in very lean equivalence ratios. The brake specific fuel consumption was reduced about 28% compared with a spark ignition engine. The experimental tests showed that the em

      Restoration is the main process in many applications. Restoring an original image from a damaged image is the foundation of the restoring operation, either blind or non-blind. One of the main challenges in the restoration process is to estimate the degradation parameters. The degradation parameters include Blurring Function (Point Spread Function, PSF) and Noise Function. The most common causes of image degradation are errors in transmission channels, defects in the optical system, inhomogeneous medium, relative motion between object and camera, etc. In our research, a novel algorithm was adopted based on Circular Hough Transform used to estimate the width (radius, sigma) of the Point Spread Function. This algorithm is based o

The need for image compression is always renewed because of its importance in reducing the volume of data; which in turn will be stored in less space and transferred more quickly though the communication channels.
In this paper a low cost color image lossy color image compression is introduced. The RGB image data is transformed to YUV color space, then the chromatic bands U & V are down-sampled using dissemination step. The bi-orthogonal wavelet transform is used to decompose each color sub band, separately. Then, the Discrete Cosine Transform (DCT) is used to encode the Low-Low (LL) sub band. The other wavelet sub bands are coded using scalar Quantization. Also, the quad tree coding process was applied on the outcomes of DCT and

Deep Learning Techniques For Skull Stripping of Brain MR Images