3D pulse EPR imaging from sparse-view projections via constrained, total variation minimization

Partial Acquisition of Spectral Projections Accelerates Four-dimensional Spectral-spatial EPR Imaging for Mouse Tumor Models: A Feasibility Study

PURPOSE

Our study aimed to accelerate the acquisition of four-dimensional (4D) spectral-spatial electron paramagnetic resonance (EPR) imaging for mouse tumor models. This advancement in EPR imaging should reduce the acquisition time of spectroscopic mapping while reducing quality degradation for mouse tumor models.

PROCEDURES

EPR spectra under magnetic field gradients, called spectral projections, were partially measured. Additional spectral projections were later computationally synthesized from the measured spectral projections. Four-dimensional spectral-spatial images were reconstructed from the post-processed spectral projections using the algebraic reconstruction technique (ART) and assessed in terms of their image qualities. We applied this approach to a sample solution and a mouse Hs766T xenograft model of human-derived pancreatic ductal adenocarcinoma cells to demonstrate the feasibility of our concept. The nitroxyl radical imaging agent 2H,15N-DCP was exogenously infused into the mouse xenograft model.

RESULTS

The computation code of 4D spectral-spatial imaging was tested with numerically generated spectral projections. In the linewidth mapping of the sample solution, we achieved a relative standard uncertainty (standard deviation/| mean |) of 0.76 μT/45.38 μT = 0.017 on the peak-to-peak first-derivative EPR linewidth. The qualities of the linewidth maps and the effect of computational synthesis of spectral projections were examined. Finally, we obtained the three-dimensional linewidth map of 2H,15N-DCP in a Hs766T tumor-bearing leg in vivo.

CONCLUSION

We achieved a 46.7% reduction in the acquisition time of 4D spectral-spatial EPR imaging without significantly degrading the image quality. A combination of ART and partial acquisition in three-dimensional raster magnetic field gradient settings in orthogonal coordinates is a novel approach. Our approach to 4D spectral-spatial EPR imaging can be applied to any subject, especially for samples with less variation in one direction.

Directional TV algorithm for image reconstruction from sparse-view projections in EPR imaging

Objective.Electron paramagnetic resonance (EPR) imaging is an advanced in vivo oxygen imaging modality. The main drawback of EPR imaging is the long scanning time. Sparse-view projections collection is an effective fast scanning pattern. However, the commonly-used filtered back projection (FBP) algorithm is not competent to accurately reconstruct images from sparse-view projections because of the severe streak artifacts. The aim of this work is to develop an advanced algorithm for sparse reconstruction of 3D EPR imaging.Methods.The optimization based algorithms including the total variation (TV) algorithm have proven to be effective in sparse reconstruction in EPR imaging. To further improve the reconstruction accuracy, we propose the directional TV (DTV) model and derive its Chambolle-Pock solving algorithm.Results.After the algorithm correctness validation on simulation data, we explore the sparse reconstruction capability of the DTV algorithm via a simulated six-sphere phantom and two real bottle phantoms filled with OX063 trityl solution and scanned by an EPR imager with a magnetic field strength of 250 G.Conclusion.Both the simulated and real data experiments show that the DTV algorithm is superior to the existing FBP and TV-type algorithms and a deep learning based method according to visual inspection and quantitative evaluations in sparse reconstruction of EPR imaging.Significance.These insights gained in this work may be used in the development of fast EPR imaging workflow of practical significance.

Directional TV algorithm for fast EPR imaging

Precise radiation guided by oxygen images has demonstrated superiority over the traditional radiation methods. Electron paramagnetic resonance (EPR) imaging has proven to be the most advanced oxygen imaging modality. However, the main drawback of EPR imaging is the long scan time. For each projection, we usually need to collect the projection many times and then average them to achieve high signal-to-noise ratio (SNR). One approach to fast scan is to reduce the repeating time for each projection. While the projections would be noisy and thus the traditional commonly-use filtered backprojection (FBP) algorithm would not be capable of accurately reconstructing images. Optimization-based iterative algorithms may accurately reconstruct images from noisy projections for they may incorporate prior information into optimization models. Based on the total variation (TV) algorithms for EPR imaging, in this work, we propose a directional TV (DTV) algorithm to further improve the reconstruction accuracy. We construct the DTV constrained, data divergence minimization (DTVcDM) model, derive its Chambolle-Pock (CP) solving algorithm, validate the correctness of the whole algorithm, and perform evaluations via simulated and real data. The experimental results show that the DTV algorithm outperforms the existing TV and FBP algorithms in fast EPR imaging. Compared to the standard FBP algorithm, the proposed algorithm may achieve 10 times of acceleration.

