Search

Aquila Optimization (AO) is a recently proposed meta-heuristic algorithm, which has been proved to be more competitive than other meta-heuristic algorithms in function optimization and practical applications. However, when solving more complex optimization problems, AO still has the shortcomings of local optimal stagnation and low solving accuracy. To overcome these shortcomings, an improved Aquila Optimization algorithm (IAO) is proposed in this paper. During the initialization of IAO population, a hybrid chaotic mapping mechanism was introduced to initialize the population, improving both the population diversity and the uniformity of the population distribution. The elite dimensional lens imaging learning strategy is introduced for elite individual to improve the optimization quality of the algorithm as elite individual has more useful information than ordinary individuals. Then the probabilistic jump mechanism of simulated annealing algorithm is used to select the position update mode to balance local development and global search. The experimental results on the CEC2005 test function verify the viability and effectiveness of IAO. IAO is used to the multi-threshold segmentation problem based on symmetric cross entropy to demonstrate its capacity to resolve practical optimization problems. The segmentation performance on different reference images shows that IAO has good segmentation performance in most cases. [ABSTRACT FROM AUTHOR]

The intrinsic high parallelism and entanglement characteristics of quantum computing have made quantum image processing techniques a focus of great interest. One of the most widely used techniques in image processing is segmentation, which in one of their most basic forms can be carried out using thresholding algorithms. In this paper, a fault-tolerant quantum dual-threshold algorithm has been proposed. This algorithm has been built using only Clifford+T gates for compatibility with error detection and correction codes. Because fault-tolerant implementation of T gates has a much higher cost than other quantum gates, our focus has been on reducing the number of these gates. This has allowed adding noise tolerance, computational cost reduction, and fault tolerance to the state-of-the-art dual-threshold segmentation circuits. Since the dual-threshold image segmentation involves the comparison operation, as part of this work we have implemented two full comparator circuits. These circuits optimize the metrics T-count and T-depth with respect to the best circuit comparators currently available in the literature. [ABSTRACT FROM AUTHOR]

To address the problems of low accuracy and slow convergence of traditional multilevel image segmentation methods, a symmetric cross-entropy multilevel thresholding image segmentation method (MSIPOA) with multi-strategy improved pelican optimization algorithm is proposed for global optimization and image segmentation tasks. First, Sine chaotic mapping is used to improve the quality and distribution uniformity of the initial population. A spiral search mechanism incorporating a sine cosine optimization algorithm improves the algorithm's search diversity, local pioneering ability, and convergence accuracy. A levy flight strategy further improves the algorithm's ability to jump out of local minima. In this paper, 12 benchmark test functions and 8 other newer swarm intelligence algorithms are compared in terms of convergence speed and convergence accuracy to evaluate the performance of the MSIPOA algorithm. By non-parametric statistical analysis, MSIPOA shows a greater superiority over other optimization algorithms. The MSIPOA algorithm is then experimented with symmetric cross-entropy multilevel threshold image segmentation, and eight images from BSDS300 are selected as the test set to evaluate MSIPOA. According to different performance metrics and Fridman test, MSIPOA algorithm outperforms similar algorithms in global optimization and image segmentation, and the symmetric cross entropy of MSIPOA algorithm for multilevel thresholding image segmentation method can be effectively applied to multilevel thresholding image segmentation tasks. [ABSTRACT FROM AUTHOR]

This paper introduces a new variant of the metaheuristic algorithm based on the naked mole rat (NMR) algorithm, called the Q-learning naked mole rat algorithm (QL-NMR), for substitution box construction and optimization. Unlike most competing works (which typically integrate a single chaotic map into a particular metaheuristic algorithm), QL-NMR assembles five chaotic maps (i.e., Chebyshev, logistic, circle, Singer, and sinusoidal) as part of the algorithm itself. Using a Q-learning table, QL-NMR remembers the historical performance of each chaotic map during the S-box construction process allowing just-in-time adaptive selection based on its current performance. Experimental results for 8 × 8 S-box generation demonstrate that the proposed QL-NMR gives competitive performance against other existing works, particularly in terms of nonlinearity and strict avalanche criteria. To further demonstrate the effectiveness of our proposed work, we have subjected the QL-NMR for image segmentation using multilevel thresholding. The results confirm that QL-NMR gives better performance than its predecessor NMR. Finally, QL-NMR S-box also outperformed NMR S-box in image encryption. [ABSTRACT FROM AUTHOR]

