Search

Multilevel thresholding segmentation of color images plays an important role in many fields. The pivotal procedure of this technique is determining the specific threshold of the images. In this paper, an improved mayfly algorithm (IMA)-based color image segmentation method is proposed. Tent mapping initializes the female mayfly population to increase population diversity. Lévy flight is introduced in the wedding dance iterative formulation to make IMA jump from the local optimal solution quickly. Two nonlinear coefficients were designed to speed up the convergence of the algorithm. To better verify the effectiveness, eight benchmark functions are used to test the performance of IMA. The average fitness value, standard deviation, and Wilcoxon rank sum test are used as evaluation metrics. The results show that IMA outperforms the comparison algorithm in terms of search accuracy. Furthermore, Kapur entropy is used as the fitness function of IMA to determine the segmentation threshold. 10 Berkeley images are segmented. The best fitness value, peak signal-to-noise ratio (PSNR), structural similarity index (SSIM), and other indexes are used to evaluate the effect of segmented images. The results show that the IMA segmentation method improves the segmentation accuracy of color images and obtains higher quality segmented images. [ABSTRACT FROM AUTHOR]

Superpixel-based segmentation has been widely used as a primary prepossessing step to simplify the subsequent image processing tasks. Since determining the number of clusters is subjective and varies based on the type of image, the segmentation algorithm may provide over-segmented or under-segmented superpixels. This paper proposes an image segmentation method to improve the SLIC superpixel by region merging. It aims to improve the segmentation accuracy without defining a precise number of superls. The color difference between superpixels is employed as a homogeneity criterion for the merging process. The Berkeley dataset is used with different quantitative performance metrics to evaluate the proposed model's performance. Results obtained from probabilistic rand index (PRI), boundary recall, and under-segmentation error proved the ability of the proposed algorithm to provide comparable segmentation with a reduced number of clusters. [ABSTRACT FROM AUTHOR]

The data explosion caused by the Internet and its applications has given researchers immense scope for data analysis. A large amount of data is available in form of images. Image processing is required for better understandability of an image. Various image processing steps are available for improving the image in different application areas. Various applications like medical imaging, face recognition, biometric security, and traffic surveillance, etc. depend only on image and its analysis. This analysis in several applications is highly dependent on the outcome of image segmentation. This paper focuses on good segmentation through multi-level thresholding. In this research, the algorithm includes two modules related to Entropy and variance. The first module is concerned with the modified firefly algorithm (FA) with Kapur's, Tsallis, and Fuzzy Entropy. FA is used to optimize fuzzy parameters for obtaining optimal thresholds. The second module is derived from the principle of variance between two classes known as between variance or inter-cluster variance. The opposition-based the learning method is used for initializing the population of candidate solutions and levying flight and local search is implemented with FA. The various experiments have been performed on Berkeley and benchmark images with distinct threshold (i.e. 2, 3, 4, 5) values. The proposed algorithm has been estimated and compared with known metaheuristic optimization methods like particle swarm optimization (PSO) and electromagnetism optimization (EMO). The results have been assessed quantitatively and qualitatively by using parameters like Peak signal-to-noise ratio (PSNR), structured similarity index metric (SSIM), objective function values, and convergence curve. The algorithm proposed observed better experiment results than PSO, EMO in terms of persistency and quality. [ABSTRACT FROM AUTHOR]

In recent decades, image segmentation has aroused great interest of many researchers, and has become an important part of machine learning, pattern recognition, and computer vision. Among many methods of image segmentation, fuzzy C‐means (FCM) algorithm is undoubtedly a milestone in unsupervised method. With the further study of FCM, various different kinds of FCM algorithms are put forward to deal with the specific problems in image segmentation. Because there exist uncertainties in different regions of the image and similarity in the same region, reducing the uncertainty is still the main problem in image segmentation. Considering that Pythagorean fuzzy set (PFS) is a powerful tool to deal with uncertainty, in this paper, we use PFS to describe the uncertainty of image segmentation, including introducing fuzzification and defuzzification process and Pythagorean fuzzy element to describe the membership degree of pixel, combine the neighborhood information with weights and Pythagorean fuzzy distance, and propose Pythagorean fuzzy C‐means (PFCM) algorithm. Finally, we apply PFCM algorithm in image segmentation, such as different size images and Berkeley Segmentation Data Set to illustrate the effectiveness and applicability of our proposed algorithm. Meanwhile, we do comparison analysis between PFCM, fully convolution network and Deep‐image‐Prior networks, these results show that our proposed PFCM has good intuition and effectiveness. [ABSTRACT FROM AUTHOR]

