最快取數程序 的英文怎麼說

中文拼音 [zuìkuàiqǔshǔchéngxù]
最快取數程序 英文
minimal latency routine
  • 最 : 副詞（表示某種屬性超過所有同類的人或事物） most; best; worst; first; very; least; above all; -est
  • 快 : Ⅰ形容詞1 （速度高; 走路、做事等費的時間短） fast; quick; rapid; swift; speedy 2 （趕快; 從速） hu...
  • 取 : Ⅰ動詞1 （拿到身邊） take; get; fetch 2 （得到; 招致） aim at; seek 3 （採取; 選取） adopt; assume...
  • 數 : 數副詞（屢次） frequently; repeatedly
  • 程 : 名詞1 （規章; 法式） rule; regulation 2 （進度; 程序） order; procedure 3 （路途; 一段路） journe...
  • 程序 : 1 （進行次序） order; procedure; course; sequence; schedule; ground rule; routing process 2 [自動...
  1. Topics covered include : sorting ; search trees, heaps, and hashing ; divide - and - conquer ; dynamic programming ; amortized analysis ; graph algorithms ; shortest paths ; network flow ; computational geometry ; number - theoretic algorithms ; polynomial and matrix calculations ; caching ; and parallel computing

    課程主題包含了：排序、搜尋樹、堆積及雜湊；各個擊破法、動態規劃、攤提分析、圖論演演算法、最短路徑、網路流量、計算幾何、數論演演算法；多項式及矩陣的運算；快取及平行計算。
  2. A fast non - iterative global motion estimation ( gme ) algorithm is disclosed for estimating the perspective transform global motion parameters from the motion vectors ( mv ) obtained from the block matching process that includes grouping a plurality of motion vectors in the input video stream into a predetermined number of groups of motion vectors, calculating a set of global motion parameters from each of the predetermined groups of the motion vector, and processing the set of global motion parameters generated from the calculation to obtain a final estimation

    本發明系關於一種快速非反覆式全域移動估測方法，以由區塊匹配程序中所獲得的移動向量去估測一透視轉換全域移動參數，其包含一分組步驟，將該輸入影像資料流中的多個移動向量區分成具有預定數目的移動向量之群組?一計算步驟，系依據每一群組中之移動向量，求取該等群組之全域移動向量參數值?一處理步驟，系處理計算步驟中所計算出的每一群組之群組全域移動向量參數值，以獲得一最後之全域移動向量。
  3. Runstats is the utility in db2 udb that updates catalog statistics used by the optimizer to determine the fastest path to your data

    Runstats是db2 udb中的實用程序，它更新優化器所使用的目錄統計信息，以確定存取數據的最快路徑。
  4. The main work of the thesis is as follows : we design a novel omni - mirror more applicable in robocup, which is made up of an isomeric horizontal mirror and an isomeric vertical mirror and can make the resolution of the imaging of the objects near the robot on the field constant and make the distortion of the imaging of the objects far from the robot small in vertical direction ; we select a 1394 digital color camera and complete the development of its software program for data acquisition ; we design a image processing algorithm for the panoramic image, which can segment the image by color, extract the features of image fast and effectively and complete the recognization of target ; according the character of the imaging, we design a new fast hough transform algorithm for line detection, which can detect the white mark lines of the field realtimely, and then design a robot ’ s self - localization method based the mark lines, which only uses the information of omni - vision system ; finally we design a monte carlo localization method based on the information of omni - vision system and odometry, and present the localization results of two localization methods and analyze the experiment results and get the conclusions

    本論文的主要工作如下:設計了一種新的更適用於機器人足球賽的全向反射鏡面，該鏡面由水平等比鏡面和垂直等比鏡面組合而成，能夠使機器人近處一定范圍內水平場地上的物體成像解析度不變，遠處物體成像高度上變形較小;選擇了一款基於1394介面的數字攝像機，並完成其數據採集程序開發;針對全景圖像設計了圖像處理演算法，能夠快速有效的實現圖像顏色分割和圖像特徵提取，完成目標識別;根據全景圖像的成像特性，設計了一種新的用於直線檢測的快速hough變換演算法，能夠實時的提取出場地的白色標志線，並在此基礎上設計了完全利用全向視覺信息的基於標志線的機器人自定位方法;最後設計了一種基於全向視覺信息和里程計信息的montecarlo定位方法，給出兩種方法的定位結果，並分析實驗結果，給出結論。
  5. 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 ）基於光線跟蹤的演算法，該演算法中所有通過輪廓頂點的光線和對應其它圖像輪廓的光錐進行求交計算，最後得到每次求交計算得到線段的交集，該線段的頂點就認為是物體表面點，從而得到物體表面的點雲。
分享友人
分享到 Line

分享到臉書