A New Image Segmentation Algorithm and Its Application in Lettuce Object Segmentation

The maximum fuzzy entropy algorithm is one of the effective methods of image segmentation, researchers often combine maximum fuzzy entropy and genetic algorithm (GA), but the algorithms have the defects of complexity encoding and unstable search, etc. To improve the algorithms, artificial fish school algorithm (AFSA) is introduced to more rapid optimization of maximum fuzzy entropy, this paper proposes a novel maximum fuzzy entropy image segmentation algorithm based on AFSA (AFSA-based MFEISA). Firstly, the histogram of the image and the probability of each gray level are counted up, and then the multiple threshold integer coding is designed and the maximum fuzzy entropy is converted to the objective function of coding, finally, the maximum fuzzy entropy and its corresponding thresholds are obtained by the improved AFSA and the image is segmented. The experimental results show that the proposed algorithm can achieve better segmentation effect than OTSU algorithm and maximum entropy algorithms, at the same time, it not only has more simple and effective coding scheme and better segmentation effect than the algorithms based on fuzzy entropy and GA, etc, but also it shows better stability and convergence.

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.

This paper introduces the definition of maximum entropy,the principle of onedimensional and 2-D maximum entropy.This paper solves the image segmentation problem by using the maximum entropy algorithm.The image gray value is divided into two regions of the background and the object.The key problem associated with this method is to find the optimal parameter extracting objects from background, the proposed method is used to segment image and ideal segmentation results can be obtained with less computation cost.Experimental simulation shows that the algorithm has a higher accuracy while preserving the edge infomation,and maximum entropy has been proven to be an efficient method for image segmentation.

The topic of colour image segmentation has been and still is a hot issue in areas such as computer vision and image processing because of its wide range of practical applications. The urge has led to the development of numerous colour image segmentation algorithms to extract salient objects from colour images. However, because of the diverse imaging conditions in varying application domains, accuracy and robustness of several state-of-the-art colour image segmentation algorithms still leave room for further improvement. This dissertation reports on the development of a new image segmentation algorithm based on perceptual colour difference saliency along with binary morphological operations. The algorithm consists of four essential processing stages which are colour image transformation, luminance image enhancement, salient pixel computation and image artefact filtering. The input RGB colour image is first transformed into the CIE L*a*b colour image to achieve perceptual saliency and obtain the best possible calibration of the transformation model. The luminance channel of the transformed colour image is then enhanced using an adaptive gamma correction function to alleviate the adverse effects of illumination variation, low contrast and improve the image quality significantly. The salient objects in the input colour image are then determined by calculating saliency at each pixel in order to preserve spatial information. The computed saliency map is then filtered using the morphological operations to eliminate undesired factors that are likely present in the colour image. A series of experiments was performed to evaluate the effectiveness of the new perceptual colour difference saliency algorithm for colour image segmentation. This was accomplished by testing the algorithm on a large set of a hundred and ninety images acquired from four distinct publicly available benchmarks corporal. The accuracy of the developed colour image segmentation algorithm was quantified using four widely used statistical evaluation metrics in terms of precision, F-measure, error and Dice. Promising results were obtained despite the fact that the experimental images were selected from four different corporal and in varying imaging conditions. The results have indeed demonstrated that the performance of the newly developed colour image segmentation algorithm is consistent with an improved performance compared to a number of other saliency and non- saliency state-of-the-art image segmentation algorithms.

