h-convergence 中文意思是什麼

h-convergence 解釋
收斂
  • h : = 【電學】 henry; 【化學】 hydrogen; 【物理學】磁場密度 （intensity of magnetic field） 地磁水平...
  • convergence : n. 1. 聚合，會聚，輻輳，匯合。2. 集合點；【數、物】收斂；【生物學】趨同（現象）。
  1. Using cross - validation to select h as hn *. under proper conditions, this paper gives the bounds of hn *, and the convergence rate and the weak consistency of g ( t )

    ） ，在一定的正則性條件下，給出了（ ? ）的上下界估計和g （ t ）的估計的收斂速度。
  2. The main contributions of this dissertation are summarized as follow : ( 1 ) an ilc approach combining feedforward with current feedback is developed based on optimal feedback control and the gradient method. a sufficient condition that guarantees the convergences is given for linear system. the procedures of designing the algorithm can employ lqr, h2 or h approaches to improve the convergence rate of learning in iterations

    本文的主要成果有： 1 、在開閉環綜合迭代學習控制結構的基礎上，分析了利用梯度下降法設計前饋迭代學習控制器時，為保證演算法的收斂性，閉環控制系統應該滿足的充分條件，並依據提高演算法收斂速率的優化條件，給出了基於lqr 、 h _ 2和h等優化控制技術的迭代學習控制演算法的設計方法。
  3. 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 ）基於光線跟蹤的演算法，該演算法中所有通過輪廓頂點的光線和對應其它圖像輪廓的光錐進行求交計算，最後得到每次求交計算得到線段的交集，該線段的頂點就認為是物體表面點，從而得到物體表面的點雲。
  4. Discussion and testifying were made to the convergence of the algorithm under the condition of having constrains in objects " outputs. one new algorithm, which can maintain the convergent speed under such constraint conditions, was presented. using iterative learning control in real job of industrial robotic manipulators, we h

    本文對對象輸出有限制情況下迭代學習演算法的收斂性做了討論和證明，並且提出了一種在這種情況下，能相對維持收斂速率的迭代學習律的改進策略。
分享友人
分享到 Line

分享到臉書