Deep learning for automatic bowel-obstruction identification on abdominal CT.

RATIONALE AND OBJECTIVES: Automated evaluation of abdominal computed tomography (CT) scans should help radiologists manage their massive workloads, thereby leading to earlier diagnoses and better patient outcomes. Our objective was to develop a machine-learning model capable of reliably identifying suspected bowel obstruction (BO) on abdominal CT. MATERIALS AND METHODS: The internal dataset comprised 1345 abdominal CTs obtained in 2015-2022 from 1273 patients with suspected BO; among them, 670 were annotated as BO yes/no by an experienced abdominal radiologist. The external dataset consisted of 88 radiologist-annotated CTs. We developed a full preprocessing pipeline for abdominal CT comprising a model to locate the abdominal-pelvic region and another model to crop the 3D scan around the body. We built, trained, and tested several neural-network architectures for the binary classification (BO, yes/no) of each CT. F1 and balanced accuracy scores were computed to assess model performance. RESULTS: The mixed convolutional network pretrained on a Kinetics 400 dataset achieved the best results: with the internal dataset, the F1 score was 0.92, balanced accuracy 0.86, and sensitivity 0.93; with the external dataset, the corresponding values were 0.89, 0.89, and 0.89. When calibrated on sensitivity, this model produced 1.00 sensitivity, 0.84 specificity, and an F1 score of 0.88 with the internal dataset; corresponding values were 0.98, 0.76, and 0.87 with the external dataset. CONCLUSION: The 3D mixed convolutional neural network developed here shows great potential for the automated binary classification (BO yes/no) of abdominal CT scans from patients with suspected BO. CLINICAL RELEVANCE STATEMENT: The 3D mixed CNN automates bowel obstruction classification, potentially automating patient selection and CT prioritization, leading to an enhanced radiologist workflow. KEY POINTS: • Bowel obstruction's rising incidence strains radiologists. AI can aid urgent CT readings. • Employed 1345 CT scans, neural networks for bowel obstruction detection, achieving high accuracy and sensitivity on external testing. • 3D mixed CNN automates CT reading prioritization effectively and speeds up bowel obstruction diagnosis.

An Auxiliary Variable Method for Markov Chain Monte Carlo Algorithms in High Dimension.

In this paper, we are interested in Bayesian inverse problems where either the data fidelity term or the prior distribution is Gaussian or driven from a hierarchical Gaussian model. Generally, Markov chain Monte Carlo (MCMC) algorithms allow us to generate sets of samples that are employed to infer some relevant parameters of the underlying distributions. However, when the parameter space is high-dimensional, the performance of stochastic sampling algorithms is very sensitive to existing dependencies between parameters. In particular, this problem arises when one aims to sample from a high-dimensional Gaussian distribution whose covariance matrix does not present a simple structure. Another challenge is the design of Metropolis-Hastings proposals that make use of information about the local geometry of the target density in order to speed up the convergence and improve mixing properties in the parameter space, while not being too computationally expensive. These two contexts are mainly related to the presence of two heterogeneous sources of dependencies stemming either from the prior or the likelihood in the sense that the related covariance matrices cannot be diagonalized in the same basis. In this work, we address these two issues. Our contribution consists of adding auxiliary variables to the model in order to dissociate the two sources of dependencies. In the new augmented space, only one source of correlation remains directly related to the target parameters, the other sources of correlations being captured by the auxiliary variables. Experiments are conducted on two practical image restoration problems-namely the recovery of multichannel blurred images embedded in Gaussian noise and the recovery of signal corrupted by a mixed Gaussian noise. Experimental results indicate that adding the proposed auxiliary variables makes the sampling problem simpler since the new conditional distribution no longer contains highly heterogeneous correlations. Thus, the computational cost of each iteration of the Gibbs sampler is significantly reduced while ensuring good mixing properties.

PALMA, an improved algorithm for DOSY signal processing.

NMR is a tool of choice for the measurement of diffusion coefficients of species in solution. The DOSY experiment, a 2D implementation of this measurement, has been proven to be particularly useful for the study of complex mixtures, molecular interactions, polymers, etc. However, DOSY data analysis requires to resort to the inverse Laplace transform, in particular for polydisperse samples. This is a known difficult numerical task for which we present here a novel approach. A new algorithm based on a splitting scheme and on the use of proximity operators is introduced. Used in conjunction with a Maximum Entropy and hybrid regularisation, this algorithm converges rapidly and produces results robust against experimental noise. This method has been called PALMA. It is able to reproduce faithfully monodisperse as well as polydisperse systems, and numerous simulated and experimental examples are presented. It has been implemented on the server where users can have their datasets processed automatically.

