Abstract:

The robustness of the particle swarm system is great, which is very helpful for solving ill?conditioned problems such as image reconstruction. However, the large number of pixels in the reconstructed image leads to a large dimension of particle and it is difficult for the particle to achieve the optimal solution in the optimization process. In order to solve this problem, a constraint is added to the particle position, imaging by Tikhonov regularization algorithm is used as the reference of particle position. The search for particles is constrained to the range of Tikhonov regularization algorithm reconstructs the image. Using the penalty function to solve the constraint problem to improve the particle search speed. Linearly decreasing weights as inertial weights for particle swarms optimization to realize the adaptive dynamic adjustment of the inertia weight and improve the flexibility of the algorithm; the chaotic operator is added to the position search process of the particle swarm optimization, when the particle falls into the local optimum, the chaotic variable will fluctuate within a certain range, reducing the missed rate of the optimal solution. The simulation results show that The improved particle swarm algorithm is more accurate and efficient than the traditional LBP algorithm and Tikhonov regularization algorithm.

Key words: Electrical capacitance tomography, Constrained particle swarm optimization, Penalty function, Chaos operator, Inertial dynamic weigh

摘要：

粒子群工作时系统的鲁棒性很高，有助于解决图像重建的病态问题。但是，重建图像的像素较大，导致粒子维度较大，粒子在寻优过程中很难达到最优解。为了解决这一问题，对粒子的位置加入约束条件，以Tikhonov正则化图像重建算法成像作为粒子位置参考，约束粒子在Tikhonov正则化算法重建图像的一定范围内搜索，并用罚函数求解，提高粒子搜索速度；粒子群的惯性权重采用线性递减权值，从而实现惯性权值的自适应动态调整，提高算法的灵活性；将混沌算子加入粒子群位置搜索过程中，当粒子陷入局部最优时，混沌变量在一定范围内波动，降低最优解的错失率。仿真实验结果表明，与传统的LBP算法和Tikhonov算法相比，改进的粒子群算法的电容层析成像图像重建更精确，效率更高。

关键词: 电容层析成像, 约束粒子群算法, 罚函数, 混沌算子, 惯性动态权值