Inverse problem of a buried metallic object

機構典藏 > College of Engineering > Graduate Institute & Department of Electrical Engineering > Proceeding > Item 987654321/80812

Please use this identifier to cite or link to this item: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/80812

Title:	Inverse problem of a buried metallic object
Authors:	Chien, Wei;HuangChung-Hsin;Lin, Chun Jen;Chiu, Chien-Ching
Contributors:	淡江大學電機工程學系
Date:	2005
Issue Date:	2013-03-07 14:01:06 (UTC+8)
Publisher:	New York: Institute of Electrical and Electronics Engineers (IEEE)
Abstract:	In this paper we address an inverse scattering problem whose aim is to discuss the CPU time for recovering a perfectly conducting cylindrical object buried in a half-space. First, we use Fourier-series or cubic-spline methods to describe the shape and reformulate the inverse problem into an optimization one. Then we solved it by the improved steady state genetic algorithm (SSGA) and simple genetic algorithm (SGA) respectively and compare the cost time in finding out the global extreme solution of the objective function. It is found the searching ability of SSGA is much powerful than that of the SGA. Even when the initial guess is far away from the exact one, the cost time for converging to a global extreme solution using by SSGA is much less than that by SGA. Numerical results are given to show that the inverse problem by using SSGA is much better than SGA in time costing.
Relation:	Microwave Conference, 2005 European, pp.4
DOI:	10.1109/EUMC.2005.1610041
Appears in Collections:	[Graduate Institute & Department of Electrical Engineering] Proceeding

Files in This Item:

File	Description	Size	Format
index.html		0Kb	HTML	238	View/Open
Inverse Problem of a Buried Metallic Object.pdf		192Kb	Adobe PDF	268	View/Open