Using Machine Learning on MRI Radiomics to Diagnose Parotid Tumours Before Comparing Performance with Radiologists: A Pilot Study.

The parotid glands are the largest of the major salivary glands. They can harbour both benign and malignant tumours. Preoperative work-up relies on MR images and fine needle aspiration biopsy, but these diagnostic tools have low sensitivity and specificity, often leading to surgery for diagnostic purposes. The aim of this paper is (1) to develop a machine learning algorithm based on MR images characteristics to automatically classify parotid gland tumours and (2) compare its results with the diagnoses of junior and senior radiologists in order to evaluate its utility in routine practice. While automatic algorithms applied to parotid tumours classification have been developed in the past, we believe that our study is one of the first to leverage four different MRI sequences and propose a comparison with clinicians. In this study, we leverage data coming from a cohort of 134 patients treated for benign or malignant parotid tumours. Using radiomics extracted from the MR images of the gland, we train a random forest and a logistic regression to predict the corresponding histopathological subtypes. On the test set, the best results are given by the random forest: we obtain a 0.720 accuracy, a 0.860 specificity, and a 0.720 sensitivity over all histopathological subtypes, with an average AUC of 0.838. When considering the discrimination between benign and malignant tumours, the algorithm results in a 0.760 accuracy and a 0.769 AUC, both on test set. Moreover, the clinical experiment shows that our model helps to improve diagnostic abilities of junior radiologists as their sensitivity and accuracy raised by 6 % when using our proposed method. This algorithm may be useful for training of physicians. Radiomics with a machine learning algorithm may help improve discrimination between benign and malignant parotid tumours, decreasing the need for diagnostic surgery. Further studies are warranted to validate our algorithm for routine use.

Graph Regularized Probabilistic Matrix Factorization for Drug-Drug Interactions Prediction.

Co-administration of two or more drugs simultaneously can result in adverse drug reactions. Identifying drug-drug interactions (DDIs) is necessary, especially for drug development and for repurposing old drugs. DDI prediction can be viewed as a matrix completion task, for which matrix factorization (MF) appears as a suitable solution. This paper presents a novel Graph Regularized Probabilistic Matrix Factorization (GRPMF) method, which incorporates expert knowledge through a novel graph-based regularization strategy within an MF framework. An efficient and sounded optimization algorithm is proposed to solve the resulting non-convex problem in an alternating fashion. The performance of the proposed method is evaluated through the DrugBank dataset, and comparisons are provided against state-of-the-art techniques. The results demonstrate the superior performance of GRPMF when compared to its counterparts.

A computational two-photon fluorescence approach for revealing label-free the 3D image of viruses and bacteria.

Current solutions for bacteria and viruses identification are based on time-consuming technics with complex preparation procedures. In the present work, we revealed label-free the presence of free viral particles and bacteria with a computational two-photon fluorescence (C-TPF) strategy. Six bacteria were tested: Escherichia coli, Staphylococcus epidermidis, Proteus vulgaris, Pseudomonas fluorescens, Bacillus subtilis, and Clostridium perfringens. The two families of viral particles were the herpes virus with the cytomegalovirus (CMV, 300 nm of diameter) and the coronavirus with the SARS-CoV-2 (100 nm of diameter). The instrumental and computational pipeline FAMOUS optimized the produced 3D images. The origin of the fluorescence emission was discussed for bacteria regarding to their two-photon excitation spectra and attributed to the metabolic indicators (FAD and NADH). The optical and computational strategy constitute a new approach for imaging label-free viral particles and bacteria and paves the way to a new understanding of viral or bacterial ways of infection.

A Novel Task-Based reconstruction approach for digital breast tomosynthesis.

