Search

Purpose: We present SCAMPI (Sparsity Constrained Application of deep Magnetic resonance Priors for Image reconstruction), an untrained deep Neural Network for MRI reconstruction without previous training on datasets. It expands the Deep Image Prior approach with a multidomain, sparsity-enforcing loss function to achieve higher image quality at a faster convergence speed than previously reported methods., Methods: Two-dimensional MRI data from the FastMRI dataset with Cartesian undersampling in phase-encoding direction were reconstructed for different acceleration rates for single coil and multicoil data., Results: The performance of our architecture was compared to state-of-the-art Compressed Sensing methods and ConvDecoder, another untrained Neural Network for two-dimensional MRI reconstruction. SCAMPI outperforms these by better reducing undersampling artifacts and yielding lower error metrics in multicoil imaging. In comparison to ConvDecoder, the U-Net architecture combined with an elaborated loss-function allows for much faster convergence at higher image quality. SCAMPI can reconstruct multicoil data without explicit knowledge of coil sensitivity profiles. Moreover, it is a novel tool for reconstructing undersampled single coil k-space data., Conclusion: Our approach avoids overfitting to dataset features, that can occur in Neural Networks trained on databases, because the network parameters are tuned only on the reconstruction data. It allows better results and faster reconstruction than the baseline untrained Neural Network approach., (© 2024 The Authors. Magnetic Resonance in Medicine published by Wiley Periodicals LLC on behalf of International Society for Magnetic Resonance in Medicine.)

Purpose: To introduce a novel deep model-based architecture (DMBA), SPICER, that uses pairs of noisy and undersampled k-space measurements of the same object to jointly train a model for MRI reconstruction and automatic coil sensitivity estimation., Methods: SPICER consists of two modules to simultaneously reconstructs accurate MR images and estimates high-quality coil sensitivity maps (CSMs). The first module, CSM estimation module, uses a convolutional neural network (CNN) to estimate CSMs from the raw measurements. The second module, DMBA-based MRI reconstruction module, forms reconstructed images from the input measurements and the estimated CSMs using both the physical measurement model and learned CNN prior. With the benefit of our self-supervised learning strategy, SPICER can be efficiently trained without any fully sampled reference data., Results: We validate SPICER on both open-access datasets and experimentally collected data, showing that it can achieve state-of-the-art performance in highly accelerated data acquisition settings (up to 10 × $$ 10\times $$ ). Our results also highlight the importance of different modules of SPICER-including the DMBA, the CSM estimation, and the SPICER training loss-on the final performance of the method. Moreover, SPICER can estimate better CSMs than pre-estimation methods especially when the ACS data is limited., Conclusion: Despite being trained on noisy undersampled data, SPICER can reconstruct high-quality images and CSMs in highly undersampled settings, which outperforms other self-supervised learning methods and matches the performance of the well-known E2E-VarNet trained on fully sampled ground-truth data., (© 2024 International Society for Magnetic Resonance in Medicine.)

Purpose: In MRI, motion artifacts can significantly degrade image quality. Motion artifact correction methods using deep neural networks usually required extensive training on large datasets, making them time-consuming and resource-intensive. In this paper, an unsupervised deep learning-based motion artifact correction method for turbo-spin echo MRI is proposed using the deep image prior framework., Theory and Methods: The proposed approach takes advantage of the high impedance to motion artifacts offered by the neural network parameterization to remove motion artifacts in MR images. The framework consists of parameterization of MR image, automatic spatial transformation, and motion simulation model. The proposed method synthesizes motion-corrupted images from the motion-corrected images generated by the convolutional neural network, where an optimization process minimizes the objective function between the synthesized images and the acquired images., Results: In the simulation study of 280 slices from 14 subjects, the proposed method showed a significant increase in the averaged structural similarity index measure by 0.2737 in individual coil images and by 0.4550 in the root-sum-of-square images. In addition, the ablation study demonstrated the effectiveness of each proposed component in correcting motion artifacts compared to the corrected images produced by the baseline method. The experiments on real motion dataset has shown its clinical potential., Conclusion: The proposed method exhibited significant quantitative and qualitative improvements in correcting rigid and in-plane motion artifacts in MR images acquired using turbo spin-echo sequence., (© 2024 International Society for Magnetic Resonance in Medicine.)

Subject motion is a long-standing problem of magnetic resonance imaging (MRI), which can seriously deteriorate the image quality. Various prospective and retrospective methods have been proposed for MRI motion correction, among which deep learning approaches have achieved state-of-the-art motion correction performance. This survey paper aims to provide a comprehensive review of deep learning-based MRI motion correction methods. Neural networks used for motion artifacts reduction and motion estimation in the image domain or frequency domain are detailed. Furthermore, besides motion-corrected MRI reconstruction, how estimated motion is applied in other downstream tasks is briefly introduced, aiming to strengthen the interaction between different research areas. Finally, we identify current limitations and point out future directions of deep learning-based MRI motion correction., (© 2024. The Author(s), under exclusive licence to European Society for Magnetic Resonance in Medicine and Biology (ESMRMB).)

Purpose: MR-STAT is a relatively new multiparametric quantitative MRI technique in which quantitative paramater maps are obtained by solving a large-scale nonlinear optimization problem. Managing reconstruction times is one of the main challenges of MR-STAT. In this work we leverage GPU hardware to reduce MR-STAT reconstruction times. A highly optimized, GPU-compatible Bloch simulation toolbox is developed as part of this work that can be utilized for other quantitative MRI techniques as well., Methods: The Julia programming language was used to develop a flexible yet highly performant and GPU-compatible Bloch simulation toolbox called BlochSimulators.jl. The runtime performance of the toolbox is benchmarked against other Bloch simulation toolboxes. Furthermore, a (partially matrix-free) modification of a previously presented (matrix-free) MR-STAT reconstruction algorithm is proposed and implemented using the Julia language on GPU hardware. The proposed algorithm is combined with BlochSimulators.jl and the resulting MR-STAT reconstruction times on GPU hardware are compared to previously presented MR-STAT reconstruction times., Results: The BlochSimulators.jl package demonstrates superior runtime performance on both CPU and GPU hardware when compared to other existing Bloch simulation toolboxes. The GPU-accelerated partially matrix-free MR-STAT reconstruction algorithm, which relies on BlochSimulators.jl, allows for reconstructions of 68 seconds per two-dimensional (2D slice)., Conclusion: By combining the proposed Bloch simulation toolbox and the partially matrix-free reconstruction algorithm, 2D MR-STAT reconstructions can be performed in the order of one minute on a modern GPU card. The Bloch simulation toolbox can be utilized for other quantitative MRI techniques as well, for example for online dictionary generation for MR Fingerprinting., (© 2024 The Authors. Magnetic Resonance in Medicine published by Wiley Periodicals LLC on behalf of International Society for Magnetic Resonance in Medicine.)

This study aims to develop an AI-enhanced methodology for the expedited and accurate diagnosis of Multiple Sclerosis (MS), a chronic disease affecting the central nervous system leading to progressive impairment. Traditional diagnostic methods are slow and require substantial expertise, underscoring the need for innovative solutions. Our approach involves two phases: initially, extracting features from brain MRI images using first-order histograms, the gray level co-occurrence matrix, and local binary patterns. A unique feature selection technique combining the Sine Cosine Algorithm with the Sea-horse Optimizer is then employed to identify the most significant features. Utilizing the eHealth lab dataset, which includes images from 38 MS patients (mean age 34.1 ± 10.5 years; 17 males, 21 females) and matched healthy controls, our model achieved a remarkable 97.97% detection accuracy using the k-nearest neighbors classifier. Further validation on a larger dataset containing 262 MS cases (199 females, 63 males; mean age 31.26 ± 10.34 years) and 163 healthy individuals (109 females, 54 males; mean age 32.35 ± 10.30 years) demonstrated a 92.94% accuracy for FLAIR images and 91.25% for T2-weighted images with the Random Forest classifier, outperforming existing MS detection methods. These results highlight the potential of the proposed technique as a clinical decision-making tool for the early identification and management of MS., (© 2024. The Author(s).)

