428 research outputs found

    A hybrid swarm intelligence feature selection approach based on time-varying transition parameter

    Get PDF
    Feature selection aims to reduce the dimensionality of a dataset by removing superfluous attributes. This paper proposes a hybrid approach for feature selection problem by combining particle swarm optimization (PSO), grey wolf optimization (GWO), and tournament selection (TS) mechanism. Particle swarm enhances the diversification at the beginning of the search mechanism, grey wolf enhances the intensification at the end of the search mechanism, while tournament selection maintains diversification not only at the beginning but also at the end of the search process to achieve local optima avoidance. A time-varying transition parameter and a random variable are used to select either particle swarm, grey wolf, or tournament selection techniques during search process. This paper proposes different variants of this approach based on S-shaped and V-shaped transfer functions (TFs) to convert continuous solutions to binaries. These variants are named hybrid tournament grey wolf particle swarm (HTGWPS), followed by S or V letter to indicate the TF type, and followed by the TF’s number. These variants were evaluated using nine high-dimensional datasets. The results revealed that HTGWPS-V1 outperformed other V’s variants, PSO, and GWO on 78% of the datasets based on maximum classification accuracy obtained by a minimal feature subset. Also, HTGWPS-V1 outperformed six well-known-metaheuristics on 67% of the datasets

    An improved jellyfish algorithm for multilevel thresholding of magnetic resonance brain image segmentations

    Get PDF
    Image segmentation is vital when analyzing medical images, especially magnetic resonance (MR) images of the brain. Recently, several image segmentation techniques based onmultilevel thresholding have been proposed for medical image segmentation; however, the algorithms become trapped in local minima and have low convergence speeds, particularly as the number of threshold levels increases. Consequently, in this paper, we develop a new multilevel thresholding image segmentation technique based on the jellyfish search algorithm (JSA) (an optimizer).We modify the JSA to prevent descents into local minima, and we accelerate convergence toward optimal solutions. The improvement is achieved by applying two novel strategies: Rankingbased updating and an adaptive method. Ranking-based updating is used to replace undesirable solutions with other solutions generated by a novel updating scheme that improves the qualities of the removed solutions. We develop a new adaptive strategy to exploit the ability of the JSA to find a best-so-far solution; we allow a small amount of exploration to avoid descents into local minima. The two strategies are integrated with the JSA to produce an improved JSA (IJSA) that optimally thresholds brain MR images. To compare the performances of the IJSA and JSA, seven brain MR images were segmented at threshold levels of 3, 4, 5, 6, 7, 8, 10, 15, 20, 25, and 30. IJSA was compared with several other recent image segmentation algorithms, including the improved and standard marine predator algorithms, the modified salp and standard salp swarm algorithms, the equilibrium optimizer, and the standard JSA in terms of fitness, the Structured Similarity Index Metric (SSIM), the peak signal-to-noise ratio (PSNR), the standard deviation (SD), and the Features Similarity IndexMetric (FSIM). The experimental outcomes and theWilcoxon rank-sum test demonstrate the superiority of the proposed algorithm in terms of the FSIM, the PSNR, the objective values, and the SD; in terms of the SSIM, IJSA was competitive with the others.</p

    A multilevel image thresholding based on Hybrid Salp Swarm algorithm and Fuzzy Entropy

    Get PDF
    The image segmentation techniques based on multi-level threshold value received lot of attention in recent years. It is because they can be used as a pre-processing step in complex image processing applications. The main problem in identifying the suitable threshold values occurs when classical image segmentation methods are employed. The swarm intelligence (SI) technique is used to improve multi-level threshold image (MTI) segmentation performance. SI technique simulates the social behaviors of swarm ecosystem, such as the behavior exhibited by different birds, animals etc. Based on SI techniques, we developed an alternative MTI segmentation method by using a modified version of the salp swarm algorithm (SSA). The modified algorithm improves the performance of various operators of the moth-flame optimization (MFO) algorithm to address the limitations of traditional SSA algorithm. This results in improved performance of SSA algorithm. In addition, the fuzzy entropy is used as objective function to determine the quality of the solutions. To evaluate the performance of the proposed methodology, we evaluated our techniques on CEC2005 benchmark and Berkeley dataset. Our evaluation results demonstrate that SSAMFO outperforms traditional SSA and MFO algorithms, in terms of PSNR, SSIM and fitness value

    Chaos Embed Marine Predator (CMPA) Algorithm for Feature Selection

    Get PDF
    Data mining applications are growing with the availability of large data; sometimes, handling large data is also a typical task. Segregation of the data for extracting useful information is inevitable for designing modern technologies. Considering this fact, the work proposes a chaos embed marine predator algorithm (CMPA) for feature selection. The optimization routine is designed with the aim of maximizing the classification accuracy with the optimal number of features selected. The well-known benchmark data sets have been chosen for validating the performance of the proposed algorithm. A comparative analysis of the performance with some well-known algorithms advocates the applicability of the proposed algorithm. Further, the analysis has been extended to some of the well-known chaotic algorithms; first, the binary versions of these algorithms are developed and then the comparative analysis of the performance has been conducted on the basis of mean features selected, classification accuracy obtained and fitness function values. Statistical significance tests have also been conducted to establish the significance of the proposed algorithm

    A Survey on Natural Inspired Computing (NIC): Algorithms and Challenges

    Get PDF
    Nature employs interactive images to incorporate end users2019; awareness and implication aptitude form inspirations into statistical/algorithmic information investigation procedures. Nature-inspired Computing (NIC) is an energetic research exploration field that has appliances in various areas, like as optimization, computational intelligence, evolutionary computation, multi-objective optimization, data mining, resource management, robotics, transportation and vehicle routing. The promising playing field of NIC focal point on managing substantial, assorted and self-motivated dimensions of information all the way through the incorporation of individual opinion by means of inspiration as well as communication methods in the study practices. In addition, it is the permutation of correlated study parts together with Bio-inspired computing, Artificial Intelligence and Machine learning that revolves efficient diagnostics interested in a competent pasture of study. This article intend at given that a summary of Nature-inspired Computing, its capacity and concepts and particulars the most significant scientific study algorithms in the field

    Enhancing Medical Imaging with Swarm Intelligence Algorithms

    Get PDF
    Medical imaging serves as an indispensable tool for the diagnosis and continuous monitoring of a diverse array of health conditions. A recent and exciting development in this field is the integration of Swarm Intelligence (SI) algorithms, which draw inspiration from the collective behaviors observed in social insects. This collaborative effort between nature and technology is progressively transforming medical image analysis, elevating both its quality and efficiency. In this book chapter we have presented various SI optimization algorithms like ACO, BCO, FA, FSA and WOA in detail. By exploring these algorithms, we aim to provide an in-depth understanding of their respective benefits and limitations when applied to medical image analysis. This knowledge empowers practitioners to choose the most appropriate algorithm for specific tasks, ensuring optimal outcomes. Furthermore, we shed light on SI-Based Segmentation methodologies, elucidating the advantages and constraints associated with these approaches. The ability of SI algorithms to innovate in the realms of image segmentation, feature extraction, and classification is emphasized, with a focus on their potential to enhance diagnostic accuracy and elevate the quality of patient care. One of the most exciting prospects on the horizon is the amalgamation of SI with cutting-edge technologies like deep learning and big data analytics. This union has the potential to revolutionize medical imaging by providing solutions that are not only more accurate and efficient but also highly clinically relevant. As these developments continue to unfold, the synergy between SI and emerging technologies promises to reshape the medical imaging landscape, ultimately enhancing patient care and improving healthcare outcomes in unprecedented way

    Machine Learning and Deep Learning Approaches for Brain Disease Diagnosis : Principles and Recent Advances

    Get PDF
    This work was supported in part by the National Research Foundation of Korea-Grant funded by the Korean Government (Ministry of Science and ICT) under Grant NRF 2020R1A2B5B02002478, and in part by Sejong University through its Faculty Research Program under Grant 20212023.Peer reviewedPublisher PD

    Comprehensive Taxonomies of Nature- and Bio-inspired Optimization: Inspiration Versus Algorithmic Behavior, Critical Analysis Recommendations

    Get PDF
    In recent algorithmic family simulates different biological processes observed in Nature in order to efficiently address complex optimization problems. In the last years the number of bio-inspired optimization approaches in literature has grown considerably, reaching unprecedented levels that dark the future prospects of this field of research. This paper addresses this problem by proposing two comprehensive, principle-based taxonomies that allow researchers to organize existing and future algorithmic developments into well-defined categories, considering two different criteria: the source of inspiration and the behavior of each algorithm. Using these taxonomies we review more than three hundred publications dealing with nature- inspired and bio-inspired algorithms, and proposals falling within each of these categories are examined, leading to a critical summary of design trends and similarities between them, and the identification of the most similar classical algorithm for each reviewed paper. From our analysis we conclude that a poor relationship is often found between the natural inspiration of an algorithm and its behavior. Furthermore, similarities in terms of behavior between different algorithms are greater than what is claimed in their public disclosure: specifically, we show that more than one-third of the reviewed bio-inspired solvers are versions of classical algorithms. Grounded on the conclusions of our critical analysis, we give several recommendations and points of improvement for better methodological practices in this active and growing research field

    RETRACTED: PBTNet: A New Computer-Aided Diagnosis System for Detecting Primary Brain Tumors

    Get PDF
    Brain tumors are among the leading human killers. There are over 120 different types of brain tumors, but they mainly fall into two groups: primary brain tumors and metastatic brain tumors. Primary brain tumors develop from normal brain cells. Early and accurate detection of primary brain tumors is vital for the treatment of this disease. Magnetic resonance imaging is the most common method to diagnose brain diseases, but the manual interpretation of the images suffers from high inter-observer variance. In this paper, we presented a new computer-aided diagnosis system named PBTNet for detecting primary brain tumors in magnetic resonance images. A pre-trained ResNet-18 was selected as the backbone model in our PBTNet, but it was fine-tuned only for feature extraction. Then, three randomized neural networks, Schmidt neural network, random vector functional-link, and extreme learning machine served as the classifiers in the PBTNet, which were trained with the features and their labels. The final predictions of the PBTNet were generated by the ensemble of the outputs from the three classifiers. 5-fold cross-validation was employed to evaluate the classification performance of the PBTNet, and experimental results demonstrated that the proposed PBTNet was an effective tool for the diagnosis of primary brain tumors

    The Medical Segmentation Decathlon

    Get PDF
    International challenges have become the de facto standard for comparative assessment of image analysis algorithms given a specific task. Segmentation is so far the most widely investigated medical image processing task, but the various segmentation challenges have typically been organized in isolation, such that algorithm development was driven by the need to tackle a single specific clinical problem. We hypothesized that a method capable of performing well on multiple tasks will generalize well to a previously unseen task and potentially outperform a custom-designed solution. To investigate the hypothesis, we organized the Medical Segmentation Decathlon (MSD) - a biomedical image analysis challenge, in which algorithms compete in a multitude of both tasks and modalities. The underlying data set was designed to explore the axis of difficulties typically encountered when dealing with medical images, such as small data sets, unbalanced labels, multi-site data and small objects. The MSD challenge confirmed that algorithms with a consistent good performance on a set of tasks preserved their good average performance on a different set of previously unseen tasks. Moreover, by monitoring the MSD winner for two years, we found that this algorithm continued generalizing well to a wide range of other clinical problems, further confirming our hypothesis. Three main conclusions can be drawn from this study: (1) state-of-the-art image segmentation algorithms are mature, accurate, and generalize well when retrained on unseen tasks; (2) consistent algorithmic performance across multiple tasks is a strong surrogate of algorithmic generalizability; (3) the training of accurate AI segmentation models is now commoditized to non AI experts
    • 

    corecore