Dataset Information

An automatic restoration framework based on GPU-accelerated collateral filtering in brain MR images.

ABSTRACT:

Background

Image restoration is one of the fundamental and essential tasks within image processing. In medical imaging, developing an effective algorithm that can automatically remove random noise in brain magnetic resonance (MR) images is challenging. The collateral filter has been shown a more powerful algorithm than many existing methods. However, the computation of the collateral filter is more time-consuming and the selection of the filter parameters is also laborious. This paper proposes an automatic noise removal system based on the accelerated collateral filter for brain MR images.

Methods

To solve these problems, we first accelerated the collateral filter with parallel computing using the graphics processing unit (GPU) architecture. We adopted the compute unified device architecture (CUDA), an application programming interface for the GPU by NVIDIA, to hasten the computation. Subsequently, the optimal filter parameters were selected and the automation was achieved by artificial neural networks. Specifically, an artificial neural network system associated with image feature analysis was adopted to establish the automatic image restoration framework. The best feature combination was selected by the paired t-test and the sequential forward floating selection (SFFS) methods.

Results

Experimental results indicated that not only did the proposed automatic image restoration algorithm perform dramatically faster than the traditional collateral filter, but it also effectively removed the noise in a wide variety of brain MR images. A speed up gain of 34 was attained to process an MR image, which completed within 0.1?s. Representative illustrations of brain tumor images demonstrated the capability of identifying lesion boundaries, which outperformed many existing methods.

Conclusions

We believe that our accelerated and automated restoration framework is promising for achieving robust filtering in many brain MR image restoration applications.

SUBMITTER: Chang HH

PROVIDER: S-EPMC6339330 | biostudies-literature | 2019 Jan

REPOSITORIES: biostudies-literature

ACCESS DATA

Similar Datasets

Project description:The location and extent of white matter lesions on magnetic resonance imaging (MRI) are important criteria for diagnosis, follow-up and prognosis of multiple sclerosis (MS). Clinical trials have shown that quantitative values, such as lesion volumes, are meaningful in MS prognosis. Manual lesion delineation for the segmentation of lesions is, however, time-consuming and suffers from observer variability. In this paper, we propose MSmetrix, an accurate and reliable automatic method for lesion segmentation based on MRI, independent of scanner or acquisition protocol and without requiring any training data. In MSmetrix, 3D T1-weighted and FLAIR MR images are used in a probabilistic model to detect white matter (WM) lesions as an outlier to normal brain while segmenting the brain tissue into grey matter, WM and cerebrospinal fluid. The actual lesion segmentation is performed based on prior knowledge about the location (within WM) and the appearance (hyperintense on FLAIR) of lesions. The accuracy of MSmetrix is evaluated by comparing its output with expert reference segmentations of 20 MRI datasets of MS patients. Spatial overlap (Dice) between the MSmetrix and the expert lesion segmentation is 0.67 ± 0.11. The intraclass correlation coefficient (ICC) equals 0.8 indicating a good volumetric agreement between the MSmetrix and expert labelling. The reproducibility of MSmetrix' lesion volumes is evaluated based on 10 MS patients, scanned twice with a short interval on three different scanners. The agreement between the first and the second scan on each scanner is evaluated through the spatial overlap and absolute lesion volume difference between them. The spatial overlap was 0.69 ± 0.14 and absolute total lesion volume difference between the two scans was 0.54 ± 0.58 ml. Finally, the accuracy and reproducibility of MSmetrix compare favourably with other publicly available MS lesion segmentation algorithms, applied on the same data using default parameter settings.

Project description:PURPOSE:To automate the estimation of swallowing motion from 2D MR cine images using deformable registration for future applications of personalized margin reduction in head and neck radiotherapy and outcome assessment of radiation-associated dysphagia. METHODS:Twenty-one patients with serial 2D FSPGR-MR cine scans of the head and neck conducted through the course of definitive radiotherapy for oropharyngeal cancer. Included patients had at least one cine scan before, during, or after radiotherapy, with a total of 52 cine scans. Contours of 7 swallowing related regions-of-interest (ROIs), including pharyngeal constrictor, epiglottis, base of tongue, geniohyoid, hyoid, soft palate, and larynx, were manually delineated from consecutive frames of the cine scan covering at least one swallowing cycle. We applied a modified thin-plate-spline robust-point-matching algorithm to register the point sets of each ROI automatically over frames. The deformation vector fields from the registration were then used to estimate the motion during swallowing for each ROI. Registration errors were estimated by comparing the deformed contours with the manual contours. RESULTS:On average 22 frames of each cine scan were contoured. The registration for one cine scan (7 ROIs over 22 frames) on average took roughly 22 minutes. A number of 8018 registrations were successfully batch processed without human interaction after the contours were drawn. The average registration error for all ROIs and all patients was 0.36 mm (range: 0.06 mm- 2.06 mm). Larynx had the average largest motion in superior direction of all structures under consideration (range: 0.0 mm- 58.7 mm). Geniohyoid had the smallest overall motion of all ROIs under consideration and the superior-inferior motion was larger than the anterior-posterior motion for all ROIs. CONCLUSION:We developed and validated a deformable registration framework to automate the estimation of swallowing motion from 2D MR cine scans.

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.