The reconstruction of a volumetric image from Digital Breast Tomosynthesis (DBT) measurements is an ill-posed inverse problem, for which existing iterative regularized approaches can provide a good solution. However, the clinical task is somehow omitted in the derivation of those techniques, although it plays a primary role in the radiologist diagnosis. In this work, we address this issue by introducing a novel variational formulation for DBT reconstruction, tailored for a specific clinical task, namely the detection of microcalcifications. Our method aims at simultaneously enhancing the detectability performance and enabling a high-quality restoration of the background breast tissues. Our contribution is threefold. First, we introduce an original task-based reconstruction framework through the proposition of a detectability function inspired from mathematical model observers. Second, we propose a novel total-variation regularizer where the gradient field accounts for the different morphological contents of the imaged breast. Third, we integrate the two developed measures into a cost function, minimized thanks to a new form of the Majorize Minimize Memory Gradient (3MG) algorithm. We conduct a numerical comparison of the convergence speed of the proposed method with those of standard convex optimization algorithms. Experimental results show the interest of our DBT reconstruction approach, qualitatively and quantitatively.

Unrolled Variational Bayesian Algorithm for Image Blind Deconvolution.

In this paper, we introduce a variational Bayesian algorithm (VBA) for image blind deconvolution. Our VBA generic framework incorporates smoothness priors on the unknown blur/image and possible affine constraints (e.g., sum to one) on the blur kernel, integrating the VBA within a neural network paradigm following an unrolling methodology. The proposed architecture is trained in a supervised fashion, which allows us to optimally set two key hyperparameters of the VBA model and leads to further improvements in terms of resulting visual quality. Various experiments involving grayscale/color images and diverse kernel shapes, are performed. The numerical examples illustrate the high performance of our approach when compared to state-of-the-art techniques based on optimization, Bayesian estimation, or deep learning.

Computational Prediction of Drug-Disease Association Based on Graph-Regularized One Bit Matrix Completion.

Investigation of existing drugs is an effective alternative to the discovery of new drugs for treating diseases. This task of drug re-positioning can be assisted by various kinds of computational methods to predict the best indication for a drug given the open-source biological datasets. Owing to the fact that similar drugs tend to have common pathways and disease indications, the association matrix is assumed to be of low-rank structure. Hence, the problem of drug-disease association prediction can be modeled as a low-rank matrix completion problem. In this work, we propose a novel matrix completion framework that makes use of the side-information associated with drugs/diseases for the prediction of drug-disease indications modeled as neighborhood graph: Graph regularized 1-bit matrix completion (GR1BMC). The algorithm is specially designed for binary data and uses parallel proximal algorithm to solve the aforesaid minimization problem taking into account all the constraints including the neighborhood graph incorporation and restricting predicted scores within the specified range. The results have been validated on two standard databases by evaluating the AUC across the 10-fold cross-validation splits. The usage of the method is also evaluated through a case study where top 5 indications are predicted for novel drugs, which then are verified with the CTD database.

DeepVir: Graphical Deep Matrix Factorization for In Silico Antiviral Repositioning-Application to COVID-19.

This study formulates antiviral repositioning as a matrix completion problem wherein the antiviral drugs are along the rows and the viruses are along the columns. The input matrix is partially filled, with ones in positions where the antiviral drug has been known to be effective against a virus. The curated metadata for antivirals (chemical structure and pathways) and viruses (genomic structure and symptoms) are encoded into our matrix completion framework as graph Laplacian regularization. We then frame the resulting multiple graph regularized matrix completion (GRMC) problem as deep matrix factorization. This is solved by using a novel optimization method called HyPALM (Hybrid Proximal Alternating Linearized Minimization). Results of our curated RNA drug-virus association data set show that the proposed approach excels over state-of-the-art GRMC techniques. When applied to in silico prediction of antivirals for COVID-19, our approach returns antivirals that are either used for treating patients or are under trials for the same.

Radiomics-Based Method for Predicting the Glioma Subtype as Defined by Tumor Grade, IDH Mutation, and 1p/19q Codeletion.

