• No results found

Sensitivity of a partially learned model-based reconstruction algorithm

N/A
N/A
Protected

Academic year: 2021

Share "Sensitivity of a partially learned model-based reconstruction algorithm"

Copied!
2
0
0

Bezig met laden.... (Bekijk nu de volledige tekst)

Hele tekst

(1)

Received: 15 June 2018 Accepted: 25 August 2018 DOI: 10.1002/pamm.201800222

Sensitivity of a partially learned model-based reconstruction algorithm

Yoeri E. Boink1,2,∗, Stephan A. van Gils1, Srirang Manohar2, and Christoph Brune1

1 Department of Applied Mathematics, Technical Medical Centre, University of Twente, the Netherlands 2 Biomedical Photonic Imaging, Technical Medical Centre, University of Twente, the Netherlands

We replace part of a model-based iterative algorithm with a convolutional neural network in order to improve the quality of tomography reconstructions. We analyse its robustness against uncertainties in the image and uncertainties in system settings. Results are presented for the application of photoacoustic tomography in a limited angle setup.

c

2018 The Authors. PAMM published by Wiley-VCH Verlag GmbH & Co. KGaA Weinheim.

1 Introduction

Developing reconstruction algorithms for tomography is an ongoing challenge: limited measurements and noise make the inverse problem f = Au + ε ill-posed. On top of that, uncertainties are ubiquitous: they appear in the images to be recon-structed, the data that is measured and in the representation of the system that is used, because often only an approximation ˜A of A is available. Under these circumstances, direct reconstruction methods often fail to give acceptable results. Regularised model-based methods are better able to cope with uncertainty [2], but manually selecting the regulariser and high computa-tion costs still lead to suboptimal methods. For this reason, we choose to replace part of the model-based algorithm with a convolutional neural network (CNN) to improve the quality of the reconstruction. Some works that explore this idea are those on learned proximal methods [5] and variational networks [3]. An overview of other works combining deep learning with inverse problems is given in [4]. In this work, we make the connection between the widely used primal-dual hybrid gradient algorithm (PDHG) by Chambolle and Pock and a learned primal-dual algorithm [1]. The method is tested for robustness against uncertainties in the image and uncertainties in system settings. We compare with filtered backprojection (FBP) and total variation (TV) for the application of photoacoustic tomography (PAT) in a limited angle setup [2].

2 Learned primal-dual algorithm

We compare Algorithm 1 (PDHG) with Algorithm 2, a learned primal-dual (L-PD) algorithm. In PDHG, the problem

minuF (Au) + G(u) is solved by alternatingly performing a dual and a primal update, which are interconnected via the

forward-operator A and its adjoint. In the L-PD approach, we do not choose the functionals F and G explicitly, but learn the best update formula for each iteration. This is achieved by a CNN, here represented by the nonlinear functions ΓΘnand ΛΘn,

in which Θndescribes the learned weights for iteration n. Note that weights of the network can be different for every iteration

n ∈ {1, . . . , N}. Instead of updating one channel of the primal and dual, we allow the network to use k channels, which

could for instance encode some kind of ‘history’, similarly to the acceleration of PDHG. Besides obtaining higher quality reconstructions, a huge advantage is that we can enforce L-PD to only use a small amount of iterations, wheras in PDHG, we have to wait till convergence. The output of the L-PD reconstruction is the first channel of the last primal iterate: uN +1

1 . for n ← 1 to N do qn+1=prox σF∗ f  qn+ σA(1 + θ)un − θun−1 , un+1=proxτ G  un− τA∗qn+1. end for for n ← 1 to N do q{1,...,k}n+1 = qn {1,...,k}+ ΓΘn  qn {1,...,k}, Aun1, f  , un+1{1,...,k}= un{1,...,k}+ΛΘn  un{1,...,k}, A∗q1n+1  . end for

Algorithm 1: Non-learned (PDHG). Algorithm 2: Learned (L-PD).

3 Simulation setup: training for robustness

A total of 768 training images and 192 test images have been obtained by preprocessing patches from the openly available DRIVE-dataset. The size of all images are 192 × 192 pixels. We simulate data (sinograms) for a setting with 32 photoacoustic detectors. This is done in the same manner as in [2], to which we refer for more detailed information. To analyse the sensitivity of L-PD, we apply the trained algorithm on a test set in which one of the image properties has been changed. Then we retrain the network on a training set in which the same image property has been changed and investigate how this affects the reconstruction quality. Below we define 8 classes of images, in which one or multiple image properties have been changed.

Corresponding author: e-mail y.e.boink@utwente.nl

This is an open access article under the terms of the Creative Commons Attribution-Non-Commercial-NoDerivs Licence 4.0, which permits use and distribu-tion in any medium, provided the original work is properly cited, the use is non-commercial and no modificadistribu-tions or adaptadistribu-tions are made.

PAMM · Proc. Appl. Math. Mech. 2018;18:e201800222. www.gamm-proceedings.com 2018 The Authors. PAMM published by Wiley-VCH Verlag GmbH & Co. KGaA Weinheim.c 1 of 2 https://doi.org/10.1002/pamm.201800222

(2)

2 of 2 Section 21: Mathematical signal and image processing

class (ci) sensitivity to explanation

0 nothing for an example image see bottom left image in Fig. 1

