A Fast Proximal Gradient Algorithm to Solve Electromagnetic Inverse Scattering Problems

Up until now, many methods have been applied in electromagnetic inverse scattering problems (ISPs). In this paper, we propose three methods to solve it using the proximal gradient algorithm (PGA) based on the Born approximation. The numerical results validate that the PGA with subspace Born iterativ...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:2019 Computing, Communications and IoT Applications (ComComAp) s. 402 - 404
Hlavní autoři: Ma, Zhenchao, Xu, Kuiwen
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 01.10.2019
Témata:
Born approximation
Born iterative approximation
inverse scattering problems (ISPs)
proximal gradient algorithm (PGA)
subspace Born iterative approximation
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Up until now, many methods have been applied in electromagnetic inverse scattering problems (ISPs). In this paper, we propose three methods to solve it using the proximal gradient algorithm (PGA) based on the Born approximation. The numerical results validate that the PGA with subspace Born iterative approximation does well in retrieving the unknown scatterers and the retrieval value is more accurate comparing to the PGA with Born approximation and Born iterative approximation.
DOI:10.1109/ComComAp46287.2019.9018664