Aiming at the problem of low efficiency and insufficient accuracy of threshold solution in multithreshold sculpture image segmentation, this paper proposes a threshold segmentation algorithm for sculpture images based on sparse decomposition. In this paper, sparse decomposition is introduced to optimize the model to reduce the impact of local noise on segmentation accuracy, and an energy functional based on pixel coconstraint is built to make up for the defect that pixels cannot retain local details. At the same time, the weighted sum of elite solution sets is used to determine Neighborhood centers increase communication between groups. Experiments show that compared with other algorithms, the above method has significant advantages in convergence efficiency and accuracy. [ABSTRACT FROM AUTHOR]

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]

The quantum image segmentation algorithm is to divide a quantum image into several parts, but most of the existing algorithms use more quantum resource(qubit) or cannot process the complex image. In this paper, an improved two-threshold quantum segmentation algorithm for NEQR image is proposed, which can segment the complex gray-scale image into a clear ternary image by using fewer qubits and can be scaled to use n thresholds for n + 1 segmentations. In addition, a feasible quantum comparator is designed to distinguish the gray-scale values with two thresholds, and then a scalable quantum circuit is designed to segment the NEQR image. For a 2 n × 2 n image with q gray-scale levels, the quantum cost of our algorithm can be reduced to 60 q - 6 , which is lower than other existing quantum algorithms and does not increase with the image's size increases. The experiment on IBM Q demonstrates that our algorithm can effectively segment the image. [ABSTRACT FROM AUTHOR]

• Moisture affects microbial succession and volatiles generation by mediated with Lactobacillus. • The ratio of ethyl acetate to ethyl lactate and content of acid, alcohol positively relate to moisture. • Increase moisture accelerate formation of Lactobacillus -dominated fermentation microbiota. • Increase moisture enhance complexity and stability of baijiu fermentation ecological networks. Today, image segmentation methods are widely used for various applications, including object detection. Multilevel Thresholding Image Segmentation (MTIS) methods are among the efficient methods for image segmentation. In MTIS methods, it is very important to find the thresholds that gives the best performance for the MTIS and better separate and detect the objects on the image from the image background. Meta-Heuristic (MH) algorithms are among the strategies that can achieve good results in obtaining optimal thresholds to solve this problem. In this paper, we use the combination of Arithmetic Optimization Algorithm (AOA) and Harris Hawks Optimizer (HHO) to improve AOA in exploitation phase, and achieve an optimal threshold vector for MTIS. Therefore, our new hybrid AOA-HHO algorithm solves the MTIS problem with better quality than both AOA and HHO algorithms and some other MH algorithms, and can obtain better thresholds that increase the performance of the MTIS system than AOA and HHO. AOA is powerful in the exploration, and HHO in exploitation phase is powerful. Therefore, AOA-HHO uses the features of both algorithms to search the entire search space locally and globally to find the best find the solution, the high power of the AOA exploration phase, and the high power of the HHO exploitation phase. Also, we use a mathematical equation as the fitness function, that is obtained by using image features. A series of experiments were performed using seven different threshold levels on the test images. Experiments show that AOA-HHO method is better than the compared algorithms and even HHO and AOA in terms of image segmentation accuracy, fitness function value, Peak Signal-to-Noise Ratio (PSNR), Structural Similarity Index Measure (SSIM), and execution time. [ABSTRACT FROM AUTHOR]

The classical image segmentation algorithm based on local adaptive threshold can effectively segment images with uneven illumination, but with the increase of the image data, the real-time problem gradually emerges. In this paper, a quantum segmentation algorithm based on local adaptive threshold for NEQR image is proposed, which can use quantum mechanism to simultaneously compute local thresholds for all pixels in a gray-scale image and quickly segment the image into a binary image. In addition, several quantum circuit units, including median calculation, quantum binarization, etc. are designed in detail, and then a complete quantum circuit is designed to segment NEQR images by using fewer qubits and quantum gates. For a 2 n × 2 n image with q gray-scale levels, the complexity of our algorithm can be reduced to O (n 2 + q) , which is an exponential speedup compared to the classic counterparts. Finally, the experiment is conducted on IBM Q to show the feasibility of our algorithm in the noisy intermediate-scale quantum (NISQ) era. [ABSTRACT FROM AUTHOR]

