Title: RANDOM MESH PROJECTORS FOR INVERSE PROBLEMS

Abstract: We propose a new learning-based approach to solve ill-posed inverse problems in imaging. We address the case where ground truth training samples are rare and the problem is severely ill-posed-both because of the underlying physics and because we can only get few measurements. This setting is common in geophysical imaging and remote sensing. We show that in this case the common approach to directly learn the mapping from the measured data to the reconstruction becomes unstable. Instead, we propose to first learn an ensemble of simpler mappings from the data to projections of the unknown image into random piecewise-constant subspaces. We then combine the projections to form a final reconstruction by solving a deconvolution-like problem. We show experimentally that the proposed method is more robust to measurement noise and corruptions not seen during training than a directly learned inverse.

1. INTRODUCTION:

A variety of imaging inverse problems can be discretized to a linear system y = Ax + η where y ∈ R M is the measured data, A ∈ R M ×N is the imaging or forward operator, x ∈ X ⊂ R N is the object being probed by applying A (often called the model), and η is the noise. Depending on the application, the set of plausible reconstructions X could model natural, seismic, or biomedical images. In many cases the resulting inverse problem is ill-posed, either because of the poor conditioning of A (a consequence of the underlying physics) or because M N .

A classical approach to solve ill-posed inverse problems is to minimize an objective functional regularized via a certain norm (e.g. 1 , 2 , total variation (TV) seminorm) of the model. These methods promote general properties such as sparsity or smoothness of reconstructions, sometimes in combination with learned synthesis or analysis operators, or dictionaries (Sprechmann et al. (2013) ).

In this paper, we address situations with very sparse measurement data (M N ) so that even a coarse reconstruction of the unknown model is hard to get with traditional regularization schemes. Unlike artifact-removal scenarios where applying a regularized pseudoinverse of the imaging operator already brings out considerable structure, we look at applications where standard techniques cannot produce a reasonable image (Figure 1 ). This highly unresolved regime is common in geophysics and requires alternative, more involved strategies (Galetti et al. (2017) ).

An appealing alternative to classical regularizers is to use deep neural networks. For example, generative models (GANs) based on neural networks have recently achieved impressive results in regularization of inverse problems (Bora et al. (2018) , Lunz et al. (2018) ). However, a difficulty in geophysical applications is that there are very few examples of ground truth models available for training (sometimes none at all). Since GANs require many, they cannot be applied to such problems. This suggests to look for methods that are not very sensitive to the training dataset. Conversely, it means that the sought reconstructions are less detailed than what is expected in data-rich settings; for an example, see the reconstructions of the Tibetan plateau (Yao et al. (2006) ).

In this paper, we propose a two-stage method to solve ill-posed inverse problems using random low-dimensional projections and convolutional neural networks. We first decompose the inverse problem into a collection of simpler learning problems of estimating projections into random (but structured) low-dimensional subspaces of piecewise-constant images. Each projection is easier to learn in terms of generalization error (Cooper (1995) ) thanks to its lower Lipschitz constant.

In the second stage, we solve a new linear inverse problem that combines the estimates from the different subspaces. We show that this converts the original problem with possibly non-local (often tomographic) measurements into an inverse problem with localized measurements, and that in fact, in expectation over random subspaces the problem becomes a deconvolution. Intuitively, projecting into piecewise-constant subspaces is equivalent to estimating local averages-a simpler problem than estimating individual pixel values. Combining the local estimates lets us recover the underlying structure. We believe that this technique is of independent interest in addressing inverse problems.

We test our method on linearized seismic traveltime tomography (Bording et al. (1987) ; Hole (1992)) with sparse measurements and show that it outperforms learned direct inversion in quality of achieved reconstructions, robustness to measurement errors, and (in)sensitivity to the training data. The latter is essential in domains with insufficient ground truth images.

2. RELATED WORK:

Although neural networks have long been used to address inverse problems (Ogawa et al. (1998) ; Hoole (1993); Schiller and Doerffer (2010) ), the past few years have seen the number of related deep learning papers grow exponentially. The majority address biomedical imaging (Güler and Übeylı (2005) ; Hudson and Cohen ( 2000)) with several special issues1 and review papers ( 2013)), as well as early uses of neural nets to unroll and adapt standard sparse reconstruction algorithms (Gregor and LeCun (2010) ; Xin et al. (2016) ). An advantage of the first group of methods is that they are fast; an advantage of the second group is that they are better at enforcing data consistency.

