Jong Chul Ye

A model-based dynamic MRI called k-t BLAST/SENSE has drawn significant attention from the MR imaging community because of its improved spatio-temporal resolution. Recently, we showed that the k-t BLAST/SENSE corresponds to the special case of a new dynamic MRI algorithm called k-t FOCUSS that is optimal from a compressed sensing perspective. The main contribution of this article is an extension of k-t FOCUSS to a more general framework with prediction and residual encoding, where the prediction

Recently, deep learning approaches with various network architectures have achieved significant performance improvement over existing iterative reconstruction methods in various imaging problems. However, it is still unclear why these deep learning architectures work for specific inverse problems. Moreover, in contrast to the usual evolution of signal processing theory around the classical theories, the link between deep learning and the classical signal processing approaches, such as wavelets,

The proposed network can learn the image distributions from the routine-dose cardiac phases, which is a big advantage over the existing supervised learning networks that need exactly matched low- and routine-dose CT images. Considering the effectiveness and practicability of the proposed method, we believe that the proposed can be applied for many other CT acquisition protocols.

Magnetic resonance imaging (MRI) is an inherently slow imaging modality, since it acquires multi-dimensional k-space data through 1-D free induction decay or echo signals. This often limits the use of MRI, especially for high resolution or dynamic imaging. Accordingly, many investigators has developed various acceleration techniques to allow fast MR imaging. For the last two decades, one of the most important breakthroughs in this direction is the introduction of compressed sensing (CS) that all

Frequency-domain diffusion imaging uses the magnitude and phase of modulated light propagating through a highly scattering medium to reconstruct an image of the spatially dependent scattering or absorption coefficients in the medium. An inversion algorithm is formulated in a Bayesian framework and an efficient optimization technique is presented for calculating the maximum a posteriori image. In this framework the data are modeled as a complex Gaussian random vector with shot-noise statistics, a

The focal underdetermined system solver (FOCUSS) was originally designed to obtain sparse solutions by successively solving quadratic optimization problems. This article adapts FOCUSS for a projection reconstruction MR imaging problem to obtain high resolution reconstructions from angular under-sampled radial k-space data. We show that FOCUSS is effective for projection reconstruction MRI, since medical images are usually sparse in some sense and the center region of the undersampled radial k-sp

Given that many diagnostic errors are caused by the systematic distortion of images, ALOHA may have a great potential for clinical applications. Magn Reson Med 76:1848-1864, 2016. © 2016 International Society for Magnetic Resonance in Medicine.

A compressed sensing dynamic MR technique called k-t FOCUSS (k-t FOCal Underdetermined System Solver) has been recently proposed. It outperforms the conventional k-t BLAST/SENSE (Broad-use Linear Acquisition Speed-up Technique/SENSitivity Encoding) technique by exploiting the sparsity of x-f signals. This paper applies this idea to radial trajectories for high-resolution cardiac cine imaging. Radial trajectories are more suitable for high-resolution dynamic MRI than Cartesian trajectories since

Optical diffusion tomography is a technique for imaging a highly scattering medium using measurements of transmitted modulated light. Reconstruction of the spatial distribution of the optical properties of the medium from such data is a difficult nonlinear inverse problem. Bayesian approaches are effective, but are computationally expensive, especially for three-dimensional (3-D) imaging. This paper presents a general nonlinear multigrid optimization technique suitable for reducing the computati