中大機構典藏-NCU Institutional Repository-提供博碩士論文、考古題、期刊論文、研究計畫等下載:Item 987654321/48442
English  |  正體中文  |  简体中文  |  Items with full text/Total items : 80990/80990 (100%)
Visitors : 41903958      Online Users : 1428
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU 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://ir.lib.ncu.edu.tw/handle/987654321/48442


    Title: 利用GPU加速SIFT特徵之擷取與比對;Implementation of fast SIFT feature extraction and matching using GPU
    Authors: 王培學;Pei-hsueh Wang
    Contributors: 資訊工程研究所
    Keywords: CUDA;區域二元特徵;GPU;SIFT;GPU;CUDA;SIFT;LBP
    Date: 2011-07-26
    Issue Date: 2012-01-05 14:54:55 (UTC+8)
    Abstract: GPU 於1999 年由NVIDIA 所提出來的一個硬體架構,主要用於輔助CPU做快速的影像平行運算,由於GPU 功能之強大,自從產品發表之後,陸續不斷有學者投入研究,針對現有的演算法進行平行化,以讓原本的系統能更有效率的發揮其功效。 本論文實作出一個海關貨櫃的認證系統。系統一開始由兩台在不同海關關口的攝影機拍攝二張貨櫃影像,二張影像即刻透過實作於GPU 上SIFT 演算法分別擷取出特徵點,並透過這些擷取的特徵點找出兩張影像的比對點。這些比對點基本上可計算出描述兩張影像對應關係的單應性矩陣,透過RANSAC 可以從對應關係中挑選出最佳對應的單應性矩陣。接著將其中一張影像透過單應性矩陣轉換後,將影像切割成多個相同的區塊,並利用區域二元特徵來做影像的比對,其比對的方法採用histogram intersection 來判斷兩個區塊是否相同。 實驗結果顯示在GPU 平台實作的特徵點擷取和比對步驟只需不到0.4 秒的時間,比一般英特爾CPU 實作出的結果快上10 倍多的速度。 Graphic processing units (GPU), announced by NVIDIA Co. in 1999, is a specially designed circuit for parallelization. According to the high computational power of GPU, many researchers have devoted to commercial product designs or academic researches. Recently, image processing algorithms are developed on this platform to improve the performance. In this thesis, an authentication system for the Customers’ containers is developed. First, two images are captured from two different cameras in two gateways. The SIFT features are efficiently extracted from the parallel operations implemented on a GPU platform. Basically, the features for each image pixel are independently and simultaneously computed. Using the extracted features, the corresponding points between two container images are matched. Given the corresponding point set, a homographic matrix is found using the RANSAC algorithm. After finding the homographic matrix, the corresponding point relations are constructed. A container image in a gateway is next separated into several blocks, and the local binary pattern (LBP) features for each block are extracted. Similarly, the corresponding LBP features for the image captured from the other gateway are also extracted using the found homographic matrix. The similarity for two images is calculated using the histogram intersection to determine if they are the same container or not. The experimental results demonstrate the performance of feature extraction for image matching on the GPU platform. Less than 0.4 seconds are needed which is 10 times faster than that of the Intel-based CPU.
    Appears in Collections:[Graduate Institute of Computer Science and Information Engineering] Electronic Thesis & Dissertation

    Files in This Item:

    File Description SizeFormat
    index.html0KbHTML1056View/Open


    All items in NCUIR are protected by copyright, with all rights reserved.

    社群 sharing

    ::: Copyright National Central University. | 國立中央大學圖書館版權所有 | 收藏本站 | 設為首頁 | 最佳瀏覽畫面: 1024*768 | 建站日期:8-24-2009 :::
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - 隱私權政策聲明