迭代搜索法 的英文怎麼說

中文拼音 [diědàisōusuǒ]
迭代搜索法 英文
iterative search method
  • : Ⅰ動詞(輪流; 替換) alternate; change Ⅱ副詞1 (屢次) repeatedly; again and again 2 (及) in tim...
  • : Ⅰ動詞1 (代替) take the place of; be in place of 2 (代理) act on behalf of; acting Ⅱ名詞1 (歷...
  • : 動詞1. (尋找) collect; gather2. (搜查) search; ransack
  • : Ⅰ名詞1 (大繩子; 大鏈子) a large rope 2 (姓氏) a surname Ⅱ動詞1 (搜尋; 尋找) search 2 (要; ...
  • : Ⅰ名詞1 (由國家制定或認可的行為規則的總稱) law 2 (方法; 方式) way; method; mode; means 3 (標...
  • 搜索 : 1 (仔細尋找) search for; ferret about; hunt for; scout around 2 [電子學] hunting; scan; [控] in...
  1. The procedure functions in the compare between partial image of dynamic collection and corresponding image of the airscape. in chapter 5, basing on the analysis of correlative theory of digital image, we introduce the improved fasted - down algorithm and simulative anneal algorithm, which applies to nn calculation, an d bring forward the unique and effective means, correlative original value evaluation. basing on the combination of correlative arithmetic, a stable, high - speed and exact correlative arithmetic is formed, which makes it possible to apply computer vision detection of single - needle quilting in industrial production

    本文展開研究並取得一定成效:構建了基於pci總線的微機實時圖像採集系統;在採集的布料總圖(鳥瞰圖)的基礎上,通過數字圖像的數字濾波、圖像增強、邊緣檢測等處理,提取布料圖像的邊緣,對輪廓的矢量化的象素點進行,得到相應的圖案矢量圖,從而確定絎縫的加工軌跡,生成加工指令;在進給加工過程中,主計算機對動態局部圖像與總圖(鳥瞰圖)的對應部分進行圖像相關的匹配計算,應用數字圖像理論,結合神經網路計算的改進最速下降和模擬退火演算,提出獨特而有效的相關初始值賦值方,形成穩定、高速和準確的相關運算,實現單針絎縫視覺測量和自動控制。
  2. Thirdly, from the idea of locally linear approximate, another tangent - plane algorithm is presented for the distance between the convex nurbs surfaces. the critical step is the construction of the support mapping by gjk and lc to search for nearest points, and emphases are laid on dealing with isotropic cases and choosing initial iterated points. it is also proved that no isotropism during iteration would take place if initial iterated points are positive points

    切平面是運用gjk和lc構造支撐映射的原理而設計的一個近點對的,著重給出了迷向情況的處理和初始點的選取方,並證明了只要將初始點取為陽點,就不會出現迷向情況。
  3. By reformulating the kkt system as a constrained equation, the algorithm generates the search direction by solving a linear equation at each iteration

    通過將問題的kkt系統轉化成一個約束方程,演算在每步只需解一個線性方程組即可得到方向。
  4. It can save the information near lips, which may be deleted by the method based on two points. ( 2 ) based on the analysis of current methods, a new multi - pose facial feature location algorithm is developed, which is based on the analysis of multi - feature and integral projection, the combination of an iterative search with a confidence function and template matching. the algorithm not only improves the location accuracy, but also speeds up a great deal. ( 3 ) based on the analysis of the advantages and disadvantages of current feature extraction methods, an adaptive facial feature selection criterion is developed, which is based on facial local feature protrusion consisting of several aspects, such as face image resolution and image quality

    其後研究了人臉特徵提取,一、討論了適合於多姿態人臉識別的基於三點仿射變換的人臉圖像歸一化方,以克服基於兩點仿射變換會引起較大圖像信息損失的缺陷;二、在分析現有器官定位演算的基礎上,提出了新多姿態人臉器官特徵定位技術,將多特徵和直方圖分析、基於置信度函數的和模板匹配相結合,既提高了器官定位精度,又提高了定位速度。
  5. The three kinds of construction graph can be applied to optimization problems with different characteristics, and the two kinds of layered construction graph are more suitable for complex multi - stage dynamic decision problems ( cmsddp ) than scg. the clcg defines smaller solution building blocks and is able to perform better in large - scale cmsddps than the blcg. 2. the construction graph of aco algorithms need statically describe the whole solution space ( or discrete solution spa

    ( 2 )蟻群優化演算的解構造圖一般要靜態地描述整個解空間(或者是離散化了的解空間) ,對于大規劃動態決策問題,不僅存在描述解空間的困難,而且讓蟻群在過程中始終在整個解空間中進行性能會很低。
  6. Genetic algorithm ( ga ) is a set of new - global - optimistic search algorithm repeatedly which simulate the process of creature evolution that of darwinian ' s genetic selection and natural elimination

    遺傳演算是模擬達爾文的遺傳選擇和自然淘汰的生物進化過程的一種新的的全局優化演算,已經廣泛地應用到組合優化問題求解、自適應控制、規劃設計、機器學習和人工生命等領域。
  7. The iterative algorithm of the 3d unstable temperature field which takes the effect of water pipe cooling into account has been studied, and some skills about determining the nodes and elements of water pipes are also given

    研究了考慮水管冷卻效果的不穩定溫度場的演算,給出了確定水管結點、單元信息的沿程技巧。
  8. In order to analysis the contact problem between elasticity roller and rigid plane, another iterative process is raised. supposing the right contact point has been known, the left contact point has to be found and the distribution of stick zone and slip one have to be determined in each iterative process. the outer load is evaluated according to the solved force distribution in contact zone

    針對彈性滾柱與剛性平面的穩態滾動接觸問題,採用已知接觸區右端點來接觸區左端點以及區內粘連區、滑移區分佈的,並根據得到的接觸區內分佈壓力反求出外部載荷。
  9. Here we consider the choice of the parameter as the norm of the gratitude of the function. we prove under the local error bound condition that the levenberg - marquardt method with this parameter converges quadraticlly to a solution of the system of the equations. and we also present two globally convergent levenberg - marquardt algorithms using line search techniques and trust region approach respectively

    我們提出選取參數為當前點處函數梯度的模,在局部誤差界條件下, levenberg - marquardt方依然具有二階收斂性,並考慮了線和信賴域技巧的levenberg - marquardt方,分析了其全局收斂性。
  10. This algorithm allows the search direction with only moderate accuracy, and does not require the feasibility of the iteration points

    該演算允許方向有相對較大的誤差,且不要求點的可行性。
  11. In general trust region method, a trial point is accepted as a new iterate and the procedure is repeated if the true reduction achieved by the objective function at this point is comparable with the reduction predicted by the quadratic model

    考慮到在一般的信賴域方中,當目標函數沿該方向的實際下降量和預計下降量擬合得比較好時,則由該方向得到新的點並調整信賴域半徑。
  12. Aiming at resolving the asynchronous reception problem in the downlink of distributed mimo systems, there exist some detection algorithms such as distributed space time codes and iterative trellis search detection

    針對分佈mimo中上述問題的解決方,目前存在分佈空時分組碼和基於格的檢測演算
  13. The problem of doa ' s estimation of multiple source signals incident on a arbitrary array in the presence of both unknown spatially correlated noise and sensor errors is firstly considered. a modified ml estimation of doa ' s and sensor gain errors is presented. unlike previous work, the proposed method does not impose any structure constraints or parameterization of the signal and noise covariances. the algorithm can be carried out via the alternating projection approach. finally, the performance of the proposed method is shown with computer simulations as well as real array data

    在空間相關色噪聲環境及存在陣列模型誤差情況下,首先給出了基於最大似然的doa及陣列幅相誤差聯合估計演算,該演算對信號和噪聲無任何約束,且適用於任意陣列結構。演算可以利用交替投影實現,計算機模擬實驗和外場實測數據表明,本章演算能給出比傳統的最大似然方更高的估計性能。
  14. The paper puts forward an iterative process to searching for the contacted zone and the distribution of contact force, in the case of the outer loading has been known. the regularization algorithm is used to evaluate the mechanical parameters of the near - boundary points in contact bodies

    列出了運用邊界元解決靜態接觸問題的基本算式,設計了根據已知外部載荷來接觸長度和接觸壓力分佈的,運用幾乎奇異積分的正則化演算,求解了接觸體內近邊界點的力學參量。
  15. In the first part of this paper we present a laser scanning location algorithm based on least square algorithm using landmarks. then successively, we give the principle of the landmarks option and position recovery algorithm. in the end, the work process of algorithm is given

    給出了結構化環境中移動機器人路標閥值匹配演算,對定位演算,本文提出了一種基於最小二乘多路標定位演算,並通過模擬實驗歸納出路標優化選擇的準則,提高了系統的定位精度。
  16. For problems whose objective function or constraint functions have sharp curves on their contour maps ( such as the rosenbrock ' s function which has banana shape contours ), monotonicity may cause a series of very small steps, causing a huge number of iteration to reach their solutions. by using the nonmonotone technique, we get the sequence of successful interative point which should make the objective function mono - tonically decreasing. hence, we use both trust region strategy and line search technique and make each iterate generate an acceptable trial step in interior feasible set as next interative point

    我們利用非單調技術得到使目標函數非單調下降的點,因為非單調克服高度非線性化函數的求解問題,從而避免了只使用單調在「峽谷」現象局部最優解被卡的情況,我們用信賴域策略和非單調線技術相結合的方,使演算產生的步落在可行域內點,同時又在信賴域內滿足接受準則。
  17. In chapter four, problem about parameters of gpc on - line tuning in frame of satisfactory control is researched, and a satisfactory model for multi - parameters on - line tuning is defined, and proposed a formula based on grade conception and one - dimension searching method. it ' s shown that the system ' s performance can be improved by this approach

    對多參數調整優化問題給出了滿意優化模型,並且對由此形成的多變量尋優問題引入了梯度的概念和一維的方給出了該多參數尋優問題求解公式的杜十模糊btai與模糊約柬的浦意優化控制向量形式。
  18. The search algorithm makes use of rewritting rules to get a set of equivalent b _ schemas, utilize the cost model to estimate the cost of each b _ schema and iterative search the min - cost b _ schema

    引入一種演算進行優化處理。該演算利用改寫規則得到一組等價的b _ schema集合,對b _ schema進行價估計、比較,得到價最小的b _ schema 。
  19. A multisensor convex linear statistic fusion modal for optimal interval estimation fusion is established. a gauss - seidel iteration computation method for searching for the fusion weights is suggested. in particular, we suggest convex combination minimum variance fusion that reduces huge computation of fusion and yield approximately optimal estimate performance generally, moreover, may achievers exactly optimal performance in some cases

    建立了一種最優區間估計融合模型? ?多傳感器凸線性組合,並給出最優權系數的gauess - seidel演算,另外,給出了一種近似的區間估計融合? ?凸線性組合的最小方差融合,它能減少大量的計算量。
  20. The executive time of the programs are dramatically shorted by searching the root of the equation and applying the iterative arithmetic

    並用根窮, bch碼的演算對程序進行優化,使程序的執行時間有量級的提高。
分享友人