Quantitative magnetic resonance imaging (qMRI) offers tissue-specific physical parameters with significant potential for neuroscience research and clinical practice. However, lengthy scan times for 3D multiparametric qMRI acquisition limit its clinical utility. Here, we propose SUMMIT, an innovative imaging methodology that includes data acquisition and an unsupervised reconstruction for simultaneous multiparametric qMRI. SUMMIT first encodes multiple important quantitative properties into highly undersampled k-space. It further leverages implicit neural representation incorporated with a dedicated physics model to reconstruct the desired multiparametric maps without needing external training datasets. SUMMIT delivers co-registered T 1 , T 2 , T 2 ∗ , and subvoxel quantitative susceptibility mapping. Extensive simulations, phantom, and in vivo brain imaging demonstrate SUMMIT’s high accuracy. Notably, SUMMIT uniquely unravels microstructural alternations in patients with white matter hyperintense lesions with high sensitivity and specificity. Additionally, the proposed unsupervised approach for qMRI reconstruction also introduces a novel zero-shot learning paradigm for multiparametric imaging applicable to various medical imaging modalities .

Supervised Deep-Learning (DL)-based reconstruction algorithms have shown state-of-the-art results for highly-undersampled dynamic Magnetic Resonance Imaging (MRI) reconstruction. However, the requirement of excessive high-quality ground-truth data hinders their applications due to the generalization problem. Recently, Implicit Neural Representation (INR) has emerged as a powerful DL-based tool for solving the inverse problem by characterizing the attributes of a signal as a continuous function of corresponding coordinates in an unsupervised manner. In this work, we proposed an INR-based method to improve dynamic MRI reconstruction from highly undersampled $\boldsymbol {k}$ -space data, which only takes spatiotemporal coordinates as inputs and does not require any training on external datasets or transfer-learning from prior images. Specifically, the proposed method encodes the dynamic MRI images into neural networks as an implicit function, and the weights of the network are learned from sparsely-acquired ( $\boldsymbol {k}$ , t)-space data itself only. Benefiting from the strong implicit continuity regularization of INR together with explicit regularization for low-rankness and sparsity, our proposed method outperforms the compared state-of-the-art methods at various acceleration factors. E.g., experiments on retrospective cardiac cine datasets show an improvement of 0.6-2.0 dB in PSNR for high accelerations (up to $40.8\times $ ). The high-quality and inner continuity of the images provided by INR exhibit great potential to further improve the spatiotemporal resolution of dynamic MRI. The code is available at: https://github.com/AMRI-Lab/INR_for_DynamicMRI.

Parallel imaging is a commonly used technique to accelerate magnetic resonance imaging (MRI) data acquisition. Mathematically, parallel MRI reconstruction can be formulated as an inverse problem relating the sparsely sampled k-space measurements to the desired MRI image. Despite the success of many existing reconstruction algorithms, it remains a challenge to reliably reconstruct a high-quality image from highly reduced k-space measurements. Recently, implicit neural representation has emerged as a powerful paradigm to exploit the internal information and the physics of partially acquired data to generate the desired object. In this study, we introduced IMJENSE, a scan-specific implicit neural representation-based method for improving parallel MRI reconstruction. Specifically, the underlying MRI image and coil sensitivities were modeled as continuous functions of spatial coordinates, parameterized by neural networks and polynomials, respectively. The weights in the networks and coefficients in the polynomials were simultaneously learned directly from sparsely acquired k-space measurements, without fully sampled ground truth data for training. Benefiting from the powerful continuous representation and joint estimation of the MRI image and coil sensitivities, IMJENSE outperforms conventional image or k-space domain reconstruction algorithms. With extremely limited calibration data, IMJENSE is more stable than supervised calibrationless and calibration-based deep-learning methods. Results show that IMJENSE robustly reconstructs the images acquired at 5× and 6× accelerations with only 4 or 8 calibration lines in 2D Cartesian acquisitions, corresponding to 22.0% and 19.5% undersampling rates. The high-quality results and scanning specificity make the proposed method hold the potential for further accelerating the data acquisition of parallel MRI.

Susceptibility tensor imaging (STI) is a promising tool for studying orientation-dependent tissue magnetic susceptibility and for mapping white matter fiber orientations complementary to diffusion tensor imaging (DTI). However, the limited head rotation range within modern head coils for data acquisition makes in vivo STI reconstruction ill-conditioned. Conventional STI reconstruction method is usually vulnerable to noise and requires sufficiently large head rotations to solve this ill-conditioned inverse problem. In this study, based on the recently proposed asymmetric STI (aSTI) model, a new method termed aSTI+ was proposed to improve in vivo STI reconstruction by enforcing isotropic susceptibility tensor inside cerebrospinal fluid (CSF) and applying morphology constraint in white matter. Experimental results showed superior performance of the proposed method with reduced noise, improved tissue contrast and better fiber orientation estimation over previous methods. Thus aSTI+ may promote in vivo human brain STI studies on white matter and myelin-related brain diseases.

Privacy-aware query is very important to Location based service (LBS). Since user's location distribution is not uniform and the contents of user query may be similar, users will be easily attacked by query sampling attack and homogeneity attack. In this paper we proposed a new distributed spatial cloaking algorithm, Location-Query Sensitive Cloaking algorithm(LQ-Cloak) to protect query privacy. The main idea is that before requesting any location-based service, the mobile user will form a group among peers locating in his neighbor area(cells) via single-hop communication and/or multi-hop routing. Then the Anonymity Spatial Region (ASR) is computed according to the cells that covers the entire group of peers. This technique is based on a distributed anonymity architecture, and eliminates the bottleneck of whole system. This method considered both users' location distribution and query content when cloaking, so the anonymity spatial region can meet the request of K-anonymity and l-diversity model. Extensive experimental studies show that the proposed techniques are effective to protect users' privacy in the distributed environment.

Image acquisition of magnetic resonance imaging (MRI) can be accelerated by using multiple receiving coils simultaneously. The problem of reconstructing an unaliased image from partially sampled k-space data can be formulated as a large system of sparse linear equations. The k-space sparse matrix (kSPA) algorithm proposes to solve the system of equations by finding a sparse approximate inverse. This algorithm has been shown to accelerate the image reconstruction for a large number of coils. The original kSPA algorithm requires knowledge of coil sensitivities. Here, we propose and demonstrate an auto-calibrated kSPA algorithm that does not require the explicit computation of the coil sensitivity maps. We have also shown that calibration data, in principle, can be acquired at any region of k-space. This property applies to arbitrary sampling trajectories and all reconstruction algorithms based on k-space. In practice, because of its higher SNR, calibration data acquired at the center of k-space performed more favorably. Such auto-calibration can be advantageous in cases where an accurate sensitivity map is difficult to obtain.