سیویلیکا را در شبکه های اجتماعی دنبال نمایید.

Parallel Spatial Pyramid Match Kernel Algorithm for Object Recognition using a Cluster of Computers

Publish Year: 1398
Type: Journal paper
Language: English
View: 483

This Paper With 12 Page And PDF Format Ready To Download

Export:

Link to this Paper:

Document National Code:

JR_JADM-7-1_009

Index date: 10 July 2019

Parallel Spatial Pyramid Match Kernel Algorithm for Object Recognition using a Cluster of Computers abstract

This paper parallelizes the spatial pyramid match kernel (SPK) implementation. SPK is one of the most usable kernel methods, along with support vector machine classifier, with high accuracy in object recognition. MATLAB parallel computing toolbox has been used to parallelize SPK. In this implementation, MATLAB Message Passing Interface (MPI) functions and features included in the toolbox help us obtain good performance by two schemes of task-parallelization and dataparallelization models. Parallel SPK algorithm ran over a cluster of computers and achieved less run time. A speedup value equal to 13 is obtained for a configuration with up to 5 Quad processors.

Parallel Spatial Pyramid Match Kernel Algorithm for Object Recognition using a Cluster of Computers Keywords:

Parallel Spatial Pyramid Match Kernel Algorithm for Object Recognition using a Cluster of Computers authors

A. Asilian Bidgoli

۱) Department of Computer Engineering, University of Kashan, Kashan, Iran ۲)Instructor, Faculty of Elecronic and Computer Engineering Pooyesh Higher Education Institute Qom, Iran

H. Ebrahimpour-Komle

Department of Computer Engineering, University of Kashan, Kashan, Iran

M. Askari

Department of Computer Engineering, University of Kashan, Kashan, Iran

Seyed J. Mousavirad

Department of Computer Engineering, University of Kashan, Kashan, Iran