A Simple but Universal Fully Linearized ADMM Algorithm for Optimization Based Image Reconstruction

Background and Objective

Optimization based image reconstruction algorithm is an advanced algorithm in medical imaging. However, the corresponding solving algorithm is challenging because the optimization model is usually large-scale and non-smooth. This work aims to devise a simple but universal solver for optimization models.

Methods

The alternating direction method of multipliers (ADMM) algorithm is a simple and effective solver of the optimization models. However, there always exists a sub-problem that has not closed-form solution. One may use gradient descent algorithm to solve this sub-problem, but the step-size selection via line search is time-consuming. Or, one may use fast Fourier transform (FFT) to get a closed-form solution if the system matrix and the sparse transform matrix are both of special structure. In this work, we propose a simple but universal fully linearized ADMM (FL-ADMM) algorithm that avoids line search to determine step-size and applies to system matrix and sparse transform of any structures.

Results

We derive the FL-ADMM algorithm instances for three total variation (TV) models in 2D computed tomography (CT). Further, we validate and evaluate one FL-ADMM algorithm and explore how the two important factors impact convergence rate. Also, we compare this algorithm with the Chambolle-Pock algorithm via real CT phantom reconstructions. These studies show that the FL-ADMM algorithm may accurately solve optimization models in image reconstruction.

Conclusion

The FL-ADMM algorithm is a simple, effective, convergent and universal solver of optimization models in image reconstruction. Compared to the existing ADMM algorithms, the new algorithm does not need time-consuming step-size line-search or special demand to system matrix and sparse transform. It is a rapid prototyping tool for optimization based image reconstruction.

An iterative reconstruction algorithm without system matrix for EPR imaging

Electron paramagnetic resonance (EPR) imaging is an advanced oxygen imaging modality for oxygen-image guided radiation. The iterative reconstruction algorithm is the research hot-point in image reconstruction for EPR imaging (EPRI) for this type of algorithm may incorporate image-prior information to construct advanced optimization model to achieve accurate reconstruction from sparse-view projections and/or noisy projections. However, the system matrix in the iterative algorithm needs complicated calculation and needs huge memory-space if it is stored in memory. In this work, we propose an iterative reconstruction algorithm without system matrix for EPRI to simplify the whole iterative reconstruction process. The function of the system matrix is to calculate the projections, whereas the function of the transpose of the system matrix is to perform backprojection. The existing projection and backprojection methods are all based on the configuration that the imaged-object remains stationary and the scanning device rotates. Here, we implement the projection and backprojection operations by fixing the scanning device and rotating the object. Thus, the core algorithm is only the commonly-used image-rotation algorithm, while the calculation and store of the system matrix are avoided. Based on the idea of image rotation, we design a specific iterative reconstruction algorithm for EPRI, total variation constrained data divergence minimization (TVcDM) algorithm without system matrix, and named it as image-rotation based TVcDM (R-TVcDM). Through a series of comparisons with the original TVcDM via real projection data, we find that the proposed algorithm may achieve similar reconstruction accuracy with the original one. But it avoids the complicated calculation and store of the system matrix. The insights gained in this work may be also applied to other imaging modalities, for example computed tomography and positron emission tomography.

A balanced total-variation-Chambolle-Pock algorithm for EPR imaging

