Accurate image reconstruction from few-view and limited-angle data in diffraction tomography

Optical diffraction tomography using a self-reference module

Optical diffraction tomography enables label-free, 3D refractive index (RI) imaging of biological samples. We present a novel, cost-effective approach to ODT that employs a modular design incorporating a self-reference holographic capture module. This two-part system consists of an illumination module and a capture module that can be seamlessly integrated with any life-science microscope using an automated alignment protocol. The illumination module employs a galvo-scanner system, providing precise control over the angular illumination, while the capture module utilises the principle of self-reference off-axis holography. The design has a compact form factor, simple alignment, and reduced cost. Furthermore, our system offers the capability to switch between two imaging modalities, ODT and real-time synthetic aperture digital holographic microscopy (SA-DHM), a unique feature not found in other setups. Experimental results are provided using a kidney cancer cell line. Experimental results are provided using a kidney cancer cell line.

Joint reconstruction algorithm: combining synchrotron radiation with conventional X-ray computed tomography for improved imaging

Synchrotron radiation (SR) is an excellent light source for micro-CT (micro-computed tomography) applications due to its monochromaticity and high brightness, which are crucial for achieving high-resolution imaging. However, when scanning larger objects, the limited field of view (FOV) of SR will lead to data truncation, limiting its utilization efficiency. To address this limitation, this paper proposed a method to integrate conventional X-ray CT data to supplement the truncated SR data for joint reconstruction to improve imaging. We first employ a polynomial transformation to match the image gray levels from the two distinct light sources and then resample these to form joint data. Subsequently, the method derives noise images from the noise characteristics of the projection data to construct image weight constraint that accurately reflects different data quality from two sources. The flexibility of the image weight constraint also allows for its combination with various denoisers to further enhance the reconstruction quality. Experimental results demonstrate that the proposed method can leverage the strengths of both imaging modalities to facilitate larger scale and high-resolution imaging.

Dynamic tracking of onion-like carbon nanoparticles in cancer cells using limited-angle holographic tomography with self-supervised learning

This research presents a novel approach for the dynamic monitoring of onion-like carbon nanoparticles inside colorectal cancer cells. Onion-like carbon nanoparticles are widely used in photothermal cancer therapy, and precise 3D tracking of their distribution is crucial. We proposed a limited-angle digital holographic tomography technique with unsupervised learning to achieve rapid and accurate monitoring. A key innovation is our internal learning neural network. This network addresses the information limitations of limited-angle measurements by directly mapping coordinates to measured data and reconstructing phase information at unmeasured angles without external training data. We validated the network using standard SiO2 microspheres. Subsequently, we reconstructed the 3D refractive index of onion-like carbon nanoparticles within cancer cells at various time points. Morphological parameters of the nanoparticles were quantitatively analyzed to understand their temporal evolution, offering initial insights into the underlying mechanisms. This methodology provides a new perspective for efficiently tracking nanoparticles within cancer cells.

Iterative reconstruction for limited-angle CT using implicit neural representation

Objective.Limited-angle computed tomography (CT) presents a challenge due to its ill-posed nature. In such scenarios, analytical reconstruction methods often exhibit severe artifacts. To tackle this inverse problem, several supervised deep learning-based approaches have been proposed. However, they are constrained by limitations such as generalization issue and the difficulty of acquiring a large amount of paired CT images.Approach.In this work, we propose an iterative neural reconstruction framework designed for limited-angle CT. By leveraging a coordinate-based neural representation, we formulate tomographic reconstruction as a convex optimization problem involving a deep neural network. We then employ differentiable projection layer to optimize this network by minimizing the discrepancy between the predicted and measured projection data. In addition, we introduce a prior-based weight initialization method to ensure the network starts optimization with an informed initial guess. This strategic initialization significantly improves the quality of iterative reconstruction by stabilizing the divergent behavior in ill-posed neural fields. Our method operates in a self-supervised manner, thereby eliminating the need for extensive data.Main results.The proposed method outperforms other iterative and learning-based methods. Experimental results on XCAT and Mayo Clinic datasets demonstrate the effectiveness of our approach in restoring anatomical features as well as structures. This finding was substantiated by visual inspections and quantitative evaluations using NRMSE, PSNR, and SSIM. Moreover, we conduct a comprehensive investigation into the divergent behavior of iterative neural reconstruction, thus revealing its suboptimal convergence when starting from scratch. In contrast, our method consistently produced accurate images by incorporating an initial estimate as informed initialization.Significance.This work showcases the feasibility to reconstruct high-fidelity CT images from limited-angle x-ray projections. The proposed methodology introduces a novel data-free approach to enhance medical imaging, holding promise across various clinical applications.

Sparse-view X-ray CT based on a box-constrained nonlinear weighted anisotropic TV regularization

Sparse-view computed tomography (CT) is an important way to reduce the negative effect of radiation exposure in medical imaging by skipping some X-ray projections. However, due to violating the Nyquist/Shannon sampling criterion, there are severe streaking artifacts in the reconstructed CT images that could mislead diagnosis. Noting the ill-posedness nature of the corresponding inverse problem in a sparse-view CT, minimizing an energy functional composed by an image fidelity term together with properly chosen regularization terms is widely used to reconstruct a medical meaningful attenuation image. In this paper, we propose a regularization, called the box-constrained nonlinear weighted anisotropic total variation (box-constrained NWATV), and minimize the regularization term accompanying the least square fitting using an alternative direction method of multipliers (ADMM) type method. The proposed method is validated through the Shepp-Logan phantom model, alongisde the actual walnut X-ray projections provided by Finnish Inverse Problems Society and the human lung images. The experimental results show that the reconstruction speed of the proposed method is significantly accelerated compared to the existing $ L_1/L_2 $ regularization method. Precisely, the central processing unit (CPU) time is reduced more than 8 times.

MDST: multi-domain sparse-view CT reconstruction based on convolution and swin transformer

Objective.Sparse-view computed tomography (SVCT), which can reduce the radiation doses administered to patients and hasten data acquisition, has become an area of particular interest to researchers. Most existing deep learning-based image reconstruction methods are based on convolutional neural networks (CNNs). Due to the locality of convolution and continuous sampling operations, existing approaches cannot fully model global context feature dependencies, which makes the CNN-based approaches less efficient in modeling the computed tomography (CT) images with various structural information.Approach.To overcome the above challenges, this paper develops a novel multi-domain optimization network based on convolution and swin transformer (MDST). MDST uses swin transformer block as the main building block in both projection (residual) domain and image (residual) domain sub-networks, which models global and local features of the projections and reconstructed images. MDST consists of two modules for initial reconstruction and residual-assisted reconstruction, respectively. The sparse sinogram is first expanded in the initial reconstruction module with a projection domain sub-network. Then, the sparse-view artifacts are effectively suppressed by an image domain sub-network. Finally, the residual assisted reconstruction module to correct the inconsistency of the initial reconstruction, further preserving image details.Main results. Extensive experiments on CT lymph node datasets and real walnut datasets show that MDST can effectively alleviate the loss of fine details caused by information attenuation and improve the reconstruction quality of medical images.Significance.MDST network is robust and can effectively reconstruct images with different noise level projections. Different from the current prevalent CNN-based networks, MDST uses transformer as the main backbone, which proves the potential of transformer in SVCT reconstruction.

