The learned range test method for the inverse inclusion problem

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Sun, Shiwei, Alberti, Giovanni S.
Format: Preprint
Published: 2024
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866908605052092416
author Sun, Shiwei
Alberti, Giovanni S.
author_facet Sun, Shiwei
Alberti, Giovanni S.
contents We consider the inverse problem consisting of the reconstruction of an inclusion $B$ contained in a bounded domain $Ω\subset\mathbb{R}^d$ from a single pair of Cauchy data $(u|_{\partialΩ},\partial_νu|_{\partialΩ})$, where $Δu=0$ in $Ω\setminus\overline B$ and $u=0$ on $\partial B$. We show that the reconstruction algorithm based on the range test, a domain sampling method, can be written as a neural network with a specific architecture. We propose to learn the weights of this network in the framework of supervised learning, and to combine it with a pre-trained classifier, with the purpose of distinguishing the inclusions based on their distance from the boundary. The numerical simulations show that this learned range test method provides accurate and stable reconstructions of polygonal inclusions. Furthermore, the results are superior to those obtained with the standard range test method (without learning) and with an end-to-end fully connected deep neural network, a purely data-driven method.
format Preprint
id arxiv_https___arxiv_org_abs_2411_00463
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle The learned range test method for the inverse inclusion problem
Sun, Shiwei
Alberti, Giovanni S.
Numerical Analysis
Machine Learning
35R30, 65N21, 68T07
We consider the inverse problem consisting of the reconstruction of an inclusion $B$ contained in a bounded domain $Ω\subset\mathbb{R}^d$ from a single pair of Cauchy data $(u|_{\partialΩ},\partial_νu|_{\partialΩ})$, where $Δu=0$ in $Ω\setminus\overline B$ and $u=0$ on $\partial B$. We show that the reconstruction algorithm based on the range test, a domain sampling method, can be written as a neural network with a specific architecture. We propose to learn the weights of this network in the framework of supervised learning, and to combine it with a pre-trained classifier, with the purpose of distinguishing the inclusions based on their distance from the boundary. The numerical simulations show that this learned range test method provides accurate and stable reconstructions of polygonal inclusions. Furthermore, the results are superior to those obtained with the standard range test method (without learning) and with an end-to-end fully connected deep neural network, a purely data-driven method.
title The learned range test method for the inverse inclusion problem
topic Numerical Analysis
Machine Learning
35R30, 65N21, 68T07
url https://arxiv.org/abs/2411.00463