Total variation (TV) minimization algorithm is an effective algorithm capable of accurately reconstructing images from sparse projection data in a variety of imaging modalities including computed tomography (CT) and electron paramagnetic resonance imaging (EPRI). The data divergence constrained, TV minimization (DDcTV) model and its Chambolle-Pock (CP) solving algorithm have been proposed for CT. However, when the DDcTV-CP algorithm is applied to 3D EPRI, it suffers from slow convergence rate or divergence. We hypothesize that this is due to the magnitude imbalance between the data fidelity term and the TV regularization term. In this work, we propose a balanced TV (bTV) model incorporating a balance parameter and demonstrate its capability to avoid convergence issues for the 3D EPRI application. Simulation and real experiments show that the DDcTV-CP algorithm cannot guarantee convergence but the bTV-CP algorithm may guarantee convergence and achieve fast convergence by use of an appropriate balance parameter. Experiments also show that underweighting the balance parameter leads to slow convergence, whereas overweighting the balance parameter leads to divergence. The iteration-behavior change-law with the variation of the balance parameter is explained by use of the data tolerance ellipse and gradient descent principle. The findings and insights gained in this work may be applied to other imaging modalities and other constrained optimization problems.

A TV-minimization image-reconstruction algorithm without system matrix

PURPOSE

Total Variation (TV) minimization algorithm is a classical compressed sensing (CS) based iterative image reconstruction algorithm that can accurately reconstruct images from sparse-view projections in computed tomography (CT). However, the system matrix used in the algorithm is often too large to be stored in computer memory. The purpose of this study is to investigate a new TV algorithm based on image rotation and without system matrix to avoid the memory requirement of system matrix.

METHODS

Without loss of generality, a rotation-based adaptive steepest descent-projection onto convex sets (R-ASD-POCS) algorithm is proposed and tested to solve the TV model in parallel beam CT. Specifically, simulation experiments are performed via the Shepp-Logan, FORBILD and real CT image phantoms are used to verify the inverse-crime capability of the algorithm and evaluate the sparse reconstruction capability and the noise suppression performance of the algorithm.

RESULTS

Experimental results show that the algorithm can achieve inverse-crime, accurate sparse reconstruction and thus accurately reconstruct images from noisy projections. Compared with the classical ASD-POCS algorithm, the new algorithm may yield the similar image reconstruction accuracy without use of the huge system matrix, which saves the computational memory space significantly. Additionally, the results also show that R-ASD-POCS algorithm is faster than ASD-POCS.

CONCLUSIONS

The proposed new algorithm can effectively solve the problem of using huge memory in large scale and iterative image reconstruction. Integrating with ASD-POCS frame, this no-system-matrix based scheme may be readily extended and applied to any iterative image reconstructions.

A simple and fast ASD-POCS algorithm for image reconstruction

PURPOSE

The adaptive steepest descent projection onto convex set (ASD-POCS) algorithm is a promising algorithm for constrained total variation (TV) type norm minimization models in computed tomography (CT) image reconstruction using sparse and/or noisy data. However, in ASD-POCS algorithm, the existing gradient expression of the TV-type norm appears too complicated in the implementation code and reduces image reconstruction speed. To address this issue, this work aims to develop and test a simple and fast ASD-POCS algorithm.

METHODS

Since the original algorithm is not derived thoroughly, we first obtain a simple matrix-form expression by thorough derivation via matrix representations. Next, we derive the simple matrix expressions of the gradients of TV, adaptive weighted TV (awTV), total p-variation (TpV), high order TV (HOTV) norms by term combinations and matrix representations. The deep analysis is then performed to identify the hidden relations of these terms.

RESULTS

The TV reconstruction experiments by use of sparse-view projections via the Shepp-Logan, FORBILD and a real CT image phantoms show that the simplified ASD-POCS (S-ASD-POCS) using the simple matrix-form expression of TV gradient achieve the same reconstruction accuracy relative to ASD-POCS, whereas it enables to speed up the whole ASD process 1.8-2.7 time fast.

CONCLUSIONS

The derived simple matrix expressions of the gradients of these TV-type norms may simplify the implementation of the ASD-POCS algorithm and speed up the ASD process. Additionally, a general gradient expression suitable to all the sparse transform-based optimization models is demonstrated so that the ASD-POCS algorithm may be tailored to extended image reconstruction fields with accelerated computational speed.

Algebraic reconstruction of 3D spatial EPR images from high numbers of noisy projections: An improved image reconstruction technique for high resolution fast scan EPR imaging