Segmentation is a low-level processing aimed at the partition of an image in disjoint regions, each one homogeneous with respect to some properties like intensity, texture, shape, etc. Such a task is needed in many high-level processing and applications in such diverse fields as remote-sensing, medical imaging, video coding, and industrial automation, just to name a few. In this work of thesis, we first deal with the problem of color based image segmentation, that is based on some form of homogeneity in the color/spectral properties of the image, and then move to the more complex task of texture based segmentation, where the aim is to recognize complex structures in the image which are typically non homogeneous in terms of spectral properties. Concerning color based segmentation, we focus on a specific class of Markov Random Field (MRF) probability models, namely the Tree-Structured Markov Random Fields (TS-MRF), recently proposed to provide a hierarchical multiscale description of images. Based on such a model, the unsupervised image segmentation is carried out by means of a sequence of nested class splits, where each class is modeled as a local binary MRF. As a first contribution, we first extend the model to generic tree structures removing the unnecessary binary constraint, and then devise a new TS-MRF unsupervised segmentation technique which improves upon the original algorithm by selecting a better tree structure and eliminating spurious classes. Such results are obtained by using the Mean-Shift procedure to estimate the number of pdf modes at each node, and to obtain a more reliable initial clustering for subsequent MRF optimization. To this end, we devise a new reliable and fast clustering algorithm based on the Mean-Shift technique, which makes use of a variable-bandwidth strategy based on the k-Nearest Neighbors (k-NN) technique, and is implemented with a speed-up strategy that cuts significantly the computational complexity. Experimental results on synthetic data and real life images from the remote sensing domain prove the potential of the proposed method. Turning to texture based segmentation, we present a novel multiscale texture model, and a related algorithm for the unsupervised segmentation of color images. Elementary textures are characterized by their spatial interactions with neighboring regions along selected directions. Such interactions are modeled in turn by means of a set of Markov chains, one for each direction, whose parameters are collected in a feature vector that synthetically describes the texture. Based on the feature vectors, the texture are then recursively merged, giving rise to larger and more complex textures, which appear at different scales of observation: accordingly, the model is named Hierarchical Multiple Markov Chain (H-MMC). The Texture Fragmentation and Reconstruction (TFR) algorithm, addresses the unsupervised segmentation problem based on the H-MMC model. The ``fragmentation'' step allows one to find the elementary textures of the model, while the ``reconstruction'' step defines the hierarchical image segmentation based on a probabilistic measure (texture score) which takes into account both region scale and inter-region interactions. The performance of the proposed method was assessed through the Prague segmentation benchmark, based on mosaics of real natural textures, and also tested on real-world natural images from the Berkeley dataset. Finally, an application of the TFR algorithm for the unsupervised segmentation of multiresolution remotely sensed images is proposed, based on the significant presence of textural content in last generation high-resolution satellite images. The obtained results further assess the potential of the proposed method for such real life applications.

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.

Summary form only given, as follows. Building on our image restoration and segmentation algorithms developed in Pollak et al. (2000), we present a very simple nonlinear diffusion equation and show its utility both for image segmentation and for the detection of abrupt changes in 1-D. We show that it may be interpreted as a variant of the Perona-Malik (1990) equation, as the steepest descent equation for the total variation (Bouman and Sauer 1991, Rudin et al. 1992), and-in 1-D-as a solver of a simple version of the Mumford-Shah (1985) problem. The analysis of our equation in 1-D reveals it to be an exact solver of certain maximum likelihood detection/estimation problems. The major advantage over other methods to solve these problems is O(N log N) computational complexity in one spatial dimension. Finally, we show our method to be a robust estimator (in the spirit of H-infinity estimation (Nagpal and Khargonekar 1991)) for a restricted class of 1-D problems. Experiments suggest that the 2-D version of our algorithm retains robustness properties of the 1-D version. Moreover, if only a binary segmentation is required, the computational complexity of our 2-D algorithm is still O(N log N). A remaining challenge is to extend our probabilistic analysis of the 1-D algorithm to 2-D, designing fast and optimal image segmentation algorithms.

Image segmentation is the process of subdividing a digital image into its constitute regions such that pixels belong to the same region will be same based on some image property (such as grayscale value, color, texture) and pixels in the different group will be different based on the same image property. Till date, different researchers have taken image segmentation problem from a different point of view and developed several image segmentation algorithms. This paper is going to address an optimization-based approach in color image segmentation where optimized threshold value is chosen by maximizing the Kapur’s Entropy Function.

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.

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.

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.

This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.

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.

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.