To solve the problem of poor anti-noise performance of the traditional fuzzy C-means (FCM) algorithm in image segmentation, a novel two-dimensional FCM clustering algorithm for image segmentation was proposed. In this...To solve the problem of poor anti-noise performance of the traditional fuzzy C-means (FCM) algorithm in image segmentation, a novel two-dimensional FCM clustering algorithm for image segmentation was proposed. In this method, the image segmentation was converted into an optimization problem. The fitness function containing neighbor information was set up based on the gray information and the neighbor relations between the pixels described by the improved two-dimensional histogram. By making use of the global searching ability of the predator-prey particle swarm optimization, the optimal cluster center could be obtained by iterative optimization, and the image segmentation could be accomplished. The simulation results show that the segmentation accuracy ratio of the proposed method is above 99%. The proposed algorithm has strong anti-noise capability, high clustering accuracy and good segment effect, indicating that it is an effective algorithm for image segmentation.展开更多
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.展开更多
基金Project(06JJ50110) supported by the Natural Science Foundation of Hunan Province, China
文摘To solve the problem of poor anti-noise performance of the traditional fuzzy C-means (FCM) algorithm in image segmentation, a novel two-dimensional FCM clustering algorithm for image segmentation was proposed. In this method, the image segmentation was converted into an optimization problem. The fitness function containing neighbor information was set up based on the gray information and the neighbor relations between the pixels described by the improved two-dimensional histogram. By making use of the global searching ability of the predator-prey particle swarm optimization, the optimal cluster center could be obtained by iterative optimization, and the image segmentation could be accomplished. The simulation results show that the segmentation accuracy ratio of the proposed method is above 99%. The proposed algorithm has strong anti-noise capability, high clustering accuracy and good segment effect, indicating that it is an effective algorithm for image segmentation.
基金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.
