2006
DOI: 10.1163/156939306779292264
|View full text |Cite
|
Sign up to set email alerts
|

Microwave Imaging 3-D Buried Objects Using Parallel Genetic Algorithm Combined With FDTD Technique

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
48
0

Year Published

2007
2007
2021
2021

Publication Types

Select...
7
2

Relationship

0
9

Authors

Journals

citations
Cited by 58 publications
(48 citation statements)
references
References 18 publications
0
48
0
Order By: Relevance
“…The equations (1)- (5) can be numerically solved by the well-known finite-difference time-domain (FDTD) method [14][15][16].…”
Section: Model and Theorymentioning
confidence: 99%
“…The equations (1)- (5) can be numerically solved by the well-known finite-difference time-domain (FDTD) method [14][15][16].…”
Section: Model and Theorymentioning
confidence: 99%
“…In the past twenty years, the inversion techniques are developed intensively for the microwave imaging both in frequency domain and time domain [3][4][5][6][7][8][9][10][11][12][13][14][15][16]. Most of the inversion techniques are investigated for the inverse problem using only single frequency scattering data (monochromatic source) [3][4][5].…”
Section: Introductionmentioning
confidence: 99%
“…However, the time domain scattering data is important for the inverse problem because the available information content about scatterer is more than the only single frequency scattering data. Therefore, various time domain inversion approaches are proposed [12][13][14][15][16][17][18][19][20][21][22][23][24][25] that could be briefly classified as the layer-stripping approach [12], the iterative approach: Born iterative method (BIM) [13][14][15], the distorted Born iterative method (DBIM) [16], Local Shape Function (LSF) [17] and optimization approach [18][19][20][21]. Traditional iterative inverse algorithms are founded on a functional minimization via some gradient-type scheme.…”
Section: Introductionmentioning
confidence: 99%
“…In general, during the search of the global minimum, they tend to get trapped in local minima when the initial guess is far from the exact one. Some global optimal searching method such as genetic algorithm [22][23][24], neural network [25], have be proposed to search the global extreme of the nonlinear functional problem. In the 1995, the Kennnedy and Eberhart first proposed the particle swarm optimization (PSO) [30].…”
Section: Introductionmentioning
confidence: 99%