English  |  正體中文  |  简体中文  |  Items with full text/Total items : 60976/93528 (65%)
Visitors : 1562435      Online Users : 26
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    Please use this identifier to cite or link to this item: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/35796

    Title: 二維導體逆散射問題之最佳化研究
    Other Titles: The optimization of inverse problems for two-dimensional conductors
    Authors: 錢威;Chien, Wei
    Contributors: 淡江大學電機工程學系博士班
    丘建青;Chiu, Chien-ching
    Keywords: 基因法則;三次方仿樣函數;傅立葉級數;Genetic Algorithm;Cubic Spline;Fourier series
    Date: 2006
    Issue Date: 2010-01-11 07:10:34 (UTC+8)
    Abstract: 本論文就柱型導體逆散射問題做了三個面向的探討。
    對於逆散射部分,我們引進了基因法則(genetic algorithm)。利用基因
    第二個部分,藉由傳統的Fourier series 以及cubic-spline 描述
    建的適用性,實驗顯示,利用Fourier series 描述複雜形狀往往造成無
    法得到收斂解,cubic-spline 的描述方式則可在較少的變數個數,獲得
    第三個部分,藉由使用改良的基因法則(NU-SSGA)與傳統GA 比較,
    NU-SSGA 可藉由大幅減少計算正散射的次數,獲取遠優於傳統GA 的效
    結果顯示,利用NU-SSGA 求解可獲得大幅改善。
    The thesis presents three related aspects of computational approach to
    the imaging of a conducting cylinder. In the first one, an imperfect
    conducting cylinder of unknown shape and variable conductivity is
    considered. Two different cases of inverse problem in free space and half
    space have done respectively. In the second one, cubic-spline method and
    trigonometric series for shape description are used and compared in several
    different situations (half space, partially immersed, slab medium, and
    periodic conductor in free space). In the third one, the inverse scattering
    problem is addressed to discuss the CPU time for reconstructing a perfectly
    conducting cylinder for two different cases (half space and slab medium). It
    is solved by the improved Steady State Genetic Algorithm (SSGA) and
    Simple Genetic Algorithm (SGA) and the consuming time in finding out the
    global extreme solution of the objective function is compared. Based on the
    boundary conditions and the measured scattered field, a set of nonlinear
    integral equations is derived and the imaging problem is reformulated into an
    optimization problem. In the first one, the genetic algorithm is employed to
    find out the global extreme solution of the objective function. Numerical
    results demonstrate that, even when the initial guess is far away from the
    exact one, a good reconstruction has been obtained. In the second one, the
    shape of the scatterer described by using cubic-spline method can be
    reconstructed. In such case, Fourier series expansion will fail. Numerical
    results show that the shape description by using cubic-spline method is much
    better than that Fourier series. In the third one, it is found that the searching
    ability of SSGA is much powerful than that of the SGA. The consuming time
    for converging to a global extreme solution by using SSGA is much less than
    that SGA. Numerical results show that the image reconstruction problem by
    using SSGA is much better than by SGA in time consuming.
    Appears in Collections:[電機工程學系暨研究所] 學位論文

    Files in This Item:

    File SizeFormat

    All items in 機構典藏 are protected by copyright, with all rights reserved.

    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library & TKU Library IR teams. Copyright ©   - Feedback