Searching for the (near) optimal subset of features is a challenging problem in the process of feature selection (FS). In the literature, Swarm Intelligence (SI) algorithms show superior performance in solving this problem. This motivated our attempts to test the performance of the newly proposed Salp Swarm Algorithm (SSA) in this area. As such, two new wrapper FS approaches that use SSA as the search strategy are proposed. In the first approach, eight transfer functions are employed to convert the continuous version of SSA to binary. In the second approach, the crossover operator is used in addition to the transfer functions to replace the average operator and enhance the exploratory behavior of the algorithm. The proposed approaches are benchmarked on 22 well-known UCI datasets and the results are compared with 5 FS methods: Binary Grey Wolf Optimizer (BGWO), Binary Gravitational Search Algorithms (BGSA), Binary Bat Algorithm (BBA), Binary Particle Swarm Optimization (BPSO), and Genetic Algorithm (GA). The paper also considers an extensive study of the parameter setting for the proposed technique. From the results, it is observed that the proposed approach significantly outperforms others on around 90% of the datasets.

/pdf/an-efficient-binary-salp-swarm-algorithm-with-crossover-9kyl7dt8j9.pdf

An efficient binary Salp Swarm Algorithm with crossover scheme for feature selection problems

Feature Selection (FS) is a challenging machine learning-related task that aims at reducing the number of features by removing irrelevant, redundant and noisy data while maintaining an acceptable level of classification accuracy. FS can be considered as an optimisation problem. Due to the difficulty of this problem and having a large number of local solutions, stochastic optimisation algorithms are promising techniques to solve this problem. As a seminal attempt, binary variants of the recent Grasshopper Optimisation Algorithm (GOA) are proposed in this work and employed to select the optimal feature subset for classification purposes within a wrapper-based framework. Two mechanisms are employed to design a binary GOA, the first one is based on Sigmoid and V-shaped transfer functions, and will be indicated by BGOA-S and BGOA-V, respectively. While the second mechanism uses a novel technique that combines the best solution obtained so far. In addition, a mutation operator is employed to enhance the exploration phase in BGOA algorithm (BGOA-M). The proposed methods are evaluated using 25 standard UCI datasets and compared with 8 well-regarded metaheuristic wrapper-based approaches, and six well known filter-based (e.g., correlation FS) approaches. The comparative results show the superior performance of the BGOA and BGOA-M methods compared to other similar techniques in the literature.

Binary grasshopper optimisation algorithm approaches for feature selection problems

Thank you for reading introductory digital image processing. As you may know, people have search hundreds times for their chosen books like this introductory digital image processing, but end up in infectious downloads. Rather than enjoying a good book with a cup of tea in the afternoon, instead they are facing with some malicious virus inside their laptop. introductory digital image processing is available in our book collection an online access to it is set as public so you can get it instantly. Our books collection hosts in multiple locations, allowing you to get the most less latency time to download any of our books like this one. Merely said, the introductory digital image processing is universally compatible with any devices to read.

Introductory Digital Image Processing

Particle Swarm Optimization (PSO) is a metaheuristic global optimization paradigm that has gained prominence in the last two decades due to its ease of application in unsupervised, complex multidimensional problems which cannot be solved using traditional deterministic algorithms. The canonical particle swarm optimizer is based on the flocking behavior and social co-operation of birds and fish schools and draws heavily from the evolutionary behavior of these organisms. This paper serves to provide a thorough survey of the PSO algorithm with special emphasis on the development, deployment and improvements of its most basic as well as some of the state-of-the-art implementations. Concepts and directions on choosing the inertia weight, constriction factor, cognition and social weights and perspectives on convergence, parallelization, elitism, niching and discrete optimization as well as neighborhood topologies are outlined. Hybridization attempts with other evolutionary and swarm paradigms in selected applications are covered and an up-to-date review is put forward for the interested reader.

Particle Swarm Optimization: A survey of historical and recent developments with hybridization perspectives

A hyperspectral imaging sensor collects detailed spectral responses from ground objects using hundreds of narrow bands; this technology is used in many real-world applications. Band selection aims to select a small subset of hyperspectral bands to remove spectral redundancy and reduce computational costs while preserving the significant spectral information of ground objects. In this article, we review current hyperspectral band selection methods, which can be classified into six main categories: ranking based, searching based, clustering based, sparsity based, embedding-learning based, and hybrid-scheme based. With two widely used hyperspectral data sets, we illustrate the classification performances of several popular band selection methods. The challenges and research directions of hyperspectral band selection are also discussed.

Hyperspectral Band Selection: A Review

