Objective: This article presents a new computerized scheme that aims to accurately and robustly separate left and right lungs on computed tomography (CT) examinations.
Methods: We developed and tested a method to separate the left and right lungs using sequential CT information and a guided dynamic programming algorithm using adaptively and automatically selected start point and end point with especially severe and multiple connections.
Results: The scheme successfully identified and separated all 827 connections on the total 4034 CT images in an independent testing data set of CT examinations. The proposed scheme separated multiple connections regardless of their locations, and the guided dynamic programming algorithm reduced the computation time to approximately 4.6% in comparison with the traditional dynamic programming and avoided the permeation of the separation boundary into normal lung tissue.
Conclusions: The proposed method is able to robustly and accurately disconnect all connections between left and right lungs, and the guided dynamic programming algorithm is able to remove redundant processing.
Download full-text PDF |
Source |
---|---|
http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3061932 | PMC |
http://dx.doi.org/10.1097/RCT.0b013e31820e4389 | DOI Listing |
Enter search terms and have AI summaries delivered each week - change queries or unsubscribe any time!