Applying Particle Swarm Optimization to Transfer Function Specification for Direct Volume Rendering

2009 ◽  
Author(s):  
Kenli Li ◽  
Rui Qi ◽  
Degui Xiao ◽  
Lei Yang ◽  
Zhiyong Li
Keyword(s):  
Particle Swarm Optimization ◽  
Transfer Function ◽  
Volume Rendering ◽  
Particle Swarm ◽  
Direct Volume Rendering ◽  
Swarm Optimization

scholarly journals A New Hybrid Particle Swarm Optimization and Greedy for 0-1 Knapsack Problem

2016 ◽  
Vol 1 (3) ◽  
pp. 411 ◽  
Author(s):  
Phuong Hoai Nguyen ◽  
Dong Wang ◽  
Tung Khac Truong
Keyword(s):  
Particle Swarm Optimization ◽  
Transfer Function ◽  
Knapsack Problem ◽  
Binary Code ◽  
Particle Swarm ◽  
Superior Performance ◽  
Binary Particle Swarm Optimization ◽  
Swarm Optimization ◽  
Greedy Strategy ◽  
Hybrid Particle Swarm Optimization

This paper proposes a new binary particle swarm optimization with a greedy strategy to solve 0-1 knapsack problem. Two constraint handling techniques are consider to cooperation with binary particle swarm optimization that are penalty function and greedy. The sigmoid transfer function is used to convert real code to binary code. The experimental results have proven the superior performance of the proposed algorithm.

A Complicated Transfer Design Method Based on Particle Swarm Optimization

2015 ◽  
Vol 729 ◽  
pp. 208-212
Author(s):  
Xiao Ling Yao ◽  
Yan Ni Wang
Keyword(s):  
Particle Swarm Optimization ◽  
Transfer Function ◽  
Design Process ◽  
Design Problem ◽  
Evaluation Method ◽  
Design Method ◽  
Particle Swarm ◽  
Swarm Optimization ◽  
Function Design ◽  
Transfer Function Design

Based on the simple transfer function design, this thesis presents a technology for complicated transfer function design. It converts complicated transfer function design problem into the fusing of several simple transfer function. The keystone is to formulate the transfer function fusing problem into searching for optimal fusing proportion, and to generate the new fusing proportion using a similarity evaluation method, which is based on expectation fitness. To a large extent, it simplifies the design process of complicated transfer function.

Automatic View Selection Algorithm Based on Particle Swarm Optimization

2014 ◽  
Vol 687-691 ◽  
pp. 1399-1403
Author(s):  
Xiao Ling Yao ◽  
Yan Ni Wang
Keyword(s):  
Particle Swarm Optimization ◽  
Transfer Function ◽  
Optimization Problem ◽  
Particle Swarm ◽  
Selection Algorithm ◽  
Swarm Optimization ◽  
Optimal Position ◽  
Viewpoint Selection ◽  
View Selection ◽  
Interesting Part

This paper proposes an automatic viewpoint selection algorithm based on the particle swarm optimization. The method introduces particle swarm optimization algorithm into the design of transfer function and viewpoint selection. By the method, the search for the transfer function and the optimal viewpoint are redeveloped as a global optimization problem to reduce the reluctant computations and interactions. And the image sequence focuses on the interesting part and displays the objects on the optimal position.

Sign in / Sign up

Export Citation Format

Share Document