Gliomas are among the most common types of central nervous system (CNS) tumors. A prompt diagnosis of the glioma subtype is crucial to estimate the prognosis and personalize the treatment strategy. The objective of this study was to develop a radiomics pipeline based on the clinical Magnetic Resonance Imaging (MRI) scans to noninvasively predict the glioma subtype, as defined based on the tumor grade, isocitrate dehydrogenase (IDH) mutation status, and 1p/19q codeletion status. A total of 212 patients from the public retrospective The Cancer Genome Atlas Low Grade Glioma (TCGA-LGG) and The Cancer Genome Atlas Glioblastoma Multiforme (TCGA-GBM) datasets were used for the experiments and analyses. Different settings in the radiomics pipeline were investigated to improve the classification, including the Z-score normalization, the feature extraction strategy, the image filter applied to the MRI images, the introduction of clinical information, ComBat harmonization, the classifier chain strategy, etc. Based on numerous experiments, we finally reached an optimal pipeline for classifying the glioma tumors. We then tested this final radiomics pipeline on the hold-out test data with 51 randomly sampled random seeds for reliable and robust conclusions. The results showed that, after tuning the radiomics pipeline, the mean AUC improved from 0.8935 (±0.0351) to 0.9319 (±0.0386), from 0.8676 (±0.0421) to 0.9283 (±0.0333), and from 0.6473 (±0.1074) to 0.8196 (±0.0702) in the test data for predicting the tumor grade, IDH mutation, and 1p/19q codeletion status, respectively. The mean accuracy for predicting the five glioma subtypes also improved from 0.5772 (±0.0816) to 0.6716 (±0.0655). Finally, we analyzed the characteristics of the radiomic features that best distinguished the glioma grade, the IDH mutation, and the 1p/19q codeletion status, respectively. Apart from the promising prediction of the glioma subtype, this study also provides a better understanding of the radiomics model development and interpretability. The results in this paper are replicable with our python codes publicly available in github.

Can Deep Learning Replace Gadolinium in Neuro-Oncology?: A Reader Study.

MATERIALS AND METHODS: This monocentric retrospective study leveraged 200 multiparametric brain MRIs acquired between November 2019 and February 2020 at Gustave Roussy Cancer Campus (Villejuif, France). A total of 145 patients were included: 107 formed the training sample (55 ± 14 years, 58 women) and 38 the separate test sample (62 ± 12 years, 22 women). Patients had glioma, brain metastases, meningioma, or no enhancing lesion. T1, T2-FLAIR, diffusion-weighted imaging, low-dose, and standard-dose postcontrast T1 sequences were acquired. A deep network was trained to process the precontrast and low-dose sequences to predict "virtual" surrogate images for contrast-enhanced T1. Once trained, the deep learning method was evaluated on the test sample. The discrepancies between the predicted virtual images and the standard-dose MRIs were qualitatively and quantitatively evaluated using both automated voxel-wise metrics and a reader study, where 2 radiologists graded image qualities and marked all visible enhancing lesions. RESULTS: The automated analysis of the test brain MRIs computed a structural similarity index of 87.1% ± 4.8% between the predicted virtual sequences and the reference contrast-enhanced T1 MRIs, a peak signal-to-noise ratio of 31.6 ± 2.0 dB, and an area under the curve of 96.4% ± 3.1%. At Youden's operating point, the voxel-wise sensitivity (SE) and specificity were 96.4% and 94.8%, respectively. The reader study found that virtual images were preferred to standard-dose MRI in terms of image quality (P = 0.008). A total of 91 reference lesions were identified in the 38 test T1 sequences enhanced with full dose of contrast agent. On average across readers, the brain lesion SE of the virtual images was 83% for lesions larger than 10 mm (n = 42), and the associated false detection rate was 0.08 lesion/patient. The corresponding positive predictive value of detected lesions was 92%, and the F1 score was 88%. Lesion detection performance, however, dropped when smaller lesions were included: average SE was 67% for lesions larger than 5 mm (n = 74), and 56% with all lesions included regardless of their size. The false detection rate remained below 0.50 lesion/patient in all cases, and the positive predictive value remained above 73%. The composite F1 score was 63% at worst. CONCLUSIONS: The proposed deep learning method for virtual contrast-enhanced T1 brain MRI prediction showed very high quantitative performance when evaluated with standard voxel-wise metrics. The reader study demonstrated that, for lesions larger than 10 mm, good detection performance could be maintained despite a 4-fold division in contrast agent usage, unveiling a promising avenue for reducing the gadolinium exposure of returning patients. Small lesions proved, however, difficult to handle for the deep network, showing that full-dose injections remain essential for accurate first-line diagnosis in neuro-oncology.

From Dose Reduction to Contrast Maximization: Can Deep Learning Amplify the Impact of Contrast Media on Brain Magnetic Resonance Image Quality? A Reader Study.

