最速下降演算法 的英文怎麼說

中文拼音 [zuìsùxiàjiàngyǎnsuànfǎ]
最速下降演算法 英文
steepest descent algorithm
  • 最 : 副詞（表示某種屬性超過所有同類的人或事物） most; best; worst; first; very; least; above all; -est
  • 速 : Ⅰ形容詞（迅速; 快） fast; rapid; quick; speedy Ⅱ名詞1 （速度） speed; velocity 2 （姓氏） a surna...
  • 下 : 下動詞1. （用在動詞后,表示由高處到低處） 2. （用在動詞后, 表示有空間, 能容納） 3. （用在動詞后, 表示動作的完成或結果）
  • 降 : 降動詞1. （投降） surrender; capitulate 2. （降伏） subdue; vanquish; tame
  • 演 : 動詞1 （演變; 演化） develop; evolve 2 （發揮） deduce; elaborate 3 （依照程式練習或計算） drill;...
  • 算 : Ⅰ動詞1 （計算數目） calculate; reckon; compute; figure 2 （計算進去） include; count 3 （謀劃;計...
  • 法 : Ⅰ名詞1 （由國家制定或認可的行為規則的總稱） law 2 （方法; 方式） way; method; mode; means 3 （標...
  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. In the next chapter, the two dimensional fipwa especially the modified steepest decent path ( msdp ) in angular complex plane and the interpolate / extrapolate technique have been carefully studied

    接著，重點研究了二維快速非均勻平面波演算法，對其復平面上的修正最陡下降路徑及內插外推技術進行了深入研究。
  3. The hybrid algorithm raises the convergence rate of the conjugate gradient method and solves the problem for which the convergence rate of the steepest descent method get slower when the isopleth of goal function is oblong

    這種混合優化演算法結合了共扼梯度法和最速下降法產生搜索方向，既提高了共扼梯度演算法的收斂速度，又解決了目標函數的等值線是扁長橢球時，最速下降法下降緩慢的問題，具有收斂速度快、收斂范圍大、適應面廣等特點。
  4. Experiments show that the efficient motion estimation algorithm proposed can further reduce block matching distortion computations relative to conventional fast motion estimation algorithms with neglectable coding efficiency loss ( within 0. 1db )

    提出一種基於節點模型的可變形塊匹配運動估計演算法來搜索最佳運動矢量。實驗表明，在編碼性能損失很小的條件下，可以使得運動搜索塊匹配的運算量在通常快速運動搜索演算法的基礎上下降61 % 。
  5. According to the least twin multiplication to calculating the sensitivity index in several water production functions. thus, the writer obtains the fitted the value of the sensitivity index and the varied rule. at the same time, the writer puts forward a new method named rag a ( real coding based accelerating genetic algorithm ) and combines raga with dpsa to calculating the best irrigation system under the non - sufficient irrigation of well irrigation rice in sanjiang plain

    根據《隨機水文學》理論中的時間序列分析法，建立了適合三江平原井灌水稻需水量預報的非平穩時序隨機模型；通過分析降雨隨機特性，選定季節性時序隨機模型，建立了適合三江平原井灌水稻降雨預報的月平均降雨模型；根據最小二乘法，計算出幾種常用水分生產函數中的敏感指數及敏感系數，進而得到三江平原適宜採用的水分生產函數漠型及模型中敏感指數的變化規律；本文提出遺傳動態規劃法（ raga ? dp ） ，即採用改進的基於實數編碼的加速遺傳演算法（ realcodingbasedacceleratinggeneticalgorithm ，簡稱raga ）與動態規劃法（ dpsa ）相結合，推求非充分灌溉條件下三江平原井灌水稻的最優灌溉制度。
  6. Compared with the classical bp algorithm, robust adaptive bp algorithm possesses some advantages as following : ( 1 ) increasing the accuracy of the network training by means of using both the relative and absolute residual to adjust the weight values ; ( 2 ) improve the robustness and the network convergence rate through combining with the robust statistic technique by way of judging the values of the samples " relative residual to establish the energy function so that can suppress the effect on network training because of the samples with high noise disturbances ; ( 3 ) prevent entrapping into the local minima area and obtain the global optimal result owing to setting the learning rate to be the function of the errors and the error gradients when network is trained. the learning rate of the weights update change with the error values of the network adaptively so that can easily get rid of the disadvantage of the classical bp algorithm that is liable to entrap into the local minima areas

    與基本bp演算法相比，本文提出的魯棒自適應bp演算法具有以下優點： （ 1 ）與魯棒統計技術相結合，通過訓練樣本相對偏差的大小，確定不同訓練樣本對能量函數的貢獻，來抑制含高噪聲干擾樣本對網路訓練的不良影響，從而增強訓練的魯棒性，提高網路訓練的收斂速度； （ 2 ）採用相對偏差和絕對偏差兩種偏差形式對權值進行調整，提高了網路的訓練精度； （ 3 ）在採用梯度下降演算法對權值進行調整的基礎上，通過將學習速率設為訓練誤差及誤差梯度的特殊函數，使學習速率依賴于網路訓練時誤差瞬時的變化而自適應的改變，從而可以克服基本bp演算法容易陷入局部極小區域的弊端，使訓練過程能夠很快的「跳出」局部極小區域而達到全局最優。
  7. To simulate and emulate the image processing algorithms in software and hardware, the universal image processing platforms of software and hardwar e have been built. as a result, the realization process of infrared image processing is decomposed to serials of subprocesses including algorithms research, software simulation, hardware emulation, and transfer to target system, thus reduces the difficult of development, lessens the risk of investment, speeds the development, and provides a good basis to future works

    為了對圖象處理演算法進行軟硬體的模擬和模擬，分別搭建了圖象處理軟硬體通用平臺，從而將紅外圖象處理實現分解成：演算法研究，軟體模擬，硬體模擬，最後移植到目標系統等一系列過程，降低了開發難度，減少了投資風險，並加快了開發速度，為今後的后續工作打下了良好的基礎。
  8. Anfis based on takagi and sugeno ' s fuzzy model has the advantage of being linear - in - parameter ; thus the conventional adaptive methods can be efficiently utilized to estimate its parameters

    由於節點參數是線性的，用梯度下降和最小二乘的混合學習演算法來調節參數，減少了運算量，加快了收斂速度。
  9. Simple genetic algorithm gets local minimization too easily and converges slowly. to solve these problems, adaptive crossover rate that has reverse hyperbolic rel ation with the numbers of iteration is designed, and adaptive mutation rate that has reverse proportion to the distances of parents and reverse exponential relat ion to the numbers of iteration is put forward. the practical simulation results show that the adaptive ga has greater convergence speed and larger probability o f getting the best solution

    簡單遺傳演算法存在著收斂速度慢、易陷入局部極小等缺陷.針對這些缺陷，本文設計出隨相對遺傳代數呈雙曲線下降的自適應交換率，並提出與父串間的相對歐氏距離成反比、隨相對遺傳代數指數下降的自適應變異率.實例驗證表明，具有自適應交換率和變異率的遺傳演算法在收斂速度和獲得全局最優解的概率兩個方面都有很大的提高
  10. Firstly, based on conventional vq, a fast algorithm named equal - sum block - extending nearest neighbor search ( ebnns ) is presented, which not only can achieve the reconstructed image of full search algorithm but also can greatly reduce both the codeword search ratio and chip area. in order to improve coding efficiency, a new algorithm called correlation - inheritance coding is proposed, which is embedded in conventional vq system to improve compression ratio by re - encoding the indexes

    首先，在普通矢量量化基礎上提出了等和值塊擴展最近鄰快速碼字搜索演算法（ ebnns ） ，該演算法在圖像畫質達到窮盡搜索演算法的前提下，大大降低了碼字搜索率和硬體實現面積；為了提高編碼效率，在相關性編碼方面，提出了相關繼承編碼演算法，對普通矢量量化后的編碼索引進行無損重編碼。
  11. The series of point group calculated by this algorithm theory is strictly descending and converging to the stable polar point. this theory is very efficiency in solving the problem of lad for its simplicity 、 rapid speed and high adaptability

    本文演算法所產生的點組序列是嚴格下降並收斂于穩定極點的，我們的計算表明，本演算法對求解超定最小一乘估計問題非常有效，具有演算法簡單、速度快、適應性強的特點。
  12. 3 a novel recursive least - square ( rls ) blind space - time receiver algorithm based on the constrained condition, which can completely avoid the matrix inversion introduced into by constraints ( comparing with the normal rls ), is proposed for multi - path slow fading cdma channels. the computational complexity of this method is not only lower than that of the normal rls, but also lower than that of both lms and ls blind space - time receiver methods that are realized based on the rosen ' s gradient projection. and the speed of convergence of the presented rls blind space - time receiver algorithm is better than that of both lms and ls blind space - time receiver methods

    3 、針對多徑慢衰落通道下ds - cdma盲空時接收機中線性約束二次規劃問題提出一種新的遞歸最小二乘演算法，該演算法完全避免因約束而引進的矩陣求逆運算（相對于常規的遞歸最小二乘演算法） ，不但運算量比常規的要低，而且比基於rosen梯度投影實現的最小均方（ lms ）與最小二乘盲空時接收機演算法還低，且收斂速度比基於rosen梯度投影實現的最小均方（ lms ）與最小二乘盲空時多用戶檢測都好，將提出的新的遞歸最小二乘演算法與提出的數據選擇方案結合起來可以進一步降低其運算量，具有很大的實用價值，最後通過模擬實驗進一步分析了其性能。
  13. The fipwa based on electric integral equation ( efie ) is presented firstly, the green ’ s function expansion with sommerfeld identity ( based on bessel kernel ) is studied and the msdp for two cases is formulated. in order to improve the iteration property and avoid inner resonance, the combined field integral equation ( cfie ) fipwa is then constructed successfully

    首先研究了基於電場積分方程的快速非均勻平面波演算法，對索末菲恆等式（基於貝塞爾積分核）展開的格林函數進行了深入研究，分兩種情形解決了修正最陡下降路徑的設計問題。
  14. In this paper, i will present some algorithms of polyhedral visual hull reconstruction : ( 1 ) polyhedral v isual h ull generation a igorithm b ased one dge - pool - searching, which constrains the 3 - d intersections into the 2 - d planes intersection via the epipolar theory to reduce the complexity a nd c an r educe t he t imes f or c ones t o b e p rejected o nto t he i mage p lanes, i n which we induced the index list to every points on the surface of object, and connected the related points to get sub polygons on surface and in turn get the mesh model, we replace triangulation process of disordered points cloud by edge - pool searching. ; ( 2 ) reconstruction based on degenerated - polygon - intersection, which have the following improvements on traditional bull intersection : using degenerated polygon to orga nize intersected area on cone face, which may be discontinuous ; a fast intersection algorithm of polygons on the cone face based on degenerated polygons, which is consistent between the continuous polygons and the discontinuous ones. the intersection of degenerated polygons is similar to the convergence of two ordered lists, which is comparably simple to the bull operation ; ( 3 ) reconstruction algorithm based on ray - tracing, in which all the rays that run through the vertex on silhouette of object will intersect with all the cones correspondent to other silhouette, and we have to calculate the intersection of all such line segments, the endpoints of which are considered to lie on the surface of object and we will get the point cloud on the surface of object

    同時利用共極線原理把三維計算投影到二維平面以降低求交計算的復雜度，該演算法可以減少光錐向圖像平面投影計算的次數，以邊池搜索取代散亂點集上進行的三角剖分； （ 2 ）基於退化多邊形求交的多面體可見殼模型重構，系統引入退化多邊形的概念，把錐體平面的交集中不連通的部分用一個退化多邊形來表示，並引入了新的基於退化多邊形的求交演算法，與傳統多面體可見殼重構相比，該演算法有以下幾點創新：在圖像平面以退化多邊形組織投影錐體和物體輪廓的交集，把任意錐面與物體輪廓的交集歸一到一個退化多邊形；基於退化多邊形的二維平面上多邊形快速相交演算法，該演算法在一定程度上就是兩個有序鏈表的合併，大大簡化了先前的布爾求交計算； （ 3 ）基於光線跟蹤的演算法，該演算法中所有通過輪廓頂點的光線和對應其它圖像輪廓的光錐進行求交計算，最後得到每次求交計算得到線段的交集，該線段的頂點就認為是物體表面點，從而得到物體表面的點雲。
  15. These weights are used as initialized weights, and then, the steepest descent approach is introduced for training the networks

    將這些權值作為初始權值，採用最速下降演算法來對神經網路進行訓練。
  16. Based on the steepest descent method and the conjugate gradient method, a hybrid algorithm is proposed in this paper, and its global convergence is proved

    摘要將最速下降法與共扼梯度法有機結合起來，構造出一種混合優化演算法，並證明其全局收斂性。
  17. This paper researches blind equalization ruler, analyses the knowledge of hos and summarizes some algorithms based on the hos. odd - order ( third - second order and fifth - second order ) normalized cumulant algorithms are introduced and a new blind equalization ruler is proved and introduced after researching even - order normalized cumulant algorithms. then the steepest descent method is used to derive the algorithm

    在分析偶數階歸一化累積量演算法的基礎上，提出了奇數階（三、二階和五、二階）歸一化累積量演算法，論證並推導出一種新的盲均衡準則，最後利用最速下降法形成了新演算法。
  18. A practical way to overcome this difficulty is to use the so - called " natural level function " as the merit function instead of the general level function

    此時newton方向是自然水平函數的最速下降方向。因此，利用自然水平函數進行搜索，可以增大演算法的步長，達到提高演算法效率的目的。
  19. Second, for vector sequence coming from the steep - descent method, we use extrapolation method for the sequence and get some applied algorithms. we also give theoretical proofs for this algorithms. many numerical experiments tell us that the new algorithms sometimes can save 80 % computation

    其次，對求解非線性優化問題的最簡潔的最速下降方法產生的迭代序列，運用向量序列加速收斂手段進行了討論，導出了一些實用的加速演算法，並從理論上證明快速演算法的有效性，眾多數值試驗進一步表明：加速收斂的方法相比較加速前幾乎都能夠節約80以上的計算量。
分享友人
分享到 Line

分享到臉書