A novel method for reconstructing 3D spatial EPR images from large numbers of noisy projections was developed that minimizes mean square error between the experimental projections and those from the reconstructed image. The method utilizes raw projection data and zero gradient spectrum to account for EPR line shape and hyperfine structure of the paramagnetic probe without the need for deconvolution techniques that are poorly suited for processing of high noise projections. A numerical phantom was reconstructed for method validation. Reconstruction time for the matrix of 128³ voxels and 16,384 noiseless projections was 4.6 min for a single iteration. The algorithm converged quickly, reaching R² ~ 0.99975 after the very first iteration. An experimental phantom sample with nitroxyl radical was measured. With 16,384 projections and a field gradient of 8 G/cm, resolutions of 0.4 mm were achieved for a cubical area of 25 × 25 × 25 mm³. Reconstruction was sufficiently fast and memory efficient making it suitable for applications with large 3D matrices and fully determined system of equations. The developed algorithm can be used with any gradient distribution and does not require adjustable filter parameters that makes for simple application. A thorough analysis of the strengths and limitations of this method for 3D spatial EPR imaging is provided.

EPR Oximetry Sensor-Developing a TAM Derivative for In Vivo Studies

Oxygenation is one of the most important physiological parameters of biological systems. Low oxygen concentration (hypoxia) is associated with various pathophysiological processes in different organs. Hypoxia is of special importance in tumor therapy, causing poor response to treatment. Triaryl methyl (TAM) derivative radicals are commonly used in electron paramagnetic resonance (EPR) as sensors for quantitative spatial tissue oxygen mapping. They are also known as magnetic resonance imaging (MRI) contrast agents and fluorescence imaging compounds. We report the properties of the TAM radical tris(2,3,5,6-tetrachloro-4-carboxy-phenyl)methyl, (PTMTC), a potential multimodal (EPR/fluorescence) marker. PTMTC was spectrally analyzed using EPR and characterized by estimation of its sensitivity to the oxygen in liquid environment suitable for intravenous injection (1 mM PBS, pH = 7.4). Further, fluorescent emission of the radical was measured using the same solvent and its quantum yield was estimated. An in vitro cytotoxicity examination was conducted in two cancer cell lines, HT-29 (colorectal adenocarcinoma) and FaDu (squamous cell carcinoma) and followed by uptake studies. The stability of the radical in different solutions (PBS pH = 7.4, cell media used for HT-29 and FaDu cells culturing and cytotoxicity procedure, full rat blood and blood plasma) was determined. Finally, a primary toxicity test of PTMTC was carried out in mice. Results of spectral studies confirmed the multimodal properties of PTMTC. PTMTC was demonstrated to be not absorbed by cancer cells and did not interfere with luciferin-luciferase based assays. Also in vitro and in vivo tests showed that it was non-toxic and can be freely administrated till doses of 250 mg/kg BW via both i.v. and i.p. injections. This work illustrated that PTMTC is a perfect candidate for multimodal (EPR/fluorescence) contrast agent in preclinical studies.

Investigation of the preconditioner-parameter in the preconditioned Chambolle-Pock algorithm applied to optimization-based image reconstruction

The optimization-based image reconstruction methods have been thoroughly investigated in the field of medical imaging. The Chambolle-Pock (CP) algorithm may be employed to solve these convex optimization image reconstruction programs. The preconditioned CP (PCP) algorithm has been shown to have much higher convergence rate than the ordinary CP (OCP) algorithm. This algorithm utilizes a preconditioner-parameter to tune the implementation of the algorithm to the specific application, which ranges from 0 and 2, but is often set to 1. In this work, we investigated the impact of the preconditioner-parameter on the convergence rate of the PCP algorithm when it is applied to the TV constrained, data-divergence minimization (TVDM) optimization based image reconstruction. We performed the investigations in the context of 2D computed tomography (CT) and 3D electron paramagnetic resonance imaging (EPRI). For 2D CT, we used the Shepp-Logan and two FORBILD phantoms. For 3D EPRI, we used a simulated 6-spheres phantom and a physical phantom. Study results showed that the optimal preconditioner-parameter depends on the specific imaging conditions. Simply setting the parameter equal to 1 cannot guarantee a fast convergence rate. Thus, this study suggests that one should adaptively tune the preconditioner-parameter to obtain the optimal convergence rate of the PCP algorithm.

Three novel accurate pixel-driven projection methods for 2D CT and 3D EPR imaging

