A Literature Survey of Optimization Techniques for Satellite Image Segmentation

To realize fast and accurate evaluation for flatness errors,a Modified Artificial Bee Colony(MABC) algorithm was proposed to implement the minimum zone evaluation of flatness errors.The minimum zone method and the criteria for flatness errors were introduced.According to the minimum zone condition,the mathematic model of flatness error evaluation was presented.By introducing two traction bees and a Tabu Strategy(TS),this modified method could enhance the rate of convergence and the quality of optimum solution.The implementation steps of the method were expounded.Then,two test functions were selected in the simulation experiments through analysis,and the results verified the feasibility of MABC algorithm.Finally,proposed approach was used to evaluate flatness errors.The results calculated meet the criterion of minimal condition.On the basis of a group of metrical data,this approach can find the optimal plane by 0.436 second,which saves 0.411 second as compared with that of ABC algorithm.In addition,the flatness value from the MABC algorithm is 18.03 μm lower than that of the Least-Square Method(LSM),and 6.13 μm than the Genetic Algorithm(GA).According to other five measurement data sets available from the Coordinate Measuring Machines(CMMs),the results obtained by the MABC algorithm are more accurate than those by the GA and Particle Swarm Optimization(PSO),and the maximum gap of flatness values is 0.9 μm.Experimental results show that the MABC-based approach outperforms ABC-base method in optimization efficiency,solution quality and stability,and its calculating precision is superior to that given by LSM,GA or PSO.It is suited for the evaluation of position measuring instruments and CMMs.

ECG heart beat classification method based on modified ABC algorithm

The image segmentation refers to the extraction of region of interest and it plays a vital role in medical image processing. This work proposes multilevel thresholding based on optimization technique for the extraction of region of interest and compression of DICOM images by an improved prediction lossless algorithm for telemedicine applications. The role of compression algorithm is inevitable in data storage and transfer. Compared to the conventional thresholding, multilevel thresholding technique plays an efficient role in image analysis. In this paper, the Particle Swarm Optimization (PSO), Darwinian Particle Swarm Optimization (DPSO), and Fractional Order Darwinian Particle Swarm Optimization (FODPSO) are employed in the estimation of the threshold value. The simulation results reveal that the FODPSO-based multilevel level thresholding generate superior results. The fractional coefficient in FODPSO algorithm makes it effective optimization with fast convergence rate. The classification and blending prediction-based lossless compression algorithm generates efficient results when compared with the JPEG lossy and JPEG lossless approaches. The algorithms are tested for various threshold values and higher value of PSNR indicates the proficiency of the proposed segmentation approach. The performance of the compression algorithms was validated by metrics and was found to be appropriate for data transfer in telemedicine. The algorithms are developed in Matlab2010a and tested on DICOM CT images.

Image segmentation is a platform for many high-level applications. It aims to identify the different homogeneous regions of an image. In our work, we cast the problem as a parallel distributed optimization task and we present a new method for image segmentation by multilevel thresholding based on generalized island model (GIM). This model is characterized by the cooperation of three metaheuristics namely Particle Swarm Optimization (PSO), Genetic Algorithm (GA) and Artificial Bee Colony (ABC). The cooperation is ensured by the use of a migration pattern the purpose of which is to avoid getting stuck in local optima. The effectiveness of the proposed method has been assessed and compared to each of the algorithms of the GIM model when used separately and other methods from the literature like Darwinian PSO (DPSO), Fractional-Order Darwinian PSO (FO-DPSO). The obtained results are very promising and show the positive impact of the use of a parallel distributed model. They also show that the proposed method competes and even outperforms the other methods.

Entropy-based thresholding techniques are quite popular and effective for image segmentation. Among different entropy-based techniques, minimum cross-entropy thresholding (MCET) has received wide attention in the field of image segmentation. Considering the high time complexity of MCET technique for multilevel thresholding, recursive approach to reducing its computational cost is highly desired. To reduce the complexity, further optimization techniques can be applied to find optimal multilevel threshold values. In this paper, a novel improved particle swarm optimization (IPSO)-based multilevel thresholding algorithm is proposed to search the near-optimal MCET thresholds. The general PSO algorithm often suffers from premature convergence problem which has been addressed in the IPSO by decomposing a high-dimensional swarm into several one-dimensional swarms, and then premature convergence is removed from each one-dimensional swarm. The proposed technique is applied to the set of grayscale images, and the experimental results infer that it produces better MCET optimal threshold values at a higher and faster convergence rate. The qualitative and quantitative results are compared with existing optimization techniques like modified artificial bee colony, Cuckoo search, Firefly, particle swarm optimization, and genetic algorithm. It has been observed that the proposed technique performs better in terms of producing better fitness value, less CPU time as quantitative measurements, and effective misclassification error, peak signal-to-noise ratio, feature similarity index measurement, complex wavelet structural similarity index measurement values as qualitative measurements compared to other considered state-of-the-art methods.

