邊搜索邊跟蹤 的英文怎麼說

中文拼音 [biānsōusuǒbiāngēnzōng]
邊搜索邊跟蹤 英文
track-while-scan
  • 邊 : 邊Ⅰ名詞1 （幾何圖形上夾成角的直線或圍成多邊形的線段） side; section 2 （邊緣） edge; margin; oute...
  • 搜 : 動詞1. （尋找） collect; gather2. （搜查） search; ransack
  • 索 : Ⅰ名詞1 （大繩子; 大鏈子） a large rope 2 （姓氏） a surname Ⅱ動詞1 （搜尋; 尋找） search 2 （要; ...
  • 跟 : Ⅰ名詞（腳的後部或鞋襪 的後部） heel Ⅱ動詞1 （在後面緊接著行動） follow 2 （指嫁給某人） be marrie...
  • 蹤 : 名詞（腳印; 蹤跡） footprint; track; trace; trail
  • 搜索 : 1 （仔細尋找） search for; ferret about; hunt for; scout around 2 [電子學] hunting; scan; [控] in...
  • 跟蹤 : follow the tracks of; tail after; following; follow up tracing; track; tracking; trail; lock on; ...
  1. This paper has researched a tracking algorithm of the track - while - scan radar. including filter algorithm, tracks association, tracks quality management

    邊掃描邊跟蹤（ tws ）雷達是一種在連續跟蹤目標的同時，還必須繼續對空間進行掃描搜索的雷達。
  2. On the further study of image vectorization principle, an auto - adapting adjust approach based on direction module is proposed to track image edges, which optimized paths searched

    研究了基於圖像邊緣矢量化原理，提出了基於方向模塊的自適應調節方法，對圖像邊緣進行跟蹤，優化了輪廓搜索路徑。
  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. At the basis of analyzing different boundary tracking algorithms, boundary point estimate algorithm based on angle and boundary point searching algorithm based on circumferential neighborhood extending were advanced to avoid tracking trap and to improve the robust of the boundary tracking algorithm

    通過分析不同演算法的特點，提出了基於已知點夾角的邊界點預估計演算法和基於圓弧鄰域擴展的邊界點搜索演算法，以避免跟蹤進入搜索陷阱，提高邊界跟蹤對邊界變化的魯棒性。
分享友人
分享到 Line

分享到臉書