Generative models A rather different take was proposed in the context of compressed sensing where the reconstruction is constrained to lie in the range of a pretrained generative network (Bora et al. (2017; 2018) ). Their scheme achieves impressive results on random sensing operators and comes with theoretical guarantees. However, training generative networks requires many examples of ground truth and the method is inherently subject to dataset bias. Here, we focus on a setting where ground-truth samples are very few or impossible to obtain.

There are connections between our work and sketching (Gribonval et al. (2017) ; Pilanci and Wainwright (2016) ) where the learning problem is also simplified by random low-dimensional projections of some object-either the data or the unknown reconstruction itself (Yurtsever et al. (2017) ). This also exposes natural connections with learning via random features (Rahimi and Recht (2008; 2009) ).

3. REGULARIZATION BY RANDOM MESH PROJECTIONS:

The two stages of our method are (i) decomposing a "hard" learning task of directly learning an unstable operator into an ensemble of "easy" tasks of estimating projections of the unknown model into low-dimensional subspaces; and (ii) combining these projection estimates to solve a reformulated inverse problem for x. The two stages are summarized in Figure 2 . While our method is applicable to continuous and non-linear settings, we focus on linear finite-dimensional inverse problems.

3.1. DECOMPOSING THE LEARNING PROBLEM:

Statistical learning theory tells us that the number of samples required to learn an M -variate L-Lipschitz function to a given sup-norm accuracy is O(L M ) (Cooper (1995) ). While this result is proved for scalar-valued multivariate maps, it is reasonable to expect the same scaling in L to hold for vector-valued maps. This motivates us to study Lipschitz properties of the projected inverse maps.

We wish to reconstruct x, an N -pixel image from X ⊂ R N where N is large (we think of x as an √ N × √ N discrete image). We assume that the map from x ∈ X to y ∈ R M is injective so that it is invertible on its range, and that there exists an L-Lipschitz (generally non-linear) inverse G,

G(y 1 ) -G(y 2 ) ≤ L y 1 -y 2 .

In order for the injectivity assumption to be reasonable, we assume that X is a low-dimensional manifold embedded in R N of dimension at most M , where M is the number of measurements. Since we are in finite dimension, injectivity implies the existence of L (Stefanov and Uhlmann (2009) ). Due to ill-posedness, L is typically large.

Consider now the map from the data y to a projection of the model x into some K-dimensional subspace S, where K N . Note that this map exists by construction (since A is injective on X ), and that it must be non-linear. To see this, note that the only consistent2 linear map acting on y is an oblique, rather than an orthogonal projection on S (cf. Section 2.4 in Vetterli et al. (2014) ). We explain this in more detail in Appendix A.

Denote the projection by P S x and assume S ⊂ R N is chosen uniformly at random. 3 We want to evaluate the expected Lipschitz constant of the map from y to P S x, noting that it can be written as P S • G:

E P S • G(y 1 ) -P S • G(y 2 ) ≤ E P S • G(y 1 ) -P S • G(y 2 ) 2 ≤ K N L y 1 -y 2

where the first inequality is Jensen's inequality, and the second one follows from

E P S x 2 = E x P S P S x = x E(P S P S )x

and the observation that E P S P S = K N I N . In other words, random projections reduce the Lipschitz constant by a factor of K/N on average. Since learning requires O(L K ) samples, this allows us to work with exponentially fewer samples and makes the learning task easier. Conversely, given a fixed training dataset, it gives more accurate estimates.

3.1.1. A CASE FOR DELAUNAY TRIANGULATIONS:

The above example uses unstructured random subspaces. In many inverse problems, such as inverse scattering (Beretta et al. (2013) ; Di Cristo and Rondi ( 2003)), a judicious choice of subspace family can give exponential improvements in Lipschitz stability. Particularly, it is favorable to use piecewiseconstant images: x = K k=1 x k χ k , with χ k being indicator functions of some domain subset. Motivated by this observation, we use piecewise-constant subspaces over random Delaunay triangle meshes. The Delaunay triangulations enjoy a number of desirable learning-theoretic properties. For function learning it was shown that given a set of vertices, piecewise linear functions on Delaunay triangulations achieve the smallest sup-norm error among all triangulations (Omohundro (1989)).