Multilevel thresholding image segmentation has attracted a lot of attention in the last several years since it has plenty of applications. The traditional exhaustive search methods are efficient for bi-level thresholding. However, they are time-consuming when extended to multilevel thresholding. To tackle this problem, a novel adaptive firefly algorithm (AFA) for multilevel thresholding using the minimum cross-entropy as its objective function has been proposed in this paper. The performance of the proposed algorithm has been examined on a set of benchmark images using various numbers of thresholds and has been compared with five different firefly variant algorithms. The experimental results indicated that the proposed algorithm outperformed the other five algorithms in terms of image segmentation quality, accuracy, and computation time. [ABSTRACT FROM AUTHOR]

In order to improve the accuracy and performance of traditional image threshold segmentation algorithm, this paper proposes a multithreshold segmentation method named improved Harris hawk optimization (IMHHO). Firstly, IMHHO adopts Tent map and elite opposition-based learning to initialize population and enhance the diversity. Secondly, IMHHO uses quadratic interpolation to generate new individuals and enhance the local search ability. Finally, IMHHO adopts improved Gaussian disturbance method to disturb optimal solution, which coordinates the local and global search ability. Then, the performance of IMHHO is tested based on 14 benchmark functions. In image segmentation, different algorithms are tested to compare the comprehensive performance based on Otsu and Renyi entropy. Experiments show that IMHHO performs better in the three kinds of benchmark functions; the segmentation effect is directly proportional to the number of thresholds; compared with other algorithms, IMHHO has better comprehensive performance. [ABSTRACT FROM AUTHOR]

Threshold segmentation has been widely used in recent years due to its simplicity and efficiency. The method of segmenting images by the two-dimensional maximum entropy is a species of the useful technique of threshold segmentation. However, the efficiency and stability of this technique are still not ideal and the traditional search algorithm cannot meet the needs of engineering problems. To mitigate the above problem, swarm intelligent optimization algorithms have been employed in this field for searching the optimal threshold vector. An effective technique of lightning attachment procedure optimization (LAPO) algorithm based on a two-dimensional maximum entropy criterion is offered in this paper, and besides, a chaotic strategy is embedded into LAPO to develop a new algorithm named CLAPO. In order to confirm the benefits of the method proposed in this paper, the other seven kinds of competitive algorithms, such as Ant–lion Optimizer (ALO) and Grasshopper Optimization Algorithm (GOA), are compared. Experiments are conducted on four different kinds of images and the simulation results are presented in several indexes (such as computational time, maximum fitness, average fitness, variance of fitness and other indexes) at different threshold levels for each test image. By scrutinizing the results of the experiment, the superiority of the introduced method is demonstrated, which can meet the needs of image segmentation excellently. [ABSTRACT FROM AUTHOR]

Salp swarm algorithm (SSA) is an innovative contribution to smart swarm algorithms and has shown its utility in a wide range of research domains. While it is an efficient algorithm, it is noted that SSA suffers from several issues, including weak exploitation, convergence, and unstable exploitation and exploration. To overcome these, an improved SSA called as adaptive salp swarm algorithm (ASSA) was proposed. Thresholding is among the most effective image segmentation methods in which the objective function is described in relation of threshold values and their position in the histogram. Only if one threshold is assumed, a segmented image of two groups is obtained. But on other side, several groups in the output image are generated with multilevel thresholds. The methods proposed by authors previously were traditional measures to identify objective functions. However, the basic challenge with thresholding methods is defining the threshold numbers that the individual must choose. In this paper, ASSA, along with type II fuzzy entropy, is proposed. The technique presented is examined in context with multilevel image thresholding, specifically with ASSA. For this reason, the proposed method is tested using various images simultaneously with histograms. For evaluating the performance efficiency of the proposed method, the results are compared, and robustness is tested with the efficiency of the proposed method to multilevel segmentation of image; numerous images are utilized arbitrarily from datasets. [ABSTRACT FROM AUTHOR]

