Parallel Implementation of Similarity Measures on GPU Architecture using CUDA
Journal Title: Indian Journal of Computer Science and Engineering - Year 2012, Vol 3, Issue 1
Abstract
Image processing and pattern recognition algorithms take more time for execution on a single core processor. Graphics Processing Unit (GPU) is more popular now-a-days due to their speed, programmability, low cost and more inbuilt execution cores in it. Most of the researchers started work to use GPUs as a processing unit with a single core computer system to speedup execution of algorithms and in the field of Content based medical image retrieval (CBMIR), Euclidean distance and Mahalanobis plays an important role in retrieval of images. Distance formula is important because it plays an important role in matching the images. In this research work, we parallelized Euclidean distance algorithm on CUDA. CPU with Intel® Dual-Core E5500 @ 2.80GHz and 2.0 GB of main memory which run on Windows XP (SP2). The next step was to convert this code in GPU format i.e. to run this program on GPU NVIDIA GeForce series 9500GT model having 1023 MB of video memory of DDR2 type and bus width of 64bit. The graphic driver we used is of 270.81 series of NVIDIA. In this paper both the CPU and GPU version of algorithm is being implemented on the MATLAB R2010. The CPU version of the algorithm is being analyzed in simple MATLAB but the GPU version is being implemented with the help of intermediate software Jacket-win-1.3.0. For using Jacket, we have to make some changes in our source code so to make the CPU and GPU to work simultaneously and thus reducing the overall computational acceleration . Our work employs extensive usage of highly multithreaded architecture of multicored GPU. An efficient use of shared memory is required to optimize parallel reduction in Compute Unified Device Architecture (CUDA), Graphic Processing Units (GPUs) are emerging as powerful parallel systems at a cheap cost of a few thousand rupees.
Authors and Affiliations
Kuldeep Yadav , Ankush Mittal , M. A Ansari , VennkteshVishwarup
Keywords
Related Articles
- EP ID EP145524
- DOI -
- Views 141
- Downloads 0
FUSION OF MULTI FOCUSED IMAGES USING HDWT FOR MACHINE VISION
During image acquisition in machine vision, due to limited depth of field of lens, it is possible to take clear image of the objects in the scene which are in focus only. The remaining objects in the scene will be out of...
A SURVEY ON FACE DETECTIONMETHODS AND FEATURE EXTRACTION OF FACE RECOGNITION USING PCA
From the most recent two decades, face acknowledgment is playing a vital and basic part particularly in the field of business, managing an account, social and law requirement region. It is an intriguing utilization of ex...
QOS PARAMETER ANALYSIS ON AODV AND DSDV PROTOCOLS IN A WIRELESS NETWORK
Wireless networks are characterized by a lack of infrastructure, and by a random and quickly changing network topology; thus the need for a robust dynamic routing protocol that can accommodate such an environment. To imp...
Solving Scheduling problems using Selective Breeding Algorithm and Hybrid Algorithm
The n-job, m-machine scheduling problem is one of the general scheduling problems in a system. Scheduling problems vary widely according to specific production tasks but most are NP-hard problems. Scheduling problems are...
SUPER STRONGLY PERFECT NESS OF SOME INTERCONNECTION NETWORKS
A Graph G is Super Strongly Perfect Graph if every induced sub graph H of G possesses a minimal dominating set that meets all the maximal complete sub graphs of H. In this paper we have analyzed the structure of super st...