Deep Convolutional Neural Network for Inverse Problems in Imaging

11/11/2016 ∙ by Kyong Hwan Jin, et al. ∙ EPFL Dassault Aviation 0

In this paper, we propose a novel deep convolutional neural network (CNN)-based algorithm for solving ill-posed inverse problems. Regularized iterative algorithms have emerged as the standard approach to ill-posed inverse problems in the past few decades. These methods produce excellent results, but can be challenging to deploy in practice due to factors including the high computational cost of the forward and adjoint operators and the difficulty of hyper parameter selection. The starting point of our work is the observation that unrolled iterative methods have the form of a CNN (filtering followed by point-wise non-linearity) when the normal operator (H*H, the adjoint of H times H) of the forward model is a convolution. Based on this observation, we propose using direct inversion followed by a CNN to solve normal-convolutional inverse problems. The direct inversion encapsulates the physical model of the system, but leads to artifacts when the problem is ill-posed; the CNN combines multiresolution decomposition and residual learning in order to learn to remove these artifacts while preserving image structure. We demonstrate the performance of the proposed network in sparse-view reconstruction (down to 50 views) on parallel beam X-ray computed tomography in synthetic phantoms as well as in real experimental sinograms. The proposed network outperforms total variation-regularized iterative reconstruction for the more realistic phantoms and requires less than a second to reconstruct a 512 x 512 image on GPU.

READ FULL TEXT VIEW PDF
POST COMMENT

Comments

There are no comments yet.

Authors

page 11

page 12

page 13

page 14

page 15

Code Repositories

FBPConvNet

FBPConvNet for computed tomography


view repo
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.

I Introduction

Over the past decades, iterative reconstruction methods have become the dominant approach to solving inverse problems in imaging including denoising [1, 2, 3, 4], deconvolution [5, 6]

, and interpolation

[7, 8]. Thanks to robust regularizers such as total variation [1, 5, 2] and sparsity [9], practical algorithms have appeared with excellent image quality and reasonable computational complexity. These advances have been particularly influential in the field of biomedical imaging, e.g., in magnetic resonance imaging (MRI) [10, 11] and X-ray computed tomography (CT) [12, 13]. These devices face an unfavorable trade-off between noise and acquisition time. Short acquisitions lead to severe degradations of image quality, while long acquisitions may cause motion artifacts, patient discomfort, or even patient harm in the case of radiation-based modalities. Iterative reconstruction with regularization provides a way to mitigate these problems in software, i.e. without developing new scanners. With the appearance of compressed sensing [14], our theoretical understanding of these approaches evolved further, and, in some applications, remarkable outcomes appeared with stable reproducibility [15, 16].

A more recent trend is deep learning 

[17], which has arisen as a promising framework providing state-of-the-art performance for image classification [18, 19] and segmentation [20, 21, 22]. Moreover, regression-type neural networks demonstrated impressive results on inverse problems with exact models such as signal denoising[23, 24], deconvolution[25], and interpolation [26, 27]

. Central to this resurgence of neural networks has been the convolutional neural network (CNN) architecture. Whereas the classic multilayer perceptron consists of layers that can perform arbitrary matrix multiplications on their input, the layers of a CNN are restricted to perform convolutions, greatly reducing the number of parameters which must be learned.

Researchers have begun to investigate the link between conventional approaches and deep learning networks [28, 29, 30, 31]. Gregor and LeCun [28] explored the similarity between the ISTA algorithm [32] and a shared layerwise neural network and demonstrated that several layer-wise neural networks act as a fast approximated sparse coder. In [29], a nonlinear diffusion reaction process based on the Perona-Malik process was proposed using deep convolutional learning; convolutional filters from diffusion terms were trained instead of using well-chosen filters like kernels for diffusion gradients, while the reaction terms were matched to the gradients of a data fidelity term. In [30], the authors focused on the relationship between penalized-least-squares methods and deep neural networks. In the context of a clustered dictionary model, they found that the non-shared layer-wise independent weights and activations of a deep neural network provide more performance gain than the layer-wise fixed parameters of an unfolded iterative hard thresholding method. The quantitative analysis relied on the restricted isometry property (RIP) condition from compressed sensing [14]. Others have investigated learning optimal shrinkage operators for deep-layered neural networks [33, 34].

