A genetic programming-based method for the imaging of
two-dimensional conductors is presented. Geometry is
encoded in this scheme using a tree-shaped chromosome
to represent the Boolean combination of convex polygons
into an arbitrary two-dimensional geometry. The
polygons themselves are encoded as the convex hull of
variable-length lists of points that reside in the
terminal nodes of the tree. A set of genetic operators
is defined for efficiently solving the inverse
scattering problem. Specifically, the encoding scheme
allows for a standard genetic programming crossover
operator, and several mutation operators are designed
in consideration of the encoding scheme. Several
results are presented that demonstrate the method on a
number of different shapes
%0 Journal Article
%1 Wildman:2007:ieeeTAP
%A Wildman, Raymond A.
%A Weile, Daniel S.
%D 2007
%J IEEE Transactions on Antennas and Propagation
%K Boolean algorithms, bodies, chromosome, combination, computational conducting conductors cylinder, electromagnetic electromagnetics, encoding, functions, genetic geometry geometry, inverse problem, programming, reconstruction, scattering scattering, tree-shaped two-dimensional wave
%N 3
%P 629--636
%R 10.1109/TAP.2007.891565
%T Geometry Reconstruction of Conducting Cylinders Using
Genetic Programming
%V 55
%X A genetic programming-based method for the imaging of
two-dimensional conductors is presented. Geometry is
encoded in this scheme using a tree-shaped chromosome
to represent the Boolean combination of convex polygons
into an arbitrary two-dimensional geometry. The
polygons themselves are encoded as the convex hull of
variable-length lists of points that reside in the
terminal nodes of the tree. A set of genetic operators
is defined for efficiently solving the inverse
scattering problem. Specifically, the encoding scheme
allows for a standard genetic programming crossover
operator, and several mutation operators are designed
in consideration of the encoding scheme. Several
results are presented that demonstrate the method on a
number of different shapes
@article{Wildman:2007:ieeeTAP,
abstract = {A genetic programming-based method for the imaging of
two-dimensional conductors is presented. Geometry is
encoded in this scheme using a tree-shaped chromosome
to represent the Boolean combination of convex polygons
into an arbitrary two-dimensional geometry. The
polygons themselves are encoded as the convex hull of
variable-length lists of points that reside in the
terminal nodes of the tree. A set of genetic operators
is defined for efficiently solving the inverse
scattering problem. Specifically, the encoding scheme
allows for a standard genetic programming crossover
operator, and several mutation operators are designed
in consideration of the encoding scheme. Several
results are presented that demonstrate the method on a
number of different shapes},
added-at = {2008-06-19T17:35:00.000+0200},
author = {Wildman, Raymond A. and Weile, Daniel S.},
biburl = {https://www.bibsonomy.org/bibtex/2ab98894603836c853d003d704422eb91/brazovayeye},
doi = {10.1109/TAP.2007.891565},
interhash = {e5b2d49d4984bcc6845ea534eda7537d},
intrahash = {ab98894603836c853d003d704422eb91},
issn = {0018-926X},
journal = {IEEE Transactions on Antennas and Propagation},
keywords = {Boolean algorithms, bodies, chromosome, combination, computational conducting conductors cylinder, electromagnetic electromagnetics, encoding, functions, genetic geometry geometry, inverse problem, programming, reconstruction, scattering scattering, tree-shaped two-dimensional wave},
month = {March},
number = 3,
pages = {629--636},
timestamp = {2008-06-19T17:54:11.000+0200},
title = {Geometry Reconstruction of Conducting Cylinders Using
Genetic Programming},
volume = 55,
year = 2007
}