A New Divide and Conquer Algorithm for Graph-based Image and Video Segmentation

Clustering-based segmentation algorithm is one of the common methods in image segmentation. However, how to avoid the influence of the initialization and the singular value is a problem we have to face. For overcoming this problem, we proposed a new image segmentation technology which is based on the AIC criterion and not affected by the singular values. The simulation results show that the method has good performance on stability and accuracy. Image segmentation is the key step in image analysis of computer vision and image processing field. It has been widely applied in various areas such as in the process of automating production, sensing images and biomedical images. The main goal of image segmentation is to simplify an image into segments that have a strong correlation with objects in the real world. The existing segmentation algorithm can be generally divided into three classes: edge detection, region- based segmentation and data clustering. Edge detection method relies on the edges of the object with background and the other objects. For the images with noise, it is difficult to separate the boundary and the target background (1). Region- based segmentation method segments an image into several meaningful sub-domains that are non-overlapping and same- nature. But it may lead to the over-segmentation, and has to combine with other methods to use (2). Data clustering method is based on the whole image and considers the distance between each data. Advantages of data clustering method are low complexity and easy to implement. Disadvantages are sensitive to the noise and selection of the initial centroids (3). Data clustering is one of the common techniques in image segmentation. Its purpose is to cluster pixels into several parts (regions) according to the feature of image. Based on the properties of clustering algorithm, researchers have proposed various image segmentation algorithm, such as based on hierarchical clustering, based on K-means clustering, based on fuzzy clustering, based on mean shift, and so on (3-5). Clustering analysis is an unsupervised process of partitioning a data set into subsets of similar data objects. The elementary principle is as far as possible to increase the difference between categories and reduce the difference within the category. In the process of image segmentation based on data clustering, thus the objective is that the similar pixels are divided into the same regions and the non-similar pixels are divided into different regions. However, Two difficulties we must face are that how to determine the cluster centers and avoid influence of noise. In this paper, a new image segmentation algorithm is proposed based on the AIC criterion. The new segmentation technology can achieve an ideal performance and not affected by the initialization of centroids and the singular values. The simulation results verify the efficiency of proposed algorithm.

In day-to-day life, new technologies are emerging in the field of Image processing, especially in the domain of segmentation. Image segmentation is the most important part in digital image processing. Segmentation is nothing but a portion of any image and object. In image segmentation, the digital image is divided into multiple set of pixels. Image segmentation is generally required to cut out region of interest (ROI) from an image. Currently there are many different algorithms available for image segmentation. This chapter presents a brief outline of some of the most common segmentation techniques (e.g. Segmentation based on thresholding, Model based segmentation, Segmentation based on edge detection, Segmentation based on clustering, etc.,) mentioning its advantages as well as the drawbacks. The Matlab simulated results of different available image segmentation techniques are also given for better understanding of image segmentation. Simply, different image segmentation algorithms with their prospects are reviewed in this chapter to reduce the time of literature survey of the future researchers.

We consider the problem of referring segmentation in images and videos with natural language. Given an input image (or video) and a referring expression, the goal is to segment the entity referred by the expression in the image or video. In this paper, we propose a cross-modal self-attention (CMSA) module to utilize fine details of individual words and the input image or video, which effectively captures the long-range dependencies between linguistic and visual features. Our model can adaptively focus on informative words in the referring expression and important regions in the visual input. We further propose a gated multi-level fusion (GMLF) module to selectively integrate self-attentive cross-modal features corresponding to different levels of visual features. This module controls the feature fusion of information flow of features at different levels with high-level and low-level semantic information related to different attentive words. Besides, we introduce cross-frame self-attention (CFSA) module to effectively integrate temporal information in consecutive frames which extends our method in the case of referring segmentation in videos. Experiments on benchmark datasets of four referring image datasets and two actor and action video segmentation datasets consistently demonstrate that our proposed approach outperforms existing state-of-the-art methods.

Image segmentation is one of the most important and difficult tasks in digital image processing. It represents a key stage of automated image analysis and interpretation. Segmentation algorithms for gray-scale images utilize basic properties of intensity values such as discontinuity and similarity. However, it is possible to enhance edge-detection capability by means of using spectral information provided by multispectral (MS) or hyperspectral (HS) imagery. In this paper we consider image segmentation algorithms for multispectral images with particular emphasis on detection of multi-color or multispectral edges. More specifically, we report on an algorithm for joint spatio-spectral (JSS) edge detection. By joint we mean simultaneous utilization of spatial and spectral characteristics of a given MS or HS image. The JSSbased edge-detection approach, termed Spectral Ratio Contrast (SRC) edge-detection algorithm, utilizes the novel concept of matching edge signatures. The edge signature represents a combination of spectral ratios calculated using bands that enhance the spectral contrast between the two materials. In conjunction with a spatial mask, the edge signature give rise to a multispectral operator that can be viewed as a threedimensional extension of the mask. In the extended mask, the third (spectral) dimension of each hyper-pixel can be chosen independently. The SRC is verified using MS and HS imagery from a quantum-dot in a well infrared (IR) focal plane array, and the Airborne Hyperspectral Imager.