We sample Λ sets of points in the image domain from a uniform-density Poisson process and construct Λ (discrete) Delaunay triangulations with those points as vertices. Let S = {S λ | 1 ≤ λ ≤ Λ} be the collection of Λ subspaces of piecewise-constant functions on these triangulations. Let further G λ be the map from y to the projection of the model into subspace S λ , G λ y = P S λ x. Instead of learning the "hard" inverse mapping G, we propose to learn an ensemble of simpler mappings {G λ } Λ λ=1 . We approximate each G λ by a convolutional neural network, Γ θ(λ) ( y) : R N → R N , parameterized by a set of trained weights θ(λ). Similar to Jin et al. ( 2016), we do not use the measured data y ∈ R M directly as this would require the network to first learn to map y back to the image domain; we rather warm-start the reconstruction by a non-negative least squares reconstruction, y ∈ R N , computed from y. The weights are chosen by minimizing empirical risk:

EQUATION

where (x j , y j ) J j=1 is a set of J training models and non-negative least squares measurements.

3.2. THE NEW INVERSE PROBLEM:

By learning projections onto random subspaces, we transform our original problem into that of estimating x from Γ θ(λ) ( y) Λ λ=1 . To see how this can be done, ascribe to the columns of B λ ∈ R N ×K a natural orthogonal basis for the subspace S λ , B λ = [χ λ,1 , . . . , χ λ,K ], with χ λ,k being the indicator function of the kth triangle in mesh λ. Denote by q λ def = q λ (y) the mapping from the data y to an estimate of the expansion coefficients of x in the basis for S λ :

q λ (y) def = B λ Γ θ(λ) ( y) Let B def = B 1 B 2 . . . B Λ ∈ R N ×KΛ

, and q def = q(y) def = q 1 , q 2 , . . . , q Λ ∈ R KΛ ; then we can estimate x using the following reformulated problem:

q ≈ B x,

and the corresponding regularized reconstruction:

EQUATION

with ϕ(x) chosen as the TV-seminorm x TV . The regularization is not essential. As we show experimentally, if KΛ is sufficiently large, ϕ(x) is not required. Note that solving the original problem directly using x TV regularizer fails to recover the structure of the model (Figure 1 ).

3.3. STABILITY OF THE REFORMULATED PROBLEM AND "CONVOLUTIONALIZATION":

Since the true inverse map G has a large Lipschitz constant, it would seem reasonable that as the number of mesh subspaces Λ grows large (and their direct sum approaches the whole ambient space R N ), the Lipschitz properties of G should deteriorate as well.

Denote the unregularized inverse mapping in y → x (2) by G. Then we have the following estimate:

G(y 1 ) -G(y 2 ) = (B T ) † q(y 1 ) -(B T ) † q(y 2 ) ≤ σ min (B) -1 √ ΛL K y 1 -y 2 ,

with σ min (B) the smallest (non-zero) singular value of B and L K the Lipschitz constant of the stable projection mappings q λ . Indeed, we observe empirically that σ min (B) -1 grows large as the number of subspaces increases which reflects the fact that although individual projections are easier to learn, the full-resolution reconstruction remains ill-posed.

Estimates of individual subspace projections give correct local information. They convert possibly non-local measurements (e.g. integrals along curves in tomography) into local ones. The key is that these local averages (subspace projection coefficients) can be estimated accurately (see Section 4).

To further illustrate what we mean by correct local information, consider a simple numerical experiment with our reformulated problem, q = B T x, where x is an all-zero image with a few pixels "on". For the sake of clarity we assume the coefficients q are perfect. Recall that B is a block matrix comprising Λ subspace bases stacked side by side. It is a random matrix because the subspaces are generated at random, and therefore the reconstruction x = (B ) † q is also random. We approximate E x by simulating a large number of Λ-tuples of meshes and averaging the obtained reconstructions.

Results are shown in Figure 3 for different numbers of triangles per subspace, K, and subspaces per reconstruction, Λ. As Λ or K increase, the expected reconstruction becomes increasingly localized around non-zero pixels. The following proposition (proved in Appendix B) tells us that this phenomenon can be modeled by convolution.4 

Proposition 1. Let x be the solution to q = B x given as (B ) † q. Then there exists a kernel κ(u), with u a discrete index, such that E x = x * κ. Furthermore, κ(u) is isotropic.

