Multi-Level Image Segmentation Combining Chaotic Initialized Chimp Optimization Algorithm and Cauchy Mutation

To enhance the diversity and distribution uniformity of initial population,as well as to avoid local extrema in the Chimp Optimization Algorithm(CHOA),this paper improves the CHOA based on chaos initialization and Cauchy mutation.First,Sin chaos is introduced to improve the random population initialization scheme of the CHOA,which not only guarantees the diversity of the population,but also enhances the distribution uniformity of the initial population.Next,Cauchy mutation is added to optimize the global search ability of the CHOA in the process of position(threshold)updating to avoid the CHOA falling into local optima.Finally,an improved CHOA was formed through the combination of chaos initialization and Cauchy mutation(CICMCHOA),then taking fuzzy Kapur as the objective function,this paper applied CICMCHOA to natural and medical image segmentation,and compared it with four algorithms,including the improved Satin Bowerbird optimizer(ISBO),Cuckoo Search(ICS),etc.The experimental results deriving from visual and specific indicators demonstrate that CICMCHOA delivers superior segmentation effects in image segmentation.

Foreign Fiber Image Segmentation Based on Maximum Entropy and Genetic Algorithm

In machine-vision-based systems for detecting foreign fibers, due to the background of the cotton layer has the absolute advantage in the whole image, while the foreign fiber only account for a very small part, and what’s more, the brightness and contrast of the image are all poor. Using the traditional image segmentation method, the segmentation results are very poor. By adopting the maximum entropy and genetic algorithm, the maximum entropy function was used as the fitness function of genetic algorithm. Through continuous optimization, the optimal segmentation threshold is determined. Experimental results prove that the image segmentation of this paper not only fast and accurate, but also has strong adaptability.

Alternative Fuzzy Cluster Segmentation of Remote Sensing Images Based on Adaptive Genetic Algorithm

Remote sensing image segmentation is the basis of image understanding and analysis. However,the precision and the speed of segmentation can not meet the need of image analysis,due to strong uncertainty and rich texture details of remote sensing images. We proposed a new segmentation method based on Adaptive Genetic Algorithm(AGA) and Alternative Fuzzy C-Means(AFCM) . Segmentation thresholds were identified by AGA. Then the image was segmented by AFCM. The results indicate that the precision and the speed of segmentation have been greatly increased,and the accuracy of threshold selection is much higher compared with traditional Otsu and Fuzzy C-Means(FCM) segmentation methods. The segmentation results also show that multi-thresholds segmentation has been achieved by combining AGA with AFCM.

An Improved Soft Subspace Clustering Algorithm for Brain MR Image Segmentation

In recent years,the soft subspace clustering algorithm has shown good results for high-dimensional data,which can assign different weights to each cluster class and use weights to measure the contribution of each dimension in various features.The enhanced soft subspace clustering algorithm combines interclass separation and intraclass tightness information,which has strong results for image segmentation,but the clustering algorithm is vulnerable to noisy data and dependence on the initialized clustering center.However,the clustering algorithmis susceptible to the influence of noisydata and reliance on initializedclustering centers andfalls into a local optimum;the clustering effect is poor for brain MR images with unclear boundaries and noise effects.To address these problems,a soft subspace clustering algorithm for brain MR images based on genetic algorithm optimization is proposed,which combines the generalized noise technique,relaxes the equational weight constraint in the objective function as the boundary constraint,and uses a genetic algorithm as a method to optimize the initialized clustering center.The genetic algorithm finds the best clustering center and reduces the algorithm’s dependence on the initial clustering center.The experiment verifies the robustness of the algorithm,as well as the noise immunity in various ways and shows good results on the common dataset and the brain MR images provided by the Changshu First People’s Hospital with specific high accuracy for clinical medicine.

Elitist Reconstruction Genetic Algorithm Based on Markov Random Field for Magnetic Resonance Image Segmentation

In this paper, elitist reconstruction genetic algorithm （ERGA） based on Markov random field （MRF） is introduced for image segmentation. In this algorithm, a population of possible solutions is maintained at every generation, and for each solution a fitness value is calculated according to a fitness function, which is constructed based on the MRF potential function according to Metropolis function and Bayesian framework. After the improved selection, crossover and mutation, an elitist individual is restructured based on the strategy of restructuring elitist. This procedure is processed to select the location that denotes the largest MRF potential function value in the same location of all individuals. The algorithm is stopped when the change of fitness functions between two sequent generations is less than a specified value. Experiments show that the performance of the hybrid algorithm is better than that of some traditional algorithms.