Multilevel thresholding is a basic method in image segmentation. The conventional image multilevel thresholding algorithms are computationally expensive when the number of decomposed segments is high. In this paper, a novel and powerful technique is suggested for Crow Search Algorithm (CSA) devoted to segmentation applications. The main contribution of our work is to adapt Darwinian evolutionary theory with heuristic CSA. First, the population is divided into specified groups and each group tries to find better location in the search space. A policy of encouragement and punishment is set on searching agents to avoid being trapped in the local optimum and premature solutions. Moreover, to increase the convergence rate of the proposed method, a gray-scale map is applied to out-boundary agents. Ten test images are selected to measure the ability of our algorithm, compared with the famous procedure, energy curve method. Two popular entropies i.e. Otsu and Kapur are employed to evaluate the capability of the introduced algorithm. Eight different search algorithms are implemented and compared to the introduced method. The obtained results show that our method, compared with the original CSA, and other heuristic search methods, can extract multi-level thresholding more efficiently. [ABSTRACT FROM AUTHOR]

Image segmentation is a prime operation to understand the content of images. Multilevel thresholding is applied in image segmentation because of its speed and accuracy. In this paper, a novel multilevel thresholding algorithm based on Cuckoo search (CS) is introduced. One of the major drawbacks of metaheuristic algorithms is the stagnation phenomenon which leads to a fall into local optimums and premature convergence. To overcome this shortcoming, the idea of Darwinian theory is incorporated with CS algorithm to increase the diversity and quality of the individuals without decreasing the convergence speed of CS algorithm. A policy of encouragement and punishment is considered to lead searching agents in the search space and reduce the computational time. The algorithm is implemented based on dividing the population into specified groups and each group tries to find a better location. Ten test images are selected to verify the ability of our algorithm using the famous energy curve method. Two popular entropies criteria, Otsu and Kapur, are employed to evaluate the capability of the introduced algorithm. Eight different search algorithms are also implemented and compared with our method. Experimental results manifest that DCS is a powerful tool for multilevel thresholding and the obtained results outperform the CS algorithm and other heuristic search methods. [ABSTRACT FROM AUTHOR]

Multilevel thresholding for image segmentation has always been a popular issue and has attracted much attention. Traditional exhaustive search methods take considerable time to solve multilevel thresholding problems. However, heuristic search algorithms have potential advantages in terms of solving such multilevel thresholding problems. Based on this idea, in this paper, a novel adaptive gravitational search algorithm (AGSA) is proposed to solve the optimal multilevel image thresholding problem; this algorithm is more efficient than the traditional exhaustive search method for grayscale image segmentation. In the AGSA, an adaptive parameter optimization strategy is used to tune the gravitational constant and the inertia weight. To verify the performance of the proposed algorithm, a series of classic test images are used to perform several experiments. In addition, the standard GSA and some optimization algorithms are compared with the proposed algorithm. The experimental results show that the proposed algorithm is obviously better than the other six algorithms. These promising results suggest that the AGSA is more suitable than existing methods for multilevel image thresholding. [ABSTRACT FROM AUTHOR]