1 diameter increase in diameter randomly chosen from the set {−2, −1, 0, 1, 2} 2 contrast contrast randomly chosen from the set {0.5, 0.7, 1, 1.4, 2}

3 background with p =1

2 uniform increase, with p = 1

2speckled background

4 coverage with p =1

3 removal of smallest vessels, with p = 1

3nothing, with p = 1

3doubling of vessels

5 structure inhomogeneous foreground scaled between [m, 1], where m ∈ {0.2, 0.4, 0.6, 0.8, 1} 6 noise level Gaussian noise level randomly chosen from [0, 3σ], where σ is the standard noise level 7 all of the above above changes have all been applied with same probabilities

Two L-PD algorithms with two sets of parameters are trained: a small network and a slightly larger network. In the first one, we choose the number of iterations N = 10 and the number of primal- and dual channels k = 5 (cf. Algorithm 2). In the second one, we choose N = 5 and k = 2. For both networks, we take 32 channels in 2 hidden layers. The filter size for the convolutions is 3 × 3 and ReLu’s are chosen as activation functions. The Adam optimiser with an MSE-loss on the difference between ground truth and reconstruction is used. For stability in the optimisation, the batch size increases from 2 to 16 in three steps [6] during 200 Epochs. The photoacoustic operator A that is used by the L-PD algorithm is explained in [2].

4 Robustness results

At the top of Fig. 1 it can be seen that L-PD gives a better reconstruction than FBP and TV, even if it is trained on a dataset (c0) with

less variety than the test set (c3). When trained on the correct class of images (c3), the previously absent background is also reconstructed

correctly and therefore the reconstruction quality improves, which is also reflected in Fig. 2. Here it can also be seen that the large network performs slightly better than the small network. At the bottom of Fig. 1 it can be seen that one can not readily transfer the learned network to a reconstruction problem in which the forward model has been altered. However, in the case of less detectors or limited view, the L-PD algorithm is still able to remove many artefacts and noise.

Fig. 1: Top: several reconstructions of an image from class 3: L-PD outperforms non-learned methods.Bottom: several reconstructions with changes in the forward PAT model: learning on one system setting is not readily transferable to other settings.

Fig. 2: L-PD trained on c0 performs better than

non-learned methods. Training on cigives

robust-ness under image changes.

5 Conclusion

In this work we have investigated the sensitivity of a learned reconstruction algorithm with respect to changes in the image, changes in the data and changes in the operator or measurement system. We have shown that:

• learning improves pure model-based reconstruction in terms of noise removal and background identification; • more variety in the training set gives robustness against image uncertainty in the L-PD setup;

• robustness against model uncertainty is not readily obtained and is a promising challenge for future research.

Acknowledgements YB, SM and CB acknowledge support by the SACAMIR project of TKI Life Science & Health. SM and CB acknowledge support by the 4TU programme Precision Medicine.

References

[1] J. Adler and O. Öktem. Learned Primal-dual Reconstruction. IEEE Trans. Med. Imaging, 0062(3):1–11, 2018.

[2] Y. E. Boink, M. J. Lagerwerf, W. Steenbergen, S. A. van Gils, S. Manohar, and C. Brune. A framework for directional and higher-order reconstruction in photoacoustic tomography. Physics in Medicine & Biology, 63(4):045018, 2018.

[3] E. Kobler, T. Klatzer, K. Hammernik, and T. Pock. Pattern Recognition. 10496:281–293, 2017.

[4] A. Lucas, M. Iliadis, and R. Molina. Using Deep Neural Networks for Inverse Problems in Imaging. IEEE Sig. Proc. Mag., 35, 2018. [5] T. Meinhardt, M. Moeller, C. Hazirbas, and D. Cremers. Learning Proximal Operators: Using Denoising Networks for Regularizing

Inverse Imaging Problems. Proc. IEEE Int. Conf. Comput. Vis., 2017-October:1799–1808, 2017.

[6] S. L. Smith, P.-J. Kindermans, C. Ying, and Q. V. Le. Don’t Decay the Learning Rate, Increase the Batch Size. (2017):1–11, 2017.

c

Referenties

GERELATEERDE DOCUMENTEN

While intergovernmental co-operation refers to the relationship between different role- players within government structures within the framework of the NPM concept, many of

Met dank aan Geert Vynckier (VIOE) voor advies bij de determinatie van het aardewerk, Johan Van Heesch (Munt- en Penningkabinet van de Koninklijke Bibliotheek van België) voor

Index Terms—Tensorization, matrix factorization, tensor de- composition, canonical polyadic decomposition, multiway data, Hankel, L¨owner, time–frequency representations,

Keywords and phrases: Kernel methods, support vector machines, con- strained optimization, primal and dual problem, feature map, regression, classification, principal

Op defensiegebied was de SDAP voor de Eerste Wereldoorlog fel tegen het gebruik van geweld, dit werd gedurende de Eerste Wereldoorlog afgezwakt tot geweld dat

male (1-tailed) P-value Charity female vs. The results on age and the questionnaire equations. The difference in reciprocity between participants with different ages. According

Chapter 4: Differences between the 48-hour post-exercise effects of passive recovery and contrast water therapy on the subscales of the Recovery-Stress Questionnaire in rugby