Medical image segmentation is a frequent processing step in image medical understanding and computer aided diagnosis. In this paper, development of range operator in image segmentation is proposed depending on dermatology infection. Three different block sizes have been utilized on the range operator and the developed ones to enhance the behavior of the segmentation process of medical images. To exploit the concept of range filtering, the extraction of the texture content of medical image is proposed. Experiment is conducted on different medical images and textures to prove the efficacy of our proposed filter was good results.

Identifying people by their ear has recently received import attention in the literature. The accurate segmentation of the ear region is vital in order to make successful person identification decisions. This paper presents an effective approach for ear region segmentation from color ear images. Firstly, the RGB color model was converted to the HSV color model. Secondly, thresholding was utilized to segment the ear region. Finally, the morphological operations were applied to remove small islands and fill the gaps. The proposed method was tested on a database which consisted of 105 ear images taken from the right sides of 105 subjects. The experimental results of the proposed approach on a variety of ear images revealed that this approac

Survival analysis is widely applied to data that described by the length of time until the occurrence of an event under interest such as death or other important events. The purpose of this paper is to use the dynamic methodology which provides a flexible method, especially in the analysis of discrete survival time, to estimate the effect of covariate variables through time in the survival analysis on dialysis patients with kidney failure until death occurs. Where the estimations process is completely based on the Bayes approach by using two estimation methods: the maximum A Posterior (MAP) involved with Iteratively Weighted Kalman Filter Smoothing (IWKFS) and in combination with the Expectation Maximization (EM) algorithm. While the other

The Normalized Difference Vegetation Index (NDVI) is commonly used as a measure of land surface greenness based on the assumption that NDVI value is positively proportional to the amount of green vegetation in an image pixel area. The Normalized Difference Vegetation Index data set of Landsat based on the remote sensing information is used to estimate the area of plant cover in region west of Baghdad during 1990-2001. The results show that in the period of 1990 and 2001 the plant area in region of Baghdad increased from (44760.25) hectare to (75410.67) hectare. The vegetation area increased during the period 1990-2001, and decreases the exposed area.

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

    A signature is a special identifier that confirms a person's identity and distinguishes him or her from others. The main goal of this paper is to present a deep study of the spatial density distribution method and the effect of a mass-based segmentation algorithm on its performance while it is being used to recognize handwritten signatures in an offline mode. The methodology of the algorithm is based on dividing the image of the signature into tiles that reflect the shape and geometry of the signature, and then extracting five spatial features from each of these tiles. Features include the mass of each tile, the relative mean, and the relative standard deviation for the vertical and horizontal projections of that tile. In the clas

      Landsat7 of Enhanced thematic mapper plus (ETM+) was launched on April 15,  1999. Four years later, images start degrading due to the scan line corrector (SLC). SLC is a malfunction that results in pixel gaps in images captured by the sensor of Landsat7. The pixel gap regions extend from about one pixel near the image center and reach up to about 14 pixels in width near the image edge. The shape of this loss is like a zigzag line; however, there are different studies about repairing these gaps. The challenge of all studies depends on retrieving inhomogeneous areas because the homogenous area can be retrieved quickly depending on the surrounding area. This research focuses on filling these gaps by utilizing pixels around them

عملية تغيير حجم الصورة في مجال معالجة الصور باستخدام التحويلات الهندسية بدون تغيير دقة الصورة تعرف ب image scaling  او image resizing. عملية تغيير حجم الصورة لها تطبيقات واسعة في مجال الحاسوب والهاتف النقال والاجهزة الالكترونية الاخرى. يقترح هذا البحث طريقة لتغيير حجم الصورة باستخدام المعادلات الخاصة بمنحني Bezier وكيفية الحصول على افضل نتائج. تم استخدام Bezier curve في اعمال سابقة في مجالات مختلفة ولكن في هذا البحث تم استخد

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

Let G be a graph, each edge e of which is given a weight w(e). The shortest path problem is a path of minimum weight connecting two specified vertices a and b, and from it we have a pre-topology. Furthermore, we study the restriction and separators in pre-topology generated by the shortest path problems. Finally, we study the rate of liaison in pre-topology between two subgraphs. It is formally shown that the new distance measure is a metric