While Figure 3 suggests that more triangles are better, we note that this increases the subspace dimension which makes getting correct projection estimates harder. Instead we choose to stack more meshes with a smaller number of triangles.

Intuitively, since every triangle average depends on many measurements, estimating each average is more robust to measurement corruptions as evidenced in Section 4. Accurate estimates of local averages enable us to recover the geometric structure while being more robust to data errors. 

4. NUMERICAL RESULTS:



4.1. APPLICATION: TRAVELTIME TOMOGRAPHY:

To demonstrate our method's benefits we consider linearized traveltime tomography (Hole (1992) ; Bording et al. (1987) ), but we note that the method applies to any inverse problem with scarce data.

In traveltime tomography, we measure N 2 wave travel times between N sensors as in Figure 4 . Travel times depend on the medium property called slowness (inverse of speed) and the task is to reconstruct the spatial slowness map. Image intensities are a proxy for slowness maps-the lower the image intensity the higher the slowness. In the straight-ray approximation, the problem data is modeled as integral along line segments:

y(s i , s j ) = 1 0 x(ts i + (1 -t)s j ) dt, ∀ s i = s j (3)

where x : R 2 → R + is the continuous slowness map and s i , s j are sensor locations. In our experiments, we use a 128 × 128 pixel grid with 25 sensors (300 measurements) placed uniformly in an inscribed circle, and corrupt the measurements with zero-mean iid Gaussian noise.

4.1.1. ARCHITECTURES AND RECONSTRUCTION:

We generate random Delaunay meshes each with 50 triangles. The corresponding projector matrices compute average intensity over triangles to yield a piecewise constant approximation P S λ x of x.

We test two distinct architectures: (i) ProjNet, tasked with estimating the projection into a single subspace; and (ii) SubNet, tasked with estimating the projection over multiple subspaces.5 

The ProjNet architecture is inspired by the FBPConvNet (Jin et al. ( 2016)) and the U-Net (Ronneberger et al. (2015) ) as shown in Figure 11a in the appendix. Crucially, we constrain the network output to live in S λ by fixing the last layer of the network to be a projector, P S λ (Figure 11a ). A similar trick in a different context was proposed in (Sønderby et al. ( 2016)).

We combine projection estimates from many ProjNets by regularized linear least-squares (2) to get the reconstructed model (cf. Figure 2 ) with the regularization parameter λ determined on five held-out images. A drawback of this approach is that a separate ProjNet must be trained for each subspace. This motivates the SubNet (shown in Figure 11b ). Each input to SubNet is the concatenation of a non-negative least squares reconstruction and 50 basis functions, one for each triangle forming a 51-channel input. This approach scales to any number of subspaces which allows us to get visually smoother reconstructions without any further regularization as in (2). On the other hand, the projections are less precise which can lead to slightly degraded performance.

As a quantitative figure of merit we use the signal-to-noise ratio (SNR). The input SNR is defined as 10 log 10 (σ 2 signal /σ 2 noise ) where σ 2 signal and σ 2 noise are the signal and noise variance; the output SNR is defined as sup a,b 20 log 10 ( x 2 / x -ax -b 2 ) with x the ground truth and x the reconstruction.

130 ProjNets are trained for 130 different meshes with measurements at various SNRs. Similarly, a single SubNet is trained with 350 different meshes and the same noise levels. We compare the ProjNet and SubNet reconstructions with a direct U-net baseline convolutional neural network that reconstructs images from their non-negative least squares reconstructions. The direct baseline has the same architecture as SubNet except the input is a single channel non-negative least squares reconstruction like in ProjNet and the output is the target reconstruction. Such an architecture was proposed by (Jin et al. (2016) ) and is used as a baseline in recent learning-based inverse problem works (Lunz et al. (2018) ; Ye et al. ( 2018)) and is inspiring other architectures for inverse problems (Antholzer et al. (2017) ). We pick the best performing baseline network from multiple networks which have a comparable number of trainable parameters to SubNet. We simulate the lack of training data by testing on a dataset that is different than that used for training.

Robustness to corruption:

