Tehran University of Medical Sciences

Science Communicator Platform

Stay connected! Follow us on X network (Twitter):
Share this content! On (X network) By
Coordinate-Based Fast Lightweight Path Search Algorithm for Electromagnetic Navigation Bronchoscopy Publisher



Wu W1, 2 ; Xia W2, 3 ; Jun Z4 ; Saghatchi S5 ; Lavasani SN5 ; Mohagheghi S5 ; Ahmadian A6 ; Gao X2, 3
Authors
Show Affiliations
Authors Affiliations
  1. 1. School of Biomedical Engineering (Suzhou), Division of Life Science and Medicine, University of Science and Technology of China, Hefei, 230026, China
  2. 2. Suzhou Institute of Biomedical Engineering and Technology, Chinese Academy of Sciences, No. 88, Keling Road, Suzhou New District, Suzhou, 215163, China
  3. 3. Jinan Guoke Medical Engineering and Technology Development Co., Ltd., Pharmaceutical Valley New Drug Creation Platform, Shandong, Jinan, 250109, China
  4. 4. Gaochun District, Nanjing Zhongao Jingzhong Medical Technology Co., LTD., No. 205, Shuanggao Road, Nanjing, 211300, China
  5. 5. Image Guided Surgery Lab, Research Centre of Biomedical Technology and Robotics, RCBTR, Tehran University of Medical Sciences, Tehran, 1416753955, Iran
  6. 6. Department of Medical Physics & Biomedical Engineering & Research Centre for Biomedical Technology and Robotics, RCBTR, Tehran University of Medical Sciences, TUMS, Tehran, 1416753955, Iran

Source: Medical and Biological Engineering and Computing Published:2023


Abstract

Electromagnetic navigation bronchoscopy (ENB) uses electromagnetic positioning technology to guide the bronchoscope to accurately and quickly reach the lesion along the planned path. However, enormous data in high-resolution lung computed tomography (CT) and the complex structure of multilevel branching bronchial tree make fast path search challenging for path planning. We propose a coordinate-based fast lightweight path search (CPS) algorithm for ENB. First, the centerline is extracted from the bronchial tree by applying topological thinning. Then, Euclidean-distance-based coordinate search is applied. The centerline points are represented by their coordinates, and adjacent points along the navigation path are selected considering the shortest Euclidean distance to the target on the centerline nearest the lesion. From the top of the trachea centerline, search is repeated until reaching the target. In 50 high-resolution lung CT images acquired from five scanners, the CPS algorithm achieves accuracy, average search time, and average memory consumption of 100%, 88.5 ms, and 166.0 MB, respectively, reducing search time by 74.3% and 73.1% and memory consumption by 83.3% and 83.0% compared with Dijkstra and A* algorithms, respectively. CPS algorithm is suitable for path search in multilevel branching bronchial tree navigation based on high-resolution lung CT images. Graphical Abstract: [Figure not available: see fulltext.] © 2022, International Federation for Medical and Biological Engineering.