Multilevel thresholding for image segmentation is a crucial process in several applications such as feature extraction and pattern recognition. The meticulous search for the best values for the optimization of fitness function using classical operations needs profuse computational time, which also results in inaccuracy and instability. In this paper, a new beta differential evolution (BDE)-based fast color image multilevel thresholding scheme using two objective functions has been presented. The optimal threshold values are determined by maximizing Kapur’s and Tsallis entropy (entropy criterion) thresholding functions coupled with BDE algorithm. The efficiency of the proposed method is examined over existing multilevel thresholding methods such as artificial bee colony, particle swarm optimization, wind-driven optimization and differential evolution. These approaches are aimed to determine optimum threshold values at different levels of thresholding for color image segmentation. The proficiency of the presented methodology is demonstrated visually and computationally on five real-life true color images as well as four satellite images. Experimental outcomes are exhibited in terms of the optimal threshold value, best objective function and computational cost (in seconds) for each method at different thresholding levels. Afterward, the proposed scheme is examined intensively regarding the superiority of quality. The experimentally evaluated results show that the proposed BDE-based approach for multilevel color image segmentation can accurately and efficiently examine for multiple thresholds, which are near to optimal ones searched using an exhaustive search process.

Selection of useful bands plays a very important role in hyperspectral image classification. In the past decade, metaheuristic algorithms have been used as promising methods for solving this problem. However, many metaheuristic algorithms may provide unsatisfactory performance due to their slow or premature convergence. Therefore, how to develop algorithms well balancing the exploration and exploitation, and find the suitable bands precisely is still a challenge. In this paper, a new hybrid global optimization algorithm, which is based on the Wind Driven Optimization (WDO) and Cuckoo Search (CS) is proposed to solve hyperspectral band selection problems. Both WDO and CS have strong searching ability and require less control parameters, but easily suffer from premature convergence due to loss of diversity of population. The proposed approach uses the Chebyshev chaotic map to initialize the population at initial step. The population is divided into two subgroups and WDO and CS are adopted for these two subgroups independently. By division, these two subgroups can share suitable information and utilize each other’s pros, thus avoid premature convergence, and obtain best optimal solution. Furthermore, the Levy flight step size in CS algorithm is adaptively adjusted based on fitness value and current iteration number, which helps in boosting the convergence speed of algorithm. The experimental results on three standard benchmark datasets namely, Pavia University, Botswana and Indian Pines, prove the superiority of the proposed approach over standard WDO and CS approaches as well as the other traditional approaches in terms of classification accuracy with fewer bands.

Cuckoo search (CS) is widely used to solve many optimisation problem, which is a biologically inspired the brood parasitic behaviour of a type of cuckoos and the Levy flights behaviour of some animals. However, it has been demonstrated to easily get trapped into local optimal solutions and slow convergence speed. Therefore, an improved adaptive cuckoo search (IACS) optimisation algorithm is proposed in this article. Two adaptive strategies based on the population feature and iteration information feedback which are integrated into the CS algorithm to adjust the parameters pa and α0. We compared the proposed algorithm to CS and five variants on the 30 benchmark functions proposed in CEC 2014. In addition, the proposed algorithm and CS are integrated into support vector machine (SVM) for classification. Experimental results certify that the modified algorithm is superior to the CS for most optimisation problems and has better performance than the other variants of CS algorithm.

A hybrid differential evolution for optimal multilevel image thresholding

Multilevel thresholding image segmentation will subdivide an image into several meaningful regions or objects, which makes the image more informative and easier to analyze. Optimal multilevel thresholding approaches are extensively used for segmentation because they are easy to implement and offer low computational cost. Multilevel thresholding image segmentation is frequently performed using popular methods such as Otsu’s between-class variance and Kapur’s entropy. Numerous researchers have used evolutionary algorithms to identify the best multilevel thresholds based on the above approaches using histogram. This paper uses the Energy Curve (EC) based thresholding method instead of the histogram. Chaotic Bidirectional Smell Agent Optimization with Adaptive Control Strategy (ChBSAOACS), a powerful evolutionary algorithm, is developed and employed in this paper to create and execute an effective method for multilevel thresholding segmentation of breast thermogram images based on energy curves. The proposed algorithm was tested for viability on standard breast thermogram images. All experimental data are examined quantitatively and qualitatively to verify the suggested method’s efficacy.

