Effects of Path-Finding Algorithms on the Labeling of the Centerlines of Circle of Willis Arteries

被引:5
|
作者
Kim, Se-On [1 ]
Kim, Yoon-Chul [1 ]
机构
[1] Yonsei Univ, Coll Software & Digital Healthcare Convergence, Div Digital Healthcare, Wonju 26493, South Korea
基金
新加坡国家研究基金会;
关键词
magnetic resonance angiography; cerebral arteries; vessel segmentation; graph structure; Dijkstra algorithm; A* algorithm; depth first search; 3D TOF-MRA; SEGMENTATION; ANGIOGRAPHY; TORTUOSITY; BONE;
D O I
10.3390/tomography9040113
中图分类号
R8 [特种医学]; R445 [影像诊断学];
学科分类号
1002 ; 100207 ; 1009 ;
摘要
Quantitative analysis of intracranial vessel segments typically requires the identification of the vessels' centerlines, and a path-finding algorithm can be used to automatically detect vessel segments' centerlines. This study compared the performance of path-finding algorithms for vessel labeling. Three-dimensional (3D) time-of-flight magnetic resonance angiography (MRA) images from the publicly available dataset were considered for this study. After manual annotations of the endpoints of each vessel segment, three path-finding methods were compared: (Method 1) depth-first search algorithm, (Method 2) Dijkstra's algorithm, and (Method 3) A* algorithm. The rate of correctly found paths was quantified and compared among the three methods in each segment of the circle of Willis arteries. In the analysis of 840 vessel segments, Method 2 showed the highest accuracy (97.1%) of correctly found paths, while Method 1 and 3 showed an accuracy of 83.5% and 96.1%, respectively. The AComm artery was highly inaccurately identified in Method 1, with an accuracy of 43.2%. Incorrect paths by Method 2 were noted in the R-ICA, L-ICA, and R-PCA-P1 segments. The Dijkstra and A* algorithms showed similar accuracy in path-finding, and they were comparable in the speed of path-finding in the circle of Willis arterial segments.
引用
收藏
页码:1423 / 1433
页数:11
相关论文
共 19 条
  • [1] An Improved Path-Finding Method for the Tracking of Centerlines of Tortuous Internal Carotid Arteries in MR Angiography
    Kim, Se-On
    Kim, Yoon-Chul
    JOURNAL OF IMAGING, 2024, 10 (03)
  • [2] SYSTOLIC ALGORITHMS FOR PATH-FINDING PROBLEMS
    ROBERT, Y
    LECTURE NOTES IN COMPUTER SCIENCE, 1988, 316 : 68 - 81
  • [3] Adversarial Cooperative Path-finding: Complexity and Algorithms
    Ivanova, Marika
    Surynek, Pavel
    2014 IEEE 26TH INTERNATIONAL CONFERENCE ON TOOLS WITH ARTIFICIAL INTELLIGENCE (ICTAI), 2014, : 75 - 82
  • [4] On fast path-finding algorithms in AND-OR graphs
    Adelson-Velsky, GM
    Gelbukh, A
    Levner, E
    MATHEMATICAL PROBLEMS IN ENGINEERING, 2002, 8 (4-5) : 283 - 293
  • [5] Better path-finding algorithms in LPS Ramanujan graphs
    Pinto, Eduardo Carvalho
    Petit, Christophe
    JOURNAL OF MATHEMATICAL CRYPTOLOGY, 2018, 12 (04) : 191 - 202
  • [7] Transition-Path Theory and Path-Finding Algorithms for the Study of Rare Events
    E, Weinan
    Vanden-Eijnden, Eric
    ANNUAL REVIEW OF PHYSICAL CHEMISTRY, VOL 61, 2010, 61 : 391 - 420
  • [8] GENERALIZED ALGEBRAIC STRUCTURES OF PATH-FINDING PROBLEMS IN FINITE GRAPHS, ALGORITHMS AND APPLICATIONS
    MINOUX, M
    COMPTES RENDUS HEBDOMADAIRES DES SEANCES DE L ACADEMIE DES SCIENCES SERIE A, 1976, 282 (01): : 17 - 18
  • [9] Optimizing Road Networks: A Graph-Based Analysis with Path-finding and Learning Algorithms
    Muthuvel, P.
    Pandiyan, G.
    Manickam, S.
    Rajesh, C.
    INTERNATIONAL JOURNAL OF INTELLIGENT TRANSPORTATION SYSTEMS RESEARCH, 2024, : 315 - 329
  • [10] Comparing ACO algorithms for solving the bi-criteria military path-finding problem
    Mora, Antonio M.
    Merelo, Juan J.
    Millan, Cristian
    Torrecillas, Juan
    Laredo, Juan L. J.
    Castillo, Pedro A.
    ADVANCES IN ARTIFICIAL LIFE, PROCEEDINGS, 2007, 4648 : 665 - +