Object detection in real time is considered as a challenging problem. However, it is very important in a wide range of applications, especially in field of multimedia. The players and ball are the most important objects in soccer game videos and detecting them is a challenging task because of many difficulties, such as shadow and illumination, ball size, ball occluded by players or merged with lines, and similar appearance of players. To overcome these problems, we present a new system to detect the players and ball in real-time by using background subtraction and Sobel detection. The results were more accurate and approximately two times faster than those using only background subtraction.

In the last years, the research of extraction the movable object from video sequence in application of computer vision become wide spread and well-known . in this paper the extraction of background model by using parallel computing is done by two steps : the first one using non-linear buffer to extraction frame from video sequence depending on the number of frame whether it is even or odd . the goal of this step is obtaining initial background when over half of training sequence contains foreground object . in the second step , The execution time of the traditional K-mean has been improved to obtain initial background through perform the k-mean by using parallel computing where the time has been minimized to 50% of the conventional time

conventional FCM algorithm does not fully utilize the spatial information in the image. In this research, we use a FCM algorithm that incorporates spatial information into the membership function for clustering. The spatial function is the summation of the membership functions in the neighborhood of each pixel under consideration. The advantages of the method are that it is less
sensitive to noise than other techniques, and it yields regions more homogeneous than those of other methods. This technique is a powerful method for noisy image segmentation. 

     Background subtraction is the dominant approach in the domain of moving object detection. Lots of research has been done to design or improve background subtraction models. However, there are a few well-known and state-of-the-art models that can be applied as a benchmark. Generally, these models are applied to different dataset benchmarks. Most of the time, choosing an appropriate dataset is challenging due to the lack of dataset availability and the tedious process of creating ground-truth frames for the sake of quantitative evaluation. Therefore, in this article, we collected local video scenes of a street and river taken by a stationary camera, focusing on dynamic background challenges. We presented a new technique for creati

In this research two algorithms are applied, the first is Fuzzy C Means (FCM) algorithm and the second is hard K means (HKM) algorithm to know which of them is better than the others these two algorithms are applied on a set of data collected  from the Ministry of Planning on the water turbidity of five areas in Baghdad to know which of these areas are less turbid in clear water to see which months during the year are less turbid in clear water in the specified area.

In this research two algorithms are applied, the first is Fuzzy C Means (FCM) algorithm and the second is hard K means (HKM) algorithm to know which of them is better than the others these two algorithms are applied on a set of data collected  from the Ministry of Planning on the water turbidity of five areas in Baghdad to know which of these areas are less turbid in clear water to see which months during the year are less turbid in clear water in the specified area.

The art of preventing the detection of hidden information messages is the way that steganography work. Several algorithms have been proposed for steganographic techniques. A major portion of these algorithms is specified for image steganography because the image has a high level of redundancy. This paper proposed an image steganography technique using a dynamic threshold produced by the discrete cosine coefficient. After dividing the green and blue channel of the cover image into 1*3-pixel blocks, check if any bits of green channel block less or equal to threshold then start to store the secret bits in blue channel block, and to increase the security not all bits in the chosen block used to store the secret bits. Firstly, store in the cente

The influx of data in bioinformatics is primarily in the form of DNA, RNA, and protein sequences. This condition places a significant burden on scientists and computers. Some genomics studies depend on clustering techniques to group similarly expressed genes into one cluster. Clustering is a type of unsupervised learning that can be used to divide unknown cluster data into clusters. The k-means and fuzzy c-means (FCM) algorithms are examples of algorithms that can be used for clustering. Consequently, clustering is a common approach that divides an input space into several homogeneous zones; it can be achieved using a variety of algorithms. This study used three models to cluster a brain tumor dataset. The first model uses FCM, whic

In information security, fingerprint verification is one of the most common recent approaches for verifying human identity through a distinctive pattern. The verification process works by comparing a pair of fingerprint templates and identifying the similarity/matching among them. Several research studies have utilized different techniques for the matching process such as fuzzy vault and image filtering approaches. Yet, these approaches are still suffering from the imprecise articulation of the biometrics’ interesting patterns. The emergence of deep learning architectures such as the Convolutional Neural Network (CNN) has been extensively used for image processing and object detection tasks and showed an outstanding performance compare