A regularized iterative algorithm for limited-angle inverse Radon transform

The tomography problem is investigated when the available projections are restricted to a limited angular domain. It is shown that a previous algorithm proposed for extrapolating the data to the missing cone in Fourier space is unstable in the presence of noise because of the ill-posedness of the problem. A regularized algorithm is proposed, which converges to stable solutions. The efficiency of both algorithms is tested by means of numerical simulations. © 1983 Taylor and Francis Group, LLC.

Sorting under partial information (without the ellipsoid algorithm)

We revisit the well-known problem of sorting under partial information: sort a finite set given the outcomes of comparisons between some pairs of elements. The input is a partially ordered set P, and solving the problem amounts to discovering an unknown linear extension of P, using pairwise comparisons. The information-theoretic lower bound on the number of comparisons needed in the worst case is log e(P), the binary logarithm of the number of linear extensions of P. In a breakthrough paper, Jeff Kahn and Jeong Han Kim (STOC 1992) showed that there exists a polynomial-time algorithm for the problem achieving this bound up to a constant factor. Their algorithm invokes the ellipsoid algorithm at each iteration for determining the next comparison, making it impractical. We develop efficient algorithms for sorting under partial information. Like Kahn and Kim, our approach relies on graph entropy. However, our algorithms differ in essential ways from theirs. Rather than resorting to convex programming for computing the entropy, we approximate the entropy, or make sure it is computed only once in a restricted class of graphs, permitting the use of a simpler algorithm. Specifically, we present: an O(n2) algorithm performing O(log n·log e(P)) comparisons; an O(n2.5) algorithm performing at most (1+ε) log e(P) + Oε(n) comparisons; an O(n2.5) algorithm performing O(log e(P)) comparisons. All our algorithms are simple to implement. © 2010 ACM.

Regularization of an iterative algorithm for the extrapolation of bandlimited signals

info:eu-repo/semantics/published

Stability and resolution in electromagnetic inverse problems

info:eu-repo/semantics/published

On the regularization of linear inverse problems in Fourier optics

info:eu-repo/semantics/published

Ill-posed Inverse Problems and Logarithmic Continuity in Electromagnetics

info:eu-repo/semantics/published

The Stability of Inverse Problems

info:eu-repo/semantics/published

Superresolution and number of degrees of freedom in inverse diffraction with subwavelength sources

info:eu-repo/semantics/published

Number of degrees of freedom in inverse diffraction

The problem of inverse diffraction from plane to plane is considered in the case where a finite aperture exists in the boundary plane. Singular values and singular functions for the problem are introduced, and the number of degrees of freedom is defined in terms of the distribution of the singular values. Numerical computations are presented for the one-dimensional problem, and it is shown that the effect of evanescent waves disappears at a distance of approximately one wavelength from the boundary plane, even when the dimension of the slit is comparable with the wavelength of the diffracted field. © 1983 Taylor & Francis Group, LLC.

Stability and Resolution in Electromagnetic Inverse Scattering - Part I

info:eu-repo/semantics/published

Positive regularised solutions in electromagnetic inverse scattering

Fredholm integral equations of the first kind are the mathematical model common to several electromagnetic, optical and acoustical inverse scattering problems. In most of these problems the solution must be positive in order to satisfy physical plausibility. We consider ill-posed deconvolution problems and investigate several linear regularization algorithms which provide positive approximate solutions at least in the absence of errors on the data.

Applied Inverse Problems in Optics

info:eu-repo/semantics/published

Linear inverse problems with discrete data: II. Stability and regularization

For pt.I. see ibid. vol.1, p.301 (1985). In the first part of this work a general definition of an inverse problem with discrete data has been given and an analysis in terms of singular systems has been performed. The problem of the numerical stability of the solution, which in that paper was only briefly discussed, is the main topic of this second part. When the condition number of the problem is too large, a small error on the data can produce an extremely large error on the generalised solution, which therefore has no physical meaning. The authors review most of the methods which have been developed for overcoming this difficulty, including numerical filtering, Tikhonov regularisation, iterative methods, the Backus-Gilbert method and so on. Regularisation methods for the stable approximation of generalised solutions obtained through minimisation of suitable seminorms (C-generalised solutions), such as the method of Phillips (1962), are also considered.

SVD for linear inverse problems

info:eu-repo/semantics/published

Stability Problems in Inverse Diffraction

Inverse diffraction consists in determining the field distribution on a boundary surface from the knowledge of the distribution on a surface situated within the domain where the wave propagates. This problem is a good example for illustrating the use of least-squares methods (also called regularization methods) for solving linear ill-posed inverse problem. We focus on obtaining error bounds For regularized solutions and show that the stability of the restored field far from the boundary surface is quite satisfactory: the error is proportional to ∊(ðŗ‚ ≃ 1) ,ðŗœ being the error in the data (Hölder continuity). However, the error in the restored field on the boundary surface is only proportional to an inverse power of │In∊│ (logarithmic continuity). Such a poor continuity implies some limitations on the resolution which is achievable in practice. In this case, the resolution limit is seen to be about half of the wavelength. Copyright © 1981 by The Institute of Electrical and Electronics Engineers, Inc.