Graphical abstractDisplay Omitted HighlightsWe propose a novel binary coded ant colony algorithm by blending of GA and BACO.The proposed algorithm is adopted to handle with the problem of feature selection.Results show the method outperforms GA, BPSO, BACO, ABACO, BDE in feature selection. Feature selection is a significant task for data mining and pattern recognition. It aims to select the optimal feature subset with the minimum redundancy and the maximum discriminating ability. In the paper, a feature selection approach based on a modified binary coded ant colony optimization algorithm (MBACO) combined with genetic algorithm (GA) is proposed. The method comprises two models, which are the visibility density model (VMBACO) and the pheromone density model (PMBACO). In VMBACO, the solution obtained by GA is used as visibility information; on the other hand, in PMBACO, the solution obtained by GA is used as initial pheromone information. In the method, each feature is treated as a binary bit and each bit has two orientations, one is for selecting the feature and another is for deselecting. The proposed method is also compared with that of GA, binary coded ant colony optimization (BACO), advanced BACO (ABACO), binary coded particle swarm optimization (BPSO), binary coded differential evolution (BDE) and a hybrid GA-ACO algorithm on some well-known UCI datasets; furthermore, it is also compared with some other existing techniques such as minimum Redundancy Maximum Relevance (mRMR), Relief algorithm for a comprehensive comparison. Experimental results display that the proposed method is robust, adaptive and exhibits the better performance than other methods involved in the paper.

A feature selection method based on modified binary coded ant colony optimization algorithm

Remote sensing image classification based on the optimal support vector machine and modified binary coded ant colony optimization algorithm

Graphical abstractDisplay Omitted HighlightsA thresholding method is proposed using fuzzy entropy and bat algorithm.We test the performance of the proposed method on some natural and infrared images.The proposed method can stably converge to optimal threshold with high efficiency.The proposed method outperforms some heuristic algorithm, such as GA, PSO, ACO, ABC. Image segmentation is a very significant process in image analysis. Much effort based on thresholding has been made on this field as it is simple and intuitive, commonly used thresholding approaches are to optimize a criterion such as between-class variance or entropy for seeking appropriate threshold values. However, a mass of computational cost is needed and efficiency is broken down as an exhaustive search is utilized for finding the optimal thresholds, which results in application of evolutionary algorithm and swarm intelligence to obtain the optimal thresholds. This paper considers image thresholding as a constrained optimization problem and optimal thresholds for 1-level or multi-level thresholding in an image are acquired by maximizing the fuzzy entropy via a newly proposed bat algorithm. The optimal thresholding is achieved through the convergence of bat algorithm. The proposed method has been tested on some natural and infrared images. The results are compared with the fuzzy entropy based methods that are optimized by artificial bee colony algorithm (ABC), genetic algorithm (GA), particle swarm optimization (PSO) and ant colony optimization (ACO); moreover, they are also compared with thresholding methods based on criteria of between-class variance and Kapur's entropy optimized by bat algorithm. It is demonstrated that the proposed method is robust, adaptive, encouraging on the score of CPU time and exhibits the better performance than other methods involved in the paper in terms of objective function values.

Fuzzy entropy based optimal thresholding using bat algorithm

A band selection method for airborne hyperspectral image based on chaotic binary coded gravitational search algorithm

Image enhancement is an important procedure of image processing and analysis This paper presents a new technique using a modified measure and blending of cuckoo search and particle swarm optimization (CS-PSO) for low contrast images to enhance image adaptively In this way, contrast enhancement is obtained by global transformation of the input intensities; it employs incomplete Beta function as the transformation function and a novel criterion for measuring image quality considering three factors which are threshold, entropy value, and gray-level probability density of the image The enhancement process is a nonlinear optimization problem with several constraints CS-PSO is utilized to maximize the objective fitness criterion in order to enhance the contrast and detail in an image by adapting the parameters of a novel extension to a local enhancement technique The performance of the proposed method has been compared with other existing techniques such as linear contrast stretching, histogram equalization, and evolutionary computing based image enhancement methods like backtracking search algorithm, differential search algorithm, genetic algorithm, and particle swarm optimization in terms of processing time and image quality Experimental results demonstrate that the proposed method is robust and adaptive and exhibits the better performance than other methods involved in the paper

/pdf/an-adaptive-image-enhancement-technique-by-combining-cuckoo-3i1mjnk6rl.pdf

Mingwei Wang

Papers

A feature selection method based on modified binary coded ant colony optimization algorithm

Remote sensing image classification based on the optimal support vector machine and modified binary coded ant colony optimization algorithm

Fuzzy entropy based optimal thresholding using bat algorithm

A band selection method for airborne hyperspectral image based on chaotic binary coded gravitational search algorithm

An adaptive image enhancement technique by combining cuckoo search and particle swarm optimization algorithm