.png){kind=icon}
.png){kind=icon}
Return
Efficient Filter Generation Based on Particle Swarm Optimization Algorithm
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2021.3056464.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The evaluation of Hankel integration is an important part in the interpretation of electromagnetic (EM) data, especially in physical and geophysical applications. The digital linear filter (DLF) method is commonly applied. For an optimal digital filter design based on matrix inversion, it requires optimization over the model space of the spacing and shift. This is typically obtained by a grid search algorithm on gradually refined grids. In this paper, we apply a particle swarm algorithm to optimize the spacing and shift in the model space. In this algorithm, we use a group of particles to search the model space and do not have to grid the model space sequentially to finer meshes. It has been applied to search the optimal spacing and shift for analytical function pairs, indicating a fast convergence. The performance of the obtained 201-point filter is examined and compared with other published filters based on analytic function pairs and controlled source electromagnetic (CSEM) applications. The results indicate that the proposed 201-point filters have a good numerical performance in terms of accuracy over a large offset range.
Keywords:
Transforms
Particle swarm optimization
Mathematical model
Kernel
Electromagnetics
Convolution
Optimization
Electromagnetics
transforms
digital filters
Hankel transform
Journal
IF:
3.6
Papers:
9.8W
Citations:
29.4W