Segmentation of image is a key step in image analysis and pre-processing. It consists of separating the pixels into different segments based on their intensity level according to threshold values. The most challenging job in segmentation is to select the optimum threshold values. Standard multilevel thresholding (MT) techniques are effective for bi-level thresholds due to their simplicity, robustness, decreased convergence time and precision. As the level of thresholds increases, computational complexity also increases exponentially. To mitigate these issues various metaheuristic algorithm are applied to this problem. In this manuscript, a new hybrid version of the Dragonfly algorithm (DA) and Firefly Algorithm (FA) is proposed. DA is an optimization algorithm recently suggested based on the dragonfly's static and dynamic swarming behavior. DA's worldwide search capability is great with randomization and static swarm behavior, local search capability is restricted, resulting in local optima trapping alternatives. The firefly algorithm (FA) is influenced by fireflies' social behavior in which they generate flashlights to attract their mates. The suggested technique combines the ability to explore DA and firefly Algorithm's ability to exploit to obtain ideal global solutions. In this paper, HDAFA is applied on ten standard test images having a diverse histogram, which are taken from Berkeley Segmentation Data Set 500 (BSDS500) benchmark image set for segmentation. The search capability of the algorithm is employed with OTSU and Kapur's entropy MT as an objective functions for image segmentation. The proposed approach is compared with the existing state-of-art optimization algorithms like MTEMO, GA, PSO, and BF for both OTSU and Kapur's entropy methods. Qualitative experimental outcomes demonstrate that HDAFA is highly efficient in terms of performance metric such as PSNR, mean, threshold values, number of iterations taken to converge and image segmentation quality. [ABSTRACT FROM AUTHOR]

To solve the problem of image threshold segmentation based on interval valued fuzzy sets, this paper proposed an threshold image segmentation algorithm using interval valued fuzzy set based on central disturbance . This algorithm used the way of disturbing to the center of object and background in an image, and considered the influence of uncertain and imprecise information on the center of clusters, and constructed interval valued fuzzy set for an image by using restricted equivalence function. Based on the distance measure between interval valued fuzzy sets, the algorithm searched the best segmentation threshold by establishing the objective function. Through the simulation experiment of three types of image data, the results show that the proposed method obtains better results in terms of vision and index, and proves the effectiveness of the algorithm. [ABSTRACT FROM AUTHOR]

Segmentation is considered as one of the most significant tasks in image processing. It consists of separating the pixels into different segments based on their intensity level according to threshold values. Selecting the optimal threshold value is the key to best quality segmentation. Multilevel thresholding (MT) is an essential approach for image segmentation, and it has become very popular during the past few years, but while increasing the level of thresholds, computational complexity also increases exponentially. In order to overcome this drawback, several metaheuristics-based algorithms have been used for determining the optimal MT levels. Learning enthusiasm-based teaching–learning-based optimization (LebTLBO) is a recently developed efficient, simple-to-implement and computationally inexpensive algorithm. It simulates the behaviors of the teaching and learning process in a classroom and gives the probability of getting the amount of information by the learner (student) from the educator. In this paper, LebTLBO is applied on ten standard test images having a diverse histogram, which are taken from Berkeley Segmentation Dataset 500 (BSDS500) (Martin et al. in a database of human segmented natural images and its application to evaluate segmentation algorithms and measure ecological statistics, 2001) benchmark image set for segmentation. The search capability of the algorithm is combined with Otsu and Kapur's entropy MT objective functions for image segmentation. The proposed approach is compared with the existing state-of-the-art optimization algorithms such as MTEMO, GA, PSO and BF for both Otsu and Kapur's entropy methods. Qualitative experimental outcomes demonstrate that LebTLBO is highly efficient in terms of performance metrics such as PSNR, mean, threshold values, number of iterations taken to converge and image segmentation quality. [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]

To overcome the shortcomings of 1-D and 2-D Otsu’s thresholding methods, a 3-D Otsu method has been introduced. While yielding satisfactory segmentation results for images with a low signal-to-noise ratio (SNR) and poor contrast, it has the downside of high computational complexity. In this paper, the cuttlefish algorithm (CFA)-based 3-D Otsu thresholding method is proposed to pace up the conventional 3-D Otsu thresholding for color image segmentation. In order to decrease the effects of noises and weak edges, an optimally selected multilevel 3-D Otsu image thresholding technique is brought into the proposed segmentation scheme. The CFA is a newly developed stochastic meta-heuristic optimization algorithm based on observing, mimicking, and modeling the camouflaging feature of cuttlefish. It is used to simplify the problem of exhaustive search for the optimal threshold vector in 3-D space. Experimental results, when compared to 1-D Otsu, 1-D Otsu-Cuckoo search (CS) algorithm, 1-D Otsu-lightning search algorithm (LSA), 1-D Otsu-CFA, conventional 3-D Otsu, 3-D Otsu-CS, and 3-D Otsu-LSA, indicate that the proposed algorithm CFA-based 3-D Otsu thresholding is superior to all the other multilevel thresholding algorithms. The proposed 3-D-CFA method produces promising segmentation results from the objective and subjective aspects. [ABSTRACT FROM AUTHOR]

