Results 1  10
of
20
Circular resistor networks for electrical impedance tomography with partial boundary measurements.
"... Abstract. We introduce an algorithm for the numerical solution of electrical impedance tomography (EIT) in two dimensions, with partial boundary measurements. The algorithm is an extension of the one in [11, 49] for EIT with full boundary measurements. It is based on resistor networks that arise in ..."
Abstract

Cited by 5 (4 self)
 Add to MetaCart
Abstract. We introduce an algorithm for the numerical solution of electrical impedance tomography (EIT) in two dimensions, with partial boundary measurements. The algorithm is an extension of the one in [11, 49] for EIT with full boundary measurements. It is based on resistor networks that arise in finite volume discretizations of the elliptic partial differential equation for the potential, on socalled optimal grids that are computed as part of the problem. The grids are adaptively refined near the boundary, where we measure and expect better resolution of the images. They can be used very efficiently in inversion, by defining a reconstruction mapping that is an approximate inverse of the forward map, and acts therefore as a preconditioner in any iterative scheme that solves the inverse problem via optimization. The main result in this paper is the construction of optimal grids for EIT with partial measurements by extremal quasiconformal (Teichmüller) transformations of the optimal grids for EIT with full boundary measurements. We present the algorithm for computing the reconstruction mapping on such grids, and we illustrate its performance with numerical simulations. The results show an interesting tradeoff between the resolution of the reconstruction in the domain of the solution and distortions due to artificial anisotropy induced by the distribution of the measurement points on the accessible boundary. 1.
Pyramidal resistor networks for electrical impedance tomography with partial boundary measurements
"... ..."
Electrical networks, symplectic reductions, and applications to the renormalization map of selfsimilar lattices
 Proc. of Symp. in Pure Math., Mandelbrot Jubilee. arXiv/mathph/0304015
"... Abstract. The first part of this paper deals with electrical networks and symplectic reductions. We consider two operations on electrical networks (the “trace map ” and the “gluing map”) and show that they correspond to symplectic reductions. We also give several general properties about symplectic ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
Abstract. The first part of this paper deals with electrical networks and symplectic reductions. We consider two operations on electrical networks (the “trace map ” and the “gluing map”) and show that they correspond to symplectic reductions. We also give several general properties about symplectic reductions, in particular we study the singularities of symplectic reductions when considered as rational maps on Lagrangian Grassmannians. This is motivated by [23] where a renormalization map was introduced in order to describe the spectral properties of selfsimilar lattices. In this text, we show that this renormalization map can be expressed in terms of symplectic reductions and that some of its key properties are direct consequences of general properties of symplectic reductions (and the singularities of the symplectic reduction play an important role in relation with the spectral properties of our operator). We also present new examples where we can compute the renormalization map.
Resistor network approaches to the numerical solution of electrical impedance tomography with partial boundary measurements
 Rice University
, 2009
"... by ..."
FourTerminal Reducibility and ProjectivePlanar WyeDeltaWyeReducible Graphs
 J. GRAPH THEORY
, 2000
"... A graph is Y∆Y reducible if it can be reduced to a vertex by a sequence of seriesparallel reductions and Y∆Ytransformations. Terminals are distinguished vertices which cannot be deleted by reductions and transformations. In this paper we show that fourterminal planar graphs are Y∆Yreducible w ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
A graph is Y∆Y reducible if it can be reduced to a vertex by a sequence of seriesparallel reductions and Y∆Ytransformations. Terminals are distinguished vertices which cannot be deleted by reductions and transformations. In this paper we show that fourterminal planar graphs are Y∆Yreducible when at least three of the vertices lie on the same face. Using this result we characterize Y∆Yreducible projectiveplanar graphs. We also consider terminals in projectiveplanar graphs, and establish that graphs of crossingnumber one are Y∆Yreducible.
Resistor network approaches to electrical impedance tomography
 Inside Out, Mathematical Sciences Research Institute Publications
