two-near points 中文意思是什麼

two-near points 解釋
兩個半分
  • two : n. (pl. twos)1. 兩人;兩個東西,一對。2. 二的記號。3. 兩點鐘。4. 兩歲。n. -ness
  • near : adv 1 近 接近 鄰接 (opp far)。2 〈口語〉幾乎 差不多 將近。3 節省地。prep 接近 在…的近旁;快要。...
  • points : 波因茨
  1. It can save the information near lips, which may be deleted by the method based on two points. ( 2 ) based on the analysis of current methods, a new multi - pose facial feature location algorithm is developed, which is based on the analysis of multi - feature and integral projection, the combination of an iterative search with a confidence function and template matching. the algorithm not only improves the location accuracy, but also speeds up a great deal. ( 3 ) based on the analysis of the advantages and disadvantages of current feature extraction methods, an adaptive facial feature selection criterion is developed, which is based on facial local feature protrusion consisting of several aspects, such as face image resolution and image quality

    其後研究了人臉特徵提取,一、討論了適合於多姿態人臉識別的基於三點仿射變換的人臉圖像歸一化方法,以克服基於兩點仿射變換會引起較大圖像信息損失的缺陷;二、在分析現有器官定位演算法的基礎上,提出了新多姿態人臉器官特徵定位技術,將多特徵和直方圖分析、基於置信度函數的迭代搜索和模板匹配相結合,既提高了器官定位精度,又提高了定位速度。
  2. This paper presents a view dependent method to augment sequential point trees by embedding the hierarchical tree structures in the sequential list of hierarchical points. by the method, two kinds of indices are constructed to facilitate the points rendering in an order mostly from near to far and from coarse to fine

    為此,我們提出視點相關的順序點模型樹,將層次化的樹結構嵌入點的順序化線形序列中,並生成兩種索引以方便對點數據進行由近及遠和由粗至細的處理。
  3. An algorithm for detecting moving ir point target in complex background is proposed, which is based on the reverse phase feature of neighborhood ( rpfn ) of target in difference between neighbor frame images that two positions of the target in the difference image are near and the gray values of them are close to in absolute value but with inverse sign. firstly, pairs of points with rpfn are detected in the difference image between neighbor frame images, with which a virtual vector graph is made, and then the moving point target can be detected by the vectors ' sequence cumulated in vector graphs. in addition, a theorem for the convergence of detection of target contrail by this algorithm is given and proved so as to afford a solid guarantee for practical applications of the algorithm proposed in this paper. finally, some simulation results with 1000 frames from 10 typical images in complex background show that moving point targets with snr not lower than 1. 5 can be detected effectively

    基於運動點目標在鄰幀差分圖像中所具有的近鄰反相特徵,即運動點目標的兩個位置相鄰近、灰度值一正一負,提出一種在復雜背景下,基於紅外序列圖像的運動點目標檢測演算法.本演算法利用該特徵在鄰幀差分圖像中檢測反相點對,進而構造反相點對矢量圖,最後依據累積反相點對矢量圖中多矢量首位相接的連續性檢測出運動的點目標.文中給出並證明應用本演算法能以概率1檢測到運動點目標的收斂性定理.對典型復雜背景下10幅1000幀圖像的模擬結果表明,當信噪比大於或等於1 . 5時,可以有效檢測出運動點目標
  4. Speaking after his side made it two wins from two against the near neighbours, sven stated : " six points against manchester united in one season is very good

    在兩次贏得與鄰居的比賽后,史蒂夫說: 「對曼聯在一個賽季中取得六分,這太好了! 」
  5. Following are detailed steps of this system : in the segmentation section, we use three successive frames to detect the motion infomation of the pictures, by using blockmatching algorithm in two successive frames twice, we can get two pictures composed of motion blocks of the moving object, then we find out the common motion blocks of the two pictures, experiments prove these blocks approximately compose the moving object. after getting the motion blocks, we calculate the center of these blocks as the center of the moving object, thus we can use the center point as the origin, construct n straight linesjoining the boundry of the image and the center. on each line, we can find out a proper point near the object contour according to some criteria, then we use these n points as the initial points of the snake and let the snake converge on the object contour, thus finish the segmentation of the moving object

    本方案的實現過程為:分割部分:對運動目標的前後三幀進行兩次塊匹配運動檢測,通過找出兩個匹配結果中運動圖像塊的公共部分,獲得組成運動目標的圖像塊;求出運動目標圖像塊的形心作為運動目標的中心,以此中心為端點,向四周發散出角度間隔為的n條射線,射線的另一端終止於圖像的邊緣;在每條射線上按照一定的準則(點的梯度和與目標中心的距離在一定閾值范圍內)找出n個初始輪廓點;以這些初始輪廓點作為主動輪廓模型( snake )的初始點,用改進的貪婪演算法使snake收斂到待分割的運動目標輪廓上。
分享友人