English  |  正體中文  |  简体中文  |  Items with full text/Total items : 49521/84656 (58%)
Visitors : 7584317      Online Users : 58
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    Please use this identifier to cite or link to this item: http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/102689


    Title: 以GPU運算技術實現即時多重解析全域搜尋之影像特徵描述子匹配演算法
    Other Titles: Implementation of a real-time multi-resolution exhaustive search algorithm for image feature descriptor matching by using GPU computing
    Authors: 曹安宏;Tsao, An-Hung
    Contributors: 淡江大學電機工程學系碩士班
    蔡奇謚
    Keywords: 特徵描述子匹配;降維;全域搜尋;Feature descriptor matching;dimensionality reduction;exhaustive search;GPU
    Date: 2014
    Issue Date: 2015-05-04 10:01:57 (UTC+8)
    Abstract: 影像特徵描述子匹配是許多電腦視覺應用中重要的前處理工作,本文提出一種多重解析全域搜尋演算法與多重解析候選點移除方法,有效地解決這個議題。所提出的演算法首先會由一張輸入影像與一張參考影像,透過特徵點描述子演算法求得特徵點及特徵點描述子。接著,使用L1-norm計算方法將兩影像的特徵點描述子集合做降維(Dimensionality reduction)的運算,每個特徵點描述子都會得到一張多重解析表(multi-resolution tables),其記錄著特徵描述子向量降維後的多層特徵點描述子向量。最後,利用所建立出的多重解析表,便可以利用距離函數計算兩描述子向量的低維度距離,加速篩選候選點的速度。另一方面,所提出的演算法實現於CPU上時,我們發現在執行建立多重解析表之步驟時運算動作較沒效率,而此步驟又很適合實現於GPU平行化技術上,所以本文亦提出了以GPU加速運算方式來實現所提出的影像特徵描述子匹配演算法。在實驗測試中,本文所提出之演算法與現有三種方法比較後,所提出之演算法無論在運算速度或匹配準確度上,都能達到不錯的效能。
    Image feature descriptor matching is an important pre-processing task in various computer vision applications. This thesis presents a multi-resolution exhaustive search algorithm combined with a multi-resolution candidate elimination technique to address this issue efficiently. The proposed algorithm first uses a SIFT-like algorithm to extract image feature points and the corresponding feature descriptors of an input image and a reference image, respectively. A multi-resolution table of each feature descriptor is then computed by using a L1-norm based dimension reduction approach. Finally, a fast candidate elimination algorithm is developed based on the multi-resolution tables to remove all non-candidates from a candidate list by using a simple L1-norm computation. When the proposed algorithm was implemented on CPU, we observed that the step of multi-resolution table building is not computationally efficient on CPU, but it is very suitable for parallel implementation on GPU. Therefore, this thesis also presents a GPU acceleration method for the proposed image feature descriptor matching algorithm to achieve better real-time performance. Experimental results validate the computational efficiency and matching accuracy of the proposed algorithm by comparing with three existing methods.
    Appears in Collections:[電機工程學系暨研究所] 學位論文

    Files in This Item:

    File SizeFormat
    index.html0KbHTML67View/Open

    All items in 機構典藏 are protected by copyright, with all rights reserved.


    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library & TKU Library IR teams. Copyright ©   - Feedback