Artificial Bee Colony (ABC) algorithm is one of the efficient nature-inspired optimization algorithms for solving continuous problems. It has no sensitive control parameters and has been shown to be competitive with other well-known algorithms. However, the slow convergence, premature convergence, and being trapped within the local solutions may occur during the search. In this paper, we propose a new Modified Artificial Bee Colony (MABC) algorithm to overcome these problems. All phases of ABC are determined for improving the exploration and exploitation processes. We use a new search equation in employed bee phase, increase the probabilities for onlooker bees to find better positions, and replace some worst positions by the new ones in onlooker bee phase. Moreover, we use the Firefly algorithm strategy to generate a new position replacing an unupdated position in scout bee phase. Its performance is tested on selected benchmark functions. Experimental results show that MABC is more effective than ABC and some other modifications of ABC.

Abstract—This research presents an integrated framework for satellite image retrieval, segmentation, and visualization, utilizing Python-based algorithms and geospatial data processing methods. It incorporates Google Maps-based image acquisition, a Tkinter-powered interactive GUI, and the U-Net segmentation model to efficiently process satellite imagery. Satellite image segmentation, powered by U-Net, plays a vital role in geospatial analysis, enabling automated classification and extraction of key features from high-resolution imagery. The framework facilitates seamless high-resolution map generation, segmentation, and an- alytical visualization through interactive tools like bar graphs and pie charts. By leveraging U-Net’s robust architecture, this implementation enhances segmentation accuracy and supports applications in urban planning, environmental monitoring, and disaster management. Through the automation of retrieval, processing, and visualization of satellite imagery, this research advances geospatial intelligence and provides a scalable solution for efficient image segmentation workflows. Keywords—Satellite Image Segmentation, Land Cover Classi- fication, Remote Sensing, Image Processing, Semantic Segmen- tation, Deep Learning Models, Convolutional Neural Networks (CNNs), U-Net Architecture, Geospatial Analysis, Land Use Analysis

This research work introduces a comprehensive study about a coherent optimization algorithm Cuckoo search, its variants and applications. Cuckoo search technique is one among the best algorithms which is inspired by nature and also metaheuristic optimization algorithms, which was designed and implemented by Yang and Deb in 2009. CS algorithm has been established as, a very efficient algorithm, which emulates an important feature of cuckoo species bird i.e., obligate brood parasitism. In this tract, we are analyzing the insight of cuckoo search algorithm and its variants, which owes to apply successfully for extensive range of global optimization problems with assorted modifications. The practices of cuckoo search algorithm can be registered as structural engineering problems, image processing techniques, identifying protein complexes, optimal power flow, wind energy forecasting, side lobes reduction, milling operations, feed forwarding applications and so on.

Detection of ischemic stroke using brain magnetic resonance imaging (MRI) images is vital and a challenging task in clinical practice. We propose a novel method based on optimization technique to identify stroke lesion in diffusion-weighted imaging (DWI) MRI sequences of the brain. The algorithm was tested in a specific slice having large area of stroke region from a series of 292 real-time images obtained from different stroke affected subjects from IMS and SUM Hospital. The proposed method consists of pre-processing, segmentation, extraction of important features and classification of stroke type. The particle swarm optimization (PSO) and Darwinian particle swarm optimization (DPSO) algorithms were applied in segmenting the stroke lesions. The important features were extracted with the gray-level co-occurrence matrix (GLCM) algorithm and in decision making process, the feature set is classified into three types of stroke according to The Oxfordshire Community Stroke Project (OCSP) classification using support vector machine (SVM) classifier. The lesion area was segmented effectively with DPSO process with classification weighted accuracy of 90.23%, which is higher than PSO method having weighted accuracy of 85.19%. Similarly, the values of different measured parameters were high in DPSO technique, the computational time was also higher in DPSO method for segmenting the stroke lesions. These results confirm that the DPSO-based approach with SVM classifier is an effective way to identify the decision making process of ischemic stroke lesion in MRI images of the brain.

Accurate medical diagnosis and treatment necessitate the application of optimal segmentation of images. Although manual segmentation is easy, it has many problems such as time complexity and error sensitivity. On the other hand, automatic segmentation is fast with less probability of errors. However, it has many problems like low contrast image, unclear boundaries and less accurate. To overcome these problems, optimization methods like Particle Swarm Optimization (PSO), genetic algorithm (GA), etc. can provide more accurate and efficient outcomes. Thus, for the achievement of optimized results, the current study proposes a more optimized ‘Singh-Elamvazuthi’ ultrasound segmentation framework based on Darwinian Particle Swarm Optimization (D-PSO) for ankle Anterior Talofibular Ligament.