This paper proposes a novel approach, BTC-SAGAN-CHA-MRI, for the classification of brain tumors using a SAGAN optimized with a Color Harmony Algorithm. Brain cancer, with its high fatality rate worldwide, especially in the case of brain tumors, necessitates more accurate and efficient classification methods. While existing deep learning approaches for brain tumor classification have been suggested, they often lack precision and require substantial computational time.The proposed method begins by gathering input brain MR images from the BRATS dataset, followed by a pre-processing step using a Mean Curvature Flow-based approach to eliminate noise. The pre-processed images then undergo the Improved Non-Sub sampled Shearlet Transform (INSST) for extracting radiomic features. These features are fed into the SAGAN, which is optimized with a Color Harmony Algorithm to categorize the brain images into different tumor types, including Gliomas, Meningioma, and Pituitary tumors. This innovative approach shows promise in enhancing the precision and efficiency of brain tumor classification, holding potential for improved diagnostic outcomes in the field of medical imaging. The accuracy acquired for the brain tumor identification from the proposed method is 99.29%. The proposed BTC-SAGAN-CHA-MRI technique achieves 18.29%, 14.09% and 7.34% higher accuracy and 67.92%,54.04%, and 59.08% less Computation Time when analyzed to the existing models, like Brain tumor diagnosis utilizing deep learning convolutional neural network with transfer learning approach (BTC-KNN-SVM-MRI); M3BTCNet: multi model brain tumor categorization under metaheuristic deep neural network features optimization (BTC-CNN-DEMFOA-MRI), and efficient method depending upon hierarchical deep learning neural network classifier for brain tumour categorization (BTC-Hie DNN-MRI) respectively.

Chemical exchange saturation transfer (CEST) is a versatile technique that enables noninvasive detections of endogenous metabolites present in low concentrations in living tissue. However, CEST imaging suffers from an inherently low signal-to-noise ratio (SNR) due to the decreased water signal caused by the transfer of saturated spins. This limitation challenges the accuracy and reliability of quantification in CEST imaging. In this study, a novel spatial-spectral denoising method, called BOOST (suBspace denoising with nOnlocal lOw-rank constraint and Spectral local-smooThness regularization), was proposed to enhance the SNR of CEST images and boost quantification accuracy. More precisely, our method initially decomposes the noisy CEST images into a low-dimensional subspace by leveraging the global spectral low-rank prior. Subsequently, a spatial nonlocal self-similarity prior is applied to the subspace-based images. Simultaneously, the spectral local-smoothness property of Z-spectra is incorporated by imposing a weighted spectral total variation constraint. The efficiency and robustness of BOOST were validated in various scenarios, including numerical simulations and preclinical and clinical conditions, spanning magnetic field strengths from 3.0 to 11.7 T. The results demonstrated that BOOST outperforms state-of-the-art algorithms in terms of noise elimination. As a cost-effective and widely available post-processing method, BOOST can be easily integrated into existing CEST protocols, consequently promoting accuracy and reliability in detecting subtle CEST effects., (© 2023 John Wiley & Sons Ltd.)

Background: Segmentation of white matter hyperintensities (WMH) in CADASIL, one of the most severe cerebral small vessel disease of genetic origin, is challenging., Method: We adapted and validated an automatic method based on a convolutional neural network (CNN) algorithm and using a large dataset of 2D and/or 3D FLAIR and T1-weighted images acquired in 132 patients, to measure the progression of WMH in this condition., Results: The volume of WMH measured using this method correlated strongly with reference data validated by experts. WMH segmentation was also clearly improved compared to the BIANCA segmentation method. Combining two successive learning models was found to be of particular interest, reducing the number of false-positive voxels and the extent of under-segmentation detected after a single-stage process. With the two-stage approach, WMH progression correlated with measures derived from the reference masks for lesions increasing with age, and with the variable WMH progression trajectories at individual level. We also confirmed the expected effect of the initial load of WMH and the influence of the type of MRI acquisition on measures of this progression., Conclusion: Altogether, our findings suggest that WMH progression in CADASIL can be measured automatically with adequate confidence by a CNN segmentation algorithm., Competing Interests: Declaration of competing interest The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper., (Copyright © 2024 The Authors. Published by Elsevier Ltd.. All rights reserved.)

Purpose: The technological advancements in surgical robots compatible with magnetic resonance imaging (MRI) have created an indispensable demand for real-time deformable image registration (DIR) of pre- and intra-operative MRI, but there is a lack of relevant methods. Challenges arise from dimensionality mismatch, resolution discrepancy, non-rigid deformation and requirement for real-time registration., Methods: In this paper, we propose a real-time DIR framework called MatchMorph, specifically designed for the registration of low-resolution local intraoperative MRI and high-resolution global preoperative MRI. Firstly, a super-resolution network based on global inference is developed to enhance the resolution of intraoperative MRI to the same as preoperative MRI, thus resolving the resolution discrepancy. Secondly, a fast-matching algorithm is designed to identify the optimal position of the intraoperative MRI within the corresponding preoperative MRI to address the dimensionality mismatch. Further, a cross-attention-based dual-stream DIR network is constructed to manipulate the deformation between pre- and intra-operative MRI, real-timely., Results: We conducted comprehensive experiments on publicly available datasets IXI and OASIS to evaluate the performance of the proposed MatchMorph framework. Compared to the state-of-the-art (SOTA) network TransMorph, the designed dual-stream DIR network of MatchMorph achieved superior performance with a 1.306 mm smaller HD and a 0.07 mm smaller ASD score on the IXI dataset. Furthermore, the MatchMorph framework demonstrates an inference speed of approximately 280 ms., Conclusions: The qualitative and quantitative registration results obtained from high-resolution global preoperative MRI and simulated low-resolution local intraoperative MRI validated the effectiveness and efficiency of the proposed MatchMorph framework., Competing Interests: Declaration of competing interest All authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper., (Copyright © 2024 Elsevier Ltd. All rights reserved.)

Deep cascaded networks have been extensively studied and applied to accelerate Magnetic Resonance Imaging (MRI) and have shown promising results. Most existing works employ a large cascading number for the sake of superior performances. However, due to the lack of proper guidance, the reconstruction performance can easily reach a plateau and even face degradation if simply increasing the cascading number. In this paper, we aim to boost the reconstruction performance from a novel perspective by proposing a parallel architecture called DIRECTION that fully exploits the guiding value of the reconstruction residual of each subnetwork. Specifically, we introduce a novel Reconstruction Residual-Based Feature Modulation Mechanism (RRFMM) which utilizes the reconstruction residual of the previous subnetwork to guide the next subnetwork at the feature level. To achieve this, a Residual Attention Modulation Block (RAMB) is proposed to generate attention maps using multi-scale residual features to modulate the image features of the corresponding scales. Equipped with this strategy, each subnetwork within the cascaded network possesses its unique optimization objective and emphasis rather than blindly updating its parameters. To further boost the performance, we introduce the Cross-Stage Feature Reuse Connection (CSFRC) and the Reconstruction Dense Connection (RDC), which can reduce information loss and enhance representative ability. We conduct sufficient experiments and evaluate our method on the fastMRI knee dataset using multiple subsampling masks. Comprehensive experimental results show that our method can markedly boost the performance of cascaded networks and significantly outperforms other compared state-of-the-art methods quantitatively and qualitatively., (Copyright © 2024. Published by Elsevier Inc.)

Magnetic resonance imaging produces detailed anatomical and physiological images of the human body that can be used in the clinical diagnosis and treatment of diseases. However, MRI suffers its comparatively longer acquisition time than other imaging methods and is thus vulnerable to motion artifacts, which ultimately lead to likely failed or even wrong diagnosis. In order to perform faster reconstruction, deep learning-based methods along with traditional strategies such as parallel imaging and compressed sensing come into play in recent years in this field. Meanwhile, in order to better analyze the diseases, it is also often necessary to acquire images in the same region of interest under different modalities, which yield images with different contrast levels. However, most of these aforementioned methods tend to use single-modal images for reconstruction, neglecting the correlation and redundancy information embedded in MR images acquired with different modalities. While there are works on multi-modal reconstruction, the information is yet to be efficiently explored. In this paper, we propose an end-to-end neural network called MLMFNet, which helps the reconstruction of the target modality by using information from the auxiliary modality across feature channels and layers. Specifically, this is highlighted by three components: (I) An encoder based on UNet with a single-stream strategy that fuses auxiliary and target modalities; (II) a decoder that tends to multi-level features from all layers of the encoder, and (III) a channel attention module. Quantitative and qualitative analyses are performed on a public brain dataset and knee brain dataset, which show that the proposed method achieves satisfying results in MRI reconstruction within the multi-modal context, and also demonstrate its effectiveness and potential to be used in clinical practice., Competing Interests: Declaration of competing interest The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper., (Copyright © 2023. Published by Elsevier Inc.)