Application of U-Net and Optimized Clustering in Medical Image Segmentation:A Review

As a mainstream research direction in the field of image segmentation,medical image segmentation plays a key role in the quantification of lesions,three-dimensional reconstruction,region of interest extraction and so on.Compared with natural images,medical images have a variety of modes.Besides,the emphasis of information which is conveyed by images of different modes is quite different.Because it is time-consuming and inefficient to manually segment medical images only by professional and experienced doctors.Therefore,large quantities of automated medical image segmentation methods have been developed.However,until now,researchers have not developed a universal method for all types of medical image segmentation.This paper reviews the literature on segmentation techniques that have produced major breakthroughs in recent years.Among the large quantities of medical image segmentation methods,this paper mainly discusses two categories of medical image segmentation methods.One is the improved strategies based on traditional clustering method.The other is the research progress of the improved image segmentation network structure model based on U-Net.The power of technology proves that the performance of the deep learning-based method is significantly better than that of the traditional method.This paper discussed both advantages and disadvantages of different algorithms and detailed how these methods can be used for the segmentation of lesions or other organs and tissues,as well as possible technical trends for future work.

Medical ultrasound image segmentation using genetic active contour

Image segmentation is one of the earliest and most important stages of image processing and plays an important role in both qualitative and quantitative analysis of medical ultrasound images but ultrasound images have low level of contrast and are corrupted with strong speckle noise. Due to these effects, segmentation of ultrasound images is very challenging and traditional image segmentation methods may not be leads to satisfactory results. The active contour method has been one of the widely used techniques for image segmentation;however, due to low quality of ultrasound images, it has encountered difficulties. In this paper, we presented a segmental method combined genetic algorithm and active contour with an energy minimization procedure based on genetic algorithms. This method have been proposed to overcome some limits of classical active contours, as con-tour initialization and local minima (speckle noise), and have been successfully applied on medical ultrasound images. Experimental result on medical ultrasound image show that our presented method only can correctly segment the circular tissue’s on ultra-sound images.

Technique of Error Concealment for Block-Based Image Coding Using Genetic Algorithm

Since real world communication channels are not error free, the coded data transmitted on them may be corrupted, and block based image coding systems are vulnerable to transmission impairment. So the best neighborhood match method using genetic algorithm is used to conceal the error blocks. Experimental results show that the searching space can be greatly reduced by using genetic algorithm compared with exhaustive searching method, and good image quality is achieved. The peak signal noise ratios(PSNRs) of the restored images are increased greatly.

Segmentation algorithm of complex ore images based on templates transformation and reconstruction

Lots of noises and heterogeneous objects with various sizes coexist in a complex image,such as an ore image;the classical image thresholding method cannot effectively distinguish between ores.To segment ore objects with various sizes simultaneously,two adaptive windows in the image were chosen for each pixel;the gray value of windows was calculated by Otsu＇s threshold method.To extract the object skeleton,the definition principle of distance transformation templates was proposed.The ores linked together in a binary image were separated by distance transformation and gray reconstruction.The seed region of each object was picked up from the local maximum gray region of the reconstruction image.Starting from these seed regions,the watershed method was used to segment ore object effectively.The proposed algorithm marks and segments most objects from complex images precisely.

Fingerprint Directional Image Partitioning Based on Genetic Algorithm

In this work, we introduce a method of fingerprint directional image partitioning based on GA. According to the fingerprint topology, A set of dynamic partition masks and a cost estimating function are designed to guide the partitioning procedure. Finding best fitted mask application is converted to an functional optimizing problem, and we give out a GA solution to the problem. At last, we discuss the application of the proposed method in Fingerprint Classification.

Image Segmentation of Brain MR Images Using Otsu’s Based Hybrid WCMFO Algorithm