Numerical refractive index correction for the stitching procedure in tomographic quantitative phase imaging

Tomographic quantitative phase imaging (QPI) lacks an absolute refractive index value baseline, which poses a problem when large dense objects extending over multiple fields of view are measured volume by volume and stitched together. Some of the measurements lack the natural baseline value that is provided by the mounting medium with a known refractive index. In this work, we discuss the problem of the refractive index (RI) baseline of individual reconstructed volumes that are deprived of access to mounting medium due to the extent of the object. The solution of this problem is provided by establishing the RI offsets based on the overlapping regions. We have proven that the process of finding the offset RI values may be justifiably reduced to the analogous procedure in the 2D baseline correction (2D-BC). Finally, we proposed the enhancement of the state-of-the-art 2D-BC procedure previously introduced in the context of 2D QPI. The processing is validated at the examples of a synthetic dataset and a liver organoid.

Intensity-based iterative reconstruction for helical grating interferometry breast CT with static grating configuration

Grating interferometry breast computed tomography (GI-BCT) has the potential to provide enhanced soft tissue contrast and to improve visualization of cancerous lesions for breast imaging. However, with a conventional scanning protocol, a GI-BCT scan requires longer scanning time and higher operation complexity compared to conventional attenuation-based CT. This is mainly due to multiple grating movements at every projection angle, so-called phase stepping, which is used to retrieve attenuation, phase, and scattering (dark-field) signals. To reduce the measurement time and complexity and extend the field of view, we have adopted a helical GI-CT setup and present here the corresponding tomographic reconstruction algorithm. This method allows simultaneous reconstruction of attenuation, phase contrast, and scattering images while avoiding grating movements. Experiments on simulated phantom and real initial intensity, visibility and phase maps are provided to validate our method.

Cone-beam breast CT using an offset detector: effect of detector offset and image reconstruction algorithm

Objective.A dedicated cone-beam breast computed tomography (BCT) using a high-resolution, low-noise detector operating in offset-detector geometry has been developed. This study investigates the effects of varying detector offsets and image reconstruction algorithms to determine the appropriate combination of detector offset and reconstruction algorithm.Approach.Projection datasets (300 projections in 360°) of 30 breasts containing calcified lesions that were acquired using a prototype cone-beam BCT system comprising a 40 × 30 cm flat-panel detector with 1024 × 768 detector pixels were reconstructed using Feldkamp-Davis-Kress (FDK) algorithm and served as the reference. The projection datasets were retrospectively truncated to emulate cone-beam datasets with sinograms of 768×768 and 640×768 detector pixels, corresponding to 5 cm and 7.5 cm lateral offsets, respectively. These datasets were reconstructed using the FDK algorithm with appropriate weights and an ASD-POCS-based Fast, total variation-Regularized, Iterative, Statistical reconstruction Technique (FRIST), resulting in a total of 4 offset-detector reconstructions (2 detector offsets × 2 reconstruction methods). Signal difference-to-noise ratio (SDNR), variance, and full-width at half-maximum (FWHM) of calcifications in two orthogonal directions were determined from all reconstructions. All quantitative measurements were performed on images in units of linear attenuation coefficient (1/cm).Results.The FWHM of calcifications did not differ (P > 0.262) among reconstruction algorithms and detector formats, implying comparable spatial resolution. For a chosen detector offset, the FRIST algorithm outperformed FDK in terms of variance and SDNR (P < 0.0001). For a given reconstruction method, the 5 cm offset provided better results.Significance.This study indicates the feasibility of using the compressed sensing-based, FRIST algorithm to reconstruct sinograms from offset-detectors. Among the reconstruction methods and detector offsets studied, FRIST reconstructions corresponding to a 30 cm × 30 cm with 5 cm lateral offset, achieved the best performance. A clinical prototype using such an offset geometry has been developed and installed for clinical trials.

ADMM-SVNet: An ADMM-Based Sparse-View CT Reconstruction Network

In clinical medical applications, sparse-view computed tomography (CT) imaging is an effective method for reducing radiation doses. The iterative reconstruction method is usually adopted for sparse-view CT. In the process of optimizing the iterative model, the approach of directly solving the quadratic penalty function of the objective function can be expected to perform poorly. Compared with the direct solution method, the alternating direction method of multipliers (ADMM) algorithm can avoid the ill-posed problem associated with the quadratic penalty function. However, the regularization items, sparsity transform, and parameters in the traditional ADMM iterative model need to be manually adjusted. In this paper, we propose a data-driven ADMM reconstruction method that can automatically optimize the above terms that are difficult to choose within an iterative framework. The main contribution of this paper is that a modified U-net represents the sparse transformation, and the prior information and related parameters are automatically trained by the network. Based on a comparison with other state-of-the-art reconstruction algorithms, the qualitative and quantitative results show the effectiveness of our method for sparse-view CT image reconstruction. The experimental results show that the proposed method performs well in streak artifact elimination and detail structure preservation. The proposed network can deal with a wide range of noise levels and has exceptional performance in low-dose reconstruction tasks.

Off-axis image plane hologram compression in holographic tomography - metrological assessment

In this paper, we present a novel study on the impact of lossy data compression on the metrological properties of holographic tomography reconstruction of the refractive index (RI). We use a spatial bandwidth-optimized compression procedure that leverages the properties of image plane off-axis holograms and standardized compression codecs, both widely applied in research and industry. The compression procedure is tested at multiple bitrates, for four different objects and against three reconstruction algorithms. The metrological evaluation is primarily done by comparison to the reconstruction from original data using the root-mean-squared error (RMSE). We show that due to differences between objects and different noise sensitivities of the reconstruction algorithms, the rate-distortion behaviour varies, but in most cases allows for the compression below 1 bit per pixel, while maintaining an RI RMSE less than 10^-4.

Image quality of dual-energy cone-beam CT with total nuclear variation regularization

Despite the improvements in image quality of cone beam computed tomography (CBCT) scans, application remains limited to patient positioning. In this study, we propose to improve image quality by dual energy (DE) imaging and iterative reconstruction using least squares fitting with total variation (TV) regularization. The generalization of TV called total nuclear variation (TNV) was used to generate DE images. We acquired single energy (SE) and DE scans of an image quality phantom (IQP) and of an anthropomorphic human male phantom (HMP). The DE scans were dual arc acquisitions of 70kV and 130kV with a variable dose partitioning between low energy (LE) and high energy (HE) arcs. To investigate potential benefits from a larger spectral separation between LE and HE, DE scans with an additional 2 mm copper beam filtration in the HE arc were acquired for the IQP. The DE TNV scans were compared to SE scans reconstructed with FDK and iterative TV with varying parameters. The contrast-to-noise ratio (CNR), spatial frequency, and structural similarity (SSIM) were used as image quality metrics. Results showed largely improved image quality for DE TNV over FDK for both phantoms. DE TNV with the highest dose allocation in the LE arm yielded the highest CNR. Compared to SE TV, these DE TNV results had a slightly lower CNR with similar spatial resolution for the IQP. A decrease in the dose allocated to the LE arm improved the spatial resolution with a trade-off against CNR. For the HMP, DE TNV displayed a lower CNR and/or lower spatial resolution depending on the reconstruction parameters. Regarding the SSIM, DE TNV was superior to FDK and SE TV for both phantoms. The additional beam filtration for the IQP led to improved image quality in all metrics, surpassing the SE TV results in CNR and spatial resolution.