• In spite of its interesting results, Mean shift (MS) has a computational cost which is prohibited for several applications. • In this paper, a new competitive segmentation algorithm for grayscale images is introduced. • To reduce the computational cost, MS is operated using a representative set of elements with a very limited number of points. • Once obtained the MS results, they are generalized to include the not involved data. • Experimental results confirm that the proposed scheme presents better performance. Multi-feature segmentation has demonstrated its superiority against one-dimensional feature approaches based on only grayscale information. Mean shift (MS) is an algorithm that has been used commonly for multi-feature segmentation. In spite of its interesting results, MS maintains a computational cost that is prohibitive for segmentation scenarios where the feature map consists of multi-dimensional features. In this paper, a new competitive segmentation algorithm for grayscale images is introduced. The proposed approach considers a two-dimensional feature map that includes the grayscale value and the local variance for each pixel in the image. To reduce the computational cost, the Mean shift (MS) algorithm is modified to operate with a very limited number of points from all available data. Under such conditions, two sets of elements are differentiated: involved data (the reduced dataset considered in the MS operation) and not involved data (the rest of the available data). Different from the classical MS, which employs Gaussian functions, in our approach, the process of estimating the feature map is carried out using a more accurate approach such as the Epanechnikov kernel function. Once the MS results are obtained, they are generalized to include the not involved data. Therefore, each unused element is assigned to the same cluster of the closest used data. Finally, clusters with the fewest elements are fused with other neighboring clusters. The proposed segmentation method has been compared with other state-of-art algorithms considering the full number of images from the Berkeley dataset. Experimental results confirm that the proposed scheme produces segmented images with a 50% better quality of visual perception approximately two times (≈ 1.8 − 2) faster than its competitors. [ABSTRACT FROM AUTHOR]

Image segmentation is one of the key steps of target recognition. However, the accuracy of image segmentation is still challenging. To solve this problem, an image segmentation algorithm combining Pulse Coupled Neural Network (PCNN) and adaptive glowworm algorithm is proposed. The algorithm retains the advantages of the glowworm algorithm. Introduce the adaptive moving step size and the population optimal value as adjustment factors. Enhance the ability to solve the global optimal value of the fitness function. Take the weighted sum of the cross entropy, information entropy and compactness of the image as the fitness function of the glowworm algorithm. This function can ensure the visual effect of image segmentation and limit the running time while maintaining as much as possible the original information of the image. In order to intuitively evaluate the effect of the segmented image, use a number of segmentation evaluation parameters to quantify the image. Maintain the diversity of image features and improving the accuracy of image segmentation. Experimental results show that compared with other algorithms, the segmented image obtained by this algorithm has better visual effect and the segmentation performance has the best comprehensive performance. For the seven gray-scale images in the Berkeley segmentation dataset, the segmentation effect is improved by 10.85% compared with two-dimensional entropies(TDE), 9.22% compared with Genetic Algorithm(GA), and 22.58% compared with AUTO algorithm. [ABSTRACT FROM AUTHOR]

Multilevel thresholding for image segmentation is one of the crucial techniques in image processing. Even though numerous methods have been proposed in literature, it is still a challenge for the existing methods to produce steady satisfactory thresholds at manageable computational cost in segmenting images with various unknown properties. In this paper, a non-revisiting quantum-behaved particle swarm optimization (NrQPSO) algorithm is proposed to find the optimal multilevel thresholds for gray-level images. The proposed NrQPSO uses the non-revisiting scheme to avoid the re-evaluation of the evaluated solution candidates. To reduce the unnecessary computation cost, the NrQPSO provides an automatic stopping mechanism which is capable of gauging the progress of exploration and stops the algorithm rationally in a natural manner. For further improving the computation efficiency, the NrQPSO employs a meticulous solution search method to overcome the drawback of the existing QPSO algorithms using the original search methods. Performance of the NrQPSO is tested on the Berkeley segmentation data set. The experimental results have demonstrated that the NrQPSO can outperform the other state-of-the-art population-based thresholding methods in terms of efficiency, effectiveness and robustness; thus, the NrQPSO can be applied in real-time massive image processing. [ABSTRACT FROM AUTHOR]