As one of the most popular image segmentation techniques, multi-level thresholding is widely used. Much work has been done to improve the efficiency of multi-level thresholding, but satisfied affect is hard to achieve. In this paper, a multi-level image segmentation method using between-class variance (Otsu) based on improved bat algorithm (DWBA) with dynamically adjusting inertia weight and velocity stratification theory is proposed. DWBA algorithm has strong global search ability at the beginning. Then, the local search capability is enhanced with numbers increasing of iterations. More importantly, the performance of DWBA further improved, because bats with different fitness values have diverse velocities. Furthermore, an improved local search strategy is proposed to avoid the current best solution being replaced during iterations. The experimental results established that the proposed DWBA algorithm obtains better outcome than other algorithms. [ABSTRACT FROM AUTHOR]

Image segmentation is a very important activity in computer vision, where critical applications are highly dependent on the efficacy of such activity. To enhance the efficiency of such automated activity, meta-heuristic algorithms to optimally elucidate multi-level image segmentation problems have been proposed in the literature. Because of the advantages in terms of efficiency and convergence speed of the bat algorithm, this paper presents a novel improvement of such algorithm for solving the image multi-thresholding problem. The algorithm leads to speed up the convergence and increase diversity through the utilization of an appropriate crossover operator and chaotic sequences, with the use of Kapur's entropy as the optimized objective function. The proposed method produces segmented images with optimal values for the threshold in few iterations. Through the comparative analysis based on standard deviation, peak signal to noise ratio (PSNR) and segmented image quality, it is observed that the effectiveness of the proposed method, validated using different standard test images, outperforms well-known metaheuristic-based optimization techniques. [ABSTRACT FROM AUTHOR]

Multi-level image thresholding is a common approach to image segmentation where an image is divided into several regions based on its histogram. Otsu's method is the most popular method for this purpose, and is based on seeking for threshold values that maximise the between-class variance. This requires an exhaustive search to find the optimal set of threshold values, making image thresholding a time-consuming process. This is especially the case with increasing numbers of thresholds since, due to the curse of dimensionality, the search space enlarges exponentially with the number of thresholds. Population-based metaheuristic algorithms are efficient and effective problem-independent methods to tackle hard optimisation problems. Over the years, a variety of such algorithms, often based on bio-inspired paradigms, have been proposed. In this paper, we formulate multi-level image thresholding as an optimisation problem and perform an extensive evaluation of 23 population-based metaheuristics, including both state-of-the-art and recently introduced algorithms, for this purpose. We benchmark the algorithms on a set of commonly used images and based on various measures, including objective function value, peak signal-to-noise ratio, feature similarity index, and structural similarity index. In addition, we carry out a stability analysis as well as a statistical analysis to judge if there are significant differences between algorithms. Our experimental results indicate that recently introduced algorithms do not necessarily achieve acceptable performance in multi-level image thresholding, while some established algorithms are demonstrated to work better. [ABSTRACT FROM AUTHOR]

