Detection of Impurity within Grain Samples by Image Analysis

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.

A novel enhanced cuckoo search algorithm for contrast enhancement of gray scale images

Region segmentation is one of the most common methods of medical image segmentation. However, it still has some disadvantages in practice: (1) Threshold choice will result in a poor performance in the image segmentation if there is little difference in the gray of an image. (2) Region-based segmentation algorithm is usually uncertain in defining the edge between the object and the background. This paper implements an improved algorithm to overcome these problems. In the algorithm, the FCM (fuzzy C-means) clustering method is used to improve the accuracy of image segmentation according to its stability. And Roberts operator is also added to compensate the deficiency in edge detection. This medical image segmentation method is a combination of region segmentation and edge segmentation, which is based on OTSU threshold segmentation, fuzzy C-means clustering and Roberts operator. Experiments show that the improved segmentation algorithm has a better performance than those traditional algorithms in the effect.

River water level detection is accomplished by sensors. However, the bending of the river channel, width changes, riverbed morphology and other factors result in errors in the water level images monitored by the sensors, which in turn affects the accuracy of small-scale feature mapping. For this reason, this paper proposes a river water level AI detection method based on image segmentation processing. The river water level image is preprocessed by mean filtering and histogram equalization to remove noise and enhance contrast. The Retinex defogging algorithm is utilized to further improve the image quality. An image segmentation model based on L1-[Formula: see text]L2 regularity is constructed, and the image segmentation is realized by solving DCA and ADMM algorithms. In the traditional YOLOv5 network structure, the meso-scale and large-scale feature mappings are fused into the small-scale feature mapping by weighted summation to enhance the spatial information, detail information and semantic information transfer capability of the small-scale feature mapping, and the water level detection is carried out based on the improved YOLOv5. The experimental results show that when the method in this paper deals with different backgrounds, light and reflection images, the segmented accurate distinction between the river water level region and other background regions has obvious boundaries. The accuracy of water level detection is always around 98%, and the recall rate is always above 96%, which is practical.

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.

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.

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.

The contrast enhancement, brightness preserving and natural look of the output image plays an important role in an infrared (IR) image enhancement process. There are several IR image enhancement algorithms that have been developed, but they may produce artificial looking images, and the images derived from these methods are not suitable for applications such as surveillance, environmental monitoring and so on. In this paper, an algorithm using new top-hat transform and multi-scale sequential toggle operator has been proposed. Firstly, a new white top-hat transform and new black top-hat transform is generated to extract the light and dark regions of the image. Then, the multi-scale sequential toggle operator is used on the extracted light and dark regions to get a sequence of regions. Ultimately, the final image is extracted from a sequence of images. To test the proposed method, the experiment is carried out on the OSU thermal bench mark database images. The enhanced image results have been compared with the popular existing methods such as Histogram Equalization (HE) and Adaptive Histogram Equalization (AHE), max-median (3 × 3) using various evaluation measures. From the results, it is observed that the proposed method works better than the existing methods.

Histogram equalisation has been widely used for image enhancement because of its simple implementation and satisfactory performance. However, traditional histogram equalisation uniformly redistributes an entire histogram or multiple piecewise histograms with the same equalisation strategy, which may produce unnatural artefacts, over‐enhancement or under‐enhancement in wide dynamic range dark image enhancement. This study proposes an adaptive extended piecewise histogram equalisation algorithm (AEPHE) for dark image enhancement. First, an original histogram is divided into a group of extended piecewise histograms. Then, an adaptive histogram equalisation, which balances intensity preservation and contrast boosting, is further developed and respectively applied to these extended piecewise histograms. The final histogram for image enhancement is produced by a weighted fusion of these equalised histograms. The experimental results indicate that AEPHE is superior to multiple state‐of‐the‐art algorithms.

IRT image segmentation and enhancement using FCM-MALO approach

In this paper, we present two new algorithms for cell image segmentation. First, we demonstrate that pixel classification-based color image segmentation in color space is equivalent to performing segmentation on grayscale image through thresholding. Based on this result, we develop a supervised learning-based two-step procedure for color cell image segmentation, where color image is first mapped to grayscale via a transform learned through supervised learning, thresholding is then performed on the grayscale image to segment objects out of background. Experimental results show that the supervised learning-based two-step procedure achieved a boundary disagreement (mean absolute distance) of 0.85 while the disagreement produced by the pixel classification-based color image segmentation method is 3.59. Second, we develop a new marker detection algorithm for watershed-based separation of overlapping or touching cells. The merit of the new algorithm is that it employs both photometric and shape information and combines the two naturally in the framework of pattern classification to provide more reliable markers. Extensive experiments show that the new marker detection algorithm achieved 0.4% and 0.2% over-segmentation and under-segmentation, respectively, while reconstruction-based method produced 4.4% and 1.1% over-segmentation and under-segmentation, respectively.

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.

This paper studied the key technology of the extraction of urban road information using high-resolution QuickBird image. And this paper discussed the road information extraction algorithms, K-mean image clustering and segmentation algorithm, lambda-schedule image merging algorithm and the construction of knowledge database using spectral and shape features, from three angles, image segmentation algorithm, image merging algorithm and specific road information extraction algorithm. Studies showed that, after the introduction of the spectral and texture information, road extraction method reached a higher area and shape consistency, and provide a valuable reference for related research in the field.

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.

Image processing is an important way to obtain information and is widely used in important fields such as military, medical and transportation. Image segmentation plays an important role in image processing. In view of the inherent complexity and correlation of the image itself, how to deal with the uncertainty in the image segmentation process is the main work to obtain a more accurate image segmentation result. We propose an image single-threshold segmentation algorithm using the maximum dependency of variable precision rough set (VPRS). The algorithm uses VPRS to represent the image, and uses the maximum dependency and particle swarm optimization to solve the optimal image segmentation threshold, which effectively handles the uncertainty in image segmentation. The experiments show that the single-threshold segmentation algorithm has certain practicability and flexibility, the segmentation effect is better than the maximum average information entropy method, and the segmentation efficiency is significantly higher than the ordinary iterative method.