ABSTRACT
This research uses bionic algorithms mapping the number of visits of particles for the design of transfer functions. For a given voxel, its opacity is determined by the number of particles in it at the present and influenced by the number of particles passing it in the past. The proposed system successfully extract features such as bones or issues in the volume data. Initially, the agents scatter around the volume data and are attracted by the featured areas. The movement of agents are governed by global optimization, avoiding trial and error efforts to come up with a good transfer function design for a given volume data.
Index Terms
- Particle swarm density for transfer function design
Recommendations
Chaotic dynamic weight particle swarm optimization for numerical function optimization
Particle swarm optimization (PSO), which is inspired by social behaviors of individuals in bird swarms, is a nature-inspired and global optimization algorithm. The PSO method is easy to implement and has shown good performance for many real-world ...
Euclidean Particle Swarm Optimization
ICINIS '09: Proceedings of the 2009 Second International Conference on Intelligent Networks and Intelligent SystemsParticle swarm optimization (PSO) is a swarm intelligence algorithm, has been successfully applied to many engineering optimization problems and shown its high search speed in these applications. However, as the dimension and the number of local optima ...
Multiswarm particle swarm optimization with transfer of the best particle
We propose an improved algorithm, for a multiswarm particle swarm optimization with transfer of the best particle called BMPSO. In the proposed algorithm, we introduce parasitism into the standard particle swarm algorithm (PSO) in order to balance ...
Comments