GPU-accelerated lung CT segmentation based on level sets and texture analysis.
Ontology highlight
ABSTRACT:
SUBMITTER: Reska D
PROVIDER: S-EPMC10792028 | biostudies-literature | 2024 Jan
REPOSITORIES: biostudies-literature
Publications
GPU-accelerated lung CT segmentation based on level sets and texture analysis.
Reska Daniel D Kretowski Marek M
Scientific reports 20240116 1
This paper presents a novel semi-automatic method for lung segmentation in thoracic CT datasets. The fully three-dimensional algorithm is based on a level set representation of an active surface and integrates texture features to improve its robustness. The method's performance is enhanced by the graphics processing unit (GPU) acceleration. The segmentation process starts with a manual initialisation of 2D contours on a few representative slices of the analysed volume. Next, the starting regions ...[more]
Similar Datasets
Project description:The treatment of ventral hernias (VH) has been a challenging problem for medical care. Repair of these hernias is fraught with failure; recurrence rates ranging from 24% to 43% have been reported, even with the use of biocompatible mesh. Currently, computed tomography (CT) is used to guide intervention through expert, but qualitative, clinical judgments, notably, quantitative metrics based on image-processing are not used. The authors propose that image segmentation methods to capture the three-dimensional structure of the abdominal wall and its abnormalities will provide a foundation on which to measure geometric properties of hernias and surrounding tissues and, therefore, to optimize intervention.In this study with 20 clinically acquired CT scans on postoperative patients, the authors demonstrated a novel approach to geometric classification of the abdominal. The authors' approach uses a texture analysis based on Gabor filters to extract feature vectors and follows a fuzzy c-means clustering method to estimate voxelwise probability memberships for eight clusters. The memberships estimated from the texture analysis are helpful to identify anatomical structures with inhomogeneous intensities. The membership was used to guide the level set evolution, as well as to derive an initial start close to the abdominal wall.Segmentation results on abdominal walls were both quantitatively and qualitatively validated with surface errors based on manually labeled ground truth. Using texture, mean surface errors for the outer surface of the abdominal wall were less than 2 mm, with 91% of the outer surface less than 5 mm away from the manual tracings; errors were significantly greater (2-5 mm) for methods that did not use the texture.The authors' approach establishes a baseline for characterizing the abdominal wall for improving VH care. Inherent texture patterns in CT scans are helpful to the tissue classification, and texture analysis can improve the level set segmentation around the abdominal region.
| S-EPMC3838426 | biostudies-other
Project description:During acquisition and reconstruction, medical images may become noisy and lose diagnostic quality. In the case of CT scans, obtaining less noisy images results in a higher radiation dose being administered to the patient. Filtering techniques can be utilized to reduce radiation without losing diagnosis capabilities. The objective in this work is to obtain an implementation of a filter capable of processing medical images in real-time. To achieve this we have developed several filter methods based on fuzzy logic, and their GPU implementations, to reduce mixed Gaussian-impulsive noise. These filters have been developed to work in attenuation coefficients so as to not lose any information from the CT scans. The testing volumes come from the Mayo clinic database and consist of CT volumes at full and at simulated low dose. The GPU parallelizations reach speedups of over 2700 and take less than 0.1 seconds to filter more than 300 slices. In terms of quality the filter is competitive with other state of the art algorithmic and AI filters. The proposed method obtains good performance in terms of quality and the parallelization results in real-time filtering.
| S-EPMC11694987 | biostudies-literature
Project description:We present a novel intensity-gradient based algorithm specifically designed for nanometer-segmentation of cell membrane contours obtained with high-resolution optical microscopy combined with high-velocity digital imaging. The algorithm relies on the image oversampling performance and computational power of graphical processing units (GPUs). Both, synthetic and experimental data are used to quantify the sub-pixel precision of the algorithm, whose analytic performance results comparatively higher than in previous methods. Results from the synthetic data indicate that the spatial precision of the presented algorithm is only limited by the signal-to-noise ratio (SNR) of the contour image. We emphasize on the application of the new algorithm to membrane fluctuations (flickering) in eukaryotic cells, bacteria and giant vesicle models. The method shows promising applicability in several fields of cellular biology and medical imaging for nanometer-precise boundary-determination and mechanical fingerprinting of cellular membranes in optical microscopy images. Our implementation of this high-precision flicker spectroscopy contour tracking algorithm (HiPFSTA) is provided as open-source at www.github.com/michaelmell/hipfsta.
| S-EPMC6283589 | biostudies-literature
Project description:Recently, clinical radiological research and practice are becoming increasingly quantitative. Further, images continue to increase in size and volume. For quantitative radiology to become practical, it is crucial that image segmentation algorithms and their implementations are rapid and yield practical run time on very large data sets. The purpose of this paper is to present a parallel version of an algorithm that belongs to the family of fuzzy connectedness (FC) algorithms, to achieve an interactive speed for segmenting large medical image data sets.The most common FC segmentations, optimizing an [script-l](∞)-based energy, are known as relative fuzzy connectedness (RFC) and iterative relative fuzzy connectedness (IRFC). Both RFC and IRFC objects (of which IRFC contains RFC) can be found via linear time algorithms, linear with respect to the image size. The new algorithm, P-ORFC (for parallel optimal RFC), which is implemented by using NVIDIA's Compute Unified Device Architecture (CUDA) platform, considerably improves the computational speed of the above mentioned CPU based IRFC algorithm.Experiments based on four data sets of small, medium, large, and super data size, achieved speedup factors of 32.8×, 22.9×, 20.9×, and 17.5×, correspondingly, on the NVIDIA Tesla C1060 platform. Although the output of P-ORFC need not precisely match that of IRFC output, it is very close to it and, as the authors prove, always lies between the RFC and IRFC objects.A parallel version of a top-of-the-line algorithm in the family of FC has been developed on the NVIDIA GPUs. An interactive speed of segmentation has been achieved, even for the largest medical image data set. Such GPU implementations may play a crucial role in automatic anatomy recognition in clinical radiology.
| S-EPMC3537719 | biostudies-other
Project description:MotivationMathematical modelling is central to systems and synthetic biology. Using simulations to calculate statistics or to explore parameter space is a common means for analysing these models and can be computationally intensive. However, in many cases, the simulations are easily parallelizable. Graphics processing units (GPUs) are capable of efficiently running highly parallel programs and outperform CPUs in terms of raw computing power. Despite their computational advantages, their adoption by the systems biology community is relatively slow, since differences in hardware architecture between GPUs and CPUs complicate the porting of existing code.ResultsWe present a Python package, cuda-sim, that provides highly parallelized algorithms for the repeated simulation of biochemical network models on NVIDIA CUDA GPUs. Algorithms are implemented for the three popular types of model formalisms: the LSODA algorithm for ODE integration, the Euler-Maruyama algorithm for SDE simulation and the Gillespie algorithm for MJP simulation. No knowledge of GPU computing is required from the user. Models can be specified in SBML format or provided as CUDA code. For running a large number of simulations in parallel, up to 360-fold decrease in simulation runtime is attained when compared to single CPU implementations.Availabilityhttp://cuda-sim.sourceforge.net/
| S-EPMC3051321 | biostudies-literature
Project description:Many scientific problems such as classifier training or medical image reconstruction can be expressed as minimization of differentiable real-valued cost functions and solved with iterative gradient-based methods. Adjoint algorithmic differentiation (AAD) enables automated computation of gradients of such cost functions implemented as computer programs. To backpropagate adjoint derivatives, excessive memory is potentially required to store the intermediate partial derivatives on a dedicated data structure, referred to as the "tape". Parallelization is difficult because threads need to synchronize their accesses during taping and backpropagation. This situation is aggravated for many-core architectures, such as Graphics Processing Units (GPUs), because of the large number of light-weight threads and the limited memory size in general as well as per thread. We show how these limitations can be mediated if the cost function is expressed using GPU-accelerated vector and matrix operations which are recognized as intrinsic functions by our AAD software. We compare this approach with naive and vectorized implementations for CPUs. We use four increasingly complex cost functions to evaluate the performance with respect to memory consumption and gradient computation times. Using vectorization, CPU and GPU memory consumption could be substantially reduced compared to the naive reference implementation, in some cases even by an order of complexity. The vectorization allowed usage of optimized parallel libraries during forward and reverse passes which resulted in high speedups for the vectorized CPU version compared to the naive reference implementation. The GPU version achieved an additional speedup of 7.5 ± 4.4, showing that the processing power of GPUs can be utilized for AAD using this concept. Furthermore, we show how this software can be systematically extended for more complex problems such as nonlinear absorption reconstruction for fluorescence-mediated tomography.
| S-EPMC4772124 | biostudies-literature
Project description:A thoracic aortic aneurysm is an abnormal dilatation of the aorta that can progress and lead to rupture. The decision to conduct surgery is made by considering the maximum diameter, but it is now well known that this metric alone is not completely reliable. The advent of 4D flow magnetic resonance imaging has allowed for the calculation of new biomarkers for the study of aortic diseases, such as wall shear stress. However, the calculation of these biomarkers requires the precise segmentation of the aorta during all phases of the cardiac cycle. The objective of this work was to compare two different methods for automatically segmenting the thoracic aorta in the systolic phase using 4D flow MRI. The first method is based on a level set framework and uses the velocity field in addition to 3D phase contrast magnetic resonance imaging. The second method is a U-Net-like approach that is only applied to magnitude images from 4D flow MRI. The used dataset was composed of 36 exams from different patients, with ground truth data for the systolic phase of the cardiac cycle. The comparison was performed based on selected metrics, such as the Dice similarity coefficient (DSC) and Hausdorf distance (HD), for the whole aorta and also three aortic regions. Wall shear stress was also assessed and the maximum wall shear stress values were used for comparison. The U-Net-based approach provided statistically better results for the 3D segmentation of the aorta, with a DSC of 0.92 ± 0.02 vs. 0.86 ± 0.5 and an HD of 21.49 ± 24.8 mm vs. 35.79 ± 31.33 mm for the whole aorta. The absolute difference between the wall shear stress and ground truth slightly favored the level set method, but not significantly (0.754 ± 1.07 Pa vs. 0.737 ± 0.79 Pa). The results showed that the deep learning-based method should be considered for the segmentation of all time steps in order to evaluate biomarkers based on 4D flow MRI.
| S-EPMC10301513 | biostudies-literature
Project description:ObjectiveTo determine whether volumetric CT texture analysis (CTTA) using fully automatic tumor segmentation can help predict recurrence-free survival (RFS) in patients with intrahepatic mass-forming cholangiocarcinomas (IMCCs) after surgical resection.Materials and methodsThis retrospective study analyzed the preoperative CT scans of 89 patients with IMCCs (64 male; 25 female; mean age, 62.1 years; range, 38-78 years) who underwent surgical resection between January 2005 and December 2016. Volumetric CTTA of IMCCs was performed in late arterial phase images using both fully automatic and semi-automatic liver tumor segmentation techniques. The time spent on segmentation and texture analysis was compared, and the first-order and second-order texture parameters and shape features were extracted. The reliability of CTTA parameters between the techniques was evaluated using intraclass correlation coefficients (ICCs). Intra- and interobserver reproducibility of volumetric CTTAs were also obtained using ICCs. Cox proportional hazard regression were used to predict RFS using CTTA parameters and clinicopathological parameters.ResultsThe time spent on fully automatic tumor segmentation and CTTA was significantly shorter than that for semi-automatic segmentation: mean ± standard deviation of 1 minutes 37 seconds ± 50 seconds vs. 10 minutes 48 seconds ± 13 minutes 44 seconds (p < 0.001). ICCs of the texture features between the two techniques ranged from 0.215 to 0.980. ICCs for the intraobserver and interobserver reproducibility using fully automatic segmentation were 0.601-0.997 and 0.177-0.984, respectively. Multivariable analysis identified lower first-order mean (hazard ratio [HR], 0.982; p = 0.010), larger pathologic tumor size (HR, 1.171; p < 0.001), and positive lymph node involvement (HR, 2.193; p = 0.014) as significant parameters for shorter RFS using fully automatic segmentation.ConclusionVolumetric CTTA parameters obtained using fully automatic segmentation could be utilized as prognostic markers in patients with IMCC, with comparable reproducibility in significantly less time compared with semi-automatic segmentation.
| S-EPMC8546140 | biostudies-literature
Project description:Voxelwise quantification of hepatic perfusion parameters from dynamic contrast enhanced (DCE) imaging greatly contributes to assessment of liver function in response to radiation therapy. However, the efficiency of the estimation of hepatic perfusion parameters voxel-by-voxel in the whole liver using a dual-input single-compartment model requires substantial improvement for routine clinical applications. In this paper, we utilize the parallel computation power of a graphics processing unit (GPU) to accelerate the computation, while maintaining the same accuracy as the conventional method. Using compute unified device architecture-GPU, the hepatic perfusion computations over multiple voxels are run across the GPU blocks concurrently but independently. At each voxel, nonlinear least-squares fitting the time series of the liver DCE data to the compartmental model is distributed to multiple threads in a block, and the computations of different time points are performed simultaneously and synchronically. An efficient fast Fourier transform in a block is also developed for the convolution computation in the model. The GPU computations of the voxel-by-voxel hepatic perfusion images are compared with ones by the CPU using the simulated DCE data and the experimental DCE MR images from patients. The computation speed is improved by 30 times using a NVIDIA Tesla C2050 GPU compared to a 2.67 GHz Intel Xeon CPU processor. To obtain liver perfusion maps with 626 400 voxels in a patient's liver, it takes 0.9 min with the GPU-accelerated voxelwise computation, compared to 110 min with the CPU, while both methods result in perfusion parameters differences less than 10(-6). The method will be useful for generating liver perfusion images in clinical settings.
| S-EPMC3449322 | biostudies-literature
Project description:Diffusion magnetic resonance imaging and tractography enable the estimation of anatomical connectivity in the human brain, in vivo. Yet, without ground-truth validation, different tractography algorithms can yield widely varying connectivity estimates. Although streamline pruning techniques mitigate this challenge, slow compute times preclude their use in big-data applications. We present 'Regularized, Accelerated, Linear Fascicle Evaluation' (ReAl-LiFE), a GPU-based implementation of a state-of-the-art streamline pruning algorithm (LiFE), which achieves >100× speedups over previous CPU-based implementations. Leveraging these speedups, we overcome key limitations with LiFE's algorithm to generate sparser and more accurate connectomes. We showcase ReAl-LiFE's ability to estimate connections with superlative test-retest reliability, while outperforming competing approaches. Moreover, we predicted inter-individual variations in multiple cognitive scores with ReAl-LiFE connectome features. We propose ReAl-LiFE as a timely tool, surpassing the state of the art, for accurate discovery of individualized brain connectomes at scale. Finally, our GPU-accelerated implementation of a popular non-negative least-squares optimization algorithm is widely applicable to many real-world problems.
| S-EPMC10766542 | biostudies-literature