Premium
Image reconstruction of buried multiple conductors by genetic algorithms
Author(s) -
Huang ChungHsin,
Lu HungCheng,
Chiu ChienChing,
Wysocki Tadeusz A.,
Wysocki Beata J.
Publication year - 2008
Publication title -
international journal of imaging systems and technology
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.359
H-Index - 47
eISSN - 1098-1098
pISSN - 0899-9457
DOI - 10.1002/ima.20158
Subject(s) - inverse problem , algorithm , noise (video) , genetic algorithm , boundary (topology) , nonlinear system , gaussian , inverse scattering problem , plane (geometry) , electrical conductor , iterative reconstruction , boundary value problem , computer science , mathematics , mathematical analysis , physics , image (mathematics) , mathematical optimization , geometry , artificial intelligence , quantum mechanics
This paper presents an inverse scattering problem for recovering the shapes of multiple conducting cylinders with the immersed targets in a half‐space by genetic algorithm. Two separate perfectly conducting cylinders of unknown shapes are buried in one half‐space and illuminated by transverse magnetic (TM) plane wave from the other half‐space. Based on the boundary condition and the measured scattered field, a set of nonlinear integral equations are derived, and the electromagnetic imaging problem is reformulated into an optimization problem. The improved steady state genetic algorithm is used to find out the global extreme solution. Numerical results are given to demonstrate the performance of the inverse algorithm. Good reconstruction can be obtained even when the initial guesses are far different from the exact shapes, and then the multiple scattered fields between two conductors are serious. In addition, the effect of Gaussian noise on the reconstruction is investigated. We can find that the effect of noise is negligible for the normalized standard deviations below 0.01. © 2008 Wiley Periodicals, Inc. Int J Imaging Syst Technol, 18, 276–281, 2008; Published online in Wiley InterScience (www.interscience.wiley.com).