Compressively sampled magnetic resonance imaging reconstruction based on split Bregman iteration with general non-uniform threshold shrinkage

PURPOSE

K-space under-sampling reconstruction technology is an effective means to improve the speed of magnetic resonance imaging. Among its many reconstruction algorithms, split Bregman iteration is an effective method to solve multi-constrained models. This model often contains TV variational regularization terms, the generalized threshold shrinkage operator often used to solve TV constraints subproblem. However, when the generalized threshold shrinkage operator is performing the shrinking operation, it does not consider the inconsistency of the elements in the image matrix, which will cause the loss of image details.

METHODS

In response to this problem, in this paper, a non-uniform threshold shrinkage operator was proposed to solve above TV constraints subproblem, which can dynamically adjust the shrinkage threshold by the residuals of each image element. And introduce this operator when performing Split Bregman iteration to improve the performance of generalized threshold shrinkage.

RESULTS

After qualitative and quantitative analysis during the experiments, it can be concluded that compared with the other three methods, the proposed method has better performance in terms of Peak Signal to Noise Ratio (PSNR), Structural Similarity Index Measure (SSIM), Transferred Edge Information(TEI) and Normalized Mutual Information(NMI), and the visual perception is better. Then we also did denoising performance analysis at different noise levels, this method also showed good robustness.

CONCLUSIONS

The proposed method can improve the reconstruction performance of TV constrained subproblem in split Bregman iteration, and then improve the overall performance of reconstruction algorithm. Moreover, this method also shows good denoising performance at different noise levels.

A neural network with encoded visible edge prior for limited-angle computed tomography reconstruction

PURPOSE

Limited-angle computed tomography is a challenging but important task in certain medical and industrial applications for nondestructive testing. The limited-angle reconstruction problem is highly ill-posed and conventional reconstruction algorithms would introduce heavy artifacts. Various models and methods have been proposed to improve the quality of reconstructions by introducing different priors regarding to the projection data or ideal images. However, the assumed priors might not be practically applicable to all limited-angle reconstruction problems. Convolutional neural network (CNN) exhibits great promise in the modeling of data coupling and has recently become an important technique in medical imaging applications. Although existing CNN methods have demonstrated promising results, their robustness is still a concern. In this paper, in light of the theory of visible and invisible boundaries, we propose an alternating edge-preserving diffusion and smoothing neural network (AEDSNN) for limited-angle reconstruction that builds the visible boundaries as priors into its structure. The proposed method generalizes the alternating edge-preserving diffusion and smoothing (AEDS) method for limited-angle reconstruction developed in the literature by replacing its regularization terms by CNNs, by which the piecewise constant assumption assumed by AEDS is effectively relaxed.

METHODS

The AEDSNN is derived by unrolling the AEDS algorithm. AEDSNN consists of several blocks, and each block corresponds to one iteration of the AEDS algorithm. In each iteration of the AEDS algorithm, three subproblems are sequentially solved. So, each block of AEDSNN possesses three main layers: data matching layer, x -direction regularization layer for visible edges diffusion, and y -direction regularization layer for artifacts suppressing. The data matching layer is implemented by conventional ordered-subset simultaneous algebraic reconstruction technique (OS-SART) reconstruction algorithm, while the two regularization layers are modeled by CNNs for more intelligent and better encoding of priors regarding to the reconstructed images. To further strength the visible edge prior, the attention mechanism and the pooling layers are incorporated into AEDSNN to facilitate the procedure of edge-preserving diffusion from visible edges.

RESULTS

We have evaluated the performance of AEDSNN by comparing it with popular algorithms for limited-angle reconstruction. Experiments on the medical dataset show that the proposed AEDSNN effectively breaks through the piecewise constant assumption usually assumed by conventional reconstruction algorithms, and works much better for piecewise smooth images with nonsharp edges. Experiments on the printed circuit board (PCB) dataset show that AEDSNN can better encode and utilize the visible edge prior, and its reconstructions are consistently better compared to the competing algorithms.

CONCLUSIONS

A deep-learning approach for limited-angle reconstruction is proposed in this paper, which significantly outperforms existing methods. The superiority of AEDSNN consists of three aspects. First, by the virtue of CNN, AEDSNN is free of parameter-tuning. This is a great facility compared to conventional reconstruction methods; Second, AEDSNN is quite fast. Conventional reconstruction methods usually need hundreds even thousands of iterations, while AEDSNN just needs three to five iterations (i.e., blocks); Third, the learned regularizer by AEDSNN enjoys a broader application capacity, which could work well with piecewise smooth images and surpass the piecewise constant assumption frequently assumed for computed tomography images.

Improvement of megavoltage computed tomography image quality for adaptive helical tomotherapy using cycleGAN-based image synthesis with small datasets

PURPOSE

Megavoltage computed tomography (MVCT) offers an opportunity for adaptive helical tomotherapy. However, high noise and reduced contrast in the MVCT images due to a decrease in the imaging dose to patients limits its usability. Therefore, we propose an algorithm to improve the image quality of MVCT.

METHODS

The proposed algorithm generates kilovoltage CT (kVCT)-like images from MVCT images using a cycle-consistency generative adversarial network (cycleGAN)-based image synthesis model. Data augmentation using an affine transformation was applied to the training data to overcome the lack of data diversity in the network training. The mean absolute error (MAE), root-mean-square error (RMSE), peak signal-to-noise ratio (PSNR), and structural similarity index measure (SSIM) were used to quantify the correction accuracy of the images generated by the proposed algorithm. The proposed method was validated by comparing the images generated with those obtained from conventional and deep learning-based image processing method through non-augmented datasets.

RESULTS

The average MAE, RMSE, PSNR, and SSIM values were 18.91 HU, 69.35 HU, 32.73 dB, and 95.48 using the proposed method, respectively, whereas cycleGAN with non-augmented data showed inferior results (19.88 HU, 70.55 HU, 32.62 dB, 95.19, respectively). The voxel values of the image obtained by the proposed method also indicated similar distributions to those of the kVCT image. The dose-volume histogram of the proposed method was also similar to that of electron density corrected MVCT.

CONCLUSIONS

The proposed algorithm generates synthetic kVCT images from MVCT images using cycleGAN with small patient datasets. The image quality achieved by the proposed method was correspondingly improved to the level of a kVCT image while maintaining the anatomical structure of an MVCT image. The evaluation of dosimetric effectiveness of the proposed method indicates the applicability of accurate treatment planning in adaptive radiation therapy.

