This paper presents an automated retinal blood vessels segmentation
approach based on flower pollination search algorithm (FPSA). The flower pollination
search is a new algorithm based on the flower pollination process of flowering
plants. The FPSA searches for the optimal clustering of the given retinal
image into compact clusters under some constrains. Shape features are used to
further enhance the clustering results using local search method. The proposed
retinal blood vessels approach is tested on a publicly available databases DRIVE
a of retinal images. The results demonstrate that the performance of the proposed
approach is comparable with state of the art techniques in terms of accuracy, sensitivity
and specificity.

This paper presents a multi-objective retinal blood vessels localization approach based on flower pollination search algorithm (FPSA) and pattern search (PS) algorithm. FPSA is a new evolutionary algorithm based on the flower pollination process of flowering plants. The proposed multi-objective fitness function uses the flower pollination search algorithm (FPSA) that searches for the optimal clustering of the given retinal image into compact clusters under some constraints. Pattern search (PS) as local search method is then applied to further enhance the segmentation results using another objective function based on shape features. The proposed approach for retinal blood vessels localization is applied on public database namely DRIVE data set. Results demonstrate that the performance of the proposed approach is comparable with state of the art techniques in terms of accuracy, sensitivity, and specificity with many extendable features.

Feature sets are always dependent, redundant and noisy in almost all application domains. These problems in The data always declined the performance of any given classifier as it make it difficult for the training phase to converge effectively and it affect also the running time for classification at operation and training time. In this work a system for feature selection based on multi-objective gray wolf optimization is proposed. The existing methods for feature selection either depend on the data description; filter-based methods, or depend on the classifier used; wrapper approaches. These two main approaches lakes of good performance and data description in the same system. In this work gray wolf optimization; a swarm-based optimization method, was employed to search the space of features to find optimal feature subset that both achieve data description with minor redundancy and keeps classification performance. At the early stages of optimization gray wolf uses filter-based principles to find a set of solutions with minor redundancy described by mutual information. At later stages of optimization wrapper approach is employed guided by classifier performance to further enhance the obtained solutions towards better classification performance. The proposed method is assessed against different common searching methods such as particle swarm optimization and genetic algorithm and also was assessed against different single objective systems. The proposed system achieves an advance over other searching methods and over the other single objective methods by testing over different UCI data sets and achieve much robustness and stability.

In this paper, binary variants of the ant lion optimizer (ALO) are proposed and used to select the optimal feature subset for classification purposes in wrapper-mode. ALO is one of the recently bio-inspired optimization techniques that imitates the hunting process of ant lions. Moreover, ALO balances exploration and exploitation using a single operator that can adaptively searches the domain of solutions for the optimal solution. Binary variants introduced here are performed using two different approaches. The first approach takes only the inspiration of ALO operators and makes the corresponding binary operators. In the second approach, the native ALO is applied while its continuous steps are threshold using suitable threshold function after squashing them. The proposed approaches for binary ant lion optimizer (BALO) are utilized in the feature selection domain for finding feature subset that maximizing the classification performance while minimizing the number of selected features. The proposed binary algorithms were compared to three common optimization algorithms hired in this domain namely particle swarm optimizer (PSO), genetic algorithms (GAs), binary bat algorithm (BBA), as well as the native ALO. A set of assessment indicators is used to evaluate and compare the different methods over 21 data sets from the UCI repository. Results prove the capability of the proposed binary algorithms to search the feature space for optimal feature combinations regardless of the initialization and the used stochastic operators.