Coronavirus Disease 2019(COVID-19)is the most severe epidemic that is prevalent all over the world.How quickly and accurately identifying COVID-19 is of great significance to controlling the spread speed of the epidem...Coronavirus Disease 2019(COVID-19)is the most severe epidemic that is prevalent all over the world.How quickly and accurately identifying COVID-19 is of great significance to controlling the spread speed of the epidemic.Moreover,it is essential to accurately and rapidly identify COVID-19 lesions by analyzing Chest X-ray images.As we all know,image segmentation is a critical stage in image processing and analysis.To achieve better image segmentation results,this paper proposes to improve the multi-verse optimizer algorithm using the Rosenbrock method and diffusion mechanism named RDMVO.Then utilizes RDMVO to calculate the maximum Kapur’s entropy for multilevel threshold image segmentation.This image segmentation scheme is called RDMVO-MIS.We ran two sets of experiments to test the performance of RDMVO and RDMVO-MIS.First,RDMVO was compared with other excellent peers on IEEE CEC2017 to test the performance of RDMVO on benchmark functions.Second,the image segmentation experiment was carried out using RDMVO-MIS,and some meta-heuristic algorithms were selected as comparisons.The test image dataset includes Berkeley images and COVID-19 Chest X-ray images.The experimental results verify that RDMVO is highly competitive in benchmark functions and image segmentation experiments compared with other meta-heuristic algorithms.展开更多
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 chara...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.展开更多
Aim Researching the optimal thieshold of image segmentation. M^ethods An adaptiveimages segmentation method based on the entropy of histogram of gray-level picture and genetic. algorithm (GA) was presental. Results ...Aim Researching the optimal thieshold of image segmentation. M^ethods An adaptiveimages segmentation method based on the entropy of histogram of gray-level picture and genetic. algorithm (GA) was presental. Results In our approach, the segmentation problem was formulated as an optimization problem and the fitness of GA which can efficiently search the segmentation parameter space was regarded as the quality criterion. Conclusion The methodcan be adapted for optimal behold segmentation.展开更多
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 w...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.展开更多
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 betwee...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.展开更多
This study proposes a novel nature-inspired meta-heuristic optimizer based on the Reptile Search Algorithm combed with Salp Swarm Algorithm for image segmentation using gray-scale multi-level thresholding,called RSA-S...This study proposes a novel nature-inspired meta-heuristic optimizer based on the Reptile Search Algorithm combed with Salp Swarm Algorithm for image segmentation using gray-scale multi-level thresholding,called RSA-SSA.The proposed method introduces a better search space to find the optimal solution at each iteration.However,we proposed RSA-SSA to avoid the searching problem in the same area and determine the optimal multi-level thresholds.The obtained solutions by the proposed method are represented using the image histogram.The proposed RSA-SSA employed Otsu’s variance class function to get the best threshold values at each level.The performance measure for the proposed method is valid by detecting fitness function,structural similarity index,peak signal-to-noise ratio,and Friedman ranking test.Several benchmark images of COVID-19 validate the performance of the proposed RSA-SSA.The results showed that the proposed RSA-SSA outperformed other metaheuristics optimization algorithms published in the literature.展开更多
The image segmentation difficulties of small objects which are much smaller than their background often occur in target detection and recognition. The existing threshold segmentation methods almost fail under the circ...The image segmentation difficulties of small objects which are much smaller than their background often occur in target detection and recognition. The existing threshold segmentation methods almost fail under the circumstances. Thus, a threshold selection method is proposed on the basis of area difference between background and object and intra-class variance. The threshold selection formulae based on one-dimensional (1-D) histogram, two-dimensional (2-D) histogram vertical segmentation and 2-D histogram oblique segmentation are given. A fast recursive algorithm of threshold selection in 2-D histogram oblique segmentation is derived. The segmented images and processing time of the proposed method are given in experiments. It is compared with some fast algorithms, such as Otsu, maximum entropy and Fisher threshold selection methods. The experimental results show that the proposed method can effectively segment the small object images and has better anti-noise property.展开更多
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 Cau...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.展开更多
In order to address the problems of Coyote Optimization Algorithm in image thresholding,such as easily falling into local optimum,and slow convergence speed,a Fuzzy Hybrid Coyote Optimization Algorithm(here-inafter re...In order to address the problems of Coyote Optimization Algorithm in image thresholding,such as easily falling into local optimum,and slow convergence speed,a Fuzzy Hybrid Coyote Optimization Algorithm(here-inafter referred to as FHCOA)based on chaotic initialization and reverse learning strategy is proposed,and its effect on image thresholding is verified.Through chaotic initialization,the random number initialization mode in the standard coyote optimization algorithm(COA)is replaced by chaotic sequence.Such sequence is nonlinear and long-term unpredictable,these characteristics can effectively improve the diversity of the population in the optimization algorithm.Therefore,in this paper we first perform chaotic initialization,using chaotic sequence to replace random number initialization in standard COA.By combining the lens imaging reverse learning strategy and the optimal worst reverse learning strategy,a hybrid reverse learning strategy is then formed.In the process of algorithm traversal,the best coyote and the worst coyote in the pack are selected for reverse learning operation respectively,which prevents the algorithm falling into local optimum to a certain extent and also solves the problem of premature convergence.Based on the above improvements,the coyote optimization algorithm has better global convergence and computational robustness.The simulation results show that the algorithmhas better thresholding effect than the five commonly used optimization algorithms in image thresholding when multiple images are selected and different threshold numbers are set.展开更多
In this paper, a comprehensive energy function is used to formulate the three most popular objective functions:Kapur's, Otsu and Tsalli's functions for performing effective multilevel color image thresholding....In this paper, a comprehensive energy function is used to formulate the three most popular objective functions:Kapur's, Otsu and Tsalli's functions for performing effective multilevel color image thresholding. These new energy based objective criterions are further combined with the proficient search capability of swarm based algorithms to improve the efficiency and robustness. The proposed multilevel thresholding approach accurately determines the optimal threshold values by using generated energy curve, and acutely distinguishes different objects within the multi-channel complex images. The performance evaluation indices and experiments on different test images illustrate that Kapur's entropy aided with differential evolution and bacterial foraging optimization algorithm generates the most accurate and visually pleasing segmented images.展开更多
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 dime...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.展开更多
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,...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.展开更多
Recently, a two-dimensional （2-D） Tsallis entropy thresholding method has been proposed as a new method for image segmentation. But the computation complexity of 2-D Tsallis entropy is very large and becomes an obst...Recently, a two-dimensional （2-D） Tsallis entropy thresholding method has been proposed as a new method for image segmentation. But the computation complexity of 2-D Tsallis entropy is very large and becomes an obstacle to real time image processing systems. A fast recursive algorithm for 2-D Tsallis entropy thresholding is proposed. The key variables involved in calculating 2-D Tsallis entropy are written in recursive form. Thus, many repeating calculations are avoided and the computation complexity reduces to O（L2） from O（L4）. The effectiveness of the proposed algorithm is illustrated by experimental results.展开更多
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 textur...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.展开更多
Two dimensional(2 D) entropy method has to pay the price of time when applied to image segmentation. So the genetic algorithm is introduced to improve the computational efficiency of the 2 D entropy method. The pro...Two dimensional(2 D) entropy method has to pay the price of time when applied to image segmentation. So the genetic algorithm is introduced to improve the computational efficiency of the 2 D entropy method. The proposed method uses both the gray value of a pixel and the local average gray value of an image. At the same time, the simple genetic algorithm is improved by using better reproduction and crossover operators. Thus the proposed method makes up the 2 D entropy method’s drawback of being time consuming, and yields satisfactory segmentation results. Experimental results show that the proposed method can save computational time when it provides good quality segmentation.展开更多
基金supported by the Natural Science Foundation of Zhejiang Province(LY21F020001,LZ22F020005)National Natural Science Foundation of China(62076185,U1809209)+1 种基金Science and Technology Plan Project of Wenzhou,China(ZG2020026)We also acknowledge the respected editor and reviewers'efforts to enhance the quality of this research.
文摘Coronavirus Disease 2019(COVID-19)is the most severe epidemic that is prevalent all over the world.How quickly and accurately identifying COVID-19 is of great significance to controlling the spread speed of the epidemic.Moreover,it is essential to accurately and rapidly identify COVID-19 lesions by analyzing Chest X-ray images.As we all know,image segmentation is a critical stage in image processing and analysis.To achieve better image segmentation results,this paper proposes to improve the multi-verse optimizer algorithm using the Rosenbrock method and diffusion mechanism named RDMVO.Then utilizes RDMVO to calculate the maximum Kapur’s entropy for multilevel threshold image segmentation.This image segmentation scheme is called RDMVO-MIS.We ran two sets of experiments to test the performance of RDMVO and RDMVO-MIS.First,RDMVO was compared with other excellent peers on IEEE CEC2017 to test the performance of RDMVO on benchmark functions.Second,the image segmentation experiment was carried out using RDMVO-MIS,and some meta-heuristic algorithms were selected as comparisons.The test image dataset includes Berkeley images and COVID-19 Chest X-ray images.The experimental results verify that RDMVO is highly competitive in benchmark functions and image segmentation experiments compared with other meta-heuristic algorithms.
基金This project was supported by Science and Technology Research Emphasis Fund of Ministry of Education(204010) .
文摘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.
文摘Aim Researching the optimal thieshold of image segmentation. M^ethods An adaptiveimages segmentation method based on the entropy of histogram of gray-level picture and genetic. algorithm (GA) was presental. Results In our approach, the segmentation problem was formulated as an optimization problem and the fitness of GA which can efficiently search the segmentation parameter space was regarded as the quality criterion. Conclusion The methodcan be adapted for optimal behold segmentation.
文摘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.
文摘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.
文摘This study proposes a novel nature-inspired meta-heuristic optimizer based on the Reptile Search Algorithm combed with Salp Swarm Algorithm for image segmentation using gray-scale multi-level thresholding,called RSA-SSA.The proposed method introduces a better search space to find the optimal solution at each iteration.However,we proposed RSA-SSA to avoid the searching problem in the same area and determine the optimal multi-level thresholds.The obtained solutions by the proposed method are represented using the image histogram.The proposed RSA-SSA employed Otsu’s variance class function to get the best threshold values at each level.The performance measure for the proposed method is valid by detecting fitness function,structural similarity index,peak signal-to-noise ratio,and Friedman ranking test.Several benchmark images of COVID-19 validate the performance of the proposed RSA-SSA.The results showed that the proposed RSA-SSA outperformed other metaheuristics optimization algorithms published in the literature.
基金Sponsored by The National Natural Science Foundation of China(60872065)Science and Technology on Electro-optic Control Laboratory and Aviation Science Foundation(20105152026)State Key Laboratory Open Fund of Novel Software Technology,Nanjing University(KFKT2010B17)
文摘The image segmentation difficulties of small objects which are much smaller than their background often occur in target detection and recognition. The existing threshold segmentation methods almost fail under the circumstances. Thus, a threshold selection method is proposed on the basis of area difference between background and object and intra-class variance. The threshold selection formulae based on one-dimensional (1-D) histogram, two-dimensional (2-D) histogram vertical segmentation and 2-D histogram oblique segmentation are given. A fast recursive algorithm of threshold selection in 2-D histogram oblique segmentation is derived. The segmented images and processing time of the proposed method are given in experiments. It is compared with some fast algorithms, such as Otsu, maximum entropy and Fisher threshold selection methods. The experimental results show that the proposed method can effectively segment the small object images and has better anti-noise property.
基金This work is supported by Natural Science Foundation of Anhui under Grant 1908085MF207,KJ2020A1215,KJ2021A1251 and 2023AH052856the Excellent Youth Talent Support Foundation of Anhui underGrant gxyqZD2021142the Quality Engineering Project of Anhui under Grant 2021jyxm1117,2021kcszsfkc307,2022xsxx158 and 2022jcbs043.
文摘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.
基金This paper is supported by the National Youth Natural Science Foundation of China(61802208)the National Natural Science Foundation of China(61572261 and 61876089)+3 种基金the Natural Science Foundation of Anhui(1908085MF207,KJ2020A1215,KJ2021A1251 and KJ2021A1253)the Excellent Youth Talent Support Foundation of Anhui(gxyqZD2019097 and gxyqZD2021142)the Postdoctoral Foundation of Jiangsu(2018K009B)the Foundation of Fuyang Normal University(TDJC2021008).
文摘In order to address the problems of Coyote Optimization Algorithm in image thresholding,such as easily falling into local optimum,and slow convergence speed,a Fuzzy Hybrid Coyote Optimization Algorithm(here-inafter referred to as FHCOA)based on chaotic initialization and reverse learning strategy is proposed,and its effect on image thresholding is verified.Through chaotic initialization,the random number initialization mode in the standard coyote optimization algorithm(COA)is replaced by chaotic sequence.Such sequence is nonlinear and long-term unpredictable,these characteristics can effectively improve the diversity of the population in the optimization algorithm.Therefore,in this paper we first perform chaotic initialization,using chaotic sequence to replace random number initialization in standard COA.By combining the lens imaging reverse learning strategy and the optimal worst reverse learning strategy,a hybrid reverse learning strategy is then formed.In the process of algorithm traversal,the best coyote and the worst coyote in the pack are selected for reverse learning operation respectively,which prevents the algorithm falling into local optimum to a certain extent and also solves the problem of premature convergence.Based on the above improvements,the coyote optimization algorithm has better global convergence and computational robustness.The simulation results show that the algorithmhas better thresholding effect than the five commonly used optimization algorithms in image thresholding when multiple images are selected and different threshold numbers are set.
文摘In this paper, a comprehensive energy function is used to formulate the three most popular objective functions:Kapur's, Otsu and Tsalli's functions for performing effective multilevel color image thresholding. These new energy based objective criterions are further combined with the proficient search capability of swarm based algorithms to improve the efficiency and robustness. The proposed multilevel thresholding approach accurately determines the optimal threshold values by using generated energy curve, and acutely distinguishes different objects within the multi-channel complex images. The performance evaluation indices and experiments on different test images illustrate that Kapur's entropy aided with differential evolution and bacterial foraging optimization algorithm generates the most accurate and visually pleasing segmented images.
基金This work was supported in part by the National Natural Science Foundation of China under Grant 62171203in part by the Suzhou Key Supporting Subjects[Health Informatics(No.SZFCXK202147)]+2 种基金in part by the Changshu Science and Technology Program[No.CS202015,CS202246]in part by the Changshu City Health and Health Committee Science and Technology Program[No.csws201913]in part by the“333 High Level Personnel Training Project of Jiangsu Province”.
文摘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.
文摘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.
基金supported by the National Natural Science Foundation of China for Distinguished Young Scholars(60525303)Doctoral Foundation of Yanshan University(B243).
文摘Recently, a two-dimensional （2-D） Tsallis entropy thresholding method has been proposed as a new method for image segmentation. But the computation complexity of 2-D Tsallis entropy is very large and becomes an obstacle to real time image processing systems. A fast recursive algorithm for 2-D Tsallis entropy thresholding is proposed. The key variables involved in calculating 2-D Tsallis entropy are written in recursive form. Thus, many repeating calculations are avoided and the computation complexity reduces to O（L2） from O（L4）. The effectiveness of the proposed algorithm is illustrated by experimental results.
基金Under the auspices of National Natural Science Foundation of China (No. 30370267)Key Project of Jilin Provincial Science & Technology Department (No. 20075014)
文摘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.
文摘Two dimensional(2 D) entropy method has to pay the price of time when applied to image segmentation. So the genetic algorithm is introduced to improve the computational efficiency of the 2 D entropy method. The proposed method uses both the gray value of a pixel and the local average gray value of an image. At the same time, the simple genetic algorithm is improved by using better reproduction and crossover operators. Thus the proposed method makes up the 2 D entropy method’s drawback of being time consuming, and yields satisfactory segmentation results. Experimental results show that the proposed method can save computational time when it provides good quality segmentation.
