Super-resolution in confocal scanning microscopy: generalized inversion formulae

It was shown in previous papers that the resolution of a confocal scanning microscope can be significantly improved by measuring, for each scanning position, the full diffraction image and by inverting these data to recover the value of the object at the confocal point. In the present work, the authors generalize the data inversion procedure by allowing, for reconstructing the object at a given point, to make use of the data samples recorded at other scanning positions. This leads them to a family of generalized inversion formulae, either exact or approximate. Some previously known formulae are re-derived here as special cases in a particularly simple way.

New data inversion formulae in confocal scanning microscopy

Whereas the resolving power of an ordinary optical microscope is determined by the classical Rayleigh distance, significant super-resolution, i.e. resolution improvement beyond that Rayleigh limit, has been achieved by confocal scanning light microscopy. Furthermore is has been shown that the resolution of a confocal scanning microscope can still be significantly enhanced by measuring, for each scanning position, the full diffraction image by means of an array of detectors and by inverting these data to recover the value of the object at the focus. We discuss the associated inverse problem and show how to generalize the data inversion procedure by allowing, for reconstructing the object at a given point, to make use also of the diffraction images recorded at other scanning positions. This leads us to a whole family of generalized inversion formulae, which contains as special cases some previously known formulae. We also show how these exact inversion formulae can be implemented in practice.

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.

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

Erratum: Generalized Smarr relation for Kerr-AdS black holes from improved surface integrals (Physical Review D (2005) 71 (044016)

SCOPUS: er.j