An improved real-time endovascular guidewire position simulation using shortest path algorithm.

In this study, we propose a new graph-theoretical method to simulate guidewire paths inside the carotid artery. The minimum energy guidewire path can be obtained by applying the shortest path algorithm, such as Dijkstra's algorithm for graphs, based on the principle of the minimal total energy. Comp...

Descripción completa

Detalles Bibliográficos
Publicado en:Medical & Biological Engineering & Computing Vol. 54; no. 9; pp. 1375 - 1383
Autores principales: Qiu, Jianpeng, Qu, Zhiyi, Qiu, Haiquan, Zhang, Xiaomin
Formato: Journal Article
Publicado: Springer Nature Sep2016
Acceso en línea:Ver este registro en EBSCOhost
fields @attributes:
  recordID: 1
pdfLink:
plink: https://search.ebscohost.com/login.aspx?direct=true&db=ccm&AN=117576410&site=ehost-live
header:
  @attributes:
    shortDbName: ccm
    uiTerm: 117576410
    longDbName: CINAHL Complete
    uiTag: AN
  controlInfo:
    bkinfo:
    dissinfo:
    jinfo:
      jid:
        01400118
        PO0
      jtl: Medical & Biological Engineering & Computing
      issn: 01400118
      maglogo: N
    pubinfo:
      dt: Sep2016
      vid: 54
      iid: 9
      pid: 237
      pub: Springer Nature
      place: New York, New York
    artinfo:
      ui:
        117576410
        117576410
        NLM26467345
        10.1007/s11517-015-1398-0
        NLM26467345
        117576410
      ppf: 1375
      ppct: 8
      formats:
        fmt:
          @attributes:
            type: P
      tig:
        atl: An improved real-time endovascular guidewire position simulation using shortest path algorithm.
      aug:
        au:
          Qiu, Jianpeng
          Qu, Zhiyi
          Qiu, Haiquan
          Zhang, Xiaomin
        affil: Computer Application Institute, School of Information Science and Engineering , Lanzhou University , No. 222, Tian Shui Road (South) Lanzhou China
      sug:
        subj:
          Carotid Arteries
          Phantoms, Imaging
          Algorithms
          Computer Simulation
          Time Factors
          Imaging, Three-Dimensional
      ab: In this study, we propose a new graph-theoretical method to simulate guidewire paths inside the carotid artery. The minimum energy guidewire path can be obtained by applying the shortest path algorithm, such as Dijkstra's algorithm for graphs, based on the principle of the minimal total energy. Compared to previous results, experiments of three phantoms were validated, revealing that the first and second phantoms overlap completely between simulated and real guidewires. In addition, 95 % of the third phantom overlaps completely, and the remaining 5 % closely coincides. The results demonstrate that our method achieves 87 and 80 % improvements for the first and third phantoms under the same conditions, respectively. Furthermore, 91 % improvements were obtained for the second phantom under the condition with reduced graph construction complexity.
      pubtype: Academic Journal
      doctype: Journal Article
      ougenre: Article
    language: English
    refInfo:
    holdings:
      @attributes:
        islocal: N