NUDIM: A non-uniform fast Fourier transform based dual-space constraint iterative reconstruction method in biological electron tomography

Electron tomography, a powerful imaging tool for studying 3D structures of macromolecular assemblies, always suffers from imperfect reconstruction with limited resolution due to the intrinsic low signal-to-noise ratio (SNR) and inaccessibility to certain tilt angles induced by radiation damage or mechanical limitation. In order to compensate for such insufficient data with low SNR and further improve imaging resolution, prior knowledge constraints about the objects in both real space and reciprocal space are thus exploited during tomographic reconstruction. However, direct Fast Fourier transform (FFT) between real space and reciprocal space remains extraordinarily challenging owing to their inconsistent grid sampling modes, e.g. regular and uniform grid sampling in real space whereas radial or polar grid sampling in reciprocal space. In order to solve such problem, a technique of non-uniform fast Fourier transform (NFFT) has been developed to transform efficiently between non-uniformly sampled grids in real and reciprocal space with sufficient accuracy. In this work, a Non-Uniform fast Fourier transform based Dual-space constraint Iterative reconstruction Method (NUDIM) applicable to biological electron tomography is proposed with a combination of basic concepts from equally sloped tomography (EST) and NFFT based reconstruction. In NUDIM, the use of NFFT can circumvent such grid sampling inconsistency and thus alleviate the stringent equally-sloped sampling requirement in EST reconstruction, while the dual-space constraint iterative procedure can dramatically enhance reconstruction quality. In comparison with conventional reconstruction methods, NUDIM is numerically and experimentally demonstrated to produce superior reconstruction quality with higher contrast, less noise and reduced missing wedge artifacts. More importantly, it is also capable of retrieving part of missing information from a limited number of projections.

PWLS-PR: low-dose computed tomography image reconstruction using a patch-based regularization method based on the penalized weighted least squares total variation approach

BACKGROUND

Radiation exposure computed tomography (CT) scans and the associated risk of cancer in patients have been major clinical concerns. Existing research can achieve low-dose CT imaging by reducing the X-ray current and the number of projections per rotation of the human body. However, this method may produce excessive noise and fringe artifacts in the traditional filtered back projection (FBP)-reconstructed image.

METHODS

To solve this problem, iterative image reconstruction is a promising option to obtain high-quality images from low-dose scans. This paper proposes a patch-based regularization method based on penalized weighted least squares total variation (PWLS-PR) for iterative image reconstruction. This method uses neighborhood patches instead of single pixels to calculate the nonquadratic penalty. The proposed regularization method is more robust than the conventional regularization method in identifying random fluctuations caused by sharp edges and noise. Each iteration of the proposed algorithm can be described in the following three steps: image updating via the total variation based on penalized weighted least squares (PWLS-TV), image smoothing, and pixel-by-pixel image fusion.

RESULTS

Simulation and real-world projection experiments show that the proposed PWLS-PR algorithm achieves a higher image reconstruction performance than similar algorithms. Through the qualitative and quantitative evaluation of simulation experiments, the effectiveness of the method is also verified.

CONCLUSIONS

Furthermore, this study shows that the PWLS-PR method reduces the amount of projection data required for repeated CT scans and has the useful potential to reduce the radiation dose in clinical medical applications.

An iterative reconstruction method for sparse-projection data for low-dose CT

Reducing X-ray radiation is beneficial for reducing the risk of cancer in patients. There are two main approaches for achieving this goal namely, one is to reduce the X-ray current, and another is to apply sparse-view protocols to do image scanning and projections. However, these techniques usually lead to degradation of the reconstructed image quality, resulting in excessive noise and severe edge artifacts, which seriously affect the diagnosis result. In order to overcome such limitation, this study proposes and tests an algorithm based on guided kernel filtering. The algorithm combines the characteristics of anisotropic edges between adjacent image voxels, expresses the relevant weights with an exponential function, and adjusts the weights adaptively through local gray gradients to better preserve the image structure while suppressing noise information. Experiments show that the proposed method can effectively suppress noise and preserve the image structure. Comparing with similar algorithms, the proposed algorithm greatly improves the peak signal-to-noise ratio (PSNR), structural similarity (SSIM), and root mean square error (RMSE) of the reconstructed image. The proposed algorithm has the best effect in quantitative analysis, which verifies the effectiveness of the proposed method and good image reconstruction performance. Overall, this study demonstrates that the proposed method can reduce the number of projections required for repeated CT scans and has potential for medical applications in reducing radiation doses.

Scalable Double Regularization for 3D Nano-CT Reconstruction

Nano-CT (computerized tomography) has emerged as a non-destructive high-resolution cross-sectional imaging technique to effectively study the sub-µm pore structure of shale, which is of fundamental importance to the evaluation and development of shale oil and gas. Nano-CT poses unique challenges to the inverse problem of reconstructing the 3D structure due to the lower signal-to-noise ratio (than Micro-CT) at the nano-scale, increased sensitivity to the misaligned geometry caused by the movement of object manipulator, limited sample size, and a larger volume of data at higher resolution. We propose a scalable double regularization (SDR) method to utilize the entire dataset for simultaneous 3D structural reconstruction across slices through total variation regularization within slices and L ₁ regularization between adjacent slices. SDR allows information borrowing both within and between slices, contrasting with the traditional methods that usually build on slice by slice reconstruction. We develop a scalable and memory-efficient algorithm by exploiting the systematic sparsity and consistent geometry induced by such Nano-CT data. We illustrate the proposed method using synthetic data and two Nano-CT imaging datasets of Jiulaodong (JLD) shale and Longmaxi (LMX) shale acquired in the Sichuan Basin. These numerical experiments show that the proposed method substantially outperforms selected alternatives both visually and quantitatively.

Cone-beam breast computed tomography using ultra-fast image reconstruction with constrained, total-variation minimization for suppression of artifacts

Compressed sensing based iterative reconstruction algorithms for computed tomography such as adaptive steepest descent-projection on convex sets (ASD-POCS) are attractive due to their applicability in incomplete datasets such as sparse-view data and can reduce radiation dose to the patients while preserving image quality. Although IR algorithms reduce image noise compared to analytical Feldkamp-Davis-Kress (FDK) algorithm, they may generate artifacts, particularly along the periphery of the object. One popular solution is to use finer image-grid followed by down-sampling. This approach is computationally intensive but may be compensated by reducing the field of view. Our proposed solution is to replace the algebraic reconstruction technique within the original ASD-POCS by ordered subsets-simultaneous algebraic reconstruction technique (OS-SART) and with initialization using FDK image. We refer to this method as Fast, Iterative, TV-Regularized, Statistical reconstruction Technique (FIRST). In this study, we investigate FIRST for cone-beam dedicated breast CT with large image matrix. The signal-difference to noise ratio (SDNR), the difference of the mean value and the variance of adipose and fibroglandular tissues for both FDK and FIRST reconstructions were determined. With FDK serving as the reference, the root-mean-square error (RMSE), bias, and the full-width at half-maximum (FWHM) of microcalcifications in two orthogonal directions were also computed. Our results suggest that FIRST is competitive to the finer image-grid method with shorter reconstruction time. Images reconstructed using the FIRST do not exhibit artifacts and outperformed FDK in terms of image noise. This suggests the potential of this approach for radiation dose reduction in cone-beam breast CT.