In this study,a novel hybrid Water Cycle Moth-Flame Optimization(WCMFO)algorithm is proposed for multilevel thresholding brain image segmentation in Magnetic Resonance(MR)image slices.WCMFO constitutes a hybrid between the two techniques,comprising the water cycle and moth-flame optimization algorithms.The optimal thresholds are obtained by maximizing the between class variance(Otsu’s function)of the image.To test the performance of threshold searching process,the proposed algorithm has been evaluated on standard benchmark of ten axial T2-weighted brain MR images for image segmentation.The experimental outcomes infer that it produces better optimal threshold values at a greater and quicker convergence rate.In contrast to other state-of-the-art methods,namely Adaptive Wind Driven Optimization(AWDO),Adaptive Bacterial Foraging(ABF)and Particle Swarm Optimization(PSO),the proposed algorithm has been found to be better at producing the best objective function,Peak Signal-to-Noise Ratio(PSNR),Standard Deviation(STD)and lower computational time values.Further,it was observed thatthe segmented image gives greater detail when the threshold level increases.Moreover,the statistical test result confirms that the best and mean values are almost zero and the average difference between best and mean value 1.86 is obtained through the 30 executions of the proposed algorithm.Thus,these images will lead to better segments of gray,white and cerebrospinal fluid that enable better clinical choices and diagnoses using a proposed algorithm.

An Improved Jellyfish Algorithm for Multilevel Thresholding of Magnetic Resonance Brain Image Segmentations

Image segmentation is vital when analyzing medical images,especially magnetic resonance(MR)images of the brain.Recently,several image segmentation techniques based on multilevel thresholding have been proposed for medical image segmentation;however,the algorithms become trapped in local minima and have low convergence speeds,particularly as the number of threshold levels increases.Consequently,in this paper,we develop a new multilevel thresholding image segmentation technique based on the jellyfish search algorithm(JSA)(an optimizer).We modify the JSA to prevent descents into local minima,and we accelerate convergence toward optimal solutions.The improvement is achieved by applying two novel strategies:Rankingbased updating and an adaptive method.Ranking-based updating is used to replace undesirable solutions with other solutions generated by a novel updating scheme that improves the qualities of the removed solutions.We develop a new adaptive strategy to exploit the ability of the JSA to find a best-so-far solution;we allow a small amount of exploration to avoid descents into local minima.The two strategies are integrated with the JSA to produce an improved JSA(IJSA)that optimally thresholds brain MR images.To compare the performances of the IJSA and JSA,seven brain MR images were segmented at threshold levels of 3,4,5,6,7,8,10,15,20,25,and 30.IJSA was compared with several other recent image segmentation algorithms,including the improved and standard marine predator algorithms,the modified salp and standard salp swarm algorithms,the equilibrium optimizer,and the standard JSA in terms of fitness,the Structured Similarity Index Metric(SSIM),the peak signal-to-noise ratio(PSNR),the standard deviation(SD),and the Features Similarity Index Metric(FSIM).The experimental outcomes and the Wilcoxon rank-sum test demonstrate the superiority of the proposed algorithm in terms of the FSIM,the PSNR,the objective values,and the SD;in terms of the SSIM,IJSA was competitive with the others.

Classification of hyperspectral remote sensing images based on simulated annealing genetic algorithm and multiple instance learning

A hybrid feature selection and classification strategy was proposed based on the simulated annealing genetic algonthrn and multiple instance learning （MIL）. The band selection method was proposed from subspace decomposition, which combines the simulated annealing algorithm with the genetic algorithm in choosing different cross-over and mutation probabilities, as well as mutation individuals. Then MIL was combined with image segmentation, clustering and support vector machine algorithms to classify hyperspectral image. The experimental results show that this proposed method can get high classification accuracy of 93.13% at small training samples and the weaknesses of the conventional methods are overcome.

Evolving Neural Network Using Variable String Genetic Algorithm for Color Infrared Aerial Image Classification

Coastal wetlands are characterized by complex patterns both in their geomorphlc and ecological teatures. Besides field observations, it is necessary to analyze the land cover of wetlands through the color infrared （CIR） aerial photography or remote sensing image. In this paper, we designed an evolving neural network classifier using variable string genetic algorithm （VGA） for the land cover classification of CIR aerial image. With the VGA, the classifier that we designed is able to evolve automatically the appropriate number of hidden nodes for modeling the neural network topology optimally and to find a near-optimal set of connection weights globally. Then, with backpropagation algorithm （BP）, it can find the best connection weights. The VGA-BP classifier, which is derived from hybrid algorithms mentioned above, is demonstrated on CIR images classification effectively. Compared with standard classifiers, such as Bayes maximum-likelihood classifier, VGA classifier and BP-MLP （multi-layer perception） classifier, it has shown that the VGA-BP classifier can have better performance on highly resolution land cover classification.

Fast interactive segmentation algorithm of image sequences based on relative fuzzy connectedness

