ArticleMedical physics2021
Assessment of fully automatic segmentation of pulmonary artery and aorta on noncontrast CT with optimal surface graph cuts.
Article in Medical physics, 2021. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 3 papers.
What it found
Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.
The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.
The trial behind it
Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.
Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.
Who cites it
3 citing papers in PubMed, 7 citations in OpenAlex.
- PDC-Net: parallel dilated convolutional network with channel attention mechanism for pituitary adenoma segmentation.Frontiers in physiology · 2023Article
- Automated 3D Segmentation of the Aorta and Pulmonary Artery on Non-Contrast-Enhanced Chest Computed Tomography Images in Lung Cancer Patients.Diagnostics (Basel, Switzerland) · 2022Article
- Assessment of fully automatic segmentation of pulmonary artery and aorta on noncontrast CT with optimal surface graph cuts.Medical physics · 2021Article
Corrections and comments
PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.
Authors and funding
5 authors at 3 institutions in 2 countries.
Funding
No grant is acknowledged in the PubMed record.
Abstract
purposeAccurate segmentation of the pulmonary arteries and aorta is important due to the association of the diameter and the shape of these vessels with several cardiovascular diseases and with the risk of exacerbations and death in patients with chronic obstructive pulmonary disease. We propose a fully automatic method based on an optimal surface graph-cut algorithm to quantify the full 3D shape and the diameters of the pulmonary arteries and aorta in noncontrast computed tomography (CT) scans.
methodsThe proposed algorithm first extracts seed points in the right and left pulmonary arteries, the pulmonary trunk, and the ascending and descending aorta by using multi-atlas registration. Subsequently, the centerlines of the pulmonary arteries and aorta are extracted by a minimum cost path tracking between the extracted seed points, with a cost based on a combination of lumen intensity similarity and multiscale medialness in three planes. The centerlines are refined by applying the path tracking algorithm to curved multiplanar reformatted scans and are then smoothed and dilated nonuniformly according to the extracted local vessel radius from the medialness filter. The resulting coarse estimates of the vessels are used as initialization for a graph-cut segmentation. Once the vessels are segmented, the diameters of the pulmonary artery (PA) and the ascending aorta (AA) and the
resultsWe obtained a Dice segmentation overlap of 0.94 ± 0.02 for pulmonary arteries and 0.96 ± 0.01 for the aorta, with a mean surface distance of 0.62 ± 0.33 mm and 0.43 ± 0.07 mm, respectively. ICC between manual and automatic in-slice diameter measures was 0.92 for PA, 0.97 for AA, and 0.90 for the
conclusionThe proposed automatic segmentation method can reliably extract diameters of the large arteries in non-ECG-gated noncontrast CT scans such as are acquired in lung cancer screening.
Indexed as
Identifiers
What OpenQuestion holds
Registered trials
Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.