Corpus ID: 235694168

Learned Global Optimization for Inverse Scattering Problems - Matching Global Search with Computational Efficiency

  title={Learned Global Optimization for Inverse Scattering Problems - Matching Global Search with Computational Efficiency},
  author={Marco Salucci and Lorenzo Poli and Paolo Rocca and Andrea Massa},
The computationally-efficient solution of fully non-linear microwave inverse scattering problems (ISPs) is addressed. An innovative System-by-Design (SbD) based method is proposed to enable, for the first time to the best of the authors’ knowledge, an effective, robust, and time-efficient exploitation of an evolutionary algorithm (EA) to perform the global minimization of the data-mismatch cost function. According to the SbD paradigm as suitably applied to ISPs, the proposed approach founds on… Expand


Evolutionary optimization as applied to inverse scattering problems
This review is aimed at presenting an overview of evolutionary algorithms (EAs) as applied to the solution of inverse scattering problems. The focus of this work is on the use of differentExpand
An FFT Twofold Subspace-Based Optimization Method for Solving Electromagnetic Inverse Scattering Problems
A fast Fourier transform (FFT) twofold subspace- based optimization method (TSOM) is proposed to solve electromagnetic inverse scattering problems. As mentioned in the original TSOM (Y. Zhong, et al,Expand
Advanced multi-frequency GPR data processing for non-linear deterministic imaging
An innovative multi-frequency (MF) fully non-linear inverse scattering (IS) technique exploiting the integration of a conjugate-gradient (CG) solver within the iterative multi-scaling approach (IMSA) is proposed. Expand
Twofold subspace-based optimization method for solving inverse scattering problems
In this paper, we propose a twofold subspace-based optimization method to tackle the problem of determining the dielectric profile of extended scatterers. Based on the recently reportedExpand
An Improved Deep Learning Scheme for Solving 2-D and 3-D Inverse Scattering Problems
A new scheme, named the modified contrast scheme (MCS), is proposed to tackle nonlinear inverse scattering problems (ISPs), which is able to alleviate the global nonlinearity in original ISPs without decreasing the accuracy of the problem formulation. Expand
Subspace-Based Optimization Method for Solving Inverse-Scattering Problems
  • Xudong Chen
  • Computer Science, Mathematics
  • IEEE Transactions on Geoscience and Remote Sensing
  • 2010
A modified version of the subspace-based optimization method for solving inverse-scattering problems is found to share several properties with the contrast-source-inversion method, which significantly speeds up the convergence of the algorithm. Expand
Three-Dimensional Microwave Imaging Problems Solved Through an Efficient Multiscaling Particle Swarm Optimization
An enhanced multistep strategy based on a multiresolution particle swarm optimizer is proposed for 3-D microwave imaging to improve the convergence capabilities and to reduce the dimension of the search space and the computational burden of the optimization strategy, thanks to a constrained control of the particle velocities adaptively determined. Expand
Multifrequency Particle Swarm Optimization for Enhanced Multiresolution GPR Microwave Imaging
An innovative inverse scattering technique for the simultaneous processing of multifrequency (MF) ground-penetrating radar (GPR) measurements is proposed and both numerical and experimental test cases are reported to assess the reliability of the MF-IMSA-PSO method toward accurate GPR tomography. Expand
On the Design of Complex EM Devices and Systems through the System-by-Design Paradigm - A Framework for Dealing with the Computational Complexity
The System-by-Design (SbD) is an emerging engineering framework for the optimization-driven design of complex electromagnetic (EM) devices and systems. More specifically, the computational complexityExpand
Differential Evolution as Applied to Electromagnetics
In electromagnetics, optimization problems generally require high computational resources and involve a large number of unknowns. They are usually characterized by non-convex functionals andExpand