A fast interactive segmentation algorithm of image-sequences based on relative fuzzy connectedness is presented. In comparison with the original algorithm, the proposed one, with the same accuracy, accelerates the segmentation speed by three times for single image. Meanwhile, this fast segmentation algorithm is extended from single object to multiple objects and from single-image to image-sequences. Thus the segmentation of multiple objects from complex hackground and batch segmentation of image-sequences can be achieved. In addition, a post-processing scheme is incorporated in this algorithm, which extracts smooth edge with one-pixel-width for each segmented object. The experimental results illustrate that the proposed algorithm can obtain the object regions of interest from medical image or image-sequences as well as man-made images quickly and reliably with only a little interaction.

Image Segmentation Using an Improved Watershed Algorithm

As watershed algorithm suffers from over-segmentation problem, this paper presented an efficient method to resolve this problem. First, pre-process of the image using median filter is made to reduce the effect of noise. Second, watershed algorithm is employed to provide initial regions. Third, regions are merged according to the information between the region and boundary. In the merger processing based on the region information, an adaptive threshold of the difference between the neighboring regions is used as the region merge criteria, which is based on the human visual character. In the merger processing on the boundary information, the gradient is used to judge the true boundary of the image to avoid merging the foreground with the background regions. Finally, post-process to the regions using mathematical morphology open and close filter is done to smooth object boundaries. The experimental results show that this method is very efficient.

2-D mini mumfuzzy entropy method of image thresholding based on genetic algorithm

A new image thresholding method is introduced, which is based on 2-D histgram and minimizing the measures of fuzziness of an input image. A new definition of fuzzy membership function is proposed, it denotes the characteristic relationship between the gray level of each pixel and the average value of its neighborhood. When the threshold is not located at the obvious and deep valley of the histgram, genetic algorithm is devoted to the problem of selecting the appropriate threshold value. The experimental results indicate that the proposed method has good performance.

Two-dimensional cross entropy multi-threshold image segmentation based on improved BBO algorithm

In order to improve the global search ability of biogeography-based optimization(BBO)algorithm in multi-threshold image segmentation,a multi-threshold image segmentation based on improved BBO algorithm is proposed.When using BBO algorithm to optimize threshold,firstly,the elitist selection operator is used to retain the optimal set of solutions.Secondly,a migration strategy based on fusion of good solution and pending solution is introduced to reduce premature convergence and invalid migration of traditional migration operations.Thirdly,to reduce the blindness of traditional mutation operations,a mutation operation through binary computation is created.Then,it is applied to the multi-threshold image segmentation of two-dimensional cross entropy.Finally,this method is used to segment the typical image and compared with two-dimensional multi-threshold segmentation based on particle swarm optimization algorithm and the two-dimensional multi-threshold image segmentation based on standard BBO algorithm.The experimental results show that the method has good convergence stability,it can effectively shorten the time of iteration,and the optimization performance is better than the standard BBO algorithm.

Adaptive template filter method for image processing based on immune genetic algorithm

To preserve the original signal as much as possible and filter random noises as many as possible in image processing,a threshold optimization-based adaptive template filtering algorithm was proposed.Unlike conventional filters whose template shapes and coefficients were fixed,multi-templates were defined and the right template for each pixel could be matched adaptively based on local image characteristics in the proposed method.The superiority of this method was verified by former results concerning the matching experiment of actual image with the comparison of conventional filtering methods.The adaptive search ability of immune genetic algorithm with the elitist selection and elitist crossover(IGAE) was used to optimize threshold t of the transformation function,and then combined with wavelet transformation to estimate noise variance.Multi-experiments were performed to test the validity of IGAE.The results show that the filtered result of t obtained by IGAE is superior to that of t obtained by other methods,IGAE has a faster convergence speed and a higher computational efficiency compared with the canonical genetic algorithm with the elitism and the immune algorithm with the information entropy and elitism by multi-experiments.

A RBF classification method of remote sensing image based on genetic algorithm

The remote sensing image classification has stimulated considerable interest as an effective method for better retrieving information from the rapidly increasing large volume, complex and distributed satellite remote imaging data of large scale and cross-time, due to the increase of remote image quantities and image resolutions. In the paper, the genetic algorithms were employed to solve the weighting of the radial basis faction networks in order to improve the precision of remote sensing image classification. The remote sensing image classification was also introduced for the GIS spatial analysis and the spatial online analytical processing (OLAP), and the resulted effectiveness was demonstrated in the analysis of land utilization variation of Daqing city.