Superixel is one of the most efficient of the image segmentation approaches that are widely used for different applications. In this paper, we developed an image segmentation based on superpixel and an automatic clustering using q-Generalized Pareto distribution under linear normalization (q-GPDL), called ASCQPHGS. The proposed method uses the superpixel algorithm to segment the given image, then the Density Peaks clustering (DPC) is employed to the results obtained from the superpixel algorithm to produce a decision graph. The Hunger games search (HGS) algorithm is employed as a clustering method to segment the image. The proposed method is evaluated using two different datasets, collected form Berkeley segmentation dataset and benchmark (BSDS500) and standford background dataset (SBD). More so, the proposed method is compared to several methods to verify its performance and efficiency. Overall, the proposed method showed significant performance and it outperformed all compared methods using well-known performance metrics. [ABSTRACT FROM AUTHOR]

• We present PSCT new data-driven sampling method based clustering algorithms. • PSCT output can be used for image segmentation and image reconstruction. • Image reconstructed with PSCT show similar performance than original images in our tests. In this paper, we describe Pixel Sampling Clustering Technique (PSCT), a data-driven sampling procedure used to reduce pixel sets. We view the pixels in an image as a high redundancy 3D space. We also refer to this space as our color model. Our method aims to retain a relevant sample of the data so it can act as a new smaller, hence more efficient, color model. PSCT uses a pair of fast density-based clustering algorithms in tandem. First, it applies Birch and then DBSCAN to keep the most densely represented colors. We cluster the resulting color model and use the labels to segment images. We also complement the sampling method with a refinement algorithm intended to improve color representation. In our paper, we show how to reconstruct images using our reduced color model. We also show that reconstructed images have enough information to perform image related learning tasks with almost the same accuracy than the original images but with only a small fraction of the data. We test our sampling method in three image related supervised and unsupervised tasks and compare them with state-of-the-art methods. For our experiments, we use two image datasets: MIT's Vision Texture Dataset and Berkeley's BSD500. [ABSTRACT FROM AUTHOR]

The fuzzy c-means (FCM) algorithm is a popular method for data clustering and image segmentation. However, the main problem of this algorithm is that it is very sensitive to the initialization of primary clusters, so it may not perform well in segmenting complex images. Another problem with the FCM is the equal importance of the image features used during the segmentation process, which causes unstable performance on different images. In this paper, we propose an FCM-based color image segmentation approach, termed CGFFCM, applying an automatic cluster weighting scheme to reduce the sensitivity to the initialization, and a group-local feature weighting strategy to better image segmentation. Also, we combine the proposed clustering algorithm with the Imperialist Competitive Algorithm (ICA) to optimize the feature weighting process. In addition, we apply an efficient combination of image features to increase the segmentation quality. The performance of CGFFCM is evaluated and compared with state-of-the-art methods (such as SMKIFC (semi-supervised surrogate-assisted multi-objective kernel intuitionistic fuzzy clustering), and A-PSO-IT2IFCM (alternate particle swarm optimization based adaptive interval type-2 intuitionistic FCM clustering algorithm)) using the Berkeley benchmark dataset. The results obtained by CGFFCM are 95%, 79%, and 91%, in terms of average Accuracy , NMI , and F-score metrics, respectively, which all are better than the competitors. The implementation source code of CGFFCM is made publicly available at https://github.com/Amin-Golzari-Oskouei/CGFFCM. • A cluster weighting scheme to reduce the sensitivity of the image segmentation to the selection of initial centers. • A group-local feature weighting strategy to measure the importance and weights of image features precisely. • An automatic way to calculate the cluster and feature weights simultaneously during the learning process. • A combination of ICA meta-heuristic algorithm with proposed clustering algorithm to find the optimal group feature weights. [ABSTRACT FROM AUTHOR]