Despite these works, practical and theoretical questions remain regarding the link between iterative reconstruction and CNNs. For example, in which problems can CNNs outperform traditional iterative reconstructions, and why? Where does this performance come from, and can the same gains be realized by learning aspects of the iterative process (e.g. the shrinkage)? Although [29] began to address this connection, they only assumed that the filters learned in the Perona-Malik scheme are modified gradient kernels, with performance gains coming from the increased size of the filters.

In this paper, we explore the relationship between CNNs and iterative optimization methods for one specific class of inverse problems: those where the normal operator associated with the forward model (, where is the forward operator and is the adjoint operator) is a convolution. The class trivially includes denoising and deconvolution, but also includes MRI [35], X-ray CT [16, 13], and diffraction tomography (DT). Based on this connection, we propose a method for solving these inverse problems by combining a fast, approximate solver with a CNN. We demonstrate the approach on low-view CT reconstruction, using filtered back projection (FBP) and a CNN that makes use of residual learning [27] and multilevel learning [22]. We use high-view FBP reconstructions for training, meaning that training is possible from real data (without oracle knowledge). We compare to a state-of-the art regularized iterative reconstruction and show promising results on both synthetic and real CT data. Especially, reconstructed images from the proposed network represented well complex textures which are important to diagnosis.

Ii Inverse Problems with Shift-Invariant Normal Operators

We begin our discussion by describing the class of inverse problems for which the normal operator is a convolution. As we will show, solving problems of this form iteratively requires repeated convolutions and point-wise nonlinearities, which suggests that CNNs may offer an alternative solution. The class is broad, encompassing at least denoising, deconvolution, and reconstruction of MRI, CT, and diffraction tomography images. The underlying convolutional structure is known for MRI and CT and has been exploited in the past for the design of fast algorithms (e.g. [13]). Here, we aim to give a general and concise definition to motivate our method. We go on to discuss the standard direct and iterative approaches to solving these problems.

Ii-a Theory

For the continuous case, let be a linear operator and denote its adjoint, where . The range, , remains general to include operators such as the X-ray transform, where the measurements are defined on a circular/spherical domain. The following definitions give the building blocks of a normal shift-invariant operator.

Definition 1 (Multiplication).

A multiplication, , is a linear operator such that with for some continuous, bounded function, .

Definition 2 (Convolution).

A convolution, , is a linear operator such that , where

is the Fourier transform,

is the Fourier transform of , and is a multiplication.

Definition 3 (Reversible change of variables).

A reversible change of variables, , is a linear operator such that for some and such that its inverse, exists.

If is a convolution, then is as well (because ), but this is true for a wider set of operators. Theorem 1 describes this set.

Theorem 1 (Normal-convolutional operators).

If there exists an isometry, , a multiplication, , and a change of variables, , such that , then is a convolution with , where is the Jacobian matrix of and is a suitable multiplication.

Proof.

Given an operator, , that satisfies the conditions of Theorem 1,

(1)
(2)
(3)

where (a) follows from the definitions of isometry and multiplication and (b) follows from the definition of a reversible change of variables. Thus, is a convolution by Definition 2. ∎

A version of Theorem 1 also holds in the discrete case; we sketch the result here. Starting with a continuous-domain operator, , that satisfies the conditions of Theorem 1, we form a discrete-domain operator, , where and are sampling and interpolation, respectively. Then, assuming that is bandlimited, is a convolution.

For example, consider the continuous 2D X-ray transform, , which measures every line integral of a function of 2D space, indexed by the slope and intercept of the line. Using the Fourier central slice theorem [36],

(4)

where changes from Cartesian to polar coordinates (i.e. ) and is the inverse Fourier transform with respect to (which is an isometry due to Parseval’s theorem). This maps a function, , of space, , to its Fourier transform, , which is a function of frequency, . Then, it performs a change of variables, giving , which is a function of a polar frequency variables, . Finally, inverts the Fourier transform along , resulting in a sinogram that is a function of and a polar space variable, . Theorem 1 states that is a convolution with , where, again, is the frequency variable associated with the 2D Fourier transform, .

Ii-B Direct Inversion

Given a normal-convolutional operator, , the inverse (or reconstruction) problem is to recover an image from its measurements . The theory presented above suggests two methods of direct solutions to this problem. The first is to apply the inverse of the filter corresponding to to the back projected measurements,

where is a convolution operator with . This is exactly equivalent to performing a deconvolution in the reconstruction space. The second is to invert the action of in the measurement domain before back projecting,

