Machine Learning Based Forward Solver: An Automatic Framework in gprMax

11/23/2021
by   Utsav Akhaury, et al.
0

General full-wave electromagnetic solvers, such as those utilizing the finite-difference time-domain (FDTD) method, are computationally demanding for simulating practical GPR problems. We explore the performance of a near-real-time, forward modeling approach for GPR that is based on a machine learning (ML) architecture. To ease the process, we have developed a framework that is capable of generating these ML-based forward solvers automatically. The framework uses an innovative training method that combines a predictive dimensionality reduction technique and a large data set of modeled GPR responses from our FDTD simulation software, gprMax. The forward solver is parameterized for a specific GPR application, but the framework can be extended in a straightforward manner to different electromagnetic problems.

READ FULL TEXT
research
05/31/2019

GENO -- GENeric Optimization for Classical Machine Learning

Although optimization is the longstanding algorithmic backbone of machin...
research
11/06/2019

Unfairness towards subjective opinions in Machine Learning

Despite the high interest for Machine Learning (ML) in academia and indu...
research
05/09/2021

Opening the Blackbox: Accelerating Neural Differential Equations by Regularizing Internal Solver Heuristics

Democratization of machine learning requires architectures that automati...
research
11/04/2021

Predictive Machine Learning of Objective Boundaries for Solving COPs

Solving Constraint Optimization Problems (COPs) can be dramatically simp...
research
06/22/2023

In Situ Framework for Coupling Simulation and Machine Learning with Application to CFD

Recent years have seen many successful applications of machine learning ...
research
11/23/2021

Deep learning-based fast solver of the shallow water equations

Fast and reliable prediction of river flow velocities is important in ma...
research
09/30/2020

Machine Learning in Airline Crew Pairing to Construct Initial Clusters for Dynamic Constraint Aggregation

The crew pairing problem (CPP) is generally modelled as a set partitioni...

Please sign up or login with your details

Forgot password? Click here to reset