As an important classifier, fuzzy c-means clustering technique has been widely used in segmentation of image. It is an adaptive segmentation method for plant disease images. However, it has some uncertain factors, when it is used for specific segmentation problem, that are input parameters value. The input parameters include the feature of the date set, the optimal number of cluster, and the degree of fuzziness. These parameters affect the speed and precision of fuzzy clustering segmentation. In this paper, the optimal choice of parameters in a fuzzy c-means algorithm for segmentation of plant disease image was discussed and investigated. Using the pixels gray and means of neighborhood pixels as input feature data; an adapting the FCM algorithm parameters based on fuzzy partition entropy, fuzzy partition coefficient, and compactness measures was used to choose the optimal cluster number; and experiments was used for choosing the degree of fuzziness. The Results show that the optimal clustering number for disease leaf segmentation problem is 4 and the degree of fuzziness is 2.

Diffusion coupling model based on neural oscillation synchronization theory, which can extract different targets with different gray levels from one, has been an important way for realizing image segmentation. This paper describes the diffusion coupling model and its algorithm and process for image segmentation. Simulation programs for supplementing this algorithm were compiled based on MATLAB platform. Experimental results on synthetic images, infrared images and brain magnetic resonance images show that, by setting reasonable algorithm parameters, the target image extraction and segmentation of different elements can be achieved. This image segmentation algorithm exhibits wide applications in medical image diagnosis, satellite image processing, traffic control, biometrics and others.

The purpose of the research is to develop a universal algorithm for partial texture segmentation of any visual images. The main peculiarity of the proposed segmentation procedure is the extraction of only homogeneous fine-grained texture segments present in the images. At first, an initial seed point is found for the largest and most homogeneous segment of the image. This initial seed point of the segment is expanded using a region growing method. Other texture segments of the image are extracted analogously in turn. At the second stage, the procedure of merging the extracted segments belonging to the same texture class is performed. Then, the detected texture segments are input to a neural network with competitive layers which accomplishes more accurate delineation of the shapes of the extracted texture segments. The proposed segmentation procedure is fully unsupervised, i.e., it does not use any a priori knowledge on either the type of textures or the number of texture segments in the image. The research results in development of the segmentation algorithm realized as a computer program tested in a series of experiments that demonstrate its efficiency on grayscale natural scenes.

In remote sensing, modern sensors produce multi-dimensional images. For example, hyperspectral images contain hundreds of spectral images. In many image processing applications, segmentation is an important step. Traditionally, most image segmentation and edge detection methods have been developed for one-dimensional images. For multidimensional images, the output images of spectral band images are typically combined under certain rules or using decision fusions. In this paper, we proposed a new edge detection algorithm for multi-dimensional images using secondorder statistics. First, we reduce the dimension of input images using the principal component analysis. Then we applied multi-dimensional edge detection operators that utilize second-order statistics. Experimental results show promising results compared to conventional one-dimensional edge detectors such as Sobel filter.

Edge detection plays a crucial role in image processing and computer vision, and is widely used in tasks such as object recognition and image segmentation. Traditional edge detection algorithms perform well in many applications, but there are still some shortcomings in terms of real-time performance and processing efficiency. To address this issue, a highly efficient image edge detection model combining Sobel algorithm and field programmable gate array technology was proposed. YCbCr color space conversion was performed on the image, then Sobel operator was utilized to calculate the image gradient, and adaptive thresholding method was applied to determine the edges. Finally, the model was implemented and optimized on a field programmable gate array. The experimental results showed that when the dataset size was 1000, the information retention rate of the proposed image preprocessing model was 0.89, and the structural information loss was 0.05. When the data volume was 100, the accuracy of the proposed image edge detection model was 0.90, and the root mean square error value was 0.16. The research results indicate that the proposed image edge detection model based on field programmable gate arrays has significant advantages in edge detection performance and processing efficiency. The model has high accuracy and speed in image edge recognition, which can provide certain guidance for research in the field of image edge detection