where is a multiplication operator with . If is a Fourier transform, then this inverse is a filtering operation followed by a back projection; if is not, the operation remains filtering-like in the sense that it is diagonalizable in the transform domain associated with . Note also that if is not a Fourier transform, then the variable no longer refers to frequency. Given the their filter-like form, we refer to these direct inverses as filtered back projection (FBP) [36], a term borrowed from X-ray CT reconstruction.

Returning to the example of the continuous 2D X-ray transform, the first method would be to back project the measurements and then apply the filter with a 2D Fourier transform given by . The second approach would be to apply the filter with 1D Fourier transform given by to each angular measurement and then back project the result. In the continuous case, the methods are equivalent, but, in practice, the measurements are discrete and applying these involves some approximation. Then, which form is used affects the accuracy of the reconstruction (along with the runtime). This type of error can be mitigated by formulating the FBP to explicitly include the effects of sampling and interpolation (e.g., as in [37]). The larger problem is that the filter greatly amplifies noise, thus in practice some amount of smoothing is also applied.

Ii-C Iterative Inversion

In practice, inverse problems related with imaging are often ill-posed, which prohibits the use of direct inversion because measurement noise causes serve perturbations in the solution. Adding regularization (e.g., total variation [2] or sparsity as in LASSO [9]) overcomes this problem. We now adopt the discrete, finite-support notation where the forward model is a matrix,

and the measurements are a vector,

. The typical synthesis form of the inverse problem is then

(5)

where is the vector of transform coefficients of the reconstruction such that is the desired reconstruction and where is a transform so that is sparse. For example, if is a multichannel wavelet transform [38, 39], then the formulation promotes the wavelet-domain sparsity of the solution. And, for many such transforms, will be shift-invariant (a set of convolutions).

This formulation does not admit a closed form solution, and, therefore, is typically solved iteratively. For example, the popular ISTA [32, 28] algorithm solves Eq. (5) with the iterate

(6)

where is the soft-thresholding operator by value and is the Lipschitz constant of a normal operator. When the forward model is normal-convolutional and when is a convolution, the algorithm consists of iteratively filtering by , adding a bias, , and applying a point-wise nonlinearity, . This is illustrated as a block diagram with unfolded iterates in Fig. 1 (b). Many other iterate methods for solving Eq. (5), including ADMM [40], FISTA[41], and SALSA[42], also rely on these basic building blocks.

Fig. 1: Block diagrams about (a) unfolded version of iterative shrinkage method [28], (b) unfolded version of iterative shrinkage method with sparsifying transform () and (c) convolutional network with the residual framework. is the Lipschitz constant,

is the initial estimates,

is learned bias, is learned convolutional kernel. The broken line boxes in (c) indicate the variables to be learned.

Iii Proposed Method: FBPConvNet

The success of iterative methods consisting of filtering plus pointwise nonlinearities on normal-convolutional inverse problems suggests that CNNs may be a good fit for these problems as well. Based on this insight, we propose a new approach to these problems, which we call the FBPConvNet. The basic structure of the FBPConvNet algorithm is to apply the discretized FBP from Section II-B to the measurements and then use this as the input of a CNN which is trained to regress the FBP result to a suitable ground truth image. This approach applies in principle to all normal-convolutional inverse problems, but we have focused in this work on CT reconstruction. We now describe the method in detail.

Iii-a Filtered Back Projection

While it would be possible to train a CNN to regress directly from the measurement domain to the reconstruction domain, performing the FBP first greatly simplifies the learning. The FBP encapsulates our knowledge about the physics of the inverse problem and also provides a warm start to the CNN. For example, in the case of CT reconstruction, if the sinogram is used as input, the CNN must encode a change between polar and Cartesian coordinates, which is completely avoided when the FBP is used as input. We stress again that, while the FBP is specific to CT, Section II-C shows that efficient, direct inversions are always available for normal-convolutional inverse problems.

Iii-B Deep Convolutional Neural Network Design

Fig. 2: Structure of the proposed deep convolutional network for deconvolution.

While we were inspired by the general form of the proximal update, (6), to apply a CNN to inverse problems of this form, our goal here is not to imitate iterative methods (e.g. by building a network that corresponds to an unrolled version of some iterative method), but rather to explore a state-of-the-art CNN architecture. To this end, we base our CNN on the U-net [22], which was originally designed for segmentation. There are several properties of this architecture that recommend it for our purposes.

Multilevel decomposition.

The U-net employs a dyadic scale decomposition based on max pooling, so that the effective filter size in the middle layers is larger than that of the early and late layers. This is critical for our application because the filters corresponding to

