Greedy search and a hybrid local optimization/genetic algorithm for tree-based inverse scattering
✍ Scribed by Raymond A. Wildman; Daniel S. Weile
- Publisher
- John Wiley and Sons
- Year
- 2008
- Tongue
- English
- Weight
- 191 KB
- Volume
- 50
- Category
- Article
- ISSN
- 0895-2477
No coin nor oath required. For personal study only.
✦ Synopsis
Abstract
A genetic programming‐based geometry optimization method for inverse scattering that uses a tree data structure to encode Boolean combinations of convex shapes has recently been shown to outperform other genetic algorithm‐based techniques. Nonetheless, the genetic algorithms are still inefficient for inverse scattering. This letter treats the inefficiency with local search techniques. First, an implementation using greedy search is discussed. Next, a local search method is added to the genetic algorithm used in the previous approach. Numerical results show that the number of function evaluations necessary to image conducting cylinders can be reduced by several orders of magnitude. © 2008 Wiley Periodicals, Inc. Microwave Opt Technol Lett 50: 822–825, 2008; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/mop.23222