TY - GEN
T1 - Airway segmentation, skeletonization, and tree matching to improve registration of 3D CT images with large opacities in the lungs
AU - Betancur, Duván Alberto Gómez
AU - Fabijańska, Anna
AU - Flórez-Valencia, Leonardo
AU - Morales Pinzón, Alfredo
AU - Serrano, Eduardo Enrique Dávila
AU - Richard, Jean Christophe
AU - Orkisz, Maciej
AU - Hoyos, Marcela Hernández
N1 - Publisher Copyright:
© Springer International Publishing AG 2016.
PY - 2016
Y1 - 2016
N2 - In this work, we address the registration of pulmonary images, representing the same subject, with large opaque regions within the lungs, and with possibly large displacements. We propose a hybrid method combining alignment based on gray levels and landmarks within the same cost function. The landmarks are nodes of the airway tree obtained by specially developed segmentation and skeletonization algorithms. The former uses the random walker approach, whereas the latter exploits the minimum spanning tree constructed by the Dijkstra’s algorithm, in order to detect end-points and bifurcations. Airway trees from different images are matched by a modified best-first-search algorithm with a specially designed distance function. The proposed method was evaluated on computed-tomography images of subjects with acute respiratory distress syndrome, acquired at significantly different mechanical ventilation conditions. It achieved better results than registration based only on gray levels, but also better than hybrid registration using a standard airway-segmentation method.
AB - In this work, we address the registration of pulmonary images, representing the same subject, with large opaque regions within the lungs, and with possibly large displacements. We propose a hybrid method combining alignment based on gray levels and landmarks within the same cost function. The landmarks are nodes of the airway tree obtained by specially developed segmentation and skeletonization algorithms. The former uses the random walker approach, whereas the latter exploits the minimum spanning tree constructed by the Dijkstra’s algorithm, in order to detect end-points and bifurcations. Airway trees from different images are matched by a modified best-first-search algorithm with a specially designed distance function. The proposed method was evaluated on computed-tomography images of subjects with acute respiratory distress syndrome, acquired at significantly different mechanical ventilation conditions. It achieved better results than registration based only on gray levels, but also better than hybrid registration using a standard airway-segmentation method.
UR - http://www.scopus.com/inward/record.url?scp=84989878607&partnerID=8YFLogxK
U2 - 10.1007/978-3-319-46418-3_35
DO - 10.1007/978-3-319-46418-3_35
M3 - Conference contribution
AN - SCOPUS:84989878607
SN - 9783319464176
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 395
EP - 407
BT - Computer Vision and Graphics - International Conference, ICCVG 2016, Proceedings
A2 - Datta, Amitava
A2 - Wojciechowski, Konrad
A2 - Chmielewski, Leszek J.
A2 - Kozera, Ryszard
PB - Springer Verlag
T2 - International Conference on Computer Vision and Graphics, ICCVG 2016
Y2 - 19 September 2016 through 21 September 2016
ER -