Deep learning-based optical field screening for robust optical diffraction tomography

In tomographic reconstruction, the image quality of the reconstructed images can be significantly degraded by defects in the measured two-dimensional (2D) raw image data. Despite the importance of screening defective 2D images for robust tomographic reconstruction, manual inspection and rule-based automation suffer from low-throughput and insufficient accuracy, respectively. Here, we present deep learning-enabled quality control for holographic data to produce robust and high-throughput optical diffraction tomography (ODT). The key idea is to distil the knowledge of an expert into a deep convolutional neural network. We built an extensive database of optical field images with clean/noisy annotations, and then trained a binary-classification network based upon the data. The trained network outperformed visual inspection by non-expert users and a widely used rule-based algorithm, with >90% test accuracy. Subsequently, we confirmed that the superior screening performance significantly improved the tomogram quality. To further confirm the trained model's performance and generalisability, we evaluated it on unseen biological cell data obtained with a setup that was not used to generate the training dataset. Lastly, we interpreted the trained model using various visualisation techniques that provided the saliency map underlying each model inference. We envision the proposed network would a powerful lightweight module in the tomographic reconstruction pipeline.

Projection extrapolation routine for tight-frame limited-angle optical diffraction tomography

We propose a data-replenishment-type expansion of the modified Gerchberg-Papoulis (GP) algorithm for limited-angle optical diffraction tomography (LAODT), which prevents artifact buildup in the GP reconstructions of confined bulk objects tightly fitting the active field of view (FoV) of the LAODT microscope. Objects crossing the FoV borders are not considered. The method relies on a Fourier-based forward projector complementary to the GP solver with no additional constraints. Fourier space regridding errors are minimized by means of one-dimensional oversampling in the axial direction, which is demonstrated to be more efficient than standard projection padding. Verification of both synthetic and experimental sinograms confirms the ability of the procedure to deduce missing projection parts necessary for the correct reconstruction.

Technical Note: Iterative megavoltage CT (MVCT) reconstruction using block-matching 3D-transform (BM3D) regularization

PURPOSE

Megavoltage CT (MVCT) images are noisier than kilovoltage CT (KVCT) due to low detector efficiency to high-energy x rays. Conventional denoising methods compromise edge resolution and low-contrast object visibility. In this work, we incorporated block-matching 3D-transform shrinkage (BM3D) transformation into MVCT iterative reconstruction as nonlocal patch-wise regularization.

METHODS

The iterative reconstruction was achieved by adding to the existing least square data fidelity objective a regularization term, formulated as the L1 norm of the BM3D transformed image. A Fast Iterative Shrinkage-Thresholding Algorithm (FISTA) was adopted to accelerate CT reconstruction. The proposed method was compared against total variation (TV) regularization, BM3D postprocess method, and filtered back projection (FBP).

RESULTS

In the Catphan phantom study, BM3D regularization better enhances low-contrast objects compared with TV regularization and BM3D postprocess method at the same noise level. The spatial resolution using BM3D regularization is 2.79 and 2.55 times higher than that using the TV regularization at 50% of the modulation transfer function (MTF) magnitude, for the fully sampled reconstruction and down-sampled reconstruction, respectively. The BM3D regularization images show better bony details and low-contrast soft tissues, on the head and neck (H&N) and prostate patient images.

CONCLUSIONS

The proposed iterative BM3D regularization CT reconstruction method takes advantage of both the BM3D denoising capability and iterative reconstruction data fidelity consistency. This novel approach is superior to TV regularized iterative reconstruction or BM3D postprocess for improving noisy MVCT image quality.

Illumination-related errors in limited-angle optical diffraction tomography

In the paper, the design and tolerances of optical systems and scanning components used in limited-angle optical diffraction tomography are analyzed in order to improve the performance of the measurement systems and to encourage the application of tomography as a standard method for quantitative analysis of 3D refractive index distribution in biological microstructures. The first part of the presented analysis consists of component selection for the scanning device and optical system in the illumination part of the setup and the influence of the illumination wavefront on reconstruction quality. In the second part, the sensitivity of the tomographic reconstruction quality to three representative measurement-related errors based on synthetic data is demonstrated. Finally, a configuration of the system, selected to minimize reconstruction errors, is proposed and alignment tolerances simulated using the Monte Carlo method are provided.

Simultaneous algebraic reconstruction technique based on guided image filtering

The challenge of computed tomography is to reconstruct high-quality images from few-view projections. Using a prior guidance image, guided image filtering smoothes images while preserving edge features. The prior guidance image can be incorporated into the image reconstruction process to improve image quality. We propose a new simultaneous algebraic reconstruction technique based on guided image filtering. Specifically, the prior guidance image is updated in the image reconstruction process, merging information iteratively. To validate the algorithm practicality and efficiency, experiments were performed with numerical phantom projection data and real projection data. The results demonstrate that the proposed method is effective and efficient for nondestructive testing and rock mechanics.

Statistical iterative reconstruction to improve image quality for digital breast tomosynthesis

PURPOSE

Digital breast tomosynthesis (DBT) is a novel modality with the potential to improve early detection of breast cancer by providing three-dimensional (3D) imaging with a low radiation dose. 3D image reconstruction presents some challenges: cone-beam and flat-panel geometry, and highly incomplete sampling. A promising means of overcome these challenges is statistical iterative reconstruction (IR), since it provides the flexibility of accurate physics modeling and a general description of system geometry. The authors' goal was to develop techniques for applying statistical IR to tomosynthesis imaging data.

METHODS

These techniques include the following: a physics model with a local voxel-pair based prior with flexible parameters to fine-tune image quality; a precomputed parameter λ in the prior, to remove data dependence and to achieve a uniform resolution property; an effective ray-driven technique to compute the forward and backprojection; and an oversampled, ray-driven method to perform high resolution reconstruction with a practical region-of-interest technique. To assess the performance of these techniques, the authors acquired phantom data on the stationary DBT prototype system. To solve the estimation problem, the authors proposed an optimization-transfer based algorithm framework that potentially allows fewer iterations to achieve an acceptably converged reconstruction.

RESULTS

IR improved the detectability of low-contrast and small microcalcifications, reduced cross-plane artifacts, improved spatial resolution, and lowered noise in reconstructed images.

CONCLUSIONS

Although the computational load remains a significant challenge for practical development, the superior image quality provided by statistical IR, combined with advancing computational techniques, may bring benefits to screening, diagnostics, and intraoperative imaging in clinical applications.

Dynamic intensity-weighted region of interest imaging for conebeam CT

BACKGROUND

Patient dose from image guidance in radiotherapy is small compared to the treatment dose. However, the imaging beam is untargeted and deposits dose equally in tumor and healthy tissues. It is desirable to minimize imaging dose while maintaining efficacy.