(and its inverse) may have non-compact support, e.g. in CT. Thus, a CNN with a small, fixed filter size may not be able to effectively invert . This decomposition also has a nice analog to the use of multiresolution wavelets in iterative approaches.

Multichannel filtering. U-net employs multichannel filters, such that there are multiple feature maps at each layer. This is the standard approach in CNNs [18] to increase the expressive power of the network [43]. The multiple channels also have an analog in iterative methods: In the ISTA formulation (6), we can think of the wavelet coefficient vector as being partitioned into different channels, with each channel corresponding to one wavelet subband [38, 39]. Or, in ADMM[40], the split variables can be viewed as channels. The CNN architecture greatly generalizes this by allowing filters to make arbitrary combinations of filters.

Residual learning. As a refinement of the original U-net, we add a skip connection [27]

between input and output, which means that the network actually learns the difference between input and output. This approach mitigates the vanishing gradient problem

[44] during training. This yields a noticeable increase in performance compared to the same network without the skip connection.

Implementation details.

We made two additional modification to U-net. First, we use zero-padding so that the image size does not decrease after each convolution. Second, we replaced the last layer with a convolutional layer which reduces the 64 channels to a single output image. This is necessary because the original U-net architecture results in two channgels: foreground and background.

Iv Experiments and results

We now describe our experimental setup and results. Though the FBPConvNet algorithm is general, we focus here on sparse-view X-ray CT reconstruction. We compare FBPConvNet to FBP alone and a state-of-the-art iterative reconstruction method [13]. This method (which we will refer to as the TV method for brevity) solves a version of Eq. (5) with the popular TV regularization via ADMM. It exploits the convolutional structure of by using FFT-based filtering in its iterates.

Our experiments proceed as follows: We begin with a full view sinogram (either synthetically generated or from real data). We compute its FBP (standard high quality reconstruction) and take this as the ground truth. We then compare the results of applying the TV method to the subsampled sinogram with the results of applying the FBPConvNet to the same. This type of sparse-view reconstruction is of particular interest for human imaging because, e.g., a twenty times reduction in the number of views corresponds to a twenty times reduction in the radiation dose received by the patient.

Iv-a Data Preparation

We used three datasets for evaluations of the proposed method. The first two are synthetic in that the sinograms are computed using a digital forward model, while the last comes from real experiments.

  1. The ellipsoid dataset is a synthetic dataset that comprises 500 images of ellipses of random intensity, size, and location. Sinograms for this data are 729 pixels by 1,000 views and are created using the analytical expression for the X-ray transform of an ellipse. The Matlab function iradon is used for FBPs.

  2. The biomedical dataset is a synthetic dataset that comprises 500 real in-vivo CT images from the Low-dose Grand challenge competition from database made by the Mayo clinic. Sinograms for this data are 729 pixels by 1,000 views and are created using the Matlab function radon. iradon is again used for FBPs.

  3. The experimental dataset is a real CT dataset that comprises 377 sinograms collected from an experiment at the TOMCAT beam line of the Swiss Light Source at the Paul Scherrer Institute in Villigen, Switzerland. Each sinogram is 1493 pixels by 721 views and comes from one z-slice of a single rat brain. FBPs were computed using our own custom routine which closely matches the behavior of iradon while accommodating different sampling steps in the sinogram an reconstruction domains.

To make sparse-view FBP images in synthetic datasets, we uniformly subsampled the sinogram by factors of 7 and 20 corresponding to 143 and 50 views, respectively. For the real data, we subsampled by factors of 5 and 14 corresponding to 145 and 52 views.

Iv-B Training Procedure

FBPConvNet. In case of synthetic data, the total number of training images is 475. The number of test images is 25. In the case of the biomedical dataset, the test data is chosen from a different subject than the training set. For the real data, the total number of training images is 327. The number of test images is 25. The test data are obtained from the last z-slices with the gap of 25 slices left between testing and training data. All images are scaled between 0 and 550.

The CNN part of the FBPConvNet is trained using pairs of low-view FBP images and full-view FBP images as input and output, respectively. Note that this training strategy means that the method is applicable to real CT reconstructions where we do not have access to an oracle reconstruction.

We use the MatConvNet toolbox (ver. 20) [45] to implement the FBPConvNet training and evaluation, with a slight modification: We clip the computed gradients to a fixed range to prevent the divergence of the cost function [27, 46]. We use a Titan Black GPU graphic processor (NVIDIA Corporation) for training and evaluation. Total training time is about 15 hours for 101 iterations.

