๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

NOSER: An algorithm for solving the inverse conductivity problem

โœ Scribed by M. Cheney; D. Isaacson; J. C. Newell; S. Simske; J. Goble


Publisher
John Wiley and Sons
Year
1990
Tongue
English
Weight
885 KB
Volume
2
Category
Article
ISSN
0899-9457

No coin nor oath required. For personal study only.

โœฆ Synopsis


The inverse conductivity problem is the mathematical problem that must be solved in order for electrical impedance tomography systems to be able to make images. Here we show how this inverse conductivity problem is related to a number of other inverse problems. We then explain the workings of an algorithm that we have used to make images from electrical impedance data measured on the boundary of a circle in two dimensions. This algorithm is based on the method of least squares. It takes one step of a Newton's method, using a constant conductivity as an initial guess. Most of the calculations can therefore be done analytically. The resulting code is named NOSER, for Newton's One-Step Error Reconstructor. It provides a reconstruction with 496 degrees of freedom. The code does not reproduce the conductivity accurately (unless it differs very little from a constant), but it yields useful images. This is illustrated by images reconstructed from numerical and experimental data, including data from a human chest.

THE PROBLEM AND ITS CONNECTION WITH OTHER INVERSE PROBLEMS

Electrical impedance imaging systems apply currents to the surface S of a body B , measure the induced voltages at the surface, and from this information reconstruct an approximation to the conductivity in the interior [l-31. The reader the amount entering, which implies Js Ap')dS, = 0 .

( 3 )

Electrical impedance imaging systems not only apply current, but also measure voltages on the boundary u ( @ ) = V ( @ ) for p' on S .

(4)


๐Ÿ“œ SIMILAR VOLUMES


An Algorithm for Solving Boundary Value
โœ Elias Deeba; S.A. Khuri; Shishen Xie ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 83 KB

In this paper a numerical algorithm, based on the decomposition technique, is presented for solving a class of nonlinear boundary value problems. The method is implemented for well-known examples, including Troesch's and Bratu's problems which have been extensively studied. The scheme is shown to be

An Efficient Algorithm for Solving the I
โœ Alexandre Timonov; Michael V. Klibanov ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 146 KB

We consider the inverse coefficient problem of locating the interface positions arising in frequency sounding of layered media. Such a problem is of particular interest in the exploration of geophysics, underwater acoustics and electromagnetics, optical sensing, and so forth. We found that a simplif

An Algorithm for Solving the Factorizati
โœ T. Minkwitz ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 345 KB

The factorization problem in permutation groups is to represent an element g of some permutation group G as a word over a given set S of generators of G. For practical purposes, the word should be as short as possible, but must not be minimal. Like many other problems in computational group theory,