OBJECTIVE

Image guidance typically does not require full image quality throughout the patient. Dynamic filtration of the kV beam allows local control of CT image noise for high quality around the target volume and lower quality elsewhere, with substantial dose sparing and reduced scatter fluence on the detector.

METHODS

The dynamic Intensity-Weighted Region of Interest (dIWROI) technique spatially varies beam intensity during acquisition with copper filter collimation. Fluence is reduced by 95% under the filters with the aperture conformed dynamically to the ROI during cone-beam CT scanning. Preprocessing to account for physical effects of the collimator before reconstruction is described.

RESULTS

Reconstructions show image quality comparable to a standard scan in the ROI, with higher noise and streak artifacts in the outer region but still adequate quality for patient localization. Monte Carlo modeling shows dose reduction by 10-15% in the ROI due to reduced scatter, and up to 75% outside.

CONCLUSIONS

The presented technique offers a method to reduce imaging dose by accepting increased image noise outside the ROI, while maintaining full image quality inside the ROI.

An interprojection sensor fusion approach to estimate blocked projection signal in synchronized moving grid-based CBCT system

PURPOSE

A preobject grid can reduce and correct scatter in cone beam computed tomography (CBCT). However, half of the signal in each projection is blocked by the grid. A synchronized moving grid (SMOG) has been proposed to acquire two complimentary projections at each gantry position and merge them into one complete projection. That approach, however, suffers from increased scanning time and the technical difficulty of accurately merging the two projections per gantry angle. Herein, the authors present a new SMOG approach which acquires a single projection per gantry angle, with complimentary grid patterns for any two adjacent projections, and use an interprojection sensor fusion (IPSF) technique to estimate the blocked signal in each projection. The method may have the additional benefit of reduced imaging dose due to the grid blocking half of the incident radiation.

METHODS

The IPSF considers multiple paired observations from two adjacent gantry angles as approximations of the blocked signal and uses a weighted least square regression of these observations to finally determine the blocked signal. The method was first tested with a simulated SMOG on a head phantom. The signal to noise ratio (SNR), which represents the difference of the recovered CBCT image to the original image without the SMOG, was used to evaluate the ability of the IPSF in recovering the missing signal. The IPSF approach was then tested using a Catphan phantom on a prototype SMOG assembly installed in a bench top CBCT system.

RESULTS

In the simulated SMOG experiment, the SNRs were increased from 15.1 and 12.7 dB to 35.6 and 28.9 dB comparing with a conventional interpolation method (inpainting method) for a projection and the reconstructed 3D image, respectively, suggesting that IPSF successfully recovered most of blocked signal. In the prototype SMOG experiment, the authors have successfully reconstructed a CBCT image using the IPSF-SMOG approach. The detailed geometric features in the Catphan phantom were mostly recovered according to visual evaluation. The scatter related artifacts, such as cupping artifacts, were almost completely removed.

CONCLUSIONS

The IPSF-SMOG is promising in reducing scatter artifacts and improving image quality while reducing radiation dose.

ODTbrain: a Python library for full-view, dense diffraction tomography

BACKGROUND

Analyzing the three-dimensional (3D) refractive index distribution of a single cell makes it possible to describe and characterize its inner structure in a marker-free manner. A dense, full-view tomographic data set is a set of images of a cell acquired for multiple rotational positions, densely distributed from 0 to 360 degrees. The reconstruction is commonly realized by projection tomography, which is based on the inversion of the Radon transform. The reconstruction quality of projection tomography is greatly improved when first order scattering, which becomes relevant when the imaging wavelength is comparable to the characteristic object size, is taken into account. This advanced reconstruction technique is called diffraction tomography. While many implementations of projection tomography are available today, there is no publicly available implementation of diffraction tomography so far.

RESULTS

We present a Python library that implements the backpropagation algorithm for diffraction tomography in 3D. By establishing benchmarks based on finite-difference time-domain (FDTD) simulations, we showcase the superiority of the backpropagation algorithm over the backprojection algorithm. Furthermore, we discuss how measurment parameters influence the reconstructed refractive index distribution and we also give insights into the applicability of diffraction tomography to biological cells.

CONCLUSION

The present software library contains a robust implementation of the backpropagation algorithm. The algorithm is ideally suited for the application to biological cells. Furthermore, the implementation is a drop-in replacement for the classical backprojection algorithm and is made available to the large user community of the Python programming language.

Comparative study of iterative reconstruction algorithms for missing cone problems in optical diffraction tomography

In optical tomography, there exist certain spatial frequency components that cannot be measured due to the limited projection angles imposed by the numerical aperture of objective lenses. This limitation, often called as the missing cone problem, causes the under-estimation of refractive index (RI) values in tomograms and results in severe elongations of RI distributions along the optical axis. To address this missing cone problem, several iterative reconstruction algorithms have been introduced exploiting prior knowledge such as positivity in RI differences or edges of samples. In this paper, various existing iterative reconstruction algorithms are systematically compared for mitigating the missing cone problem in optical diffraction tomography. In particular, three representative regularization schemes, edge preserving, total variation regularization, and the Gerchberg-Papoulis algorithm, were numerically and experimentally evaluated using spherical beads as well as real biological samples; human red blood cells and hepatocyte cells. Our work will provide important guidelines for choosing the appropriate regularization in ODT.

Compressed sensing for ultrasound computed tomography

Ultrasound computed tomography (UCT) allows the reconstruction of quantitative tissue characteristics, such as speed of sound, mass density, and attenuation. Lowering its acquisition time would be beneficial; however, this is fundamentally limited by the physical time of flight and the number of transmission events. In this letter, we propose a compressed sensing solution for UCT. The adopted measurement scheme is based on compressed acquisitions, with concurrent randomised transmissions in a circular array configuration. Reconstruction of the image is then obtained by combining the born iterative method and total variation minimization, thereby exploiting variation sparsity in the image domain. Evaluation using simulated UCT scattering measurements shows that the proposed transmission scheme performs better than uniform undersampling, and is able to reduce acquisition time by almost one order of magnitude, while maintaining high spatial resolution.

Improved regularization reconstruction from sparse angle data in optical diffraction tomography

In this paper, we propose an improved deterministic regularization algorithm to handle the sparse angle data problem in optical diffraction tomography. Based on optical diffraction tomography and the deterministic regularization algorithm, the regularization iteration is performed in the space domain and the frequency domain simultaneously, which greatly reduces the computational cost. By applying piecewise-smoothness and positivity constraints as the penalty function, the missing frequency spectrum is effectively recovered and the internal refractive index distribution of the specimen is accurately reconstructed. Using simulated and experimental results, we show that the proposed regularization algorithm allows accurate refractive index reconstruction from very sparse angle data in optical diffraction tomography.

Sparse-view ultrasound diffraction tomography using compressed sensing with nonuniform FFT