Independent component analysis (ICA) and dictionary learning (DL) are the most successful blind source separation (BSS) methods for functional magnetic resonance imaging (fMRI) data analysis. However, ICA to higher and DL to lower extent may suffer from performance degradation by the presence of anomalous observations in the recovered time courses (TCs) and high overlaps among spatial maps (SMs). This paper addressed both problems using a novel three-layered sparse DL (TLSDL) algorithm that incorporated prior information in the dictionary update process and recovered full-rank outlier-free TCs from highly corrupted measurements. The associated sequential DL model involved factorizing each subject's data into a multi-subject (MS) dictionary and MS sparse code while imposing a low-rank and a sparse matrix decomposition restriction on the dictionary matrix. It is derived by solving three layers of feature extraction and component estimation. The first and second layers captured brain regions with low and moderate spatial overlaps, respectively. The third layer that segregated regions with significant spatial overlaps solved a sequence of vector decomposition problems using the proximal alternating linearized minimization (PALM) method and solved a decomposition restriction using the alternating directions method (ALM). It learned outlier-free dynamics that integrate spatiotemporal diversities across brains and external information. It differs from existing DL methods owing to its unique optimization model, which incorporates prior knowledge, subject-wise/multi-subject representation matrices, and outlier handling. The TLSDL algorithm was compared with existing dictionary learning algorithms using experimental and synthetic fMRI datasets to verify its performance. Overall, the mean correlation value was found to be 26 % higher for the TLSDL than for the state-of-the-art subject-wise sequential DL (swsDL) technique., (© 2024. The Author(s).)

Quantitative susceptibility mapping (QSM) is a rising MRI-based technology and quite a few QSM-related algorithms have been proposed to reconstruct maps of tissue susceptibility distribution from phase images. In this paper, we develop a comprehensive susceptibility imaging process and analysis studio (SIPAS) that can accomplish reliable QSM processing and offer a standardized evaluation system. Specifically, SIPAS integrates multiple methods for each step, enabling users to select algorithm combinations according to data conditions, and QSM maps could be evaluated by two aspects, including image quality indicators within all voxels and region-of-interest (ROI) analysis. Through a sophisticated design of user-friendly interfaces, the results of each procedure are able to be exhibited in axial, coronal, and sagittal views in real-time, meanwhile ROIs can be displayed in 3D rendering visualization. The accuracy and compatibility of SIPAS are demonstrated by experiments on multiple in vivo human brain datasets acquired from 3T, 5T, and 7T MRI scanners of different manufacturers. We also validate the QSM maps obtained by various algorithm combinations in SIPAS, among which the combination of iRSHARP and SFCR achieves the best results on its evaluation system. SIPAS is a comprehensive, sophisticated, and reliable toolkit that may prompt the QSM application in scientific research and clinical practice., Competing Interests: Declaration of competing interest The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper., (Copyright © 2024 The Author(s). Published by Elsevier Inc. All rights reserved.)

Magnetic Resonance Imaging (MRI) is an important diagnostic technique for brain tumors due to its ability to generate images without tissue damage or skull artifacts. Therefore, MRI images are widely used to achieve the segmentation of brain tumors. This paper is the first attempt to discuss the use of optimization spiking neural P systems to improve the threshold segmentation of brain tumor images. To be specific, a threshold segmentation approach based on optimization numerical spiking neural P systems with adaptive multi-mutation operators (ONSNPSamos) is proposed to segment brain tumor images. More specifically, an ONSNPSamo with a multi-mutation strategy is introduced to balance exploration and exploitation abilities. At the same time, an approach combining the ONSNPSamo and connectivity algorithms is proposed to address the brain tumor segmentation problem. Our experimental results from CEC 2017 benchmarks (basic, shifted and rotated, hybrid, and composition function optimization problems) demonstrate that the ONSNPSamo is better than or close to 12 optimization algorithms. Furthermore, case studies from BraTS 2019 show that the approach combining the ONSNPSamo and connectivity algorithms can more effectively segment brain tumor images than most algorithms involved.

In the medical field, datasets are mostly integrated across sites due to difficult data acquisition and insufficient data at a single site. The domain shift problem caused by the heterogeneous distribution among multi-site data makes autism spectrum disorder (ASD) hard to identify. Recently, domain adaptation has received considerable attention as a promising solution. However, domain adaptation on graph data like brain networks has not been fully studied. It faces two major challenges: (1) complex graph structure; and (2) multiple source domains. To overcome the issues, we propose an end-to-end structure-aware domain adaptation framework for brain network analysis (BrainDAS) using resting-state functional magnetic resonance imaging (rs-fMRI). The proposed approach contains two stages: supervision-guided multi-site graph domain adaptation with dynamic kernel generation and graph classification with attention-based graph pooling. We evaluate our BrainDAS on a public dataset provided by Autism Brain Imaging Data Exchange (ABIDE) which includes 871 subjects from 17 different sites, surpassing state-of-the-art algorithms in several different evaluation settings. Furthermore, our promising results demonstrate the interpretability and generalization of the proposed method. Our code is available at https://github.com/songruoxian/BrainDAS., Competing Interests: Declaration of competing interest The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper., (Copyright © 2024 Elsevier B.V. All rights reserved.)

Lung diseases are almost invariably heterogeneous and progressive, making it imperative to capture temporally and spatially explicit information to understand the disease initiation and progression. Imaging the lung with MRI-particularly in the preclinical setting-has historically been challenging because of relatively low lung tissue density, rapid cardiac and respiratory motion, and rapid transverse (T 2 *) relaxation. These limitations can largely be mitigated using ultrashort-echo-time (UTE) sequences, which are intrinsically robust to motion and avoid significant T 2 * decay. A significant disadvantage of common radial UTE sequences is that they require inefficient, center-out k-space sampling, resulting in long acquisition times relative to conventional Cartesian sequences. Therefore, pulmonary images acquired with radial UTE are often undersampled to reduce acquisition time. However, undersampling reduces image SNR, introduces image artifacts, and degrades true image resolution. The level of undersampling is further increased if offline gating techniques like retrospective gating are employed, because only a portion (∼40-50%) of the data is used in the final image reconstruction. Here, we explore the impact of undersampling on SNR and T 2 * mapping in mouse lung imaging using simulation and in-vivo data. Increased scatter in both metrics was noticeable at around 50% sampling. Parenchymal apparent SNR only decreased slightly (average decrease ∼ 1.4) with as little as 10% sampling. Apparent T 2 * remained similar across undersampling levels, but it became significantly increased (p < 0.05) below 80% sampling. These trends suggest that undersampling can generate quantifiable, but moderate changes in the apparent value of T 2 *. Moreover, these approaches to assess the impact of undersampling are straightforward to implement and can readily be expanded to assess the quantitative impact of other MR acquisition and reconstruction parameters., Competing Interests: Declaration of competing interest The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper., (Copyright © 2024 Elsevier Inc. All rights reserved.)

In recent years, brain imaging genomics has advanced significantly in revealing underlying pathological mechanisms of Alzheimer's disease (AD) and providing early diagnosis. In this paper, we present a framework for diagnosing AD that integrates magnetic resonance imaging (fMRI) genetic preprocessing, feature selection, and a support vector machine (SVM) model. In particular, a novel sand cat swarm optimization (SCSO) algorithm, named SS-SCSO, which integrates the spiral search strategy and alert mechanism from the sparrow search algorithm, is proposed to optimize the SVM parameters. The optimization efficacy of the SS-SCSO algorithm is evaluated using CEC2017 benchmark functions, with results compared with other metaheuristic algorithms (MAs). The proposed SS-SCSO-SVM framework has been effectively employed to classify different stages of cognitive impairment in Alzheimer's Disease using imaging genetic datasets from the Alzheimer's Disease Neuroimaging Initiative. It has demonstrated excellent classification accuracies for four typical cases, including AD, early mild cognitive impairment, late mild cognitive impairment, and healthy control. Furthermore, experiment results indicate that the SS-SCSO-SVM algorithm has a stronger exploration capability for diagnosing AD compared to other well-established MAs and machine learning techniques., (© The Author(s) 2024. Published by Oxford University Press. All rights reserved. For permissions, please e-mail: journals.permission@oup.com.)

Background: Volume of interest (VOI) segmentation is a crucial step for Radiomics analyses and radiotherapy (RT) treatment planning. Because it can be time-consuming and subject to inter-observer variability, we developed and tested a Deep Learning-based automatic segmentation (DLBAS) algorithm to reproducibly predict the primary gross tumor as VOI for Radiomics analyses in extremity soft tissue sarcomas (STS)., Methods: A DLBAS algorithm was trained on a cohort of 157 patients and externally tested on an independent cohort of 87 patients using contrast-enhanced MRI. Manual tumor delineations by a radiation oncologist served as ground truths (GTs). A benchmark study with 20 cases from the test cohort compared the DLBAS predictions against manual VOI segmentations of two residents (ERs) and clinical delineations of two radiation oncologists (ROs). The ROs rated DLBAS predictions regarding their direct applicability., Results: The DLBAS achieved a median dice similarity coefficient (DSC) of 0.88 against the GTs in the entire test cohort (interquartile range (IQR): 0.11) and a median DSC of 0.89 (IQR 0.07) and 0.82 (IQR 0.10) in comparison to ERs and ROs, respectively. Radiomics feature stability was high with a median intraclass correlation coefficient of 0.97, 0.95 and 0.94 for GTs, ERs, and ROs, respectively. DLBAS predictions were deemed clinically suitable by the two ROs in 35% and 20% of cases, respectively., Conclusion: The results demonstrate that the DLBAS algorithm provides reproducible VOI predictions for radiomics feature extraction. Variability remains regarding direct clinical applicability of predictions for RT treatment planning., Competing Interests: Declaration of competing interest The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper., (Copyright © 2024 The Authors. Published by Elsevier B.V. All rights reserved.)