To demonstrate that our method is robust against arbitrary assumptions made at training time, we consider two experiments. First, we corrupt the data with zero-mean iid Gaussian noise and reconstruct with networks trained at different input noise levels. In Figures 5a, 12 and Table 1 , we summarize the results with reconstructions of geo images taken from the BP2004 dataset6 and x-ray images of metal castings (Mery et al. (2015) ). The direct baseline and SubNet are trained on a set of 20,000 images from the arbitrarily chosen LSUN bridges dataset (Yu et al. (2015) ) and tested with the geophysics and x-ray images. ProjNets are trained with 10,000 images from the LSUN dataset. Our method reports better SNRs compared to the baseline. We note that direct reconstruction is unstable when trained on clean and tested on noisy measurements as it often hallucinates details that are artifacts of the training data. For applications in geophysics it is important that our method correctly captures the shape of the cavities unlike the direct inversion which can produce sharp but wrong geometries (see outlines in Figure 5a ). Second, we consider a different corruption mechanism where traveltime measurements are erased (set to zero) independently with probability p ∈ 1 12 , 1 10 , 1 8 , and use networks trained with 10 dB input SNR on the LSUN dataset to reconstruct. Figure 5b and with Gaussian noise (Figure 5a ) the direct method completely fails to recover coarse geometry in all test cases. In our entire test dataset of 102 x-ray images there is not a single example where the direct network captures a geometric feature that our method misses. This demonstrates the strengths of our approach. For more examples of x-ray images please see Appendix E.

Robustness against dataset overfitting Figure 6 illustrates the influence of the training data on reconstructions. Training with LSUN, CelebA (Liu et al. (2015) ) and a synthetic dataset of random overlapping shapes (see Figure 15 in Appendix for examples) all give comparable reconstructions-a desirable property in applications where real ground truth is unavailable.

We complement our results with reconstructions of checkerboard phantoms (standard resolution tests) and x-rays of metal castings in Figure 7 . We note that in addition to better SNR, our method produces more accurate geometry estimates, as per the annotations in the figure.

5. CONCLUSION:

We proposed a new approach to regularize ill-posed inverse problems in imaging, the key idea being to decompose an unstable inverse mapping into a collection of stable mappings which only estimate low-dimensional projections of the model. By using piecewise-constant Delaunay subspaces, we showed that the projections can indeed be accurately estimated. Combining the projections leads to a deconvolution-like problem. Compared to directly learning the inverse map, our method is more robust against noise and corruptions. We also showed that regularizing via projections allows our method to generalize across training datasets. Our reconstructions are better both quantitatively in terms of SNR and qualitatively in the sense that they estimate correct geometric features even when measurements are corrupted in ways not seen at training time. Future work involves getting precise estimates of Lipschitz constants for various inverse problems, regularizing the reformulated problem using modern regularizers (Ulyanov et al. (2017) ), studying extensions to non-linear problems and developing concentration bounds for the equivalent convolution kernel.

Figure 8 : Orthogonal vs. oblique projections. There is no linear operator acting on or on the orthogonal projection y = P R(A * ) x = A † y that can compute the orthogonal projection into S.

A NEED FOR NON-LINEAR OPERATORS:

We explain the need for non-linear operators even in the absence of noise with reference to Figure 8 . Projecting x into a given known subspace is a simple linear operation, so it may not be a priori clear why we use non-linear neural networks to estimate the projections. Alas, we do not know x and only have access to y. Suppose that there exists a linear operator (a matrix) F ∈ R N ×M which acts on y and computes the projection of x on S λ . A natural requirement on F is consistency: if x already lives in S λ , then we would like to have F Ax = x. This implies that for any x, not necessarily in S λ , we require F AF Ax = F Ax which implies that F A = (F A) 2 is an idempotent operator. Letting the columns of B λ be a basis for S λ , it is easy to see that the least squares minimizer for F is B λ (AB λ ) † . However, because R(F ) = S λ = R(A * ) (A * is the adjoint of A, simply a transpose for real matrices), in general it will not hold that (F A) * = F A. Thus, F A is an oblique, rather than orthogonal projection into S. In Figure 8 this corresponds to the point P oblique S λ

x which can be arbitrarily far from the orthogonal projection P ortho S λ x. The nullspace of the oblique projection is precisely N (A) = R(A * ) ⊥ .