OBJECTIVES: The aim of this study was to evaluate a deep learning method designed to increase the contrast-to-noise ratio in contrast-enhanced gradient echo T1-weighted brain magnetic resonance imaging (MRI) acquisitions. The processed images are quantitatively evaluated in terms of lesion detection performance. MATERIALS AND METHODS: A total of 250 multiparametric brain MRIs, acquired between November 2019 and March 2021 at Gustave Roussy Cancer Campus (Villejuif, France), were considered for inclusion in this retrospective monocentric study. Independent training (107 cases; age, 55 ± 14 years; 58 women) and test (79 cases; age, 59 ± 14 years; 41 women) samples were defined. Patients had glioma, brain metastasis, meningioma, or no enhancing lesion. Gradient echo and turbo spin echo with variable flip angles postcontrast T1 sequences were acquired in all cases. For the cases that formed the training sample, "low-dose" postcontrast gradient echo T1 images using 0.025 mmol/kg injections of contrast agent were also acquired. A deep neural network was trained to synthetically enhance the low-dose T1 acquisitions, taking standard-dose T1 MRI as reference. Once trained, the contrast enhancement network was used to process the test gradient echo T1 images. A read was then performed by 2 experienced neuroradiologists to evaluate the original and processed T1 MRI sequences in terms of contrast enhancement and lesion detection performance, taking the turbo spin echo sequences as reference. RESULTS: The processed images were superior to the original gradient echo and reference turbo spin echo T1 sequences in terms of contrast-to-noise ratio (44.5 vs 9.1 and 16.8; P < 0.001), lesion-to-brain ratio (1.66 vs 1.31 and 1.44; P < 0.001), and contrast enhancement percentage (112.4% vs 85.6% and 92.2%; P < 0.001) for cases with enhancing lesions. The overall image quality of processed T1 was preferred by both readers (graded 3.4/4 on average vs 2.7/4; P < 0.001). Finally, the proposed processing improved the average sensitivity of gradient echo T1 MRI from 88% to 96% for lesions larger than 10 mm ( P = 0.008), whereas no difference was found in terms of the false detection rate (0.02 per case in both cases; P > 0.99). The same effect was observed when considering all lesions larger than 5 mm: sensitivity increased from 70% to 85% ( P < 0.001), whereas false detection rates remained similar (0.04 vs 0.06 per case; P = 0.48). With all lesions included regardless of their size, sensitivities were 59% and 75% for original and processed T1 images, respectively ( P < 0.001), and the corresponding false detection rates were 0.05 and 0.14 per case, respectively ( P = 0.06). CONCLUSION: The proposed deep learning method successfully amplified the beneficial effects of contrast agent injection on gradient echo T1 image quality, contrast level, and lesion detection performance. In particular, the sensitivity of the MRI sequence was improved by up to 16%, whereas the false detection rate remained similar.

Impact of Preprocessing and Harmonization Methods on the Removal of Scanner Effects in Brain MRI Radiomic Features.

In brain MRI radiomics studies, the non-biological variations introduced by different image acquisition settings, namely scanner effects, affect the reliability and reproducibility of the radiomics results. This paper assesses how the preprocessing methods (including N4 bias field correction and image resampling) and the harmonization methods (either the six intensity normalization methods working on brain MRI images or the ComBat method working on radiomic features) help to remove the scanner effects and improve the radiomic feature reproducibility in brain MRI radiomics. The analyses were based on in vitro datasets (homogeneous and heterogeneous phantom data) and in vivo datasets (brain MRI images collected from healthy volunteers and clinical patients with brain tumors). The results show that the ComBat method is essential and vital to remove scanner effects in brain MRI radiomic studies. Moreover, the intensity normalization methods, while not able to remove scanner effects at the radiomic feature level, still yield more comparable MRI images and improve the robustness of the harmonized features to the choice among ComBat implementations.

A computational approach to aid clinicians in selecting anti-viral drugs for COVID-19 trials.

