A Comparison of Some Nature-Inspired Optimization Metaheuristics Applied in Biomedical Image Registration

2018 ◽  
Vol 57 (05/06) ◽  
pp. 280-286 ◽  
Author(s):  
Silviu Bejinariu ◽  
Hariton Costin
Keyword(s):  
Image Registration ◽  
Optimization Problems ◽  
Search Algorithm ◽  
Evolutionary Process ◽  
Optimal Solution ◽  
Machine Learning Algorithms ◽  
Swarm Optimization ◽  
Biomedical Image ◽  
Biomedical Image Registration ◽  
Nature Inspired Algorithms

Computational Intelligence Re-meets Medical Image Processing Analysis of Machine Learning Algorithms for Diagnosis of Diffuse Lung Diseases Background In the last decades, new optimization methods based on the nature's intelligence were developed. These metaheuristics can find a nearly optimal solution faster than other traditional algorithms even for high-dimensional optimization problems. All these algorithms have a similar structure, the difference being made by the strategies used during the evolutionary process. Objectives A set of three nature-inspired algorithms, including Cuckoo Search algorithm (CSA), Particle Swarm Optimization (PSO), and Multi-Swarm Optimization (MSO), are compared in terms of strategies used in the evolutionary process and also of the results obtained in case of particular optimization problems. Methods The three algorithms were applied for biomedical image registration (IR) and compared in terms of performances. The expected geometric transform has seven parameters and is composed of rotation against a point in the image, scaling on both axis with different factors, and translation. Results The evaluation consisted of 25 runs of each IR procedure and revealed that (1) PSO offers the most precise solutions; (2) CSA and MSO are more stable in the sense that their solutions are less scattered; and (3) MSO and PSO have a higher convergence speed. Conclusions The evaluation of PSO, MSO, and CSA was made for multimodal IR problems. It is possible that for other optimization problems and also for other settings of the optimization algorithms, the results can be different. Therefore, the nature-inspired algorithms demonstrated their efficacy for this class of optimization problems.

INTRODUCING TENSOR ANALYSIS FOR BIOMEDICAL IMAGE REGISTRATION

2018 ◽  
Author(s):  
Wilian Fiirst ◽  
José Montero ◽  
ROGER RESMINI ◽  
Anselmo Antunes Montenegro ◽  
Trueman McHenry ◽  
...  
Keyword(s):  
Image Registration ◽  
Tensor Analysis ◽  
Biomedical Image ◽  
Biomedical Image Registration

Lower limb exoskeleton robots’ dynamics parameters identification based on improved beetle swarm optimization algorithm

Robotica ◽  
2022 ◽  
pp. 1-16
Author(s):  
Peng Zhang ◽  
Junxia Zhang
Keyword(s):  
Optimization Algorithm ◽  
Robot Control ◽  
Search Algorithm ◽  
Optimal Solution ◽  
Global Optimum ◽  
Identification Accuracy ◽  
Dynamic Parameters ◽  
Dynamics Modeling ◽  
Swarm Optimization ◽  
Exoskeleton Robot

Abstract Efficient and high-precision identification of dynamic parameters is the basis of model-based robot control. Firstly, this paper designed the structure and control system of the developed lower extremity exoskeleton robot. The dynamics modeling of the exoskeleton robot is performed. The minimum parameter set of the identified parameters is determined. The dynamic model is linearized based on the parallel axis theory. Based on the beetle antennae search algorithm (BAS) and particle swarm optimization (PSO), the beetle swarm optimization algorithm (BSO) was designed and applied to the identification of dynamic parameters. The update rule of each particle originates from BAS, and there is an individual’s judgment on the environment space in each iteration. This method does not rely on the historical best solution in the PSO and the current global optimal solution of the individual particle, thereby reducing the number of iterations and improving the search speed and accuracy. Four groups of test functions with different characteristics were used to verify the performance of the proposed algorithm. Experimental results show that the BSO algorithm has a good balance between exploration and exploitation capabilities to promote the beetle to move to the global optimum. Besides, the test was carried out on the exoskeleton dynamics model. This method can obtain independent dynamic parameters and achieve ideal identification accuracy. The prediction result of torque based on the identification method is in good agreement with the ideal torque of the robot control.

Stellar Mass Black Hole for Engineering Optimization

2017 ◽  
pp. 62-90
Author(s):  
Premalatha Kandhasamy ◽  
Balamurugan R ◽  
Kannimuthu S
Keyword(s):  
Black Hole ◽  
Artificial Bee Colony ◽  
Optimization Problems ◽  
Optimal Solution ◽  
Cuckoo Search ◽  
Optimization Method ◽  
Stellar Mass ◽  
Bee Colony ◽  
Nature Inspired Algorithms ◽  
The Universe