Accurate reconstruction of the object from sparse-view sampling data is an appealing issue for ultrasound diffraction tomography (UDT). In this paper, we present a reconstruction method based on compressed sensing framework for sparse-view UDT. Due to the piecewise uniform characteristics of anatomy structures, the total variation is introduced into the cost function to find a more faithful sparse representation of the object. The inverse problem of UDT is iteratively resolved by conjugate gradient with nonuniform fast Fourier transform. Simulation results show the effectiveness of the proposed method that the main characteristics of the object can be properly presented with only 16 views. Compared to interpolation and multiband method, the proposed method can provide higher resolution and lower artifacts with the same view number. The robustness to noise and the computation complexity are also discussed.

Real-time visualization of 3-D dynamic microscopic objects using optical diffraction tomography

3-D refractive index (RI) distribution is an intrinsic bio-marker for the chemical and structural information about biological cells. Here we develop an optical diffraction tomography technique for the real-time reconstruction of 3-D RI distribution, employing sparse angle illumination and a graphic processing unit (GPU) implementation. The execution time for the tomographic reconstruction is 0.21 s for 96(3) voxels, which is 17 times faster than that of a conventional approach. We demonstrated the real-time visualization capability with imaging the dynamics of Brownian motion of an anisotropic colloidal dimer and the dynamic shape change in a red blood cell upon shear flow.

Digital holographic microtomography for high-resolution refractive index mapping of live cells

Quantification of three-dimensional (3D) refractive index (RI) with sub-cellular resolution is achieved by digital holographic microtomography (DHμT) using quantitative phase images measured at multiple illumination angles. The DHμT system achieves sensitive and fast phase measurements based on iterative phase extraction algorithm and asynchronous phase shifting interferometry without any phase monitoring or active control mechanism. A reconstruction algorithm, optical diffraction tomography with projection on convex sets and total variation minimization, is implemented to substantially reduce the number of angular scattered fields needed for reconstruction without sacrificing the accuracy and quality of the reconstructed 3D RI distribution. Tomogram of a living CA9-22 cell is presented to demonstrate the performance of the method. Further, a statistical analysis of the average RI of the nucleoli, the nucleus excluding the nucleoli and the cytoplasm of twenty CA9-22 cells is performed.

A new regularization technique for limited-view sound-speed imaging

Reconstructing sound-speed maps from the limited view offered by a linear array of ultrasonic sensors has been a long-standing challenge in medical diagnostics and nondestructive evaluation. Because of the limited range of angles that can be used to interrogate the volume beneath the array, the inverse problem of retrieving sound-speed maps from scattering measurements is highly ill-posed. The missing angles cause significant artifacts that degrade the image by altering the values of sound speed and producing ghost features. This paper introduces the virtual image space component iterative technique (VISCIT), which addresses the limited-view problem by introducing a new regularization technique which iteratively compensates for the missing components by applying an adaptive threshold to the reconstruction. The effectiveness of the method in yielding high-accuracy sound-speed maps is demonstrated using a complex numerical phantom and validated experimentally with an agar phantom. It is shown that sound-speed contrast as low as 1.3% is readily detectable, thus paving the way for more sensitive and selective detection of damage precursors and early stage diseases.

Total variation based gradient descent algorithm for sparse-view photoacoustic image reconstruction

In photoacoustic imaging (PAI), reconstruction from sparse-view sampling data is a remaining challenge in the cases of fast or real-time imaging. In this paper, we present our study on a total variation based gradient descent (TV-GD) algorithm for sparse-view PAI reconstruction. This algorithm involves the total variation (TV) method in compressed sensing (CS) theory. The objective function of the algorithm is modified by adding the TV value of the reconstructed image. With this modification, the reconstructed image could be closer to the real optical energy distribution map. Additionally in the proposed algorithm, the photoacoustic data is processed and the image is updated individually at each detection point. In this way, the calculation with large matrix can be avoided and a more frequent image update can be obtained. Through the numerical simulations, the proposed algorithm is verified and compared with other reconstruction algorithms which have been widely used in PAI. The peak signal-to-noise ratio (PSNR) of the image reconstructed by this algorithm is higher than those by the other algorithms. Additionally, the convergence of the algorithm, the robustness to noise and the tunable parameter are further discussed. The TV-based algorithm is also implemented in the in vitro experiment. The better performance of the proposed method is revealed in the experiments results. From the results, it is seen that the TV-GD algorithm may be a practical and efficient algorithm for sparse-view PAI reconstruction.

Volume-of-change cone-beam CT for image-guided surgery

C-arm cone-beam CT (CBCT) can provide intraoperative 3D imaging capability for surgical guidance, but workflow and radiation dose are the significant barriers to broad utilization. One main reason is that each 3D image acquisition requires a complete scan with a full radiation dose to present a completely new 3D image every time. In this paper, we propose to utilize patient-specific CT or CBCT as prior knowledge to accurately reconstruct the aspects of the region that have changed by the surgical procedure from only a sparse set of x-rays. The proposed methods consist of a 3D-2D registration between the prior volume and a sparse set of intraoperative x-rays, creating digitally reconstructed radiographs (DRRs) from the registered prior volume, computing difference images by subtracting DRRs from the intraoperative x-rays, a penalized likelihood reconstruction of the volume of change (VOC) from the difference images, and finally a fusion of VOC reconstruction with the prior volume to visualize the entire surgical field. When the surgical changes are local and relatively small, the VOC reconstruction involves only a small volume size and a small number of projections, allowing less computation and lower radiation dose than is needed to reconstruct the entire surgical field. We applied this approach to sacroplasty phantom data obtained from a CBCT test bench and vertebroplasty data with a fresh cadaver acquired from a C-arm CBCT system with a flat-panel detector. The VOCs were reconstructed from a varying number of images (10-66 images) and compared to the CBCT ground truth using four different metrics (mean squared error, correlation coefficient, structural similarity index and perceptual difference model). The results show promising reconstruction quality with structural similarity to the ground truth close to 1 even when only 15-20 images were used, allowing dose reduction by the factor of 10-20.

Echo-based Single Point Imaging (ESPI): a novel pulsed EPR imaging modality for high spatial resolution and quantitative oximetry

A novel time-domain spectroscopic EPR imaging approach, that is a unique combination of already known techniques, is described. The first one is multi-gradient Single Point Imaging involving pure phase-encoding where the oximetry is based on T(2)(∗). Line width derived from T(2)(∗) is subject to susceptibility effects and therefore needs system-dependent line width calibrations. The second approach utilizes the conventional 90°-τ-180° Spin-Echo pulse sequence where the images are obtained by the filtered back-projection after FT of the echoes collected under frequency-encoding gradients. The spatially resolved oximetry information is derived from a set of T(2)-weighted images. The back-projection images suffer susceptibility artifacts with resolution determined by T(2)(∗), but the oximetry based on T(2) is quite reliable. The current approach combines Single Point Imaging and the Spin-Echo procedure to take advantage the enhanced spatial resolution associated with the former and the T(2) dependent contrast of the latter. Pairs of images are derived choosing two time points located at identical time intervals on either side of the 180° pulse. The refocusing pulse being exactly in the middle of the two points ensures that artifacts associated with susceptibility and field inhomogeneities are eliminated. In addition, the net phase accumulated by the two time points being identical results in identical field of views, thus avoiding the zoom-in effect as a function delay in regular SPI and the associated interpolation requirements employed in T(2)(∗)-weighted oximetry. The end result is superior image resolution and reliable oximetry. In spite of the fact that projection-reconstruction methods require less number of measurements compared to SPI, the enormous advantage in SNR of the SPI procedure makes the echo-based SPI equally efficient in terms of measurement time. The Fourier reconstruction, line width independent resolution and the true T(2)-weighting make this novel procedure very attractive for in vivo EPR imaging of tissue oxygen quantitatively.