• A color image segmentation based on Exchange Market Algorithm (EMA) is proposed. • Between class variance and entropy functions are used as objective functions. • The proposed EMA approach is compared with other state-of-the-art algorithms. • Results reveal that the EMA is the effective approach for multilevel thresholding. Color image segmentation is the primary step to elicit detailed information of the image with RGB color space. The key to acquire the region of interest is the straightforward, instinctual technique called thresholding. Bi-level thresholding can be assessed concretely for simple images, whereas revealing various classes from a complex image is achieved only through multiple threshold values. Hence, multilevel thresholding with the most propitious maximizing objective functions such as Kapur, Otsu and Minimum Cross Entropy (MCE) to extract the precise threshold are employed in this paper. As the segmentation level increases, execution of non-parametric objective functions leads to exponential increase in computational time. Several researches to enhance the speed of objective functions along with various metaheuristics such as Krill Herd Algorithm (KHA), Teaching-Learning Based Optimization (TLBO) and Cuckoo Search Algorithm (CSA) are performed. The need to unlock the computational complexity drifted our view towards the most powerful, robust, recently introduced metaheuristic Exchange Market Algorithm (EMA). EMA involves exchange of shares among investors to gain profit. The strategic approach of share members in stable and unstable modes of the market results in precise exploration and exploitation. Furthermore, low fitness shareholders gaining experience from their high and moderate counterparts, stands out as an exceptional step to reduce the time consumption. This concept is utilized in our paper for the first time to obtain the exact details from the image without any delay. Empirical outcome of the results indicates that exceptional image segmentation is achieved by EMA in less time compared to extensive search techniques such as KHA, TLBO and CSA. Quantitative and qualitative validation furnished by metrics such as Structural Similarity Index (SSIM), computational time, Peak Signal to Noise Ratio (PSNR) and statistical Wilcoxon test affirm that Otsu, Kapur and MCE based EMA outperforms the existing techniques to analyze the real-world images. [ABSTRACT FROM AUTHOR]

In this paper, we propose an interval iteration multilevel thresholding method (IIMT). This approach is based on the Otsu method but iteratively searches for sub-regions of the image to achieve segmentation, rather than processing the full image as a whole region. Then, a novel multilevel thresholding framework based on IIMT for brain MR image segmentation is proposed. In this framework, the original image is first decomposed using a hybrid L1 − L0 layer decomposition method to obtain the base layer. Second, we use IIMT to segment both the original image and its base layer. Finally, the two segmentation results are integrated by a fusion scheme to obtain a more refined and accurate segmentation result. Experimental results showed that our proposed algorithm is effective, and outperforms the standard Otsu-based and other optimization-based segmentation methods. [ABSTRACT FROM AUTHOR]

Region Growing Algorithm (RGA) is a popular, fast and strongly formed object segmentation method. In RGA, the region is grown from the seed points to adjacent points depending on an aggregation criterion. Despite the huge literature on RGA, none of the proposed aggregation criteria have been analytically proved to be suitable for an ideal segmentation. In this paper, Cauchy-Schwarz Divergence (CSD) is proved to be suitable as an aggregation criterion in RGA for object segmentation. First, RGA is formulated in this context. The Cauchy-Schwarz-based criterion is proposed here in the continuous case for a bimodal image that contains one object in the background while both regions are normally distributed with different parameters (while the assumption of normal distribution of object and background has been used by many researchers in minimum error thresholding method). Then, a proof is given that in the mentioned formulated case, the proposed RGA will lead to an ideal segmentation. The case is also investigated while object and background have heavy-tail distributions like generalized Gaussian function when β < 2. While all formulations and proofs are given in the continuous case, the segmentation results in the discrete case are shown to be good. Comparison of these results with the outcomes of RGA with traditional aggregation criteria, shows how analytical justifications can suggest a better criterion. [ABSTRACT FROM AUTHOR]

Infrared pedestrian segmentation is a challenging problem in infrared image processing. Kaniadakis entropy thresholding method can segment the infrared image with long tail distribution histogram. However, it failed in images with noise and complex background. In this paper, a novel infrared pedestrian segmentation algorithm based on the two-dimensional Kaniadakis entropy thresholding is proposed to address this problem. First, in order to introduce the spatial information of pixels, the two-dimensional Kaniadakis entropy thresholding algorithm is proposed through extending the one-dimensional Kaniadakis entropy thresholding algorithm and using the two-dimensional histogram of image. The recursive formulas of the two-dimensional algorithm are also presented to improve the computation efficiency. Second, an intensity suppressed strategy is embedded in the optimal thresholds searching process of the two-dimensional Kaniadakis entropy thresholding algorithm to segment the pedestrian in infrared images with complex background. In the experiment, the proposed algorithm is compared with the state-of-the-art image segmentation methods on several infrared images with different backgrounds. The experimental results verify the effectiveness of the proposed method both qualitatively and quantitatively. • Extend the Kaniadakis entropy thresholding to 2d. • Derive the recursive formulas of the 2d Kaniadakis entropy thresholding. • Propose a suppressed strategy in 2d-Kan for infrared pedestrian segmentation. • Verify the effectiveness of the proposed infrared pedestrian segmentation algorithm. [ABSTRACT FROM AUTHOR]