Brain tumors, often referred to as intracranial tumors, are abnormal tissue masses that arise from rapidly multiplying cells. During medical imaging, it is essential to separate brain tumors from healthy tissue. The goal of this paper is to improve the accuracy of separating tumorous regions from healthy tissues in medical imaging, specifically for brain tumors in MRI images which is difficult in the field of medical image analysis. In our research work, we propose IC-Net (Inverted-C), a novel semantic segmentation architecture that combines elements from various models to provide effective and precise results. The architecture includes Multi-Attention (MA) blocks, Feature Concatenation Networks (FCN), Attention-blocks which performs crucial tasks in improving brain tumor segmentation. MA-block aggregates multi-attention features to adapt to different tumor sizes and shapes. Attention-block is focusing on key regions, resulting in more effective segmentation in complex images. FCN-block captures diverse features, making the model more robust to various characteristics of brain tumor images. Our proposed architecture is used to accelerate the training process and also to address the challenges posed by the diverse nature of brain tumor images, ultimately leads to potentially improved segmentation performance. IC-Net significantly outperforms the typical U-Net architecture and other contemporary effective segmentation techniques. On the BraTS 2020 dataset, our IC-Net design obtained notable outcomes in Accuracy, Loss, Specificity, Sensitivity as 99.65, 0.0159, 99.44, 99.86 and DSC (core, whole, and enhancing tumors as 0.998717, 0.888930, 0.866183) respectively., (© 2024. The Author(s).)

Cardiac MRI segmentation is a significant research area in medical image processing, holding immense clinical and scientific importance in assisting the diagnosis and treatment of heart diseases. Currently, existing cardiac MRI segmentation algorithms are often constrained by specific datasets and conditions, leading to a notable decrease in segmentation performance when applied to diverse datasets. These limitations affect the algorithm's overall performance and generalization capabilities. Inspired by ConvNext, we introduce a two-dimensional cardiac MRI segmentation U-shaped network called ConvNextUNet. It is the first application of a combination of ConvNext and the U-shaped architecture in the field of cardiac MRI segmentation. Firstly, we incorporate up-sampling modules into the original ConvNext architecture and combine it with the U-shaped framework to achieve accurate reconstruction. Secondly, we integrate Input Stem into ConvNext, and introduce attention mechanisms along the bridging path. By merging features extracted from both the encoder and decoder, a probability distribution is obtained through linear and nonlinear transformations, serving as attention weights, thereby enhancing the signal of the same region of interest. The resulting attention weights are applied to the decoder features, highlighting the region of interest. This allows the model to simultaneously consider local context and global details during the learning phase, fully leveraging the advantages of both global and local perception for a more comprehensive understanding of cardiac anatomical structures. Consequently, the model demonstrates a clear advantage and robust generalization capability, especially in small-region segmentation. Experimental results on the ACDC, LVQuan19, and RVSC datasets confirm that the ConvNextUNet model outperforms the current state-of-the-art models, particularly in small-region segmentation tasks. Furthermore, we conducted cross-dataset training and testing experiments, which revealed that the pre-trained model can accurately segment diverse cardiac datasets, showcasing its powerful generalization capabilities. The source code of this project is available at https://github.com/Zemin-Cai/ConvNextUNet., Competing Interests: Declaration of competing interest The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper., (Copyright © 2024 Elsevier Ltd. All rights reserved.)

Automated Motion Artefact Detection (MAD) in Magnetic Resonance Imaging (MRI) is a field of study that aims to automatically flag motion artefacts in order to prevent the requirement for a repeat scan. In this paper, we identify and tackle the three current challenges in the field of automated MAD; (1) reliance on fully-supervised training, meaning they require specific examples of Motion Artefacts (MA), (2) inconsistent use of benchmark datasets across different works and use of private datasets for testing and training of newly proposed MAD techniques and (3) a lack of sufficiently large datasets for MRI MAD. To address these challenges, we demonstrate how MAs can be identified by formulating the problem as an unsupervised Anomaly Detection (AD) task. We compare the performance of three State-of-the-Art AD algorithms DeepSVDD, Interpolated Gaussian Descriptor and FewSOME on two open-source Brain MRI datasets on the task of MAD and MA severity classification, with FewSOME achieving a MAD AUC >90% on both datasets and a Spearman Rank Correlation Coefficient of 0.8 on the task of MA severity classification. These models are trained in the few shot setting, meaning large Brain MRI datasets are not required to build robust MAD algorithms. This work also sets a standard protocol for testing MAD algorithms on open-source benchmark datasets. In addition to addressing these challenges, we demonstrate how our proposed 'anomaly-aware' scoring function improves FewSOME's MAD performance in the setting where one and two shots of the anomalous class are available for training. Code available at https://github.com/niamhbelton/Unsupervised-Brain-MRI-Motion-Artefact-Detection/., Competing Interests: Declaration of competing interest The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper., (Copyright © 2024 The Author(s). Published by Elsevier Ltd.. All rights reserved.)

In this paper, we present the Magnetic Resonance Image (MRI) denoising method via nonlocal multidimensional low rank tensor transformation constraint (NLRT). We first design a nonlocal MRI denoising method by non-local low rank tensor recovery framework. Furthermore, a multidimensional low rank tensor constraint is used to obtain low-rank prior information combined with 3-dimensional structure feature of MRI image cubes. Our NLRT can achieve denoising by retaining more image detail information. The optimization and updating process of the model is solved via the alternating direction method of multipliers (ADMM) algorithm. Several state-of-the-art denoising methods are selected for comparative experiments. In order to reflect the performance of the denoising method, Rician noise with different levels is added to the experiment to analyze the results. The experimental results prove that our NLTR has more outstanding denoising ability and can obtain better MRI images.

Magnetic resonance imaging (MRI) plays a crucial role in the diagnosis of ischemic stroke. Accurate segmentation of the infarct is of great significance for selecting intervention treatment methods and evaluating the prognosis of patients. To address the issue of poor segmentation accuracy of existing methods for multiscale stroke lesions, a novel encoder-decoder architecture network based on depthwise separable convolution is proposed. Firstly, this network replaces the convolutional layer modules of the U-Net with redesigned depthwise separable convolution modules. Secondly, an modified Atrous spatial pyramid pooling (MASPP) is introduced to enlarge the receptive field and enhance the extraction of multiscale features. Thirdly, an attention gate (AG) structure is incorporated at the skip connections of the network to further enhance the segmentation accuracy of multiscale targets. Finally, Experimental evaluations are conducted using the ischemic stroke lesion segmentation 2022 challenge (ISLES2022) dataset. The proposed algorithm in this paper achieves Dice similarity coefficient (DSC), Hausdorff distance (HD), sensitivity (SEN), and precision (PRE) scores of 0.816 5, 3.668 1, 0.889 2, and 0.894 6, respectively, outperforming other mainstream segmentation algorithms. The experimental results demonstrate that the method in this paper effectively improves the segmentation of infarct lesions, and is expected to provide a reliable support for clinical diagnosis and treatment.

Introduction: The aim of this study was to assess the accuracy of a preoperative screening algorithm in identifying low-risk endometrial cancer (EC) patients to ensure optimal care., Methods: A total of 277 patients with primary EC confirmed through biopsy underwent magnetic resonance imaging (MRI). Patients with risk factors for advanced high-risk EC, such as non-endometrioid histology, high-grade differentiation status, deep myometrial invasion, or spread beyond the uterine corpus, were systematically excluded. The remaining preoperatively screened patients with stage IA low-grade endometrioid EC (EEC) (n = 93) underwent surgery in a tertiary hospital. The accuracy of the preoperative diagnosis was evaluated by comparing the findings with the postoperative histopathological results. Disease-free survival (DFS) and overall survival (OS) were analyzed using 8-year follow-up data., Results: Postoperative histopathological analysis revealed that all patients had grade 1-2 EEC localized to the corpus uteri. Only three patients had deep myometrial invasion (stage IB), but they remained disease-free after 6-9 years of follow-up. The median follow-up time for all patients was 8.7 years. The DFS was 7.6 years, and the OS was 8.6 years. Two patients with stage IA grade 1 EEC experienced relapse and, despite treatment, died of EC. No other EC-related deaths occurred., Conclusions: The screening algorithm accurately identified low-risk EC patients without compromising survival. Therefore, the algorithm appears to be feasible for selecting patients for surgery in secondary hospitals., Competing Interests: Declaration of competing interest The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper., (© 2024 Published by Elsevier Ltd.)

