Fast and Robust Inverse Scattering Algorithm

摘要

It is well known that the inverse scattering problem is usually computationally demanding, characterized by (1) slow convergence rate; (2) possibility of convergence to a local optimum instead of the global minimum; (3) instability in the presence of noise. The common way of solving an inverse scattering problem is to cast the problem into an optimization problem where the objective is to minimize the mismatch between the measured scattered field and the calculated scattered field. During the project, five important contributions have been documented: (1) Proposed improved version of the Subspace-based Optimization Method (SOM) to solve general inverse scattering problems. (2) Applied frequency hopping technique in one-sided transmitter/receiver inverse scattering problems. (3) Efficiently located small scatterers are embedded in inhomogeneous background, such as through-wall- imaging. (4) Reconstructed large scatterers embedded in inhomogeneous background. (5) Reconstructed scatterers using only the magnitude of wave information (i.e., the phase information is not available).