Thus consistent linear operators can at best yield oblique projections which can be far from the orthogonal one. One could also see this geometrically from Figure 8 . As the angle between S λ and R(A * ) increases to π/2 the oblique projection point travels to infinity (note that the oblique projection always happens along the nullspace of A, which is the line orthogonal to P R(A * ) . Since our subspaces are chosen at random, in general they are not aligned with R(A * ). The only subspace on which we can linearly compute an orthogonal projection from y is R(A * ); this is given by the Moore-Penrose pseudoinverse. Therefore, to get the orthogonal projection onto random subspaces, we must use non-linear operators. More generally, for any other ad hoc linear reconstruction operator W , W y = W Ax always lives in the column space of W A which is a subspace whose dimension is at most the number of rows of A. However, we do not have any linear subspace model for x.

As shown in the right half of Figure 8 , as soon as A is injective on X , the existence of this non-linear map is guaranteed by construction: since y determines x, it also determines P S λ x.

We show the results of numerical experiments in Figures 9 and 10 which further illustrate the performance difference between linear oblique projectors and our non-linear learned operator when estimating the projection of an image into a random subspace. We refer the reader to the captions below each figure for more details.

B PROOF OF PROPOSITION 1:

Proof. The reconstruction of the new inverse problem can be written as x = BB x where the columns of B = (B ) † form a biorthogonal basis to the columns of B. Thus 

E ERASURE RECONSTRUCTIONS:

We show additional reconstructions for the largest corruption case, p = 1 8 , for x-ray images (Figure 13 ) and geo images (Figure 14 ). Our method consistently has better SNR. More importantly we note that there is not a single instance where the direct reconstruction gets a feature that our methods do not. In a majority of instances, the direct network misses a feature of the image. This is highly undesirable in settings such as geophysical imaging.

:

IEEE Transactions on Medical Imaging, May

(Greenspan et al. (2016)); IEEE Signal Processing Magazine, November

2017, January 2018(Porikli et al. (2017; 2018)).

Consistent meaning that if x already lives in S, then the map should return x.

One way to construct the corresponding projection matrix is as P S = W W † , where W ∈ R N ×K is a matrix with standard iid Gaussian entries.

We note that this result requires adequate handling of boundary conditions; for the lack of space we omit the straightforward details.

Code available at https://github.com/swing-research/deepmesh under the MIT License.

http://software.seg.org/datasets/2D/2004_BP_Vel_Benchmark/

Figures and Tables:

Figure 1: We reconstruct an image x from its tomographic measurements. In moderately ill-posed problems, conventional methods based on the pseudoinverse and regularized non-negative least squares (x ∈ [0, 1] N , N is image dimension) give correct structural information. In fact, total variation (TV) approaches give very good results. A neural network (Jin et al. (2016)) can be trained to directly invert and remove the artifacts (NN). In a severely ill-posed problem on the other hand (explained in Figure4) with insufficient ground truth training data, neither the classical techniques nor a neural network recover salient geometric features.

Figure 2: Regularization by Λ random projections: 1) each orthogonal projection is approximated by a convolutional neural network which maps from a non-negative least squares reconstruction of an image to its projection onto a lower dimension subspace of Delaunay triangulations; 2) projections are combined to estimate the original image using regularized least squares.

Figure 3: Illustration of the expected kernel κ(u, v) with varying subspace dimension, K, and number of subspaces, Λ. Reconstruction of a sparse three-pixel image (left) and the cameraman image (right).

Figure 4: Linearized traveltime tomography illustration: On the left we show a sample model, with red crosses indicating 25 sensor locations and dashed blue lines indicating linearized travel paths; on the right we show a reconstruction from 25 2 = 300 measurements by non-negative least squares.

Figure 5: a) Reconstructions for different combinations of training and testing input SNR. The output SNR is indicated for each reconstruction. Our method stands out when the training and testing noise levels do not match; b) reconstructions with erasures with probability 1 8 , 1 10 and 1 12 . The reconstructions are obtained from networks which are trained with input SNR of 10 dB. The direct network cannot produce a reasonable image in any of the cases.

Figure 6: Reconstructions from networks trained on different datasets (LSUN, CelebA and Shapes) with 10dB training SNR.

Figure 7: Reconstructions on checkerboards and x-rays with 10dB measurement SNR tested on 10dB trained networks. Red annotations highlight where the direct net fails to reconstruct correct geometry.

p b p .

Figure 12: Geophysics image patches taken from BP2004 dataset. Our method especially gets correct global shapes with better accuracy even when tested on noise levels different from training.

Table 2 summarizes our findings. Unlike Published as a conference paper at ICLR 2019 Average reconstruction SNR for various training and testing SNR combinations.