Automation of clip localization in Digital Tomosynthesis for setup of breast cancer patients

The objective of this study is to develop an automatic clip localization procedure for breast cancer patient setup based on Digital Tomosynthesis (DTS) and to characterize its performance with respect to the overall registration accuracy and robustness. The study was performed under an IRB-approved protocol for 12 breast cancer patients with surgical clips implanted around the tumor cavity. The registration of DTS images to planning CTs was performed using an automatic algorithm developed to overcome specific challenges of localization and registration of clips in the breast setup images. The automatic method consisted of auto-segmentation (intensity-based thresholding with a priori knowledge about clip size and location to distinguish clips from bony features) and auto-registration of the segmented clip clusters. To determine the inherent accuracy and robustness of the registration algorithm, additional simulated DTS data was analyzed. The developed algorithm is efficient in removing false positives and negatives and provides an accuracy of better than 2.3mm for 60° and 3.3mm for 40° DTS. When incorporated in clinical software, this algorithm helps to facilitate fast and accurate setup evaluation with minimal dose delivered to patients.

Photoacoustic image reconstruction from few-detector and limited-angle data

Photoacoustic tomography (PAT) is an emerging non-invasive imaging technique with great potential for a wide range of biomedical imaging applications. However, the conventional PAT reconstruction algorithms often provide distorted images with strong artifacts in cases when the signals are collected from few measurements or over an aperture that does not enclose the object. In this work, we present a total-variation-minimization (TVM) enhanced iterative reconstruction algorithm that can provide excellent photoacoustic image reconstruction from few-detector and limited-angle data. The enhancement is confirmed and evaluated using several phantom experiments.

A novel off-axis scanning method for an enlarged ellipse cone-beam computed tomography field of view

PURPOSE

Current on-board imaging systems commonly used by modern linear accelerators (LINACs) have a limited field of view (FOV) for a cone-beam CT (CBCT) scan, which is typically less than 50 cm. Consequently, truncation artifacts often occur for large patients. The goal of this work is to investigate a novel method to increase the FOV for current on-board CBCT systems.

METHODS

When a large patient is scanned with CBCT, any region outside the FOV is only partially sampled within a short range of projection angles, and at other angles no x-ray beams may pass through that region. To increase the sampling rate for the region outside the FOV, we have designed a new source trajectory by shifting the center of rotation during a CBCT scan. This resulted in a reduced sampling rate at the central area and increased sampling rate at the edges. The tradeoff led to a more balanced sampling for an enlarged FOV. An iterative algorithm was also developed to reconstruct the CT image under the new sampling scheme using a compressed sensing technique.

RESULTS

The method was validated by numerical simulations mimicking a Varian Trilogy CBCT system, and it was found that artifact-free images could be obtained with the FOV as large as 80 cm.

CONCLUSIONS

The new CT scanning trajectory can be easily realized under current clinical setup with little modification of the control system, and this can be useful for treating obese patients.

Selective-diffusion regularization for enhancement of microcalcifications in digital breast tomosynthesis reconstruction

PURPOSE

Digital breast tomosynthesis (DBT) has been shown to improve mass detection. Detection of microcalcifications is more challenging because of the large breast volume to be searched for subtle signals. The simultaneous algebraic reconstruction technique (SART) was found to provide good image quality for DBT, but the image noise is amplified with an increasing number of iterations. In this study, the authors developed a selective-diffusion (SD) method for noise regularization with SART to improve the contrast-to-noise ratio (CNR) of microcalcifications in the DBT slices for human or machine detection.

METHODS

The SD method regularizes SART reconstruction during updating with each projection view. Potential microcalcifications are differentiated from the noisy background by estimating the local gradient information. Different degrees of regularization are applied to the signal or noise classes, such that the microcalcifications will be enhanced while the noise is suppressed. The new SD method was compared to several current methods, including the quadratic Laplacian (QL) method, the total variation (TV) method, and the nonconvex total p-variation (TpV) method for noise regularization with SART. A GE GEN2 prototype DBT system with a stationary digital detector was used for the acquisition of DBT scans at 21 angles in 3 degrees increments over a +/-30 degrees range. The reconstruction image quality without regularization and that with the different regularization methods were compared using the DBT scans of an American College of Radiology phantom and a human subject. The CNR and the full width at half maximum (FWHM) of the line profiles of microcalcifications within the in-focus DBT slices were used as image quality measures.

RESULTS

For the comparison of large microcalcifications in the DBT data of the subject, the SD method resulted in comparable CNR to the nonconvex TpV method. Both of them performed better than the other two methods. For subtle microcalcifications, the SD method was superior to other methods in terms of CNR. In both the subject and phantom DBT data, for large microcalcifications, the FWHM of the SD method was comparable to that without regularization, which was wider than that of the TV type methods. For subtle microcalcifications, the SD method had comparable FWHM values to the TV type methods. All three regularization methods were superior to the QL method in terms of FWHM.

CONCLUSIONS

The SART regularized by the selective-diffusion method enhanced the CNR and preserved the sharpness of microcalcifications. In comparison with three existing regularization methods, the selective-diffusion regularization was superior to the other methods for subtle microcalcifications.

Compressed sensing based cone-beam computed tomography reconstruction with a first-order method

PURPOSE

This article considers the problem of reconstructing cone-beam computed tomography (CBCT) images from a set of undersampled and potentially noisy projection measurements.

METHODS

The authors cast the reconstruction as a compressed sensing problem based on l1 norm minimization constrained by statistically weighted least-squares of CBCT projection data. For accurate modeling, the noise characteristics of the CBCT projection data are used to determine the relative importance of each projection measurement. To solve the compressed sensing problem, the authors employ a method minimizing total-variation norm, satisfying a prespecified level of measurement consistency using a first-order method developed by Nesterov.

RESULTS

The method converges fast to the optimal solution without excessive memory requirement, thanks to the method of iterative forward and back-projections. The performance of the proposed algorithm is demonstrated through a series of digital and experimental phantom studies. It is found a that high quality CBCT image can be reconstructed from undersampled and potentially noisy projection data by using the proposed method. Both sparse sampling and decreasing x-ray tube current (i.e., noisy projection data) lead to the reduction of radiation dose in CBCT imaging.

CONCLUSIONS

It is demonstrated that compressed sensing outperforms the traditional algorithm when dealing with sparse, and potentially noisy, CBCT projection views.