In recent years, nature-inspired algorithms have been popular due to the fact that many real-world optimization problems are increasingly large, complex and dynamic. By reasons of the size and complexity of the problems, it is necessary to develop an optimization method whose efficiency is measured by finding the near optimal solution within a reasonable amount of time. A black hole is an object that has enough masses in a small enough volume that its gravitational force is strong enough to prevent light or anything else from escaping. Stellar mass Black hole Optimization (SBO) is a novel optimization algorithm inspired from the property of the gravity's relentless pull of black holes which are presented in the Universe. In this paper SBO algorithm is tested on benchmark optimization test functions and compared with the Cuckoo Search, Particle Swarm Optimization and Artificial Bee Colony systems. The experiment results show that the SBO outperforms the existing methods.

Modified Sub-Population Based Heat Transfer Search Algorithm for Structural Optimization

2017 ◽  
Vol 8 (3) ◽  
pp. 1-23 ◽  
Author(s):  
Ghanshyam Tejani ◽  
Vimal Savsani ◽  
Vivek Patel
Keyword(s):  
Heat Transfer ◽  
Optimization Problems ◽  
Search Algorithm ◽  
Optimal Solution ◽  
Population Based ◽  
Truss Optimization ◽  
Feasible Region ◽  
Frequency Constraints ◽  
Local Optimal Solution ◽  
Better Than

In this study, a modified heat transfer search (MHTS) algorithm is proposed by incorporating sub-population based simultaneous heat transfer modes viz. conduction, convection, and radiation in the basic HTS algorithm. However, the basic HTS algorithm considers only one of the modes of heat transfer for each generation. The multiple natural frequency constraints in truss optimization problems can improve the dynamic behavior of the structure and prevent undesirable vibrations. However, shape and size variables subjected to frequency constraints are difficult to handle due to the complexity of its feasible region, which is non-linear, non-convex, implicit, and often converging to the local optimal solution. The viability and effectiveness of the HTS and MHTS algorithms are investigated by six standard trusses problems. The solutions illustrate that the MHTS algorithm performs better than the HTS algorithm.

Runtime analysis of discrete particle swarm optimization algorithms: A survey

2019 ◽  
Vol 61 (4) ◽  
pp. 177-185
Author(s):  
Moritz Mühlenthaler ◽  
Alexander Raß
Keyword(s):  
Particle Swarm Optimization ◽  
Optimization Problems ◽  
Particle Swarm ◽  
Optimal Solution ◽  
Pso Algorithm ◽  
Upper And Lower Bounds ◽  
Swarm Optimization ◽  
Randomized Search Heuristics ◽  
Recent Developments ◽  
Randomized Search

Abstract A discrete particle swarm optimization (PSO) algorithm is a randomized search heuristic for discrete optimization problems. A fundamental question about randomized search heuristics is how long it takes, in expectation, until an optimal solution is found. We give an overview of recent developments related to this question for discrete PSO algorithms. In particular, we give a comparison of known upper and lower bounds of expected runtimes and briefly discuss the techniques used to obtain these bounds.

scholarly journals Intelligent discrete particle swarm optimization for multiprocessor task scheduling problem

2016 ◽  
Vol 11 (1) ◽  
pp. 58-67 ◽  
Author(s):  
S Sarathambekai ◽  
K Umamaheswari
Keyword(s):  
Particle Swarm Optimization ◽  
Optimization Algorithm ◽  
Particle Swarm Optimization Algorithm ◽  
Optimization Problems ◽  
Particle Swarm ◽  
Optimal Solution ◽  
Initial Population ◽  
Discrete Particle Swarm Optimization ◽  
Swarm Optimization ◽  
Discrete Particle

Discrete particle swarm optimization is one of the most recently developed population-based meta-heuristic optimization algorithm in swarm intelligence that can be used in any discrete optimization problems. This article presents a discrete particle swarm optimization algorithm to efficiently schedule the tasks in the heterogeneous multiprocessor systems. All the optimization algorithms share a common algorithmic step, namely population initialization. It plays a significant role because it can affect the convergence speed and also the quality of the final solution. The random initialization is the most commonly used method in majority of the evolutionary algorithms to generate solutions in the initial population. The initial good quality solutions can facilitate the algorithm to locate the optimal solution or else it may prevent the algorithm from finding the optimal solution. Intelligence should be incorporated to generate the initial population in order to avoid the premature convergence. This article presents a discrete particle swarm optimization algorithm, which incorporates opposition-based technique to generate initial population and greedy algorithm to balance the load of the processors. Make span, flow time, and reliability cost are three different measures used to evaluate the efficiency of the proposed discrete particle swarm optimization algorithm for scheduling independent tasks in distributed systems. Computational simulations are done based on a set of benchmark instances to assess the performance of the proposed algorithm.

Sign in / Sign up

Export Citation Format

Share Document