Purpose: To investigate the potential of combining Compressed Sensing (CS) and a newly developed AI-based super resolution reconstruction prototype consisting of a series of convolutional neural networks (CNN) for a complete five-minute 2D knee MRI protocol., Methods: In this prospective study, 20 volunteers were examined using a 3T-MRI-scanner (Ingenia Elition X, Philips). Similar to clinical practice, the protocol consists of a fat-saturated 2D-proton-density-sequence in coronal, sagittal and transversal orientation as well as a sagittal T1-weighted sequence. The sequences were acquired with two different resolutions (standard and low resolution) and the raw data reconstructed with two different reconstruction algorithms: a conventional Compressed SENSE (CS) and a new CNN-based algorithm for denoising and subsequently to interpolate and therewith increase the sharpness of the image (CS-SuperRes). Subjective image quality was evaluated by two blinded radiologists reviewing 8 criteria on a 5-point Likert scale and signal-to-noise ratio calculated as an objective parameter., Results: The protocol reconstructed with CS-SuperRes received higher ratings than the time-equivalent CS reconstructions, statistically significant especially for low resolution acquisitions (e.g., overall image impression: 4.3 ± 0.4 vs. 3.4 ± 0.4, p < 0.05). CS-SuperRes reconstructions for the low resolution acquisition were comparable to traditional CS reconstructions with standard resolution for all parameters, achieving a scan time reduction from 11:01 min to 4:46 min (57 %) for the complete protocol (e.g. overall image impression: 4.3 ± 0.4 vs. 4.0 ± 0.5, p < 0.05)., Conclusion: The newly-developed AI-based reconstruction algorithm CS-SuperRes allows to reduce scan time by 57% while maintaining unchanged image quality compared to the conventional CS reconstruction., Competing Interests: Declaration of competing interest David Maintz is part of the speakers bureau at Philips Healthcare; all other authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper., (Copyright © 2024 The Author(s). Published by Elsevier B.V. All rights reserved.)

Magnetic Resonance Imaging (MRI) reconstruction has made significant progress with the introduction of Deep Learning (DL) technology combined with Compressed Sensing (CS). However, most existing methods require large fully sampled training datasets to supervise the training process, which may be unavailable in many applications. Current unsupervised models also show limitations in performance or speed and may face unaligned distributions during testing. This paper proposes an unsupervised method to train competitive reconstruction models that can generate high-quality samples in an end-to-end style. Firstly teacher models are trained by filling the re-undersampled images and compared with the undersampled images in a self-supervised manner. The teacher models are then distilled to train another cascade model that can leverage the entire undersampled k-space during its training and testing. Additionally, we propose an adaptive distillation method to re-weight the samples based on the variance of teachers, which represents the confidence of the reconstruction results, to improve the quality of distillation. Experimental results on multiple datasets demonstrate that our method significantly accelerates the inference process while preserving or even improving the performance compared to the teacher model. In our tests, the distilled models show 5%-10% improvements in PSNR and SSIM compared with no distillation and are 10 times faster than the teacher.

Deep learning models often need sufficient supervision (i.e., labelled data) in order to be trained effectively. By contrast, humans can swiftly learn to identify important anatomy in medical images like MRI and CT scans, with minimal guidance. This recognition capability easily generalises to new images from different medical facilities and to new tasks in different settings. This rapid and generalisable learning ability is largely due to the compositional structure of image patterns in the human brain, which are not well represented in current medical models. In this paper, we study the utilisation of compositionality in learning more interpretable and generalisable representations for medical image segmentation. Overall, we propose that the underlying generative factors that are used to generate the medical images satisfy compositional equivariance property, where each factor is compositional (e.g., corresponds to human anatomy) and also equivariant to the task. Hence, a good representation that approximates well the ground truth factor has to be compositionally equivariant. By modelling the compositional representations with learnable von-Mises-Fisher (vMF) kernels, we explore how different design and learning biases can be used to enforce the representations to be more compositionally equivariant under un-, weakly-, and semi-supervised settings. Extensive results show that our methods achieve the best performance over several strong baselines on the task of semi-supervised domain-generalised medical image segmentation. Code will be made publicly available upon acceptance at https://github.com/vios-s.

Medical image registration plays an important role in medical diagnosis and treatment planning. However, the current registration methods based on deep learning still face some challenges, such as insufficient ability to extract global information, large number of network model parameters, slow reasoning speed and so on. Therefore, this paper proposed a new model LCU-Net, which used parallel lightweight convolution to improve the ability of global information extraction. The problem of large number of network parameters and slow inference speed was solved by multi-scale fusion. The experimental results showed that the Dice coefficient of LCU-Net reached 0.823, the Hausdorff distance was 1.258, and the number of network parameters was reduced by about one quarter compared with that before multi-scale fusion. The proposed algorithm shows remarkable advantages in medical image registration tasks, and it not only surpasses the existing comparison algorithms in performance, but also has excellent generalization performance and wide application prospects.

Objective: The fully automatic segmentation of glioma and its subregions is fundamental for computer-aided clinical diagnosis of tumors. In the segmentation process of brain magnetic resonance imaging (MRI), convolutional neural networks with small convolutional kernels can only capture local features and are ineffective at integrating global features, which narrows the receptive field and leads to insufficient segmentation accuracy. This study aims to use dilated convolution to address the problem of inadequate global feature extraction in 3D-UNet., Methods: 1) Algorithm construction: A 3D-UNet model with three pathways for more global contextual feature extraction, or 3DGE-UNet, was proposed in the paper. By using publicly available datasets from the Brain Tumor Segmentation Challenge (BraTS) of 2019 (335 patient cases), a global contextual feature extraction (GE) module was designed. This module was integrated at the first, second, and third skip connections of the 3D UNet network. The module was utilized to fully extract global features at different scales from the images. The global features thus extracted were then overlaid with the upsampled feature maps to expand the model's receptive field and achieve deep fusion of features at different scales, thereby facilitating end-to-end automatic segmentation of brain tumors. 2) Algorithm validation: The image data were sourced from the BraTs 2019 dataset, which included the preoperative MRI images of 335 patients across four modalities (T1, T1ce, T2, and FLAIR) and a tumor image with annotations made by physicians. The dataset was divided into the training, the validation, and the testing sets at an 8∶1∶1 ratio. Physician-labelled tumor images were used as the gold standard. Then, the algorithm's segmentation performance on the whole tumor (WT), tumor core (TC), and enhancing tumor (ET) was evaluated in the test set using the Dice coefficient (for overall effectiveness evaluation), sensitivity (detection rate of lesion areas), and 95% Hausdorff distance (segmentation accuracy of tumor boundaries). The performance was tested using both the 3D-UNet model without the GE module and the 3DGE-UNet model with the GE module to internally validate the effectiveness of the GE module setup. Additionally, the performance indicators were evaluated using the 3DGE-UNet model, ResUNet, UNet++, nnUNet, and UNETR, and the convergence of these five algorithm models was compared to externally validate the effectiveness of the 3DGE-UNet model., Results: 1) In internal validation, the enhanced 3DGE-UNet model achieved Dice mean values of 91.47%, 87.14%, and 83.35% for segmenting the WT, TC, and ET regions in the test set, respectively, producing the optimal values for comprehensive evaluation. These scores were superior to the corresponding scores of the traditional 3D-UNet model, which were 89.79%, 85.13%, and 80.90%, indicating a significant improvement in segmentation accuracy across all three regions ( P <0.05). Compared with the 3D-UNet model, the 3DGE-UNet model demonstrated higher sensitivity for ET (86.46% vs. 80.77%) ( P <0.05) , demonstrating better performance in the detection of all the lesion areas. When dealing with lesion areas, the 3DGE-UNet model tended to correctly identify and capture the positive areas in a more comprehensive way, thereby effectively reducing the likelihood of missed diagnoses. The 3DGE-UNet model also exhibited exceptional performance in segmenting the edges of WT, producing a mean 95% Hausdorff distance superior to that of the 3D-UNet model (8.17 mm vs. 13.61 mm, P <0.05). However, its performance for TC (8.73 mm vs. 7.47 mm) and ET (6.21 mm vs. 5.45 mm) was similar to that of the 3D-UNet model. 2) In the external validation, the other four algorithms outperformed the 3DGE-UNet model only in the mean Dice for TC (87.25%), the mean sensitivity for WT (94.59%), the mean sensitivity for TC (86.98%), and the mean 95% Hausdorff distance for ET (5.37 mm). Nonetheless, these differences were not statistically significant ( P >0.05). The 3DGE-UNet model demonstrated rapid convergence during the training phase, outpacing the other external models., Conclusion: The 3DGE-UNet model can effectively extract and fuse feature information on different scales, improving the accuracy of brain tumor segmentation., Competing Interests: 利益冲突　所有作者均声明不存在利益冲突, (© 2024《四川大学学报（医学版）》编辑部 版权所有Copyright ©2024 Editorial Board of Journal of Sichuan University (Medical Sciences).)

