vector point function 中文意思是什麼
vector point function
解釋
矢函數-
The main work completed in the paper is listed as following : 1. image function acquisition -, 2. read bmp files by dib format ; 3. drawing gray scale histogram ; 4. choose a optimum threshold and make gray image become binary image -, s. find image ' s contour points by making inner points become empty and apply template matching on the contour points ; 6. transform the object ' s beginning points ( pixel point ) to the ones in the image coordinate and the positions of in the corresponding three dimensions ; 7. compute the position vector and the normal vector of the object
選擇一個最佳闋值,把灰度圖像進行二值化處理; 5用掏空內部點法,找到圖像的輪廓點,然後在輪廓點上進行模板匹配; 6把輸出的目標物開始點(像素點)轉化成圖像坐標系中的點和對應的三維空間的坐標位置; 7計算目標物的位置矢量和法向矢量,根據機器人抓取面的法向矢量,找到機器人要抓取的平面; 8 -
The support vector machine is much better in the aspects of the function expression, generalization and efficiency than the traditional artificial neural network. it solves the problems : model selection, overfitting, nonlinearity, dimensions, the lowest point in local, and so on
支持向量機方法在函數表達能力,推廣能力和學習效率上都要優于傳統的人工神經網路,且很大程度上解決了傳統方法存在的問題:如模型選擇、過學習、非線性、多維問題、局部最小點問題等。 -
Motivated by the above results, the third part of this paper considers the equivalence problems that every stationary point or kuhn - tucker point is an efficient solution. we define i - quasi - invex vector function., i - strictly quasi - invex vector function and kt - i - strictly quasi invex vector function, and derive the above equivalent condition for unconstrained or constrained multiobjective programming
於是,在本文的第三部分,我們定義了類不變擬凸、類嚴格不變擬凸、 kt -類嚴格不變擬凸的向量值函數,並且在無約束或約束多目標規劃中,獲得了每個駐點(或k - t點)是有效解的等價條件。
分享友人