freepeople性欧美熟妇, 色戒完整版无删减158分钟hd, 无码精品国产vα在线观看DVD, 丰满少妇伦精品无码专区在线观看,艾栗栗与纹身男宾馆3p50分钟,国产AV片在线观看,黑人与美女高潮,18岁女RAPPERDISSSUBS,国产手机在机看影片

正文內(nèi)容

外文翻譯--基于批處理灰度圖像的拼接方法com組件技術(shù)(編輯修改稿)

2025-02-14 14:37 本頁面
 

【文章內(nèi)容簡介】 icable.. Software designation for the fast image registrationThe image registration algorithm in Sec. contains three main steps: Firstly, extract Harris corner point matrix for the two images to be spliced。 secondly, initial circular projection matching。 thirdly, relax optimization matching. The puting process of the three steps is corresponding to the above three conditions. Hence, we can improve the execution efficiency of the algorithm and the robustness of the system by reasonably using these fuzzy visual restriction conditions.The flowchart of the image registration algorithm proposed in Sec. is shown in (a). We can see from (a) that, there is no relevance between Step 1 and Step 2, and every individual extraction is based on the whole image. This will produce plenty of useless corner points, which are a waste of time and will cause interference for the initial matching. For the corner point matrixes selected from Step 3 and Step 5, there is relevance, but there is no relevance for the corner points within the matrix. Hence, the putation of grey similarity of the corner points and that of the support degree summation of the optimization selection algorithm can be executed concurrently. (a) Flowchart of the image registration algorithm。 (b) Software implementation of the image registration algorithmThe flowchart of the software for the image registration proposed in Sec. is shown in (b). (b) shows that, the putation time of Step 1 and Step 2 can be overlap, and the corner points searching from the unoverlap area can be avoided based on the restriction condition 1, which can improve the efficiency of the feature points searching algorithm, and the accuracy of the initial matching. Step 3 divides the corner point matrix got from Step 1 based on columns of the matrix. In this paper, we divide it into 4 blocks based on the height of the simulation image (12801024). All the corner point matrix blocks pute the grey similarity concurrently, and select the initial corner point matching pairs based on the restriction condition 2. Step 6 clones the initial matching pair position coordinate set of the first image to be spliced got from Step 5 set into 4, and each set will be relax matching optimization selected based on the following strategy.Let
點擊復(fù)制文檔內(nèi)容
規(guī)章制度相關(guān)推薦
文庫吧 www.dybbs8.com
備案圖片鄂ICP備17016276號-1