The hyper parameters for training are as follows: learning rate decreasing logarithmically from 0.01 to 0.001; batchsize equals 1; momentum equals 0.99; and the clipping value for gradient equals . We use flip-flop data augmentation in both horizontal and vertical directions during the training phase to reduce overfitting [18].

State-of-the-art TV reconstruction. For completeness, we comment on how the iterative method used the training and testing data. Though it may be a fairer comparison to require the TV method to select its parameters from the training data (as the FBPConvNet does), we instead simply select the parameters that optimize performance on the training set (via a golden-section search). We do this with the understanding that the parameter is usually tuned by hand in practice and because the correct way to learn these parameters from data remains an open question.

V Experimental Results

We use SNR as a quantitative metric. If is the oracle and is the reconstructed image, SNR is given by

(7)

where a higher SNR value corresponds to a better reconstruction.

V-a Ellipsoidal Dataset

Fig. 3: Reconstructed images of ellipsoidal dataset from 143 views using FBP, TV regularized convex optimization [13], and the FBPConvNet. The first row shows the ROI with full region of image, and the second row shows magnified ROI for the appearance of differences. All subsequent figures keep the same manner.
Fig. 4: Reconstructed images of ellipsoidal dataset from 50 views using FBP, TV regularized convex optimization [13], and the FBPConvNet.

Figures 3 and 4 and Table I show the results for the ellisoidal dataset. In the seven times downsampling case, Figure 3, the full-view FBP (ground truth) shows nearly artifact-free ellipsoids, while the sparse-view FBP shows significant line artifacts (most visible in the background). Both the TV and FBPConvNet methods significantly reduce these artifacts, giving visually indistinguishable results. When the downsampling is increased to twenty times, Figure 4, the line artifacts in the sparse-view FBP reconstruction are even more pronounced. Both the TV and FBPConvNet reduce these artifacts, though the FBPConvNet retains some of the artifacts. The average SNR on the testing set for the TV method is higher than that of the the FBPConvNet. This is a reasonable results given that the phantom is piecewise constant and thus the TV regularization should be optimal [2, 47].

Metrics        Methods FBP TV [13] Proposed
avg. SNR (dB) 143 views (x7) 16.09 29.48 28.96
50 views (x20) 8.44 27.69 23.84
TABLE I: Comparison of SNR between different reconstruction algorithms for numerical ellipsoidal dataset.

V-B Biomedical Dataset

Figures 5 and 6 and Table II show the results for the biomedical dataset. In Figure 5, again, the sparse-view FBP contains line artifacts. Both TV and the proposed method remove streaking artifacts satisfactorily; however, the TV reconstruction shows the cartoon-like artifacts that are typical of TV reconstructions. This trend is also observed in severe case (x20) in Fig. 6. Quantitatively, the proposed method outperforms the TV method.

Fig. 5: Reconstructed images of biomedical dataset from 143 views using FBP, TV regularized convex optimization [13], and the FBPConvNet.
Fig. 6: Reconstructed images of biomedical dataset from 50 views using FBP, TV regularized convex optimization [13], and the FBPConvNet.
Metrics        Methods FBP TV [13] Proposed
avg. SNR (dB) 143 views (x7) 24.97 31.92 36.15
50 views (x20) 13.52 25.2 28.83
TABLE II: Comparison of SNR between different reconstruction algorithms for biomedical dataset.

V-C Experimental Dataset

Fig. 7: Reconstructed images of experimental dataset from 145 views using FBP, TV regularized convex optimization [13], and the FBPConvNet.
Fig. 8: Reconstructed images of experimental dataset from 52 views using FBP, TV regularized convex optimization [13], and the FBPConvNet.
Metrics        Methods FBP TV [13] Proposed
avg. SNR (dB) 145 views (x5) 5.38 8.25 11.34
51 views (x14) 3.29 7.25 8.85
TABLE III: Comparison of SNR between different reconstruction algorithms for experimental dataset.

Figures 7 and 8 and Table III show the results for the experimental dataset. The SNRs of all methods are significantly lower here because of the relatively low contrast of the sinogram. In Fig. 7, we observe the same trend as for the biomedical dataset, where the TV method oversmooths and the FBPConvNet better preserves fine structures. These trends also appears in twenty times downsampling case (x20) in Fig. 8. The FBPConvNet had a higher SNR than the TV method in both settings.