, 2011
"... We review a resistor network approach to the numerical solution of the inverse problem of electrical impedance tomography (EIT). The networks arise in the context of finite volume discretizations of the elliptic equation for the electric potential, on sparse and adaptively refined grids that we call ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
We review a resistor network approach to the numerical solution of the inverse problem of electrical impedance tomography (EIT). The networks arise in the context of finite volume discretizations of the elliptic equation for the electric potential, on sparse and adaptively refined grids that we call optimal. The name refers to the fact that the grids give spectrally accurate approximations of the Dirichlet to Neumann map, the data in EIT. The fundamental feature of the optimal grids in inversion is that they connect the discrete inverse problem for resistor networks to the continuum EIT problem. 1.
STUDY OF NOISE EFFECTS IN ELECTRICAL IMPEDANCE TOMOGRAPHY WITH RESISTOR NETWORKS
, 1105
"... Abstract. We present a study of the numerical solution of the two dimensional electrical impedance tomography problem, with noisy measurements of the Dirichlet to Neumann map. The inversion uses parametrizations of the conductivity on optimal grids. The grids are optimal in the sense that finite vol ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Abstract. We present a study of the numerical solution of the two dimensional electrical impedance tomography problem, with noisy measurements of the Dirichlet to Neumann map. The inversion uses parametrizations of the conductivity on optimal grids. The grids are optimal in the sense that finite volume discretizations on them give spectrally accurate approximations of the Dirichlet to Neumann map. The approximations are Dirichlet to Neumann maps of special resistor networks, that are uniquely recoverable from the measurements. Inversion on optimal grids has been proposed and analyzed recently, but the study of noise effects on the inversion has not been carried out. In this paper we present a numerical study of both the linearized and the nonlinear inverse problem. We take three different parametrizations of the unknown conductivity, with the same number of degrees of freedom. We obtain that the parametrization induced by the inversion on optimal grids is the most efficient of the three, because it gives the smallest standard deviation of the maximum a posteriori estimates of the conductivity, uniformly in the domain. For the nonlinear problem we compute the mean and variance of the maximum aposterioriestimatesoftheconductivity,onoptimalgrids. Forsmallnoise, we obtain that the estimates are unbiased and their variance is very close to the optimal one, given by the CramérRao bound. For larger noise we use regularization and quantify the tradeoff between reducing the variance and introducing bias in the solution. Both the full and partial measurement setups are considered. 1.
Combinatorics of Tripartite Boundary Connections for Trees and Dimers
, 811
"... A grove is a spanning forest of a planar graph in which every component tree contains at least one of a special subset of vertices on the outer face called nodes. For the natural probability measure on groves, we compute various connection probabilities for the nodes in a random grove. In particular ..."
Abstract
 Add to MetaCart
A grove is a spanning forest of a planar graph in which every component tree contains at least one of a special subset of vertices on the outer face called nodes. For the natural probability measure on groves, we compute various connection probabilities for the nodes in a random grove. In particular, for “tripartite ” pairings of the nodes, the probability can be computed as a Pfaffian in the entries of the DirichlettoNeumann matrix (discrete Hilbert transform) of the graph. These formulas generalize the determinant formulas given by Curtis, Ingerman, and Morrow, and by Fomin, for parallel pairings. These Pfaffian formulas are used to give exact expressions for reconstruction: reconstructing the conductances of a planar graph from boundary measurements. We prove similar theorems for the doubledimer model on bipartite planar graphs. 1
Combinatorics of Tripartite Boundary Connections for Trees and Dimers
"... A grove is a spanning forest of a planar graph in which every component tree contains at least one of a special subset of vertices on the outer face called nodes. For the natural probability measure on groves, we compute various connection probabilities for the nodes in a random grove. In particular ..."
Abstract
 Add to MetaCart
A grove is a spanning forest of a planar graph in which every component tree contains at least one of a special subset of vertices on the outer face called nodes. For the natural probability measure on groves, we compute various connection probabilities for the nodes in a random grove. In particular, for “tripartite ” pairings of the nodes, the probability can be computed as a Pfaffian in the entries of the DirichlettoNeumann matrix (discrete Hilbert transform) of the graph. These formulas generalize the determinant formulas given by Curtis, Ingerman, and Morrow, and by Fomin, for parallel pairings. These Pfaffian formulas are used to give exact expressions for reconstruction: reconstructing the conductances of a planar graph from boundary measurements. We prove similar theorems for the doubledimer model on bipartite planar graphs. 1