In this paper, we propose a novel method for removing noise from MRI data by exploiting regularisation techniques combined with variational mode decomposition. Variational mode decomposition is a new decomposition technique for sparse decomposition of a 1D or 2D signal into a set of modes. In turn, regularisation is a method that can translate the ill-posed problem (e.g., image denoising) into a well-posed problem. The proposed method aims to remove the noise from the image in two steps. In the first step, the MR imaging data are decomposed by the 2D variational mode decomposition algorithm. In the second step, for effective suppression of Rician noise from MRI data, we used the fused lasso signal approximator with all modes acquired from the medical scan. The performance of the proposed approach was compared with state-of-the-art reference methods based on different metrics, that is, the peak signal-to-noise ratio, the structural similarity index metrics, the high-frequency error norm, the quality index based on local variance, and the sharpness index. The experiments were performed on the basis of both simulated and real images. The presented results prove the high denoising performance of the proposed algorithm; particularly under heavy noise conditions., Competing Interests: Declaration of Competing Interest The author has no conflicts of interest to declare., (Copyright © 2023 The Authors. Published by Elsevier Inc. All rights reserved.)

The design of radiofrequency (RF) coils is crucial for ultra-high field (UHF) magnetic resonance imaging (MRI) systems. To analyze RF coils, various numerical methods, such as finite-difference time-domain (FDTD) and method of moments (MoM), are usually adopted. In this paper, we present a novel hybrid approach that combines a two-dimensional (2D) FDTD with a three-dimensional (3D) MoM to analyze MRI RF problems. In our algorithm, the MoM is utilized for calculating the coil current, and FDTD is assigned for solving the electromagnetic (EM) fields in the imaging region. The hybrid method achieves superior efficiency and acceptable accuracy than using either method individually. To validate the hybrid method, we analyze an ellipse coil loaded with a uniform phantom and a realistic human head model, with the objective of tailoring the magnetic field intensity by adding a multilayer dielectric pad (DP). The results show an improvement in the magnetic field after optimizing the DP configuration. These simulation studies indicate the potential of the new numerical method for the design and analysis of RF systems for ultra-high field applications., Competing Interests: Declaration of Competing Interest The authors declare that they have no conflict of interest., (Copyright © 2023. Published by Elsevier Inc.)

Rationale and Objectives: MR images can be challenging for machine learning and other large-scale analyses because most clinical images, for example, T 2 -weighted (T 2 w) images, reflect not only the biologically relevant T 2 of tissue but also hardware and acquisition parameters that vary from site to site. Quantitative T 2 mapping avoids these confounds because it quantitatively isolates the biological parameter of interest, thus representing a universal standardization across sites. However, efforts to incorporate quantitative mapping sequences into routine clinical practice have seen slow adoption. Here we show, for the first time, that the routine T 2 w complex raw dataset can be successfully regarded as a quantitative mapping sequence that can be reconstructed with classical optimization methods and physics-based constraints., Materials and Methods: While previous constrained reconstruction methods are unable to reconstruct a T 2 map based on this data, the expanding-constrained alternating minimization for parameter mapping (e-CAMP), which employs stepwise initialization, a linearized version of the exponential model and a phase conjugacy constraint, is demonstrated to provide useful quantitative maps directly from a vendor T 2 w single image data., Results: This paper introduces the method and demonstrates its performance using simulations, retrospectively undersampled brain images, and prospectively acquired T 2 w images taken on both phantom and brain., Conclusion: Because T 2 w scans are included in nearly every protocol, this approach could open the door to creating large, standardized datasets without requiring widespread changes in clinical protocols., Competing Interests: Declaration of Competing Interest The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper., (Copyright © 2024 The Association of University Radiologists. Published by Elsevier Inc. All rights reserved.)

Accurate segmentation of brain tumors across multiple MRI sequences is essential for diagnosis, treatment planning, and clinical decision-making. In this paper, I propose a cutting-edge framework, named multi-modal graph convolution network (M2GCNet), to explore the relationships across different MR modalities, and address the challenge of brain tumor segmentation. The core of M2GCNet is the multi-modal graph convolution module (M2GCM), a pivotal component that represents MR modalities as graphs, with nodes corresponding to image pixels and edges capturing latent relationships between pixels. This graph-based representation enables the effective utilization of both local and global contextual information. Notably, M2GCM comprises two important modules: the spatial-wise graph convolution module (SGCM), adept at capturing extensive spatial dependencies among distinct regions within an image, and the channel-wise graph convolution module (CGCM), dedicated to modelling intricate contextual dependencies among different channels within the image. Additionally, acknowledging the intrinsic correlation present among different MR modalities, a multi-modal correlation loss function is introduced. This novel loss function aims to capture specific nonlinear relationships between correlated modality pairs, enhancing the model's ability to achieve accurate segmentation results. The experimental evaluation on two brain tumor datasets demonstrates the superiority of the proposed M2GCNet over other state-of-the-art segmentation methods. Furthermore, the proposed method paves the way for improved tumor diagnosis, multi-modal information fusion, and a deeper understanding of brain tumor pathology.

The fusion of magnetic resonance imaging and positron emission tomography can combine biological anatomical information and physiological metabolic information, which is of great significance for the clinical diagnosis and localization of lesions. In this paper, we propose a novel adaptive linear fusion method for multi-dimensional features of brain magnetic resonance and positron emission tomography images based on a convolutional neural network, termed as MdAFuse. First, in the feature extraction stage, three-dimensional feature extraction modules are constructed to extract coarse, fine, and multi-scale information features from the source image. Second, at the fusion stage, the affine mapping function of multi-dimensional features is established to maintain a constant geometric relationship between the features, which can effectively utilize structural information from a feature map to achieve a better reconstruction effect. Furthermore, our MdAFuse comprises a key feature visualization enhancement algorithm designed to observe the dynamic growth of brain lesions, which can facilitate the early diagnosis and treatment of brain tumors. Extensive experimental results demonstrate that our method is superior to existing fusion methods in terms of visual perception and nine kinds of objective image fusion metrics. Specifically, in the results of MR-PET fusion, the SSIM (Structural Similarity) and VIF (Visual Information Fidelity) metrics show improvements of 5.61% and 13.76%, respectively, compared to the current state-of-the-art algorithm. Our project is publicly available at: https://github.com/22385wjy/MdAFuse.

Resting-state functional magnetic resonance imaging (rs-fMRI) has been widely used in the identification of mild cognitive impairment (MCI) research, MCI patients are relatively at a higher risk of progression to Alzheimer's disease (AD). However, almost machine learning and deep learning methods are rarely analyzed from the perspective of spatial structure and temporal dimension. In order to make full use of rs-fMRI data, this study constructed a dynamic spatiotemporal graph neural network model, which mainly includes three modules: temporal block, spatial block, and graph pooling block. Our proposed model can extract the BOLD signal of the subject's fMRI data and the spatial structure of functional connections between different brain regions, and improve the decision-making results of the model. In the study of AD, MCI and NC, the classification accuracy reached 83.78% outperforming previously reported, which manifested that our model could effectively learn spatiotemporal, and dynamic spatio-temporal method plays an important role in identifying different groups of subjects. In summary, this paper proposed an end-to-end dynamic spatio-temporal graph neural network model, which uses the information of the temporal dimension and spatial structure in rs-fMRI data, and achieves the improvement of the three classification performance among AD, MCI and NC.

Brain region-of-interest (ROI) segmentation with magnetic resonance (MR) images is a basic prerequisite step for brain analysis. The main problem with using deep learning for brain ROI segmentation is the lack of sufficient annotated data. To address this issue, in this paper, we propose a simple multi-atlas supervised contrastive learning framework (MAS-CL) for brain ROI segmentation with MR images in an end-to-end manner. Specifically, our MAS-CL framework mainly consists of two steps, including 1) a multi-atlas supervised contrastive learning method to learn the latent representation using a limited amount of voxel-level labeling brain MR images, and 2) brain ROI segmentation based on the pre-trained backbone using our MSA-CL method. Specifically, different from traditional contrastive learning, in our proposed method, we use multi-atlas supervised information to pre-train the backbone for learning the latent representation of input MR image, i.e., the correlation of each sample pair is defined by using the label maps of input MR image and atlas images. Then, we extend the pre-trained backbone to segment brain ROI with MR images. We perform our proposed MAS-CL framework with five segmentation methods on LONI-LPBA40, IXI, OASIS, ADNI, and CC359 datasets for brain ROI segmentation with MR images. Various experimental results suggested that our proposed MAS-CL framework can significantly improve the segmentation performance on these five datasets.