OBJECTIVES

This work aims to explore more accurate pixel-driven projection methods for iterative image reconstructions in order to reduce high-frequency artifacts in the generated projection image.

METHODS

Three new pixel-driven projection methods namely, small-pixel-large-detector (SPLD), linear interpolation based (LIB) and distance anterpolation based (DAB), were proposed and applied to reconstruct images. The performance of these methods was evaluated in both two-dimensional (2D) computed tomography (CT) images via the modified FORBILD phantom and three-dimensional (3D) electron paramagnetic resonance (EPR) images via the 6-spheres phantom. Specifically, two evaluations based on projection generation and image reconstruction were performed. For projection generation, evaluation was using a 2D disc phantom, the modified FORBILD phantom and the 6-spheres phantom. For image reconstruction, evaluations were performed using the FORBILD and 6-spheres phantom. During evaluation, 2 quantitative indices of root-mean-square-error (RMSE) and contrast-to-noise-ratio (CNR) were used.

RESULTS

Comparing to the use of ordinary pixel-driven projection method, RMSE of the SPLD based least-square algorithm was reduced from 0.0701 to 0.0384 and CNR was increased from 5.6 to 19.47 for 2D FORBILD phantom reconstruction. For 3D EPRI, RMSE of SPLD was also reduced from 0.0594 to 0.0498 and CNR was increased from 3.88 to 11.58. In addition, visual evaluation showed that images reconstructed in both 2D and 3D images suffered from high-frequency line-shape artifacts when using the ordinary pixel-driven projection method. However, using 3 new methods all suppressed the artifacts significantly and yielded more accurate reconstructions.

CONCLUSIONS

Three proposed pixel-driven projection methods achieved more accurate iterative image reconstruction results. These new and more accurate methods can also be easily extended to other imaging modalities. Among them, SPLD method should be recommended to 3D and four dimensional (4D) EPR imaging.

Fast backprojection-based reconstruction of spectral-spatial EPR images from projections with the constant sweep of a magnetic field

In this paper, we introduce a procedure for the reconstruction of spectral-spatial EPR images using projections acquired with the constant sweep of a magnetic field. The application of a constant field-sweep and a predetermined data sampling rate simplifies the requirements for EPR imaging instrumentation and facilitates the backprojection-based reconstruction of spectral-spatial images. The proposed approach was applied to the reconstruction of a four-dimensional numerical phantom and to actual spectral-spatial EPR measurements. Image reconstruction using projections with a constant field-sweep was three times faster than the conventional approach with the application of a pseudo-angle and a scan range that depends on the applied field gradient. Spectral-spatial EPR imaging with a constant field-sweep for data acquisition only slightly reduces the signal-to-noise ratio or functional resolution of the resultant images and can be applied together with any common backprojection-based reconstruction algorithm.

Accelerated dynamic EPR imaging using fast acquisition and compressive recovery

Electron paramagnetic resonance (EPR) allows quantitative imaging of tissue redox status, which provides important information about ischemic syndromes, cancer and other pathologies. For continuous wave EPR imaging, however, poor signal-to-noise ratio and low acquisition efficiency limit its ability to image dynamic processes in vivo including tissue redox, where conditions can change rapidly. Here, we present a data acquisition and processing framework that couples fast acquisition with compressive sensing-inspired image recovery to enable EPR-based redox imaging with high spatial and temporal resolutions. The fast acquisition (FA) allows collecting more, albeit noisier, projections in a given scan time. The composite regularization based processing method, called spatio-temporal adaptive recovery (STAR), not only exploits sparsity in multiple representations of the spatio-temporal image but also adaptively adjusts the regularization strength for each representation based on its inherent level of the sparsity. As a result, STAR adjusts to the disparity in the level of sparsity across multiple representations, without introducing any tuning parameter. Our simulation and phantom imaging studies indicate that a combination of fast acquisition and STAR (FASTAR) enables high-fidelity recovery of volumetric image series, with each volumetric image employing less than 10 s of scan. In addition to image fidelity, the time constants derived from FASTAR also match closely to the ground truth even when a small number of projections are used for recovery. This development will enhance the capability of EPR to study fast dynamic processes that cannot be investigated using existing EPR imaging techniques.