Vi Discussion

The experiments provide strong evidence for the feasibility of the FBPConvNet for sparse-view CT reconstruction. The conventional iterative algorithm with TV regularization outperformed the FBPConvNet in the ellipsoidal dataset, while the reverse was true for the biomedical and experimental datasets. In these more-realistic datasets, the SNR improvement of the FBPConvNet came from its ability to preserve fine details in the images. This points to one advantage of the proposed method over iterative methods: the iterative methods must explicitly impose regularization, while the FBPConvNet effectively learns a regularizer from the data.

The computation time for the FBPConvNet was about 200 ms for the FBP and 200300 ms in GPU for the CNN for a image. This is much faster than the iterative reconstruction, which, in our case, requires around 7 minutes even after the regularization parameters have been selected.

A major limitation of the proposed method is lack of transfer between datasets. For instance, when we put FBP images from a twenty-times subsampled sinogram into the network trained on the seven-times subsampled sinogram, the results retain many artifacts. Handling datasets of different dimensions or subsampling factors requires retraining the network. Future work could address strategies for heterogeneous datasets.

Our theory suggests that the methodology proposed here is applicable to all problems where the normal operator is shift-invariant; however, we have focused here on X-ray CT reconstruction. We expect that adapting the method to, e.g., MRI reconstruction will be non-trivial experimentally, because it will require large sets of training data (either from a high-quality forward model or real data) and a high-quality iterative reconstruction algorithm for comparison. Furthermore, because MRI and DT involve complex values (both in the measurement and reconstruction domains), we need a CNN architecture that correctly handles complex values. Therefore, we leave experimentation on other modalities to future work.

Vii Conclusion

In this paper, we proposed a deep convolutional network for inverse problems with a focus on biomedical imaging. The proposed method, which we call the FBPConvNet combines FBP with a multiresolution CNN. The structure of the CNN is based on U-net, with the addition of residual learning.

This approach was motivated by the convolutional structure of several biomedical inverse problems, including CT, MRI, and DT. Specifically, we showed conditions on a linear operator that ensure that its normal operator is a convolution. This results suggests that CNNs are well-suited to this subclass of inverse problems.

The proposed method demonstrated compelling results on synthetic and real data. It compared favorably to state-of-the-art iterative reconstruction on the two more realistic datasets. Furthermore, after training, the computation time of the proposed network per one image is under a second.

Acknowledgment

The authors would like to thank Dr. Cynthia McCollough, the Mayo Clinic, the American Association of Physicists in Medicine, and grants EB017095 and EB017185 from the National Institute of Biomedical Imaging and Bioengineering for giving opportunities to use real-invivo CT DICOM images (Fig. 5-6). The authors also thank thank Dr. Marco Stampanoni, Swiss Light Source, Paul Scherrer Institute, Villigen, Switzerland, for providing real CT sinograms (Fig. 7-8).

