Abstract

In this paper, a graphics processing unit (GPU) based matching technique is proposed to perform fast feature matching between different images under various image conditions with viewpoint changes. Most recently, general-purpose graphics processing units (GPGPUs or GPUs) have become commonplace within high performance supercomputers. GPUs allow developers to effectively exploit the computational power for high performance computing. This paper focuses on improving the performance of feature matching based on self-organizing map by porting it onto the GPUs. GPU optimization has been applied for the fast computation of keypoints to make the system fast and efficient. This scheme has enhanced the overall performance and is much more efficient compared to other methods without degradation of detection results. The proposed matching algorithm is partitioned between the CPU and GPU in a way that best exploits the parallelism and perform matching between the different images. Experimental results demonstrate that fast feature matching is achieved using the graphics processing units, and its computational efficiency is checked by comparing its results and run times with those of some standard software (MATLAB) run on central processing unit (CPU).

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.