Comparison of an Enhanced Distorted Born Iterative Method and the Multiplicative-Regularized Contrast Source Inversion method
For 2D transverse magnetic (TM) microwave inversion, multiplicative-regularized contrast source inversion (MR-CSI), and the distorted Born iterative method (DBIM) are compared. The comparison is based on a computational resource analysis, inversion of synthetic data, and inversion of experimentally...
Gespeichert in:
Veröffentlicht in: | IEEE transactions on antennas and propagation 2009-08, Vol.57 (8), p.2341-2351 |
---|---|
Hauptverfasser: | , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | For 2D transverse magnetic (TM) microwave inversion, multiplicative-regularized contrast source inversion (MR-CSI), and the distorted Born iterative method (DBIM) are compared. The comparison is based on a computational resource analysis, inversion of synthetic data, and inversion of experimentally collected data from both the Fresnel and UPC Barcelona data sets. All inversion results are blind, but appropriate physical values for the reconstructed contrast are maintained. The data sets used to test the algorithms vary widely in terms of the background media, antennas, and far/near field considerations. To ensure that the comparison is replicable, an automatic regularization parameter selection method is used for the additive regularization within the DBIM, which utilizes a fast implementation of the L-curve method and the Laplacian regularizer. While not used in the classical DBIM, we introduce an MR term to the DBIM in order to provide comparable results to MR-CSI. The introduction of this MR term requires only slight modifications to the classical DBIM algorithm, and adds little computational complexity. The results show that with the addition of the MR term in the DBIM, the two algorithms provide very similar inversion results, but with the MR-CSI method providing advantages for both computational resources and ease of implementation. |
---|---|
ISSN: | 0018-926X 1558-2221 |
DOI: | 10.1109/TAP.2009.2024478 |