Journal of Northeastern University(Natural Science) ›› 2023, Vol. 44 ›› Issue (7): 922-930.DOI: 10.12068/j.issn.1005-3026.2023.07.002

• Information & Control • Previous Articles     Next Articles

Multi-constraint Optimal Puncture Path Planning Algorithm for Liver Cancer Ablation

LIU Xiao-xi, JIANG Hui-yan, LUO Min   

  1. School of Software, Northeastern University, Shenyang 110169, China.
  • Published:2023-07-13
  • Contact: JIANG Hui-yan
  • About author:-
  • Supported by:
    -

Abstract: Aiming at the problem that the classic puncture path planning algorithm does not consider the area around the path when quantifying the path, new constraints condition are proposed to make up for the lack of quantification of the information around the path. A strict constraint condition was proposed based on the blood vessel position information (the surrounding area avoids the blood vessel), and based on bone density, blood vessel density, and diameter information, three soft constraints (bone density, blood vessel density, and blood vessel risk) were proposed, and the surrounding information was added to the quantification of the path to improve the safety of the puncture path. In order to adapt to the specificity of patients, a soft constraint optimization degree scoring algorithm is proposed, and the weight is set according to the optimization degree of soft constraints, and the puncture path corresponding to the maximum optimization degree is taken as the optimal puncture path. In order to verify the effectiveness of the algorithm, experiments were carried out on the public dataset 3D-IRCADb. The experimental results show that the algorithm proposed in this paper can quickly calculate the optimal puncture path that meets the clinical needs.

Key words: liver cancer ablation; puncture constraints; puncture path planning; multi-objective optimization; surgical navigation

CLC Number: