Infinite-dimensional inverse problems with finite measurements
Giovanni S. Alberti, Matteo Santacesaria

TL;DR
This paper develops a framework for solving infinite-dimensional inverse problems with finite measurements, establishing stability, uniqueness, and a convergent reconstruction algorithm applicable to various nonlinear ill-posed problems.
Contribution
It introduces a general theory for finite measurement inverse problems in infinite dimensions, including a globally convergent Landweber iteration-based algorithm.
Findings
Stability estimates hold with finite measurements for Lipschitz stable problems.
The framework applies to nonlinear problems like electrical impedance tomography.
A practical reconstruction algorithm is proposed and analyzed.
Abstract
We present a general framework to study uniqueness, stability and reconstruction for infinite-dimensional inverse problems when only a finite-dimensional approximation of the measurements is available. For a large class of inverse problems satisfying Lipschitz stability we show that the same estimate holds even with a finite number of measurements. We also derive a globally convergent reconstruction algorithm based on the Landweber iteration. This theory applies to nonlinear ill-posed problems such as electrical impedance tomography, inverse scattering and quantitative photoacoustic tomography, under the assumption that the unknown belongs to a finite-dimensional subspace.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Infinite-dimensional inverse problems
with finite measurements
Giovanni S. Alberti
MaLGa Center, Department of Mathematics, University of Genoa, Via Dodecaneso 35, 16146 Genova, Italy.
and
Matteo Santacesaria
MaLGa Center, Department of Mathematics, University of Genoa, Via Dodecaneso 35, 16146 Genova, Italy.
Abstract.
We present a general framework to study uniqueness, stability and reconstruction for infinite-dimensional inverse problems when only a finite-dimensional approximation of the measurements is available. For a large class of inverse problems satisfying Lipschitz stability we show that the same estimate holds even with a finite number of measurements. We also derive a globally convergent reconstruction algorithm based on the Landweber iteration. This theory applies to nonlinear ill-posed problems such as electrical impedance tomography, inverse scattering and quantitative photoacoustic tomography, under the assumption that the unknown belongs to a finite-dimensional subspace.
Key words and phrases:
Inverse problems, Calderón’s problem, inverse conductivity problem, electrical impedance tomography, inverse scattering, photoacoustic tomography, global uniqueness, Lipschitz stability, reconstruction algorithm
2010 Mathematics Subject Classification:
35R30, 94A20, 35P25, 78A46
The authors are members of the Gruppo Nazionale per l’Analisi Matematica, la Probabilità e le loro Applicazioni (GNAMPA) of the Istituto Nazionale di Alta Matematica (INdAM). G.S. Alberti is partially supported by the UniGE starting grant “Curiosity”. M. Santacesaria is partially supported by a INdAM – GNAMPA Project 2019. This material is based upon work supported by the Air Force Office of Scientific Research under award number FA8655-20-1-7027. The authors would like to thank Otmar Scherzer for explaining some useful details of [53].
1. Introduction
1.1. General setup and aim of the paper
The recovery of an unknown physical quantity from indirect measurements is the main goal of an inverse problem. It is often convenient to consider both the unknown quantity and the measured data in a continous setting. This allows for studying, for instance, inverse problems modeled by partial differential equations (PDE) [67, 65] and, more generally, infinite-dimensional inverse problems where the measurement operator, or forward map, is a function between Banach spaces [71]. The inverse problem consists in the reconstruction of from the knowledge of the measurements . Several possibly nonlinear inverse problems fit into this framework, including electrical impedance tomography (EIT) [44, 48, 83], photoacoustic tomography [93, 72] (and many other hybrid imaging problems [8]), travel time tomography [90], and inverse scattering [51].
However, in practice we only have access to a finite-dimensional approximation of the data, for some finite-rank operator . It is then critical, in view of the applications, to study how the reconstruction depends on this approximation. The aim of this paper is to provide explicit guarantees for exact recovery for general inverse problems with finite measurements. As we show in this work, this issue is strictly related with that of stability, which we now discuss.
1.2. Stability of inverse problems and previous work.
The main motivation of this work comes from some nonlinear inverse problems for PDE, such as Calderón’s problem for EIT, where the unknown is a conductivity distribution that has to be recovered from boundary voltage and current patterns. This is a severely ill-posed problem, where a small error in the data propagates exponentially to the reconstruction [80]. In other words, the continuous dependence of the conductivity on the boundary data, also known as stability estimate, is of logarithmic type [12], and this explains the typical low spatial resolution in the reconstruction.
In the case of general nonlinear inverse problems, such as EIT or inverse scattering, it turns out that a possible way to obtain a stronger stability of Lipschitz type is to assume that the unknown belongs to a known finite-dimensional subspace of the original space . This has been shown for a number of inverse problems for elliptic PDE [13, 18, 23, 37, 34, 33, 42, 38, 36, 31, 57, 30, 32, 15, 14, 64, 16, 35]. The main drawback of these results is that, even though the unknown is a finite-dimensional object, infinitely many measurements are still needed. For instance, in the case of EIT, an infinite number of boundary current and voltage data are required to recover a conductivity in a known finite-dimensional space.
A uniqueness result from a finite number of boundary measurements – as well as a Lipschitz stability estimate and a reconstruction scheme – was recently obtained by the authors for the Gel’fand-Calderón problem for the Schrödinger equation and for EIT under rather general finite-dimensionality assumptions on the unknown [9]. Afterwards, Lipschitz stability from a finite number of measurements was derived by Harrach for the complete electrode model in EIT [62] (based on the local problem studied in [75]), as well as by Rüland-Sincich for the fractional Calderón problem [87]. The linearized EIT problem was previously addressed in [11] using compressed sensing. Many related works, mainly for the inverse scattering problem, consider a periodic, polygonal or polyhedral structure in the unknown [56, 49, 17, 28, 66, 39, 40, 77].
Though the above results constitute a clear improvement showing that a finite number of measurements is enough, they still leave many unanswered questions. In our previous result [9], the (finite number of) boundary measurements depend on the unknown conductivity, which is clearly impractical. This assumption was then removed in [62], though the result is not constructive (the number of measurements is not explicitly given), and the approach is restricted to finite-dimensional subspaces of piecewise analytic conductivities. The other results either work under very restrictive assumptions on the unknown, or they do not provide criteria to choose the measurements depending on the a priori assumptions.
1.3. Main contributions of this paper
In this work, we present a general framework to solve infinite-dimensional inverse problems when only a finite number of measurements is available.111After the first version of this preprint was published, several works on this topic have appeared [63, 10, 7].
In Section 2 we prove a Lipschitz stability estimate for inverse problems with finite measurements. We also give an explicit criterion to choose the type and number of measurements depending on the a priori assumptions on the unknown, namely on the space . The result is obtained with functional analytic techniques and it takes inspiration from the general Lipschitz stability results of [23, 42] as well as from the already mentioned works on EIT [9, 62].
In Section 3 we derive a globally convergent reconstruction algorithm for the inverse problem by combining the Lipschitz stability obtained in the previous section with the results of [53] (summarized in Appendix A), which guarantee local convergence for the associated Landweber iteration. We show how a good initial guess can be recovered by constructing a lattice in the (finite-dimensional) unknown space.
In Section 4, we apply the abstract results to three inverse problems, EIT, inverse scattering and quantitative photoacoustic tomography. For EIT, we show a Lipschitz stability estimate from a finite number of measurements independent of the unknown, under the assumption that a Lipschitz stability estimate holds in the case of full measurements. Thus, this covers a large class of finite-dimensional spaces of conductivities. Moreover, an explicit criterion is given in order to choose the number of measurements. In particular, we consider the special case of conductivities on the unit disk: assuming that a Lipschitz stability estimate for the full Neumann-to-Dirichlet map holds with a constant , we show that Lipschitz stability also holds with only a finite number of trigonometric current patterns proportional to .
Finally, in Section 5 we provide some concluding remarks and discuss future research directions.
1.4. Connections with machine learning
In recent years, machine learning has arisen as a data-driven alternative to classical inversion methods, and has shown tremendous improvements in dealing with the ill-posedness of several inverse problems [21, 78, 81, 85]. The results presented in this paper may be used in connection with machine learning techniques in several ways.
- •
Our main stability result holds under the assumption that the unknown belongs (or is close) to a known finite-dimensional subspace of a Banach space. In case this subspace is not known, it could be estimated by using, for instance, dictionary learning techniques [79].
- •
The main stability estimate of this work shows the Lipschitz continuity of an inverse mapping. This property allows the inverse to be approximated with neural networks [94], even when is not known. The explicit discretisation that we use in the stability result would help in designing the architecture of such a network.
- •
The iterative reconstruction algorithm presented in Section 3 can be unrolled and seen as a neural network as in [5, 6]. Also in this context the subspace can be learned, namely the projection operator can be replaced by weights of a deep network.
2. Lipschitz stability estimate
2.1. Abstract inverse problem
Let and be Banach spaces with norms and . We denote the space of continuous linear operators from to by . Let be an open set and be a map of class . In other words, is Fréchet differentiable at every , namely there exists such that
[TABLE]
and is continuous. We shall refer to as the forward map.
The focus of this work is the following inverse problem: given , recover . Very often, even if the map is injective, its inverse is not continuous, and so the inverse problem is ill-posed.
2.2. Lipschitz stability with infinite-dimensional measurements
We are interested in a Lipschitz stability estimate for this general inverse problem. One way to obtain it, without imposing strong assumptions on the map , is to assume that the unknown belongs to a finite-dimensional subset of . We recall here a general result obtained in [23, Proposition 5] and [42, Theorem 1] in a similar setting.
Theorem 1**.**
Let and be Banach spaces. Let be an open subset, be a finite-dimensional subspace and be a compact and convex subset. Let be such that and , , are injective.
Then there exists a constant such that
[TABLE]
The constant can be explicitly estimated in terms of the lower bound of the Fréchet derivative and the moduli of continuity of and , as done in [23], or with ad-hoc techniques depending on the specific problem as in [86]. In general, for ill-posed problems, as (which is consistent with the results of [88]), and so this approach works well for low-dimensional spaces only.
Estimate (1) shows that even a severely ill-posed problem becomes stable under the above finite dimensionality assumptions. Nevertheless, this is still unsatisfactory because we are recovering a finite-dimensional quantity from infinite-dimensional (and so, infinitely many scalar) measurements .
2.3. Lipschitz stability with finitely many measurements
Instead of measuring the infinite-dimensional data , we now suppose to have the measurements
[TABLE]
for large enough (depending explicitly on and , as we will see), where are (finite-rank) bounded operators approximating the identity as . The precise characterization of the convergence is as follows.
Hypothesis 1**.**
Let be a subspace of and . For , let be bounded linear maps. We assume that there exists a subspace of such that
- (a)
for every
[TABLE]
(if is linear, this is equivalent to requiring ); 2. (b)
for every , for some ; 3. (c)
and, as ,
[TABLE]
with respect to the strong operator topology.
Remark*.*
Several works study inverse problems with finitely-many measurements in the Bayesian approach to discretisation errors [68, 74, 52, 70], but they only consider asymptotic estimates (as goes to infinity) and are mostly for linear problems.
The framework considered here is similar to that of multilevel regularization methods, where discretization in the image space is used as a regularizer [69]. More precisely, it is possible to interpret this hypothesis as a smoothing property (cfr. the regularization theory by discretization [69, Sections 4.3 and 5.1]).
Let us now list some important examples of operators . These are applied to realistic scenarios in Section 4.
Any family of bounded operators such that strongly may be considered (in particular, we do not require convergence with respect to the operator norm). In the next example, we discuss how this situation can arise in practice.
Example 1** (Projections onto finite-dimensional subspaces).**
Let the data space be an infinite-dimensional separable Hilbert space and be an orthonormal basis (ONB) of . Then can be taken as the projection onto the space generated by the first elements of the basis, i.e. .
More generally, assume that has the following multi-resolution structure. Let be a family of subspaces of satisfying:
- (1)
each is a finite-dimensional subspace; 2. (2)
for every ; 3. (3)
and the spaces are exhaustive, i.e. .
Let be the orthogonal projection onto . We have that and if , where , the measurements
[TABLE]
determine the Galerkin projection . Thus this represents a model for a finite number of measurements from the full data . In this case we can choose .
For example, the projections may represent a low-pass filter in frequency (modelling sensors up to a certain bandwidth) or in wavelet scale.
Next, we consider a particular case of multi-resolution structure in reproducing kernel Hilbert spaces, in order to view the projected measurements as a finite pointwise sampling of the full measurements .
Example 2** (Finite sampling in reproducing kernel Hilbert spaces).**
Let be a reproducing kernel Hilbert space (RKHS) of continuous functions on a separable topological space [20] (for instance, can be a sufficiently smooth Sobolev space, possibly on a manifold [55], which is a common setup in inverse problems). Roughly speaking, this means that the evaluation functionals are continuous for every , so that by the Riesz representation theorem we can write the reproducing property
[TABLE]
for a suitable . The kernel of the RKHS is then
[TABLE]
Let be a dense set of (assume that if ): its existence follows from the separability of . Set
[TABLE]
Let us now verify that the conditions of Example 1 are satisfied. By construction, is a finite-dimensional subspace of and for every . It remains to show that . Take such that for every . Then
[TABLE]
and so because it is continuous and is dense in . The claim is proved.
As in Example 1, we can let be the projection onto . Since
[TABLE]
the pointwise values for allows us to recover . Furthermore, since is finite-dimensional, there exists such that
[TABLE]
In other words, the reconstruction of from the sampled values of is stable.
Let us now consider a third example that is adapted to inverse boundary value problems, in which the measurements themselves are operators. In this case, the maps do not converge strongly to the identity on the whole .
Example 3** (Projections with operator-valued measurements).**
Let be the space of bounded linear operators from to , where and are Banach spaces. Let be bounded maps such that and strongly as (for instance, when is a Hilbert space, may be chosen as the projection onto the -th subspace of an exhaustive chain, as in Example 1).
Let us now take \tilde{Y}=\{T\in Y:\text{T is compact}\} and assume that
[TABLE]
which is satisfied in many cases of interest. It is worth observing that this condition is implied by
[TABLE]
since is the operator-norm limit of compact operators, and so it is compact.
Let be the maps defined by
[TABLE]
Even if strongly, let us show that Hypothesis 1 is satisfied. Condition a follows immediately from (3). By the uniform boundedness principle the operators are uniformly bounded, and so b is satisfied with . It remains to verify c. For we have
[TABLE]
Since and strongly, and is compact, by a standard result in functional analysis (see Lemma 3 below) we have that the right hand side converges to [math] as , and c follows.
Our main result states that it is indeed possible to obtain Lipschitz stability from a finite number of measurements, obtained by composing with the full measurements, at the price of a slightly larger Lipschitz constant. In particular, we also obtain a uniqueness result with finite measurements.
Theorem 2**.**
Let and be Banach spaces. Let be an open subset, be a subspace and be a compact and convex subset. Let be a Lipschitz map satisfying the Lipschitz stability estimate
[TABLE]
for some . Let be bounded linear maps for satisfying Hypothesis 1.
- (i)
If is finite-dimensional, then
[TABLE] 2. (ii)
If , then for every
[TABLE]
where is the Lipschitz constant of .
Remark 1*.*
Even though i and ii combined clearly imply that there exists for which (5) holds true, we decided to separate the two conditions since in many cases it is possible to show directly , and this allows to derive explicit bounds on (as in Section 4.1). More precisely, the inequality
[TABLE]
gives an explicit relation between the number of measurements/discretization parameter , the space and the Lipschitz stability constant of the full-measurement case. It is worth observing that this condition may be seen as a nonlinear version of the stable sampling rate and the balancing property, which were introduced in the context of generalized sampling and compressed sensing for infinite-dimensional linear problems [1, 3, 2, 4].
Remark 2*.*
When the mismodeling errors are zero, estimate (5) is exactly a Lipschitz stability estimate. Otherwise, it is natural to have an error term depending on the distance to . We want to underline that, in our framework, this error term is amplified by the Lipschitz constant , which may be very large for severely ill-posed problems. This is due to the linearization techniques in our proof and it might be a price to pay to obtain a general result such as Theorem 2. However, in [9, 10] we were able to obtain sharper estimates with respect to the mismodeling error for Calderón’s inverse conductivity problem, thanks to specific nonlinear inversion methods.
Combining Theorems 1 and 2 we obtain the following corollary for the cases discussed in Examples 1 and 3.
Corollary 1**.**
Let and be Banach spaces. Let be an open subset, be a finite-dimensional subspace of and be a compact and convex subset of . Let be such that and , , are injective. Let be bounded linear maps for . Assume one of the following:
- (a)
* strongly as (as, e.g., in Example 1);* 2. (b)
, with and Banach spaces, is given as in Example 3, and is compact for every and .
Then there exist and such that
[TABLE]
This corollary shows that in the rather common cases discussed in Examples 1 and 3, under basically the same conditions of Theorem 1 we obtain Lipschitz stability from a finite number of measurements.
Let us now prove the main result.
Proof of Theorem 2.
We prove the two parts of the statement separately.
Proof of i. Let , where is the unit sphere in centered in [math], and
[TABLE]
We first show that is continuous. Given a converging sequence in , we have
[TABLE]
Using the fact that , and we have that , and so is continuous. Set . Thus the map
[TABLE]
is continuous on the compact set , so there exists such that
[TABLE]
Let be a subsequence of : by a classical result in general topology, it is enough to show that has a subsequence converging to [math]. The set is compact, and so in for a subsequence (with an abuse of notation, we do not specify the second subsequence), so
[TABLE]
where we have used Hypothesis 1a. Since by Hypothesis 1b, we have . Moreover, as since is continuous. Finally, as by Hypothesis 1c. This shows that as , as desired.
Proof of ii. Let be such that . Take and let be such that
[TABLE]
(The existence of these points is guaranteed by the compactness of .) By the Lipschitz stability estimate of we have
[TABLE]
Consider now , . Then it is easy to verify that its Fréchet derivative satisfies , because is linear. Then, by the mean value theorem for Gateaux differentiable functions between Banach spaces (see [19, Theorem 1.8] for instance) and since is convex, there exists such that
[TABLE]
Plugging this estimate into inequality (9) yields
[TABLE]
because and is the Lipschitz constant of . As a consequence, thanks to (8) we readily obtain
[TABLE]
This immediately gives the desired Lipschitz stability estimate (5). ∎
We finish this section with a technical lemma used in Example 3.
Lemma 3**.**
Let and be two Banach spaces, be a compact operator and , , be such that and strongly as . Then
- (i)
* as ,* 2. (ii)
* as .*
Proof.
We start from i. Assume by contradiction that . Then there exists such that, for a subsequence, we have
[TABLE]
Thus, for each there exists such that and . Since is bounded and is compact, there exists such that, for a subsequence, as . Since for every we have
[TABLE]
and by the uniform boundedness principle we obtain
[TABLE]
for some . Thus
[TABLE]
which is a contradiction, since the last term goes to zero as .
The proof of ii follows from i using the fact that
[TABLE]
the compactness of and that strongly. ∎
3. Reconstruction algorithm
The Lipschitz stability estimates presented in Theorem 2 and Corollary 1 can be used to design a reconstruction algorithm. We slightly strengthen the assumptions of Theorem 2 (regarding the regularity of and the map ), and let
- •
and be Banach spaces;
- •
be an open set;
- •
be a finite-dimensional subspace;
- •
be such that and are Lipschitz continuous;
- •
be a continuous finite-rank operator;
- •
be a compact set;
- •
and be a positive constant such that
[TABLE]
Let be the unknown signal and denote the corresponding measurements. We now derive a global reconstruction algorithm which allows for the recovery of from the knowledge of . We assume here, for simplicity, that we have noiseless data at our disposal. However, we expect the extension to the noisy case to be possible by using the results of [82].
3.1. Local reconstruction
We first discuss how to reconstruct by means of an iterative method [53, 54] (see Appendix A), provided that a good approximation of is known.
The domain and the range of are finite dimensional, and so they are isomorphic to finite-dimensional euclidean spaces. In particular, without loss of generality, we can assume that and are Hilbert spaces.
We wish to apply Proposition 10 to and : let be given as in the statement of Proposition 10. Let be the initial guess of the Landweber iteration with stepsize
[TABLE]
related to the minimization of
[TABLE]
By Proposition 10, . More precisely, the convergence rate is given by
[TABLE]
In view of the multi-level scheme of [54], with Lipschitz stability constants depending on each level , it is interesting to note that in this case the projection would also depend on through condition (6). Thus, the number of measurements would grow at each iteration depending on the Lipschitz constant .
3.2. Getting the initial guess
Let us now discuss how to find the initial guess for the Landweber iteration, namely an approximation of so that .
The forward map is Lipschitz continuous on by assumption, and so there exists such that
[TABLE]
Since is compact, we can find a finite lattice such that
[TABLE]
where is given by Proposition 10 and is given by (10).
Lemma 4**.**
Under the above assumptions, we have:
- (a)
there exists such that
[TABLE] 2. (b)
if (13) holds true for some , then
[TABLE]
Proof.
Proof of a. By (12) there exists such that . Thus, (13) is an immediate consequence of (11).
[TABLE]
Thanks to this lemma, it is enough to let the initial guess be chosen as one of the elements of the lattice for which (13) is satisfied. Indeed, one such element exists by part a and, by part b, we have the desired approximation
[TABLE]
It is worth observing that this method requires the “physical” measurements and to compute for “offline”, which can be done in parallel.
3.3. Global reconstruction
These two steps may be combined to obtain a global reconstruction algorithm; see Algorithm 1.
4. Examples
In this section we show how Theorem 2 and Corollary 1 can be used to derive Lipschitz stability estimates for several inverse problems with a finite number of measurements.
4.1. Electrical impedance tomography
Consider a bounded Lipschitz domain , with , equipped with an electrical conductivity , where
[TABLE]
The corresponding Neumann-to-Dirichlet (ND) or current-to-voltage map is the operator , defined by
[TABLE]
where and is the unique -weak solution of the Neumann problem for the conductivity equation
[TABLE]
where is the unit outward normal to , satisfying the normalization condition
[TABLE]
The following inverse boundary value problem arises from this framework, see [44, 41, 92] and references therein.
Inverse conductivity problem. Given , find in .
It is well known that the knowledge of determines uniquely if [84, 22] or if is smooth enough [91, 61, 46]. The inverse problem is severely ill-posed, and only logarithmic stability holds true [12, 80, 50, 45].
In recent years several Lipschitz stability estimates have been obtained for this inverse problem under certain a priori-assumption on , such as for piecewise constant [18], piecewise linear [15] or for belonging to a finite-dimensional subspace of piecewise analytic functions [62] (see [57, 14] for the anisotropic case). In all these cases, the conductivity is always assumed to lie in a certain finite-dimensional subspace of , but the full boundary measurements are required, i.e. all possible combination of current/voltage data (see formula (16) below).
We now show how to derive the same estimates with finitely many measurements by applying the results of Section 2. Further, the reconstruction algorithm of Section 3 may be used to recover the unknown conductivity.
We now fix the main ingredients of the construction. Let
- •
;
- •
;
- •
;
- •
, for ;
- •
be a finite-dimensional subspace of such that
[TABLE]
for some , where and
[TABLE]
for some fixed a priori;
- •
be bounded linear maps, , such that and strongly as (as, e.g., in Example 1);
- •
and for , as in Example 3.
Under these assumptions, we have the following Lipschitz stability estimate with a finite number of measurements. This result extends [62] to any subspace yielding (16) and, in addition, it provides a constructive way to determine the parameter .
Theorem 5**.**
Under the above assumptions, there exists such that
[TABLE]
where is given in (16).
The parameter can be chosen such that
[TABLE]
where is a constant depending only on and , is the canonical immersion, , and .
Remark 3*.*
It is worth analyzing the right hand side of (17) in order to understand why it represents a finite number of measurements if the maps are properly chosen. Let be an ONB of and let be the orthogonal projection onto (similarly, we could also consider projections onto the -th subspace of an exhaustive chain, as in Example 1). In this case, we clearly have , and that strongly as . Writing , we have
[TABLE]
Let be the matrix defined by : observe that this can be obtained by applying only the currents and measuring the corresponding voltages only up to frequency/scale . By (19), estimate (17) becomes
[TABLE]
where denotes the spectral norm of the matrix . In other words, we have a Lipschitz stability estimates with scalar measurements.
Let us now comment on how large the parameter has to be chosen.
Remark 4*.*
The parameter is given explicitly as a function of and in (18), up to a constant depending only on and . Further, upper bounds on in (16) depending on the dimension of are known in some particular cases, and so it is possible to give the number of measurements as a function of . For example, with piecewise constant conductivities, we have that depends exponentially on [86].
Note that the norm depends exclusively on the domain , and can be explicitly estimated in some particular cases. In the following example, we consider the case when is the unit ball in two dimensions and is the low-pass filter up to the frequency .
Example 4**.**
Take and . Parametrizing the boundary with the arc-length parameter , for , using Fourier series we can write
[TABLE]
where the norm is given by Define the projections as
[TABLE]
We clearly have that strongly and that for every , so that . This is substantially in the same framework described in Remark 3, the only difference being that the elements of the basis are considered in pairs. Thus, the measures here corresponds to sinusoidal input currents and the related voltages measured up to frequency . Thanks to the Nyquist-Shannon sampling theorem, the voltages may be measured only at a finite number of locations on .
Observing that , we readily derive
[TABLE]
This implies that the parameter (corresponding to input currents) in order to have Lipschitz stability needs to satisfy
[TABLE]
and is therefore quadratic in the Lipschitz constant . If depends exponentially on , this gives an exponential dependence of on . It is worth observing that for the Gel’fand-Calderón problem for the Schrödinger equation, one has a polynomial dependence if complex geometrical optics solutions (depending on the unknown) are used [9].
Let us now prove Theorem 5.
Proof.
In the proof, the symbol will denote , for some positive constant depending only on and .
By using the variational formulation of (15), it is easy to see [75] that is Fréchet differentiable and that its Fréchet derivative in in the direction is given by
[TABLE]
Therefore, using the well-posedness of (15), namely , for such that we have
[TABLE]
In particular, for with we have
[TABLE]
where and .
Arguing in a similar way, using that is self-adjoint we obtain
[TABLE]
Recall the definition , where . Arguing as in (4), and using (20) and (21), for and with we have
[TABLE]
In particular, .
Now recall that . By the Kondrachov embedding theorem, the operator is compact and so, by Lemma 3, we have .
Thus, the conclusion immediately follows from Theorem 2, part ii. ∎
Dirichlet-to-Neumann map
The model based on the ND map is arguably more realistic in view of the applications [48]. However, an alternative model for EIT considers boundary data modeled by the Dirichlet-to-Neumann (DN) map, namely the operator
[TABLE]
where is the unique solution of the Dirichlet problem for the conductivity equation
[TABLE]
Most Lipschitz stability estimates for the inverse conductivity problem have been obtained for the DN map, i.e. they are of the form
[TABLE]
for belonging to a known finite-dimensional subspace of .
Here we briefly sketch two possible approaches to extend Theorem 5 to this setting.
- (1)
Given a Lipschitz stability estimate for the DN map, one can easily obtain the same stability (up to a slightly different constant) for the ND map. The only difference lies in the use of an integration by part (Alessadrini’s identity) for the ND map instead of the usual one for the DN map. In this case, Theorem 5 applies directly. 2. (2)
It is also possible to avoid changing the boundary operator, and to obtain stability with a discretization of the DN map, as a consequence of Theorem 2. The compactness of the Frechét derivative, required to fit in the framework discussed in Example 3, follows by the fact that is analytic smoothing [80], provided that and coincide in a neighborhood of the boundary.
4.2. Inverse scattering problem
We now discuss the inverse medium problem in scattering theory [51]. The physical model here is
[TABLE]
augmented with the Sommerfeld radiation condition
[TABLE]
where , is the wavenumber, is the complex refractive index of the medium such that in and for some open ball and is the incident field satisfying
[TABLE]
The far-field, or scattering amplitude, is given by
[TABLE]
where is the unit sphere in and is large enough so that . Choosing incoming waves for , let denote the corresponding far-field measurements, so that . The following inverse problem arises from this framework.
Fixed frequency inverse scattering problem. Given at fixed , find in .
As in the Calderón’s problem, the stability of this inverse problem is only logarithmic in the general case [89], but Lipschitz estimates may be derived under a priori assumptions on , and the theory developed in this paper may be applied.
We now set the various objects introduced in Section 2 (following [42]). Let
- •
;
- •
;
- •
A=L^{\infty}_{+}(B)=\{f\in L^{\infty}(B;\mathbb{C}):\mathrm{Im}(n)\geq\lambda\text{ in B\lambda>0}\};
- •
be the far-field pattern associated to the refractive index extended by to the whole ;
- •
be a finite-dimensional subspace of and be a convex and compact subset of ;
- •
and be bounded linear maps, , such that and strongly as .
By using Theorem 1, it was proven in [42] that the inverse problem of recovering a refractive index in from its far-field pattern is Lipschitz stable, namely there exists such that
[TABLE]
This estimate still requires the knowledge of the full measurements in . By applying Theorem 2 (or directly Corollary 1), we can establish the following result.
Theorem 6**.**
Under the above assumptions, there exists (given explicitly by (6)) such that
[TABLE]
Let us now show why may be seen as finite measures. Let the maps be chosen as projections onto the vector spaces generated by the first elements of an ONB of , as in Example 1. More precisely, in this case we can consider the ONB of given by the tensor products of the spherical harmonics, namely
[TABLE]
and let be the projections onto
[TABLE]
The measurements are now low-frequency projections of the full far-field pattern . With this choice of the maps , it is also possible to apply the reconstruction algorithm discussed in Section 3, which allows for the recovery of from the measurements .
Furthermore, let us show how to obtain a Lipschitz stability estimate with only a finite number of directions and with measurements of the corresponding far-field patterns taken only at a finite number of locations on .
Theorem 7**.**
Assume that the hypotheses of Theorem 6 hold true. Let
[TABLE]
be two dense subsets of (possibly identical). There exist and a constant such that
[TABLE]
Proof.
We first observe that the far-field patterns are analytic functions of and [71], and so taking pointwise evaluations is meaningful.
We consider the Sobolev space [43, 29, 55, 76]. Since and , is continuously embedded into , and so it is a reproducing kernel Hilbert space consisting of continuous functions. As in Example 2, define
[TABLE]
and let be the projection onto . Arguing as in the derivation of Theorem 6 (with , since ), there exists such that
[TABLE]
Thus, in view of (2) we obtain
[TABLE]
for some , as desired. ∎
4.3. Quantitative photoacoustic tomography (QPAT)
Let be a bounded domain of class for some and be a nonnegative function representing the optical absorption of the medium. Photoacoustic tomography (PAT) is a hybrid modality based on coupling optical and ultrasonic waves [93]: a laser pulse illuminates the biological tissue under consideration, whose thermal expansion creates a ultrasonic wave that can be measured outside the medium. In the first step of photoacoustic tomography [72, 8], by solving a linear (and stable) inverse source problem for the wave equation, we measure the internal optical energy
[TABLE]
where the light intensity solves
[TABLE]
for a fixed known illumination such that .
We have considered the diffusion approximation for light propagation with constant diffusion term. More involved models, involving a non-constant leading order term [27, 26] or the use of the more accurate transport equation [25], would complicate the analysis, but the type of results obtained would be similar: we have decided to discuss the simplest model in order to highlight the impact of the results of this paper.
The second step of PAT, called quantitative, consists in the reconstruction of from the knowledge of the internal energy.
Inverse problem of QPAT. Given in , find in .
We now set the various objects introduced in Section 2. Let
- •
be a finite-dimensional subspace of ;
- •
;
- •
A=\{f\in X:\lambda^{-1}<\mu<\lambda\text{ in \Omega\lambda>0}\};
- •
, where is the unique weak solution of (22);
- •
K=\{f\in X:\Lambda^{-1}\leq\mu\leq\Lambda\text{ in \Omega}\} for some fixed ;
- •
and be bounded linear maps, , such that and strongly as .
Several Lipschitz stability estimates have been derived for PAT [27, 26, 73]. For completeness, we provide a proof in the setting considered here.
Proposition 8**.**
There exists a constant depending only on , , and such that
[TABLE]
where is the solution to (22) with coefficient .
Remark*.*
As it will be clear from the proof, the dependence of on appears only to replace the norm of on the left hand side by the more natural norm. This dependence may be dropped if higher order Sobolev (or Hölder) norms are used [27, 26].
Proof.
Let us denote the unique solution to (22) by , so that . In the proof, by an abuse of notation, several different positive constants depending only on , , and will be denoted by the same letter .
We claim that there exists such that
[TABLE]
Take . By classical elliptic regularity theory (see, e.g., [58, Theorem 8.29]) we have that and
[TABLE]
As a consequence, since is positive, there exists such that
[TABLE]
By the strong maximum principle (see, e.g., [58, Theorem 8.19] applied to ) we have in . Thus, the Harnack inequality ([58, Theorem 8.20]) yields
[TABLE]
Finally, combining (25) and (26) we obtain (23).
In view of (22) we have that
[TABLE]
Thus, standard energy estimates for the Poisson equation give
[TABLE]
Let us now show the Lipschitz stability estimate of the statement. Using the identity
[TABLE]
thanks to (23), (24) and (27) we readily derive for
[TABLE]
Finally, the norm of may be replaced by the norm because the space is finite dimensional and all norms are equivalent. ∎
Note that the map is certainly Fréchet differentiable because it is in fact analytic (the map is analytic). Therefore, it is possible to apply Theorem 2 to this inverse problem and obtain a Lipschitz stability estimate with finite-dimensional measurements.
Theorem 9**.**
Under the above assumptions, there exists (given explicitly by (6)) such that
[TABLE]
where is the solution to (22) with coefficient .
As in the previous examples, the projections may be chosen as low-pass filters. The reconstruction algorithm discussed in Section 3 may be used to recover the unknown from finite measurements.
We considered PAT as a key example, but the analysis presented here may be easily generalized to several other hybrid imaging inverse problems with internal data [24, 8], such as thermo-acoustic tomography, dynamic elastography and acousto-electric tomography.
5. Conclusion
In this paper, we have discussed a general framework to derive Lipschitz stability estimates for nonlinear inverse problems with finite measurements, under the assumption that the unknown belongs to a finite-dimensional space. A global reconstruction algorithm was also derived, based on a nonlinear Landweber iteration. We then applied the general theory to Calderón’s inverse problem for EIT, to inverse scattering and to quantitative photoacoustic tomography.
Let us discuss a few research directions motivated by the findings of this work.
- •
The assumption of the finite dimensionality of is not needed in Theorem 2, part ii. Thus, it would be interesting to investigate whether the condition may be derived in some cases with the only compactness assumption on . The latter could follow from a more general argument based on compact embeddings.
- •
The theory of compressed sensing (CS) allows for the recovery of sparse signals from a number of (linear) measurements that is proportional to the sparsity (up to log factors), under suitable incoherence assumptions. The classical theory, working for a unitary forward map , was recently extended to arbitrary linear maps with bounded inverse [11]. It would be interesting to apply CS to the general nonlinear setup presented in this paper by using the results of [59, 60].
- •
The numerical implementation of the reconstruction algorithm constructed in Section 3 would allow for testing its efficiency and applicability.
- •
In this work, we have limited ourselves to considering three nonlinear inverse problems as proofs of concept, but it would be interesting to apply the theory to other examples, for instance where the unknown is supposed to have a particular shape (e.g. a polygon) with unknown location [31, 35] or for inverse problems with fractional operators [87, 47].
- •
In Theorem 2, the dependence on the mismodeling error in the stability estimate is not sharp, as discussed in Remark 2. A very challenging question is then to improve upon this dependence, without losing the generality of our approach.
Appendix A Local convergence of Landweber iteration
For the sake of completeness, we describe the convergence result used in Section 3.1. We present a simplified version of [53, Theorem 3.2] that is sufficient for our scopes.
Let and be Hilbert spaces, be an open set, be a compact set and be such that
- (1)
and is Lipschitz continuous, namely
[TABLE]
for some ; 2. (2)
is Lipschitz continuous, namely
[TABLE]
for some .
Proposition 10**.**
There exist such that the following is true. Take and let . If satisfies
[TABLE]
then the iterates of the Landweber iteration
[TABLE]
converge to and satisfy
[TABLE]
Remark*.*
The constants , and are given explicitly in [53] as functions of the a priori data. The statement provided in [53] requires to be weakly sequentially closed, but a close look to the proof indicates that this assumption may be dropped, since in this case the existence of the minimizer is granted.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] B. Adcock and A. C. Hansen. A generalized sampling theorem for stable reconstructions in arbitrary bases. J. Fourier Anal. Appl. , 18(4):685–716, 2012. URL: https://doi.org/10.1007/s 00041-012-9221-x , doi:10.1007/s 00041-012-9221-x . · doi ↗
- 2[2] B. Adcock and A. C. Hansen. Generalized sampling and infinite-dimensional compressed sensing. Found. Comput. Math. , 16(5):1263–1323, 2016. URL: https://doi.org/10.1007/s 10208-015-9276-6 . · doi ↗
- 3[3] B. Adcock, A. C. Hansen, and C. Poon. Beyond consistent reconstructions: optimality and sharp bounds for generalized sampling, and application to the uniform resampling problem. SIAM J. Math. Anal. , 45(5):3132–3167, 2013. URL: https://doi.org/10.1137/120895846 , doi:10.1137/120895846 . · doi ↗
- 4[4] B. Adcock, A. C. Hansen, C. Poon, and B. Roman. Breaking the coherence barrier: a new theory for compressed sensing. Forum Math. Sigma , 5:e 4, 84, 2017. URL: http://dx.doi.org/10.1017/fms.2016.32 , doi:10.1017/fms.2016.32 . · doi ↗
- 5[5] J. Adler and O. Öktem. Solving ill-posed inverse problems using iterative deep neural networks. Inverse Problems , 33(12):124007, 2017.
- 6[6] J. Adler and O. Öktem. Learned primal-dual reconstruction. IEEE transactions on medical imaging , 37(6):1322–1332, 2018.
- 7[7] G. S. Alberti, Á. Arroyo, and M. Santacesaria. Inverse problems on low-dimensional manifolds. ar Xiv preprint ar Xiv:2009.00574 , 2020.
- 8[8] G. S. Alberti and Y. Capdeboscq. Lectures on elliptic methods for hybrid inverse problems , volume 25 of Cours Spécialisés [Specialized Courses] . Société Mathématique de France, Paris, 2018.
