Nature Inspired Evolutionary Swarm Optimizers for Biomedical Image and Signal Processing -- A Systematic Review

• URL: http://arxiv.org/abs/2311.12830v1
• Date: Mon, 2 Oct 2023 04:52:46 GMT
• Title: Nature Inspired Evolutionary Swarm Optimizers for Biomedical Image and Signal Processing -- A Systematic Review
• Authors: Subhrangshu Adhikary
• Abstract summary: The paper reviews 28 latest peer-reviewed relevant articles and 26 nature-inspired algorithms. It segregates them into thoroughly explored, lesser explored and unexplored categories intending to help readers understand the reliability and exploration stage of each of these algorithms.
• Score: 0.0
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• Abstract: The challenge of finding a global optimum in a solution search space with limited resources and higher accuracy has given rise to several optimization algorithms. Generally, the gradient-based optimizers converge to the global solution very accurately, but they often require a large number of iterations to find the solution. Researchers took inspiration from different natural phenomena and behaviours of many living organisms to develop algorithms that can solve optimization problems much quicker with high accuracy. These algorithms are called nature-inspired meta-heuristic optimization algorithms. These can be used for denoising signals, updating weights in a deep neural network, and many other cases. In the state-of-the-art, there are no systematic reviews available that have discussed the applications of nature-inspired algorithms on biomedical signal processing. The paper solves that gap by discussing the applications of such algorithms in biomedical signal processing and also provides an updated survey of the application of these algorithms in biomedical image processing. The paper reviews 28 latest peer-reviewed relevant articles and 26 nature-inspired algorithms and segregates them into thoroughly explored, lesser explored and unexplored categories intending to help readers understand the reliability and exploration stage of each of these algorithms.

Related papers

• What is Metaheuristics? A Primer for the Epidemiologists [1.2783241540121182]
  This paper reviews the basic BAT algorithm and its variants, including their applications in various fields. As a specific application, we apply the BAT algorithm to a biostatistical estimation problem and show it has some clear advantages over existing algorithms.
  arXiv  Detail & Related papers  (2024-10-26T02:13:00Z)
• A Generalized Evolutionary Metaheuristic (GEM) Algorithm for Engineering Optimization [1.6589012298747952]
  A major trend in recent years is the use of nature-inspired metaheustic algorithms (NIMA) There are over 540 algorithms in the literature, and there is no unified framework to understand the search mechanisms of different algorithms. We propose a generalized evolutionary metaheuristic algorithm to unify more than 20 different algorithms.
  arXiv  Detail & Related papers  (2024-07-02T09:55:15Z)
• Introductory Studies of Swarm Intelligence Techniques [1.2930503923129208]
  Swarm intelligence involves the collective study of individuals and their mutual interactions leading to intelligent behavior of the swarm. The chapter presents various population-based SI algorithms, their fundamental structures along with their mathematical models.
  arXiv  Detail & Related papers  (2022-09-26T16:29:55Z)
• Improving RNA Secondary Structure Design using Deep Reinforcement Learning [69.63971634605797]
  We propose a new benchmark of applying reinforcement learning to RNA sequence design, in which the objective function is defined to be the free energy in the sequence's secondary structure. We show results of the ablation analysis that we do for these algorithms, as well as graphs indicating the algorithm's performance across batches.
  arXiv  Detail & Related papers  (2021-11-05T02:54:06Z)
• Deep Algorithm Unrolling for Biomedical Imaging [99.73317152134028]
  In this chapter, we review biomedical applications and breakthroughs via leveraging algorithm unrolling. We trace the origin of algorithm unrolling and provide a comprehensive tutorial on how to unroll iterative algorithms into deep networks. We conclude the chapter by discussing open challenges, and suggesting future research directions.
  arXiv  Detail & Related papers  (2021-08-15T01:06:26Z)
• Provably Faster Algorithms for Bilevel Optimization [54.83583213812667]
  Bilevel optimization has been widely applied in many important machine learning applications. We propose two new algorithms for bilevel optimization. We show that both algorithms achieve the complexity of $mathcalO(epsilon-1.5)$, which outperforms all existing algorithms by the order of magnitude.
  arXiv  Detail & Related papers  (2021-06-08T21:05:30Z)
• Nature-Inspired Optimization Algorithms: Research Direction and Survey [0.0]
  Nature-inspired algorithms are commonly used for solving the various optimization problems. We classify nature-inspired algorithms as natural evolution based, swarm intelligence based, biological based, science based and others. The purpose of this review is to present an exhaustive analysis of various nature-inspired algorithms based on its source of inspiration, basic operators, control parameters, features, variants and area of application where these algorithms have been successfully applied.
  arXiv  Detail & Related papers  (2021-02-08T06:03:36Z)
• A Survey On (Stochastic Fractal Search) Algorithm [0.0]
  This paper presents a metaheuristic algorithm called Fractal Search, inspired by the natural phenomenon of growth based on a mathematical concept called the fractal. This paper also focuses on the steps and some example applications of engineering design optimisation problems commonly used in the literature being applied to the proposed algorithm.
  arXiv  Detail & Related papers  (2021-01-25T22:44:04Z)
• Towards Optimally Efficient Tree Search with Deep Learning [76.64632985696237]
  This paper investigates the classical integer least-squares problem which estimates signals integer from linear models. The problem is NP-hard and often arises in diverse applications such as signal processing, bioinformatics, communications and machine learning. We propose a general hyper-accelerated tree search (HATS) algorithm by employing a deep neural network to estimate the optimal estimation for the underlying simplified memory-bounded A* algorithm.
  arXiv  Detail & Related papers  (2021-01-07T08:00:02Z)
• Community detection using fast low-cardinality semidefinite programming [94.4878715085334]
  We propose a new low-cardinality algorithm that generalizes the local update to maximize a semidefinite relaxation derived from Leiden-k-cut. This proposed algorithm is scalable, outperforms state-of-the-art algorithms, and outperforms in real-world time with little additional cost.
  arXiv  Detail & Related papers  (2020-12-04T15:46:30Z)
• Activation Relaxation: A Local Dynamical Approximation to Backpropagation in the Brain [62.997667081978825]
  Activation Relaxation (AR) is motivated by constructing the backpropagation gradient as the equilibrium point of a dynamical system. Our algorithm converges rapidly and robustly to the correct backpropagation gradients, requires only a single type of computational unit, and can operate on arbitrary computation graphs.
  arXiv  Detail & Related papers  (2020-09-11T11:56:34Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.