A computational geometry method for the inverse scattering problem

07/23/2018
by   Maria L. Daza-Torres, et al.
0

In this paper we demonstrate a computational method to solve the inverse scattering problem for a star-shaped, smooth, penetrable obstacle in 2D. Our method is based on classical ideas from computational geometry. First, we approximate the support of a scatterer by a point cloud. Secondly, we use the Bayesian paradigm to model the joint conditional probability distribution of the non-convex hull of the point cloud and the constant refractive index of the scatterer given near field data. Of note, we use the non-convex hull of the point cloud as spline control points to evaluate, on a finer mesh, the volume potential arising in the integral equation formulation of the direct problem. Finally, in order to sample the arising posterior distribution, we propose a probability transition kernel that commutes with affine transformations of space. Our findings indicate that our method is reliable to retrieve the support and constant refractive index of the scatterer simultaneously. Indeed, our sampling method is robust to estimate a quantity of interest such as the area of the scatterer. We conclude pointing out a series of generalizations of our method.

READ FULL TEXT
research
01/11/2021

A Bayesian level set method for an inverse medium scattering problem in acoustics

In this work, we are interested in the determination of the shape of the...
research
08/04/2022

IT/IST/IPLeiria Response to the Call for Proposals on JPEG Pleno Point Cloud Coding

This document describes a deep learning-based point cloud geometry codec...
research
08/18/2022

An Adjustable Farthest Point Sampling Method for Approximately-sorted Point Cloud Data

Sampling is an essential part of raw point cloud data processing such as...
research
01/05/2022

Towards Uniform Point Distribution in Feature-preserving Point Cloud Filtering

As a popular representation of 3D data, point cloud may contain noise an...
research
11/28/2019

Region segmentation via deep learning and convex optimization

In this paper, we propose a method to segment regions in three-dimension...
research
11/05/2019

Computational Separations between Sampling and Optimization

Two commonly arising computational tasks in Bayesian learning are Optimi...
research
03/22/2020

Efficient Clustering for Stretched Mixtures: Landscape and Optimality

This paper considers a canonical clustering problem where one receives u...

Please sign up or login with your details

Forgot password? Click here to reset