With the development of the camera, video camera, infrared and various sensors such as visual information capture device with the technology, it has become a simple question that the visual information is obtained, but now in the era of information explosion, how to capture the interest of visual information in part become an important research direction, which is one of the most fundamental problems in the digital image processing. The image processing and segmentation is the bottom and the most basic work, only the good image segmentation result can perform image analysis work. This paper proposes the extracting method of the basketball match video games based on image segmentation algorithm.

With the increasingly important role of image segmentation in the field of computed tomography (CT) image segmentation, the requirements for image segmentation technology in related industries are constantly improving. When the hardware resources can fully meet the needs of the fast and high-precision image segmentation program system, the main means of how to improve the image segmentation effect is to improve the related algorithms. Therefore, this study has proposed a combination of genetic algorithm (GA) and Great Law (OTSU) algorithm to form an image segmentation algorithm-immune genetic algorithm (IGA) algorithm. The algorithm has improved the segmentation accuracy and efficiency of the original algorithm, which is beneficial to the more accurate results of CT image segmentation. The experimental results in this study have shown that the operating efficiency of the OTSU segmentation algorithm is up to 75%. The operating efficiency of the GA algorithm is up to 78%. The operating efficiency of the IGA algorithm is up to 92%. In terms of operating efficiency, the OTSU segmentation algorithm has more advantages. In terms of segmentation accuracy, the highest accuracy rate of OTSU segmentation algorithm is 45%. The accuracy of the GA algorithm is 80%. The highest accuracy of the IGA algorithm is 97%. The IGA algorithm is more powerful in terms of operating efficiency and accuracy. Therefore, the application of the IGA algorithm to CT image segmentation is beneficial to doctors to better judge the lesions and improve the diagnosis rate.

Edge detection in range images provides rich information about the scene being observed. Many researchers have been taking advantage of this information to improve image segmentation by integrating edge detection with other segmentation techniques. This paper presents a methodology to perform edge detection in range images in order to provide a reliable and meaningful edge map, which helps to guide and improve range image segmentation by clustering techniques. The obtained edge map leads to three important improvements: (1) the definition of the ideal number of clusters to initialise the clustering algorithm; (2) the selection of suitable initial cluster centres; and (3) the successful identification of distinct regions with similar features. Experimental results that substantiate the effectiveness of this work are presented.

Resistivity imaging logging has become a direct and precise method for visualizing the structural complexities of reservoir fractures and dissolution pores. The current use of Otsu's thresholding for segmentation results in poor segmentation quality and significant noise. Accurate segmentation of sub-images containing fracture and dissolution pore targets is essential for automated structure identification and subsequent parameter calculation. This study leverages the rapid convergence and robust global optimization capabilities of the dung beetle optimizer to develop enhanced image segmentation approaches. Specifically, it introduces a refined K-means algorithm for multi-category image segmentation and an Otsu algorithm for multi-threshold image segmentation, both optimized by the dung beetle optimizer. Compared to conventional binary segmentation algorithms, this new algorithm effectively isolates noise and extracts multi-category information. Using the segmented sub-images, this paper integrates mathematical morphology techniques to compute parameters such as area, perimeter, tortuosity length, and pore shape factor for identified targets. Additionally, principal component analysis is used to derive recognition factors for fractures and dissolution pores. Applications show that this factor can identify matrix, fracture, and dissolution pore targets in complex background images. By combining parameter information of the target area, the method effectively removes false information in resistivity imaging and segments sub-images of fractures and dissolution pores, calculating fracture area ratio, dissolution pore area ratio, and total area ratio.

Image segmentation is one of the significant computational applications of the biomedical field. Automated computational methodologies are highly preferred for medical image segmentation since these techniques are immune to human perception error. Artificial intelligence (AI)-based techniques are often used for this process since they are superior to other automated techniques in terms of accuracy and convergence time period. Fuzzy systems hold a significant position among the AI techniques because of their high accuracy. Even though these systems are exceptionally accurate, the time period required for convergence is exceedingly high. In this work, a novel distance metric-based fuzzy C-means (FCM) algorithm is proposed to tackle the low-convergence-rate problem of the conventional fuzzy systems. This modified approach involves the concept of distance-based dimensionality reduction of the input vector space that substantially reduces the iterative time period of the conventional FCM algorithm. The effectiveness of the modified FCM algorithm is explored in the context of magnetic resonance brain tumor image segmentation. Experimental results show promising results for the proposed approach in terms of convergence time period and segmentation efficiency. Thus, this algorithm proves to be highly feasible for time-oriented real-time applications.

Color Image Edge Detection Based on Fuzzy Rule Based Approach