The Minimum Cost Connected Subgraph for the Vascular Network

被引:4
|
作者
Salman, Shatha Assaad [1 ]
Abd-Almeer, Abeer Hussin [1 ]
机构
[1] Univ Technol, Div Math & Comp Applicat, Baghdad Pc 10001, Iraq
来源
TECHNOLOGIES AND MATERIALS FOR RENEWABLE ENERGY, ENVIRONMENT AND SUSTAINABILITY (TMREES) | 2019年 / 157卷
关键词
Connected subgraph; vascular network; algorithms.ntroduction;
D O I
10.1016/j.egypro.2018.11.172
中图分类号
X [环境科学、安全科学];
学科分类号
08 ; 0830 ;
摘要
Recently, humanity has suffered radiation problems either from medical examination or various devices in daily life. In this study we attempt to minimize the impact of medical examination equipment. This is done by represented the blood vessel network as a graph and the weight of the edge represent the length of the vessel, the location of the clot were computed previously, in the current search the shortest distance to the place of the clot is computed. Medical imaging is one of the most active research topics in an image analysis. Analyzing and segmenting medical images in a clinical context remains a challenging task due to the multiplicity of imaging modalities and the variability of the patient's characteristics and pathologies. As opposed to the previous methods in which the minimum cost connected sub graph (MCCS) appeared in many medical image analysis, prominently for segmenting medical image. In our method the MCCS is used for calculating the shortest path for the location of the clot achieved in a directed graph G1, this is an overcomplete segmentation of the vasculature by placing vertices and edges. Hence, the least path for the location of the clot is calculated by applying algorithms to overcomplete graph G1. (C) 2019 The Authors. Published by Elsevier Ltd.
引用
收藏
页码:128 / 134
页数:7
相关论文
共 50 条
  • [1] To Be Connected, or Not to Be Connected: That is the Minimum Inefficiency Subgraph Problem
    Ruchansky, Natali
    Bonchi, Francesco
    Garcia-Soriano, David
    Gullo, Francesco
    Kourtellis, Nicolas
    CIKM'17: PROCEEDINGS OF THE 2017 ACM CONFERENCE ON INFORMATION AND KNOWLEDGE MANAGEMENT, 2017, : 879 - 888
  • [2] On approximability of the minimum-cost k-connected spanning subgraph problem
    Czumaj, A
    Lingas, A
    PROCEEDINGS OF THE TENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 1999, : 281 - 290
  • [3] An approximation algorithm for the minimum-cost k-vertex connected subgraph
    Cheriyan, J
    Vempala, S
    Vetta, A
    SIAM JOURNAL ON COMPUTING, 2003, 32 (04) : 1050 - 1055
  • [4] An Improved Approximation Algorithm for the Minimum Cost Subset k-Connected Subgraph Problem
    Bundit Laekhanukit
    Algorithmica, 2015, 72 : 714 - 733
  • [5] On the minimum-cost lambda-edge-connected k-subgraph problem
    Sadeghi, Elham
    Fan, Neng
    COMPUTATIONAL MANAGEMENT SCIENCE, 2016, 13 (04) : 571 - 596
  • [6] An Improved Approximation Algorithm for the Minimum Cost Subset k-Connected Subgraph Problem
    Laekhanukit, Bundit
    ALGORITHMICA, 2015, 72 (03) : 714 - 733
  • [7] TOWARD A 6/5 BOUND FOR THE MINIMUM COST 2-EDGE CONNECTED SPANNING SUBGRAPH
    Boyd, Sylvia
    Legault, Philippe
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2017, 31 (01) : 632 - 644
  • [8] Minimum Strongly Connected Subgraph Collection in Dynamic Graphs
    Chen, Xin
    Shi, Jieming
    Peng, You
    Lin, Wenqing
    Wang, Sibo
    Zhang, Wenjie
    PROCEEDINGS OF THE VLDB ENDOWMENT, 2024, 17 (06): : 1324 - 1336
  • [9] Approximation algorithm for the minimum weight connected κ-subgraph cover problem
    Zhang, Yaping
    Shi, Yishuo
    Zhang, Zhao
    THEORETICAL COMPUTER SCIENCE, 2014, 535 : 54 - 58
  • [10] A Nearly Time-Optimal Distributed Approximation of Minimum Cost k-Edge-Connected Spanning Subgraph
    Dory, Michal
    Ghaffari, Mohsen
    PROCEEDINGS OF THE 2023 ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA, 2023, : 4296 - 4334