Table content: <table><tr><td colspan="3">Average SNR over 102 x-ray images</td><td colspan="6">Training SNR Direct ProjNets SubNet Direct ProjNets SubNet 10 dB ∞ dB</td></tr><tr><td>Testing</td><td colspan="2">10 dB</td><td>13.51</td><td>14.49</td><td>13.92</td><td>10.34</td><td>12.88</td><td>12.85</td></tr><tr><td>SNR</td><td colspan="2">∞ dB</td><td>13.78</td><td>15.38</td><td>14.04</td><td>16.67</td><td>17.23</td><td>16.86</td></tr><tr><td colspan="2">Average SNR over 102 x-ray images</td><td>p = 1 8</td><td>p = 1 10</td><td>p = 1 12</td><td/><td/><td/></tr><tr><td>Direct</td><td/><td>9.03</td><td>9.62</td><td>10.06</td><td/><td/><td/></tr><tr><td>ProjNets</td><td/><td>11.09</td><td>11.70</td><td>12.08</td><td/><td/><td/></tr><tr><td>SubNet</td><td/><td>11.33</td><td>11.74</td><td>11.99</td><td/><td/><td/></tr></table>

Average SNR values for reconstructions from measurements with erasure probability, p. All networks were trained for 10dB noisy measurements on the LSUN bridges dataset. Refer to Appendix E for actual reconstructions.

Table content: <table><tr><td>Original</td><td>Non-negative least squares</td><td>LSUN</td><td>CelebA</td><td>Shapes</td></tr></table>

Peer review (iclr2019):
 This paper describes a novel method for solving inverse problems in imaging. The basic idea of this approach is use the following steps: 1. initialize with nonnegative least squares solution to inverse problem (x0) 2. compute m different projections of x0 3. estimate x from the m different projections by solving "reformuated" inverse problem using TV regularization. The learning part of this algorithm is in step 2, where m different convolutional neural networks are used to learn m good projections. The projections correspond to computing a random Delaunay triangulation over the image domain and then computing pixel averages within each triangle. It*s not clear exactly what the learning part is doing, i.e. what makes a "good" triangulation, why a CNN might accurately represent one, and what the shortcomings of truly random triangulations might be. More specifically, for each projection the authors start with a random set of points in the image domain and compute a Delaunay triangulation. They average x0 in each of the Delaunay triangles. Then since the projection is constant on each triangle, the projection into the lower-dimensional space is given by the magnitude of the function over each of the triangular regions. Next they train a convolutional neural network to approximate the above projection. The do this m times. It*s not clear why the neural network approximation is necessary or helpful. Empirically, this method outperforms a straightforward use of a convolutional U-Net to invert the problem. The core novelty of this paper is the portion that uses a neural network to calculate a projection onto a random Delaunay triangulation. The idea of reconstructing images using random projections is not especially new, and much of the "inverse-ness" of the problem here is removed by first taking the pseudoinverse of the forward operator and applying it to the observations. Then the core idea at the heart of the paper is to speed up this reconstruction using a neural network by viewing the projection onto the mesh space as a set of special filter banks which can be learned. At the heart of this paper is the idea that for an L-Lipschitz function f : R^k → R the sample complexity is O(L^k), so the authors want to use the random projections to essentially reduce L. However, the Cooper sample complexity bound scales with k like k^{1+k/2}, so the focus on the Lipschitz constant seems misguided. This isn*t damning, but it seems like the piecewise-constant estimators are a sort of regularizer, and that*s where we really get the benefits. The authors only compare to another U-Net, and it*s not entirely clear how they even trained that U-Net. It*d be nice to see if you get any benefit here from their method relative to other approaches in the literature, or if this is just better than inversion using a U-Net. Even how well a pseudoinverse does would be nice to see or TV-regularized least squares. Practically I*m quite concerned about their method requiring training 130 separate convolutional neural nets. The fact that all the different datasets give equal quality triangulations seems a bit odd, too. Is it possible that any network at all would be okay? Can we just reconstruct the image from regression on 130 randomly-initialized convolutional networks? The proposed method isn*t bad, and the idea is interesting. But I can*t help but wonder whether it works just because what we*re doing is denoising the least squares reconstruction, and regression on many random projections might be pretty good for that. Unfortunately, the experiments don*t help with developing a deeper understanding.