The year 2020 witnessed a heavy death toll due to COVID-19, calling for a global emergency. The continuous ongoing research and clinical trials paved the way for vaccines. But, the vaccine efficacy in the long run is still questionable due to the mutating coronavirus, which makes drug re-positioning a reasonable alternative. COVID-19 has hence fast-paced drug re-positioning for the treatment of COVID-19 and its symptoms. This work builds computational models using matrix completion techniques to predict drug-virus association for drug re-positioning. The aim is to assist clinicians with a tool for selecting prospective antiviral treatments. Since the virus is known to mutate fast, the tool is likely to help clinicians in selecting the right set of antivirals for the mutated isolate. The main contribution of this work is a manually curated database publicly shared, comprising of existing associations between viruses and their corresponding antivirals. The database gathers similarity information using the chemical structure of drugs and the genomic structure of viruses. Along with this database, we make available a set of state-of-the-art computational drug re-positioning tools based on matrix completion. The tools are first analysed on a standard set of experimental protocols for drug target interactions. The best performing ones are applied for the task of re-positioning antivirals for COVID-19. These tools select six drugs out of which four are currently under various stages of trial, namely Remdesivir (as a cure), Ribavarin (in combination with others for cure), Umifenovir (as a prophylactic and cure) and Sofosbuvir (as a cure). Another unanimous prediction is Tenofovir alafenamide, which is a novel Tenofovir prodrug developed in order to improve renal safety when compared to its original counterpart (older version) Tenofovir disoproxil. Both are under trail, the former as a cure and the latter as a prophylactic. These results establish that the computational methods are in sync with the state-of-practice. We also demonstrate how the drugs to be used against the virus would vary as SARS-Cov-2 mutates over time by predicting the drugs for the mutated strains, suggesting the importance of such a tool in drug prediction. We believe this work would open up possibilities for applying machine learning models to clinical research for drug-virus association prediction and other similar biological problems.

Magnification-driven B-spline interpolation for cone-beam projection and backprojection.

PURPOSE: Discretizing tomographic forward and backward operations is a crucial step in the design of model-based reconstruction algorithms. Standard projectors rely on linear interpolation, whose adjoint introduces discretization errors during backprojection. More advanced techniques are obtained through geometric footprint models that may present a high computational cost and an inner logic that is not suitable for implementation on massively parallel computing architectures. In this work, we take a fresh look at the discretization of resampling transforms and focus on the issue of magnification-induced local sampling variations by introducing a new magnification-driven interpolation approach for tomography. METHODS: Starting from the existing literature on spline interpolation for magnification purposes, we provide a mathematical formulation for discretizing a one-dimensional homography. We then extend our approach to two-dimensional representations in order to account for the geometry of cone-beam computed tomography with a flat panel detector. Our new method relies on the decomposition of signals onto a space generated by nonuniform B-splines so as to capture the spatially varying magnification that locally affects sampling. We propose various degrees of approximations for a rapid implementation of the proposed approach. Our framework allows us to define a novel family of projector/backprojector pairs parameterized by the order of the employed B-splines. The state-of-the-art distance-driven interpolation appears to fit into this family thus providing new insight and computational layout for this scheme. The question of data resampling at the detector level is handled and integrated with reconstruction in a single framework. RESULTS: Results on both synthetic data and real data using a quality assurance phantom, were performed to validate our approach. We show experimentally that our approximate implementations are associated with reduced complexity while achieving a near-optimal performance. In contrast with linear interpolation, B-splines guarantee full usage of all data samples, and thus the X-ray dose, leading to more uniform noise properties. In addition, higher-order B-splines allow analytical and iterative reconstruction to reach higher resolution. These benefits appear more significant when downsampling frames acquired by X-ray flat-panel detectors with small pixels. CONCLUSIONS: Magnification-driven B-spline interpolation is shown to provide high-accuracy projection operators with good-quality adjoints for iterative reconstruction. It equally applies to backprojection for analytical reconstruction and detector data downsampling.

Calibration-Less Multi-Coil Compressed Sensing Magnetic Resonance Image Reconstruction Based on OSCAR Regularization.

Over the last decade, the combination of compressed sensing (CS) with acquisition over multiple receiver coils in magnetic resonance imaging (MRI) has allowed the emergence of faster scans while maintaining a good signal-to-noise ratio (SNR). Self-calibrating techniques, such as ESPiRIT, have become the standard approach to estimating the coil sensitivity maps prior to the reconstruction stage. In this work, we proceed differently and introduce a new calibration-less multi-coil CS reconstruction method. Calibration-less techniques no longer require the prior extraction of sensitivity maps to perform multi-coil image reconstruction but usually alternate estimation sensitivity map estimation and image reconstruction. Here, to get rid of the nonconvexity of the latter approach we reconstruct as many MR images as the number of coils. To compensate for the ill-posedness of this inverse problem, we leverage structured sparsity of the multi-coil images in a wavelet transform domain while adapting to variations in SNR across coils owing to the OSCAR (octagonal shrinkage and clustering algorithm for regression) regularization. Coil-specific complex-valued MR images are thus obtained by minimizing a convex but nonsmooth objective function using the proximal primal-dual Condat-Vù algorithm. Comparison and validation on retrospective Cartesian and non-Cartesian studies based on the Brain fastMRI data set demonstrate that the proposed reconstruction method outperforms the state-of-the-art (ℓ1-ESPIRiT, calibration-less AC-LORAKS and CaLM methods) significantly on magnitude images for the T1 and FLAIR contrasts. Additionally, further validation operated on 8 to 20-fold prospectively accelerated high-resolution ex vivo human brain MRI data collected at 7 Tesla confirms the retrospective results. Overall, OSCAR-based regularization preserves phase information more accurately (both visually and quantitatively) compared to other approaches, an asset that can only be assessed on real prospective experiments.