Purpose: To develop a general framework for parallel imaging (PI) with the use of Maxwell regularization for the estimation of the sensitivity maps (SMs) and constrained optimization for the parameter-free image reconstruction., Theory and Methods: Certain characteristics of both the SMs and the images are routinely used to regularize the otherwise ill-posed optimization-based joint reconstruction from highly accelerated PI data. In this paper, we rely on a fundamental property of SMs-they are solutions of Maxwell equations-we construct the subspace of all possible SM distributions supported in a given field-of-view, and we promote solutions of SMs that belong in this subspace. In addition, we propose a constrained optimization scheme for the image reconstruction, as a second step, once an accurate estimation of the SMs is available. The resulting method, dubbed Maxwell parallel imaging (MPI), works for both 2D and 3D, with Cartesian and radial trajectories, and minimal calibration signals., Results: The effectiveness of MPI is illustrated for various undersampling schemes, including radial, variable-density Poisson-disc, and Cartesian, and is compared against the state-of-the-art PI methods. Finally, we include some numerical experiments that demonstrate the memory footprint reduction of the constructed Maxwell basis with the help of tensor decomposition, thus allowing the use of MPI for full 3D image reconstructions., Conclusion: The MPI framework provides a physics-inspired optimization method for the accurate and efficient image reconstruction from arbitrary accelerated scans., (© 2021 International Society for Magnetic Resonance in Medicine.)

A method of determining the optimal kernel size for filtering noise in vortex dominated flow-fields, as found in the cardiac chambers is presented in this paper. Using synthetic flow fields generated using harmonic functions and perturbed using Gaussian noises of different amplitudes and spreads, the effect of kernel size on noise removal using the Median filter is tested systematically. It is shown that there exists an optimal kernel size at which the Median filter works best. The size of the optimal kernel is shown to be related to the vortex size. When applied to MRI generated cardiac flow-fields, the approach is seen to reveal underlying vortex patterns thereby aiding as an effective tool in the diagnosis and prognosis of cardiac diseases based on vortices as clinical biomarkers. The behavior of the restored cardiac flow fields which are filtered with the optimal kernel size and also with some values preceding and succeeding it are similar to that observed in studies with synthetic flow fields. This confirms that the optimal size of the kernel is related to the cardiac vortex size as is observed in the case of synthetic flow fields., (© 2023. The Author(s).)

Magnetic resonance imaging (MRI) Super-Resolution (SR) aims to obtain high resolution (HR) images with more detailed information for precise diagnosis and quantitative image analysis. Deep unfolding networks outperform general MRI SR reconstruction methods by providing better performance and improved interpretability, which enhance the trustworthiness required in clinical practice. Additionally, current SR reconstruction techniques often rely on a single contrast or a simple multi-contrast fusion mechanism, ignoring the complex relationships between different contrasts. To address these issues, in this paper, we propose a Model-Guided multi-contrast interpretable Deep Unfolding Network (MGDUN) for medical image SR reconstruction, which explicitly incorporates the well-studied multi-contrast MRI observation model into an unfolding iterative network. Specifically, we manually design an objective function for MGDUN that can be iteratively computed by the half-quadratic splitting algorithm. The iterative MGDUN algorithm is unfolded into a special model-guided deep unfolding network that explicitly takes into account both the multi-contrast relationship matrix and the MRI observation matrix during the end-to-end optimization process. Extensive experimental results on the multi-contrast IXI dataset and the BraTs 2019 dataset demonstrate the superiority of our proposed model, with PSNR reaching 37.3366 and 35.9690 respectively. Our proposed MGDUN provides a promising solution for multi-contrast MR image super-resolution reconstruction. Code is available at https://github.com/yggame/MGDUN., Competing Interests: Declaration of competing interest All the authors listed have approved the manuscript and agree with submission to Computers in Biology and Medicine. No conflict of interest exists in the submission of this manuscript. And the authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper., (Copyright © 2023 Elsevier Ltd. All rights reserved.)

We consider inference problems for high-dimensional (HD) functional data with a dense number of T repeated measurements taken for a large number of p variables from a small number of n experimental units. The spatial and temporal dependence, high dimensionality, and dense number of repeated measurements pose theoretical and computational challenges. This paper has two aims; our first aim is to solve the theoretical and computational challenges in testing equivalence among covariance matrices from HD functional data. The second aim is to provide computationally efficient and tuning-free tools with guaranteed stochastic error control. The weak convergence of the stochastic process formed by the test statistics is established under the "large p, large T, and small n" setting. If the null is rejected, we further show that the locations of the change points can be estimated consistently. The estimator's rate of convergence is shown to depend on the data dimension, sample size, number of repeated measurements, and signal-to-noise ratio. We also show that our proposed computation algorithms can significantly reduce the computation time and are applicable to real-world data with a large number of HD-repeated measurements (e.g., functional magnetic resonance imaging (fMRI) data). Simulation results demonstrate both the finite sample performance and computational effectiveness of our proposed procedures. We observe that the empirical size of the test is well controlled at the nominal level, and the locations of multiple change points can be accurately identified. An application to fMRI data demonstrates that our proposed methods can identify event boundaries in the preface of the television series Sherlock. Code to implement the procedures is available in an R package named TechPhD., (© 2023 The Authors. Biometrics published by Wiley Periodicals LLC on behalf of International Biometric Society.)

Dynamic magnetic resonance imaging (DMRI) is an important medical imaging modality, but the long imaging time limits its practical applications. This paper proposes a low-rank plus sparse joint smoothing model based on tensor singular value decomposition (T-SVD) to reconstruct DMR images from highly under-sampled k-t space data. The low-rank plus sparse tensor (ℒ+S) model decomposes the DMR data into a low-rank and sparse tensor, which naturally fits the dynamic MR images characteristics and exploits the spatiotemporal correlation of DMRI data to improve reconstruction effect. T-SVD is utilized in the ℒ+S model to maintain the intrinsic structure of the low-rank tensor and further enhance the low-rank property. In addition, considering the global multi-dimensional smoothness of the DMR images, the proposed method joint tensor total variation (TTV) constraints to utilize the smoothness of DMR images to obtain more reconstruction details while protecting the global structure. We conducted experiments on the dynamic cardiac datasets, and the experiment results show that the proposed method has superior performance to several state-of-the-art imaging methods., Competing Interests: Declaration of Competing Interest The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper., (Copyright © 2023. Published by Elsevier Inc.)

Magnetic resonance imaging (MRI) is extensively utilized in clinical practice for diagnostic purposes, owing to its non-invasive nature and remarkable ability to provide detailed characterization of soft tissues. However, its drawback lies in the prolonged scanning time. To accelerate MR imaging, how to reconstruct MR images from under-sampled data quickly and accurately has drawn intensive research interest; it, however, remains a challenging task. While some deep learning models have achieved promising performance in MRI reconstruction, these models usually require a substantial quantity of paired data for training, which proves challenging to gather and share owing to high scanning costs and data privacy concerns. Federated learning (FL) is a potential tool to alleviate these difficulties. It enables multiple clinical clients to collaboratively train a global model without compromising privacy. However, it is extremely challenging to fit a single model to diverse data distributions of different clients. Moreover, existing FL algorithms treat the features of each channel equally, lacking discriminative learning ability across feature channels, and hence hindering their representational capability. In this study, we propose a novel Adaptive Channel-Modulated Federal learning framework for personalized MRI reconstruction, dubbed as ACM-FedMRI. Specifically, considering each local client may focus on features in different channels, we first design a client-specific hypernetwork to guide the channel selection operation in order to optimize the extracted features. Additionally, we introduce a performance-based channel decoupling scheme, which dynamically separates the global model at the channel level to facilitate personalized adjustments based on the performance of individual clients. This approach eliminates the need for heuristic design of specific personalization layers. Extensive experiments on four datasets under two different settings show that our ACM-FedMRI achieves outstanding results compared to other cutting-edge federated learning techniques in the field of MRI reconstruction., Competing Interests: Declaration of competing interest The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper., (Copyright © 2023 Elsevier Ltd. All rights reserved.)

Image registration is the process of bringing different images into a common coordinate system - a technique widely used in various applications of computer vision, such as remote sensing, image retrieval, and, most commonly, medical imaging. Deep learning based techniques have been applied successfully to tackle various complex medical image processing problems, including medical image registration. Over the years, several image registration techniques have been proposed using deep learning. Deformable image registration techniques such as Voxelmorph have been successful in capturing finer changes and providing smoother deformations. However, Voxelmorph, as well as ICNet and FIRE, do not explicitly encode global dependencies (i.e. the overall anatomical view of the supplied image) and, therefore, cannot track large deformations. In order to tackle the aforementioned problems, this paper extends the Voxelmorph approach in three different ways. To improve the performance in case of small as well as large deformations, supervision of the model at different resolutions has been integrated using a multi-scale UNet. To support the network to learn and encode the minute structural co-relations of the given image-pairs, a self-constructing graph network (SCGNet) has been used as the latent of the multi-scale UNet - which can improve the learning process of the model and help the model to generalise better. And finally, to make the deformations inverse-consistent, cycle consistency loss has been employed. On the task of registration of brain MRIs, the proposed method achieved significant improvements over ANTs and VoxelMorph, obtaining a Dice score of 0.8013 ± 0.0243 for intramodal and 0.6211 ± 0.0309 for intermodal, while VoxelMorph achieved 0.7747 ± 0.0260 and 0.6071 ± 0.0510, respectively., Competing Interests: Declaration of competing interest The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper., (Copyright © 2023 Elsevier Ltd. All rights reserved.)