References

  • [1] L. I. Rudin, S. Osher, and E. Fatemi, “Nonlinear total variation based noise removal algorithms,” Physica D: Nonlinear Phenomena, vol. 60, no. 1, pp. 259–268, 1992.
  • [2] A. Chambolle, “An algorithm for total variation minimization and applications,” J. Math. imaging and vision, vol. 20, no. 1-2, pp. 89–97, 2004.
  • [3] S. G. Chang, B. Yu, and M. Vetterli, “Adaptive wavelet thresholding for image denoising and compression,” IEEE transactions on image processing, vol. 9, no. 9, pp. 1532–1546, 2000.
  • [4] F. Luisier, T. Blu, and M. Unser, “A new SURE approach to image denoising: Interscale orthonormal wavelet thresholding,” IEEE Transactions on image processing, vol. 16, no. 3, pp. 593–606, 2007.
  • [5] T. F. Chan and C.-K. Wong, “Total variation blind deconvolution,” IEEE transactions on Image Processing, vol. 7, no. 3, pp. 370–375, 1998.
  • [6] D. Krishnan and R. Fergus, “Fast image deconvolution using hyper-Laplacian priors,” in Advances in Neural Information Processing Systems, 2009, pp. 1033–1041.
  • [7] P. Thévenaz, T. Blu, and M. Unser, “Interpolation revisited [medical images application],” IEEE Transactions on medical imaging, vol. 19, no. 7, pp. 739–758, 2000.
  • [8]

    M. Bertalmio, G. Sapiro, V. Caselles, and C. Ballester, “Image inpainting,” in

    Proceedings of the 27th annual conference on Computer graphics and interactive techniques.   ACM Press/Addison-Wesley Publishing Co., 2000, pp. 417–424.
  • [9] R. Tibshirani, “Regression shrinkage and selection via the lasso,” Journal of the Royal Statistical Society. Series B (Methodological), pp. 267–288, 1996.
  • [10] H. Jung, K. Sung, K. S. Nayak, E. Y. Kim, and J. C. Ye, “k-t FOCUSS: A general compressed sensing framework for high resolution dynamic MRI,” Magnetic Resonance in Medicine, vol. 61, no. 1, pp. 103–116, Jan. 2009.
  • [11] S. G. Lingala, Y. Hu, E. DiBella, and M. Jacob, “Accelerated Dynamic MRI Exploiting Sparsity and Low-Rank Structure: k-t SLR,” IEEE Transactions on Medical Imaging, vol. 30, no. 5, pp. 1042–1054, May 2011.
  • [12] M. McGaffin and J. Fessler, “Alternating dual updates algorithm for X-ray CT reconstruction on the GPU,” IEEE Transactions on Computational Imaging, vol. 1, no. 3, pp. 186–199, Sep. 2015.
  • [13] M. T. McCann, M. Nilchian, M. Stampanoni, and M. Unser, “Fast 3D reconstruction method for differential phase contrast X-ray CT,” Opt. Express, vol. 24, no. 13, pp. 14 564–14 581, Jun 2016.
  • [14] E. J. Candès, J. Romberg, and T. Tao, “Robust uncertainty principles: Exact signal reconstruction from highly incomplete frequency information,” IEEE Trans. Inf. Theory, vol. 52, no. 2, pp. 489–509, 2006.
  • [15] M. Lustig, D. Donoho, and J. M. Pauly, “Sparse MRI: The application of compressed sensing for rapid MR imaging,” Magn. Reson. Med., vol. 58, no. 6, pp. 1182–1195, 2007.
  • [16] E. Y. Sidky and X. Pan, “Image reconstruction in circular cone-beam computed tomography by constrained, total-variation minimization,” Physics in medicine and biology, vol. 53, no. 17, p. 4777, 2008.
  • [17] Y. LeCun, Y. Bengio, and G. Hinton, “Deep learning,” Nature, vol. 521, no. 7553, pp. 436–444, 2015.
  • [18]

    A. Krizhevsky, I. Sutskever, and G. E. Hinton, “Imagenet classification with deep convolutional neural networks,” in

    Advances in neural information processing systems, 2012, pp. 1097–1105.
  • [19] O. Russakovsky, J. Deng, H. Su, J. Krause, S. Satheesh, S. Ma, Z. Huang, A. Karpathy, A. Khosla, M. Bernstein et al., “Imagenet large scale visual recognition challenge,”

    International Journal of Computer Vision

    , vol. 115, no. 3, pp. 211–252, 2015.
  • [20] R. Girshick, J. Donahue, T. Darrell, and J. Malik, “Rich feature hierarchies for accurate object detection and semantic segmentation,” in

    Proceedings of the IEEE conference on computer vision and pattern recognition

    , 2014, pp. 580–587.
  • [21] J. Long, E. Shelhamer, and T. Darrell, “Fully convolutional networks for semantic segmentation,” in Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, 2015, pp. 3431–3440.
  • [22] O. Ronneberger, P. Fischer, and T. Brox, “U-net: Convolutional networks for biomedical image segmentation,” in International Conference on Medical Image Computing and Computer-Assisted Intervention.   Springer, 2015, pp. 234–241.
  • [23] H. C. Burger, C. J. Schuler, and S. Harmeling, “Image denoising: Can plain neural networks compete with BM3D?” in Computer Vision and Pattern Recognition (CVPR), 2012 IEEE Conference on.   IEEE, 2012, pp. 2392–2399.
  • [24] J. Xie, L. Xu, and E. Chen, “Image denoising and inpainting with deep neural networks,” in Advances in Neural Information Processing Systems, 2012, pp. 341–349.
  • [25] L. Xu, J. S. Ren, C. Liu, and J. Jia, “Deep convolutional neural network for image deconvolution,” in Advances in Neural Information Processing Systems, 2014, pp. 1790–1798.
  • [26]

    C. Dong, C. C. Loy, K. He, and X. Tang, “Image super-resolution using deep convolutional networks,”

    IEEE transactions on pattern analysis and machine intelligence, vol. 38, no. 2, pp. 295–307, 2016.
  • [27] J. Kim, J. K. Lee, and K. M. Lee, “Accurate image super-resolution using very deep convolutional networks,” in Proc. of IEEE Converence on Computer Vision and Pattern Recognition (CVPR), 2016.
  • [28] K. Gregor and Y. LeCun, “Learning fast approximations of sparse coding,” in

    Proceedings of the 27th International Conference on Machine Learning (ICML-10)

    , 2010, pp. 399–406.
  • [29] Y. Chen, W. Yu, and T. Pock, “On learning optimized reaction diffusion processes for effective image restoration,” in Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, 2015, pp. 5261–5269.
  • [30] B. Xin, Y. Wang, W. Gao, and D. Wipf, “Maximal sparsity with deep networks?” arXiv preprint arXiv:1605.01636, 2016.
  • [31] H. W. Lin and M. Tegmark, “Why does deep and cheap learning work so well?” arXiv preprint arXiv:1608.08225, 2016.
  • [32] I. Daubechies, M. Defrise, and C. De Mol, “An iterative thresholding algorithm for linear inverse problems with a sparsity constraint,” Communications on pure and applied mathematics, vol. 57, no. 11, pp. 1413–1457, 2004.
  • [33] U. S. Kamilov and H. Mansour, “Learning optimal nonlinearities for iterative thresholding algorithms,” IEEE Signal Processing Letters, vol. 23, no. 5, pp. 747–751, 2016.
  • [34] U. Schmidt and S. Roth, “Shrinkage fields for effective image restoration,” in Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, 2014, pp. 2774–2781.
  • [35] K. P. Pruessmann, M. Weiger, M. B. Scheidegger, P. Boesiger et al., “SENSE: sensitivity encoding for fast MRI,” Magn. Reson. Med., vol. 42, no. 5, pp. 952–962, 1999.
  • [36] A. Kak and M. Slaney, Principles of Computerized Tomographic Imaging.   Society for Industrial and Applied Mathematics, Jan. 2001.
  • [37] S. Horbelt, M. Liebling, and M. Unser, “Discretization of the radon transform and of its inverse by spline convolutions,” IEEE Transactions on Medical Imaging, vol. 21, no. 4, pp. 363–376, Apr. 2002.
  • [38] A. L. Da Cunha, J. Zhou, and M. N. Do, “The nonsubsampled contourlet transform: theory, design, and applications,” IEEE Trans. Image Process., vol. 15, no. 10, pp. 3089–3101, 2006.
  • [39] S. Mallat, A wavelet tour of signal processing.   Academic press, 1999.
  • [40] S. Boyd, N. Parikh, E. Chu, B. Peleato, and J. Eckstein, “Distributed optimization and statistical learning via the alternating direction method of multipliers,” Found. Trends in Mach. Learn., vol. 3, no. 1, pp. 1–122, 2011.
  • [41] A. Beck and M. Teboulle, “A fast iterative shrinkage-thresholding algorithm for linear inverse problems,” SIAM journal on imaging sciences, vol. 2, no. 1, pp. 183–202, 2009.
  • [42] M. V. Afonso, J. M. Bioucas-Dias, and M. A. Figueiredo, “Fast image recovery using variable splitting and constrained optimization,” IEEE Transactions on Image Processing, vol. 19, no. 9, pp. 2345–2356, 2010.
  • [43] M. D. Zeiler and R. Fergus, “Visualizing and understanding convolutional networks,” in European Conference on Computer Vision.   Springer, 2014, pp. 818–833.
  • [44] K. He, X. Zhang, S. Ren, and J. Sun, “Deep residual learning for image recognition,” arXiv preprint arXiv:1512.03385, 2015.
  • [45] A. Vedaldi and K. Lenc, “MatConvNet – Convolutional Neural Networks for MATLAB,” in Proceeding of the ACM Int. Conf. on Multimedia, 2015.
  • [46]

    R. Pascanu, T. Mikolov, and Y. Bengio, “On the difficulty of training recurrent neural networks.”

    ICML (3), vol. 28, pp. 1310–1318, 2013.
  • [47] M. Unser, J. Fageot, and H. Gupta, “Representer theorems for sparsity-promoting regularization,” IEEE Transactions on Information Theory, vol. 62, no. 9, pp. 5167–5180, September 2016.