Multiplex-multiphoton microscopy and computational strategy for biomedical imaging.

We demonstrate the benefit of a novel laser strategy in multiphoton microscopy (MPM). The cheap, simple, and turn-key supercontinuum laser system with its spectral shaping module, constitutes an ideal approach for the one-shot microscopic imaging of many fluorophores without modification of the excitation parameters: central wavelength, spectral bandwidth, and average power. The polyvalence of the resulting multiplex-multiphoton microscopy (M-MPM) device is illustrated by images of many biomedical models from several origins (biological, medical, or vegetal), generated while keeping constant the spectral parameters of excitation. The resolution of the M-MPM device is quantified by a procedure of point-spread-function (PSF) assessment led by an original, robust, and reliable computational approach FIGARO. The estimated values for the PSF width for our M-MPM system are shown to be comparable to standard values found in optical microscopy. The simplification of the excitation system constitutes a significant instrumental progress in biomedical MPM, paving the way to the imaging of many fluorophores with a single shot of excitation without any modification of the lighting device. RESEARCH HIGHLIGHTS: A new solution of multiplex-multiphoton microscopy device is shown, resting on a supercontinuum laser. The one-shot excitation device has imaged biomedical and vegetal models. Our original computational strategy measures usual microscopy resolution.

Machine-Learning-Based Radiomics MRI Model for Survival Prediction of Recurrent Glioblastomas Treated with Bevacizumab.

Anti-angiogenic therapy with bevacizumab is a widely used therapeutic option for recurrent glioblastoma (GBM). Nevertheless, the therapeutic response remains highly heterogeneous among GBM patients with discordant outcomes. Recent data have shown that radiomics, an advanced recent imaging analysis method, can help to predict both prognosis and therapy in a multitude of solid tumours. The objective of this study was to identify novel biomarkers, extracted from MRI and clinical data, which could predict overall survival (OS) and progression-free survival (PFS) in GBM patients treated with bevacizumab using machine-learning algorithms. In a cohort of 194 recurrent GBM patients (age range 18-80), radiomics data from pre-treatment T2 FLAIR and gadolinium-injected MRI images along with clinical features were analysed. Binary classification models for OS at 9, 12, and 15 months were evaluated. Our classification models successfully stratified the OS. The AUCs were equal to 0.78, 0.85, and 0.76 on the test sets (0.79, 0.82, and 0.87 on the training sets) for the 9-, 12-, and 15-month endpoints, respectively. Regressions yielded a C-index of 0.64 (0.74) for OS and 0.57 (0.69) for PFS. These results suggest that radiomics could assist in the elaboration of a predictive model for treatment selection in recurrent GBM patients.

A Predictive Clinical-Radiomics Nomogram for Survival Prediction of Glioblastoma Using MRI.

Glioblastoma (GBM) is the most common and aggressive primary brain tumor in adult patients with a median survival of around one year. Prediction of survival outcomes in GBM patients could represent a huge step in treatment personalization. The objective of this study was to develop machine learning (ML) algorithms for survival prediction of GBM patient. We identified a radiomic signature on a training-set composed of data from the 2019 BraTS challenge (210 patients) from MRI retrieved at diagnosis. Then, using this signature along with the age of the patients for training classification models, we obtained on test-sets AUCs of 0.85, 0.74 and 0.58 (0.92, 0.88 and 0.75 on the training-sets) for survival at 9-, 12- and 15-months, respectively. This signature was then validated on an independent cohort of 116 GBM patients with confirmed disease relapse for the prediction of patients surviving less or more than the median OS of 22 months. Our model insured an AUC of 0.71 (0.65 on train). The Kaplan-Meier method showed significant OS difference between groups (log-rank p = 0.05). These results suggest that radiomic signatures may improve survival outcome predictions in GBM thus creating a solid clinical tool for tailoring therapy in this population.