Application of DE algorithm and improved GVF Snake model in segmentation of PET image

Xiaojun Bi, Jing XiaoJournal of Image and Graphics 2011 · DOI

Abstract

Accurate lesion localization in Positron Emission Tomography (PET) imaging is essential for early diagnosis and treatment planning. However, traditional active contour (Snake) models often struggle with PET images due to high noise levels, low contrast, and complex concave lesion geometries. This paper presents a hybrid segmentation framework that integrates the Gradient Vector Flow (GVF) Snake model with the Differential Evolution (DE) algorithm. By utilizing GVF to expand the capture range and DE to perform global optimization, the proposed method effectively overcomes local optima and converges to irregular boundaries. Experimental validation on clinical brain PET scans shows that this approach achieves superior accuracy and computational efficiency compared to standard optimization techniques.

Introduction

Positron Emission Tomography (PET) is a vital tool in oncology and cardiology, yet its utility is often limited by the inherent quality of the images. PET scans typically exhibit low spatial resolution and significant noise, making the precise segmentation of lesions a challenging task.

Active contour models, or "Snakes," are widely used for image segmentation. These models treat the boundary as an elastic curve that evolves to minimize an energy functional. Despite their popularity, traditional Snakes face three critical issues:

  1. Sensitivity to Initialization: The initial contour must be placed very close to the target boundary to ensure convergence.
  2. The Concavity Problem: Standard image gradients often fail to pull the contour into deep "U-shaped" or concave regions.
  3. Local Optima: Noise and secondary edges can trap the Snake in a "good enough" but incorrect state.

Methodology

To address these limitations, we propose a multi-stage segmentation pipeline that combines local refinement with global optimization.

1. Preprocessing and GVF Evolution

The first step involves denoising the PET image using a Gaussian low-pass filter to mitigate the grainy artifacts characteristic of PET data. Subsequently, we replace the standard image gradient with Gradient Vector Flow (GVF). GVF generates a bidirectional force field that propagates edge information far into homogeneous regions. This significantly increases the "capture range," allowing the Snake to be initialized further from the target and effectively "flowing" into concave boundaries that traditional models would bridge over.

2. Differential Evolution (DE) Optimization

While GVF improves local convergence, it does not guarantee a global minimum. To prevent the contour from getting stuck in local optima caused by residual noise, we employ the Differential Evolution (DE) algorithm.

Flowchart of the proposed PET image segmentation algorithm combining GVF Snake and DE optimization.

As shown in the flowchart above, the DE algorithm treats discrete points on the GVF-derived contour as a population. Through iterative cycles of mutation, crossover, and selection, the algorithm searches the surrounding space for the configuration that minimizes the total energy of the Snake. This evolutionary process ensures that the final segmentation is the mathematically optimal fit for the lesion.

Results and Discussion

The proposed method was tested on a dataset of 30 clinical PET images ($128 \times 128$ pixels) featuring brain lesions. We compared our GVF-DE hybrid against standard GVF Snakes and Snakes optimized with Simulated Annealing (SA).

Accuracy and Robustness

The GVF-DE model consistently outperformed other methods in capturing complex, irregular boundaries. By combining the capture range of GVF with the global search capability of DE, the model demonstrated significantly reduced sensitivity to initial contour placement, making it more robust for clinical use.

Segmentation of a brain lesion in a clinical PET image using the proposed hybrid model.

Computational Efficiency

Efficiency is a critical factor in clinical workflows. Our experiments revealed that:

  • The GVF-DE method completed segmentation in approximately 25.72 seconds, with the DE optimization phase contributing only ~2 seconds to the total time.
  • In comparison, the Simulated Annealing (SA) approach took 32.66 seconds and often failed to reach the same level of accuracy.

Conclusion

The integration of Differential Evolution with the GVF Snake model provides a powerful solution for PET image segmentation. By leveraging GVF for its superior capture range and DE for its global optimization properties, the proposed method successfully handles the noise and geometric complexities of PET data. Future work will focus on automating the initial seed placement and extending the framework to 3D volumetric segmentation.

Summary updated

Abstract

利用PET图像进行诊治时需要对人体病灶精确定位,PET图像中病灶目标区域的分割是早期诊断与治疗的前提和关键。基于传统Snake模型的方法在PET图像分割时存在对初始轮廓过于敏感,难以收敛到目标凹型区域等问题,为此将GVF Snake模型引入PET图像的分割中。为防止GVF Snake模型陷入局部最优,进一步利用差分进化(DE)算法的全局优化特性对GVF Snake模型分割的结果进行优化,提高PET图像分割精度。实验结果表明,该方法能有效地对PET图像中的病灶目标区域进行分割,可避免陷入局部最优且具有良好的实时性。
BibTeX
@article{bi2011application,
  author = {Xiaojun Bi and Jing Xiao},
  title = {{Application of DE algorithm and improved GVF Snake model in segmentation of PET image}},
  journal = {Journal of Image and Graphics},
  year = {2011},
  doi = {10.11834/jig.20110320},
}
Figure