The automatic identification of seedling defects is an important technology of an intelligent automatic transplanting machine, which effectively improves the quality of the transplanting machine's operation. The accurate segmentation of seedling substrate and seedling region is the key to the success of the seedling defect recognition algorithm. This paper proposes the maxIOU algorithm to calculate the image segmentation threshold: The image G channel and excess green color space were selected as the color space for the segmentation of the substrate region and seedling region by analyzing the color histogram. Several images were randomly selected from the dataset to generate a training set and were labeled manually as the ground truth. The training set images were segmented using a threshold of zero to 255, and the intersection over union (IOU) were calculated using the algorithm segmented result and the ground truth. The threshold corresponding to the average IOU maximum was used as the segmentation threshold. After image segmentation, three features (area of the substrate, area of the seedling, and filling ratio of the lower part of the substrate) were obtained by the algorithm, and the image was identified for whether there was an empty conveyor belt, seedling deficiency, multiple seedlings, skew, and damaged substrate. The algorithm was tested on the automatic transplanter test platform. The experiment results were as follows: Firstly, the image segmentation threshold was calculated by the maxIOU method. The color component interval corresponding to the segmented substrate region was [0, 24] in the G channel, and the color component interval corresponding to the segmented seedling region was [21, 255] in the excess green channel. The average IOU of the substrate area was 0.854, and the average IOU of the seedling area was 0.820 in the verification experiment. Secondly, a dataset including 431 normal seedling images and 69 defective seedling images (empty conveyor belt, seedling deficiency, multiple seedlings, skew, and damaged substrate) was identified for defects. The accuracy, precision, and recall were 97.6%, 97.4%, and 99.8%. The processing time was 71.4 ms. The conclusion of the experiment was as follows: the maxIOU algorithm had high accuracy in the segmentation of the substrate and seedling region. The defect identification algorithm had high accuracy for defect identification of cabbage seedlings, and the algorithm had good real-time performance, which can be applied to high speed field transplanters. [ABSTRACT FROM AUTHOR]

• The ALDE algorithm works better for MRI image analysis than DE variants. • The ALDE algorithm is less sensitive to increasing number of thresholds. • The ALDE algorithm is fast enough for real-world image analysis applications. • The ALDE algorithm can efficiently balance between exploration and exploitation. Segmentation is an important method for MRI medical image analysis as it can provide the radiologists with noninvasive information about a patient that is crucial to the diagnostic process. The efficiency of such a computer-aided diagnosis system relies on the accuracy of an adopted image segmentation method. Multi-level thresholding is a segmentation method that has been widely adopted in medical image analysis in recent studies, where selecting the optimal thresholds has a pivotal role in determining the efficiency and the accuracy of the segmentation algorithm. While some well-known methods, such as Kapur's and Otsu's, are proven effective for bi-level thresholding, multi-level thresholding remains a challenge as it is computationally expensive. Evolutionary algorithms, such as Differential Evolution (DE), have the potential to address this problem, as they can find sufficiently good solutions with manageable computational effort. While a number of DE solutions have been proposed for multi-level thresholding, they are not stable, in that, when the number of thresholds increases, the algorithm efficiency decreases due to the imbalance between exploration and exploitation. In this paper, we propose a DE solution that achieves a good balance between exploration and exploitation through a new adaptive approach and new mutation strategies. The new adaptive approach can generate optimal solutions in assigning populations by measuring the quality of candidate solutions to evaluate the efficiency of different parts of the proposed DE algorithm. The new mutation methods harness Mantegna Lévy and Cauchy distributions, as well as Cotes' Spiral to improve global search, and to further balance between exploitation and exploration. We further experimentally compare the proposed DE algorithm, referred to as Adaptive Differential Evolution with Lévy Distribution (ALDE), against three DE benchmark algorithms on T2 weighted MRI brain images. Our results show that ALDE can, not only obtain optimal thresholds at a reasonable computational cost, but more importantly, clearly outperforms the benchmark algorithms. [ABSTRACT FROM AUTHOR]