The use of neural network approximation models to speed up the optimisation process in electrical impedance tomography (Q839172): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4331755 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Inverse Conductivity Problem with One Measurement: Uniqueness for Convex Polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast solution of discretized optimization problems. Workshop held at the Weierstrass Institute for Applied Analysis and Stochastics, Berlin, Germany, May 8--12, 2000 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primal-dual Newton-type interior-point method for topology optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primal–dual Newton interior point methods in shape and topology optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the inverse conductivity problem with one measurement / rank
 
Normal rank
Property / cites work
 
Property / cites work: The layer potential technique for the inverse conductivity problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3366056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Singularities in anisotropic steady-state heat conduction using a boundary element method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4873721 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3726657 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3897937 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Special issue: SQP-based direct discretization methods for practical optimal control problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the uniqueness in the inverse conductivity problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Electrical impedance tomography with basis constraints / rank
 
Normal rank

Latest revision as of 22:10, 1 July 2024

scientific article
Language Label Description Also known as
English
The use of neural network approximation models to speed up the optimisation process in electrical impedance tomography
scientific article

    Statements

    The use of neural network approximation models to speed up the optimisation process in electrical impedance tomography (English)
    0 references
    0 references
    0 references
    0 references
    1 September 2009
    0 references
    The considered mathematical model for the cavity detection problem consist of the Laplace equation on E - D and three boundary conditions on the boundary of E and D, where E and D are two domains with Lipschitz boundary and D is completely included in E. The case of circular cavities will be investigated only. If a solution for the Laplace equation and two boundary conditions can be computed, the third boundary condition will be fulfilled if a certain quadratic functional gets minimized. This way, the mathematical model for the cavity detection is transformed into an optimization problem. For the optimization process one uses ES , the evolutionary strategy. Further, the purpose is to use neural networks technology for approximating the objective function. MLP (MultiLayer Perceptrons) as well as RBF (Radial Basis Functions) networks are used for constructing the reduced model. The MLP consists of one hidden layer, N input and one output signals, a sigmoid activation function and is trained by backpropagation. The RBF network has Gaussian basis functions, one output and the centroids are clustered by Kohonnen training. Some numerical examples are presented to prove the way ES is accelerated by using MLP or RBF approximating models.
    0 references
    Neural network
    0 references
    evolution strategy
    0 references
    cavity detection
    0 references
    inverse geometric problem
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references