邊界鏈碼 的英文怎麼說

中文拼音 [biānjièliànmǎ]
邊界鏈碼 英文
border chain code
  • 邊 : 邊Ⅰ名詞1 （幾何圖形上夾成角的直線或圍成多邊形的線段） side; section 2 （邊緣） edge; margin; oute...
  • 界 : 名詞1 （相交的地方; 劃分的界限） boundary 2 （一定的范圍） scope; extent 3 （按職業、工作或性別等...
  • 鏈 : Ⅰ名詞1. （鏈子） chain Ⅱ動詞（用鏈栓住） chain; enchain Ⅲ量詞（計量海洋上距離的長度單位） cable length
  • 碼 : Ⅰ名詞（表示數目的符號或用具） a sign or object indicating number; code Ⅱ量詞1 （指一件事或一類的...
  • 邊界 : boundary; frontier; border; borderline; edge range line; periphery
  1. First, the contour is represented by chain code, and then we find the possible matched contours by area rules and boundary rules, and computer ? aided automatic paper fragments reassembly is also realized in this paper

    首先採用鏈碼表示碎片輪廓，然後通過碎片旋轉進行搜索，採用邊界準則和面積準則進行碎片之間相似的匹配部分的判斷，達到碎紙自動拼接的目的，實現了基於計算機輔助的碎紙自動拼接復原。
  2. The basic thought of the csapfba algorithm is : the edge routers perform the state management per flow, and the edge routers differentiate between the marked flows and the non - marked flows, and the edge routers insert the relevant information into the packet header by using dynamic packet state ; the core routers divide the output link bandwidth into two parts in the light of the state information of the packet header by using class - based queueing, and the core routers allocate proportionally the bandwidth to the marked flows according to their service profiles and the current network load, and the core routers allocate the bandwidth to the non - marked flows according to the principle of max - min fairness, and the csapfba algorithm can adaptively dynamically adjust the bandwidth allocation between the marked flows and the non - marked flows

    本文在csfq演算法的基礎上，提出了一種核心無狀態的自適應的成比例公平帶寬分配csapfba （ core - statelessadaptiveproportionalfairbandwidthallocation ）演算法。 csapfba演算法的基本思想是：在邊界路由器完成基於每個流的狀態處理，將所有的流分成標記流和非標記流兩種類型，採用dps技術將有關信息編碼進分組頭；在核心路由器根據分組頭中攜帶的狀態信息採用cbq策略，將輸出鏈路帶寬分成兩部分，對標記流根據當前的網路負荷按照服務規格成比例地分配帶寬，對非標記流按照最大最小公平性原則分配帶寬，並且能自適應地動態調整帶寬分配的比例。
  3. To solve these problems respectively, the color space transformation and bp neural network are firstly used to realize the classification and threshold processing of images. then the images processing including thinning, interval linking, code word chaining, seed filling, boundary fitting is performed well by some methods in mathematical morphology and computer graphics and interpolation in numerical value analysis

    為了逐一解決這些困難，運用了色彩空間變換以及bp神經元網路的方法對圖像進行分類和閾值處理，利用數學形態學和計算機圖形學以及數值分析中的插值等方法對圖像進行了細化、間隙連接、鏈碼、種子填充、邊界擬合等處理。
  4. By constructing the list of vertices of polygon and intersecting points between polygon and rectangle, the list of vertices of rectangle and between polygon and rectangle, the list of incoming points and the list of outcoming points, the problem that how to confirm close clipped area edge is solved. at the same time, the second encoding technology is developed from line clipping to polygon clipping so that the speed of algorithm is increased

    矩形窗口多邊形裁剪的改進演算法通過引入多交表、矩交表、入點表、出點表等線性鏈表，解決了如何確定一般多邊形在矩形窗口裁剪后封閉區域邊界問題，並把二次編碼技術由線裁剪拓展到多邊形裁剪中，對處于窗外的多邊形的邊可直接處理，提高了演算法的效率。
  5. In this paper, a boundary chain code tracing method is used to extract the contour information, the process of thinning, de noising, and encoding for contour are realized at one time, so a 1d string represented the 2d contour shape information is obtained, then a contour matching method based on chain code is presented

    摘要首先利用邊界鏈碼的跟蹤技術，提取出二維碎片的輪廓信息，同時對輪廓線進行細化、去噪和編碼處理，得到二維輪廓線的一維鏈碼信息描述，並在此基礎上提出一種基於鏈碼的二維碎片輪廓匹配方法。
  6. This dissertation expands on a new algorithm, which has the function of analyzing edge form with the chain code. by the introduction of the concepts of relative chain code and absolute chain code, this paper proposes a simple and direct algorithm to compute chain code sum ( average chain code )

    為了實現骨髓切片圖像細胞的形態特徵，應用鏈碼分析邊界形狀的新方法，引入相對鏈碼與絕對鏈碼概念得到了計算鏈碼和（平均鏈碼）的簡潔演算法。
  7. Algorithm for extracting contour and generating chain code tree

    圖像區域邊界抽取與鏈碼樹結構生成演算法
  8. University of paisley, february2000, 7 : 1 - 10. 16 pavlidis t. algorithms for graphic and image processing. rockville, md : computer science press, 1982

    用弗里曼鏈碼freeman code chain抽取圖像輪廓，用邊界跟蹤演算法處理有交疊的子詞。
分享友人
分享到 Line

分享到臉書