Background: Dynamic magnetic resonance imaging (DMRI) is an essential medical imaging technique, but the slow data acquisition process limits its further development., Purpose: By exploiting the inherent spatio-temporal correlation of MR images, low-rank tensor based methods have been developed to accelerate imaging. However, the tensor rank used by these methods is defined by an unbalanced matricization scheme, which cannot capture the global correlation of DMR data efficiently during the reconstruction process., Methods: In this paper, an effective reconstruction model is proposed to achieve accurate reconstruction by using the tensor train (TT) rank defined by a well-balanced matricization scheme to exploit the hidden correlation of DMR data and combining sparsity. Meanwhile, the ket augmentation (KA) technology is introduced to preprocess the DMR data into a higher-order tensor through block structure addressing, which further improves the ability of TT rank to explore the local information of the image. In order to solve the proposed model, the alternating direction method of multipliers (ADMM) is used to decompose the optimization problem into several unconstrained subproblems., Results: The performance of the proposed method was validated on the 3D DMR image dataset by using different sampling trajectories and sampling rates. Extensive numerical experiments demonstrate that the reconstruction quality of the proposed method is superior to several state-of-the-art reconstruction methods., Conclusions: The proposed method successfully utilizes the TT rank to explore the global correlation of DMR images, enabling more detailed information of the image to be captured. Besides, with the sparse priors, the proposed method can further improve the overall reconstruction quality for highly undersampled MR images., (© 2023 American Association of Physicists in Medicine.)

Large training datasets are important for deep learning-based methods. For medical image segmentation, it could be however difficult to obtain large number of labeled training images solely from one center. Distributed learning, such as swarm learning, has the potential to use multi-center data without breaching data privacy. However, data distributions across centers can vary a lot due to the diverse imaging protocols and vendors (known as feature skew). Also, the regions of interest to be segmented could be different, leading to inhomogeneous label distributions (referred to as label skew). With such non-independently and identically distributed (Non-IID) data, the distributed learning could result in degraded models. In this work, we propose a novel swarm learning approach, which assembles local knowledge from each center while at the same time overcomes forgetting of global knowledge during local training. Specifically, the approach first leverages a label skew-awared loss to preserve the global label knowledge, and then aligns local feature distributions to consolidate global knowledge against local feature skew. We validated our method in three Non-IID scenarios using four public datasets, including the Multi-Centre, Multi-Vendor and Multi-Disease Cardiac Segmentation (M&Ms) dataset, the Federated Tumor Segmentation (FeTS) dataset, the Multi-Modality Whole Heart Segmentation (MMWHS) dataset and the Multi-Site Prostate T2-weighted MRI segmentation (MSProsMRI) dataset. Results show that our method could achieve superior performance over existing methods. Code will be released via https://zmiclab.github.io/projects.html once the paper gets accepted.

Federated learning (FL) can be used to improve data privacy and efficiency in magnetic resonance (MR) image reconstruction by enabling multiple institutions to collaborate without needing to aggregate local data. However, the domain shift caused by different MR imaging protocols can substantially degrade the performance of FL models. Recent FL techniques tend to solve this by enhancing the generalization of the global model, but they ignore the domain-specific features, which may contain important information about the device properties and be useful for local reconstruction. In this paper, we propose a specificity-preserving FL algorithm for MR image reconstruction (FedMRI). The core idea is to divide the MR reconstruction model into two parts: a globally shared encoder to obtain a generalized representation at the global level, and a client-specific decoder to preserve the domain-specific properties of each client, which is important for collaborative reconstruction when the clients have unique distribution. Such scheme is then executed in the frequency space and the image space respectively, allowing exploration of generalized representation and client-specific properties simultaneously in different spaces. Moreover, to further boost the convergence of the globally shared encoder when a domain shift is present, a weighted contrastive regularization is introduced to directly correct any deviation between the client and server during optimization. Extensive experiments demonstrate that our FedMRI's reconstructed results are the closest to the ground-truth for multi-institutional data, and that it outperforms state-of-the-art FL methods.

Nuclear magnetic resonance (NMR) has shown good applications in engineering fields such as well logging and rubber material ageing assessment. However, due to the low magnetic field strength of NMR sensors and the complex working conditions of engineering sites, the signal-to-noise ratio (SNR) of NMR signals is low, and it is usually necessary to increase the number of repeated measurements to improve the SNR, which means a longer measurement time. Therefore, it is especially important to set the measurement parameters appropriately for onsite NMR. In this paper, we propose a stochastic simulation using Monte Carlo methods to predict the measurement curves of [Formula: see text] and [Formula: see text] and correct the measurement parameters of the next step according to the previous measurement results. The method can update the measurement parameters in real time and perform automatic measurements. At the same time, this method greatly reduces the measurement time. The experimental results show that the method is suitable for the measurement of the self-diffusion coefficient D 0 and longitudinal relaxation time T 1 , which are frequently used in NMR measurements., (© 2023. The Author(s).)

Deep unrolling networks (DUNs) have emerged as a promising approach for solving compressed sensing (CS) problems due to their superior explainability, speed, and performance compared to classical deep network models. However, the CS performance in terms of efficiency and accuracy remains a principal challenge for approaching further improvements. In this paper, we propose a novel deep unrolling model, SALSA-Net, to solve the image CS problem. The network architecture of SALSA-Net is inspired by unrolling and truncating the split augmented Lagrangian shrinkage algorithm (SALSA) which is used to solve sparsity-induced CS reconstruction problems. SALSA-Net inherits the interpretability of the SALSA algorithm while incorporating the learning ability and fast reconstruction speed of deep neural networks. By converting the SALSA algorithm into a deep network structure, SALSA-Net consists of a gradient update module, a threshold denoising module, and an auxiliary update module. All parameters, including the shrinkage thresholds and gradient steps, are optimized through end-to-end learning and are subject to forward constraints to ensure faster convergence. Furthermore, we introduce learned sampling to replace traditional sampling methods so that the sampling matrix can better preserve the feature information of the original signal and improve sampling efficiency. Experimental results demonstrate that SALSA-Net achieves significant reconstruction performance compared to state-of-the-art methods while inheriting the advantages of explainable recovery and high speed from the DUNs paradigm.

Purpose: To develop and validate an effective algorithm, based on classification and regression tree (CART) analysis and LI-RADS features, for diagnosing HCC ≤ 3.0 cm with gadoxetate disodium‑enhanced MRI (Gd-EOB-MRI)., Method: We retrospectively included 299 and 90 high-risk patients with hepatic lesions ≤ 3.0 cm that underwent Gd-EOB-MRI from January 2018 to February 2021 in institution 1 (development cohort) and institution 2 (validation cohort), respectively. Through binary and multivariate regression analyses of LI-RADS features in the development cohort, we developed an algorithm using CART analysis, which comprised the targeted appearance and independently significant imaging features. On per-lesion basis, we compared the diagnostic performances of our algorithm, two previously reported CART algorithms, and LI-RADS LR-5 in development and validation cohorts., Results: Our CART algorithm, presenting as a decision tree, included targetoid appearance, HBP hypointensity, nonrim arterial phase hyperenhancement (APHE), and transitional phase hypointensity plus mild-moderate T2 hyperintensity. For definite HCC diagnosis, the overall sensitivity of our algorithm (development cohort 93.2%, validation cohort 92.5%; P < 0.006) was significantly higher than those of Jiang's algorithm modified LR-5 (defined as targetoid appearance, nonperipheral washout, restricted diffusion, and nonrim APHE) and LI-RADS LR-5, with the comparable specificity (development cohort: 84.3%, validation cohort: 86.7%; P ≥ 0.006). Our algorithm, providing the highest balanced accuracy (development cohort: 91.2%, validation cohort: 91.6%), outperformed other criteria for identifying HCCs from non-HCC lesions., Conclusions: In high-risk patients, our CART algorithm developed with LI-RADS features showed promise for the early diagnosis of HCC ≤ 3.0 cm with Gd-EOB-MRI., Competing Interests: Declaration of Competing Interest The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper., (Copyright © 2023 Elsevier B.V. All rights reserved.)