By Topic

A fast parallel image matching algorithm based on MPP computing model

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Fu Guangyuan ; Xi''an Res. Inst. of High-tech Hongqing Town, Xi''an, China ; Wu Hanzhao ; Wensi Fu ; Wang Hongqiao

Image matching is a branch of image processing. Its application is widely the precision guidance field. And the image correlation processor is one of the key technologies in image matching system. In this paper, the embedded MPP computing model is used as the image correlation processor. It mostly accomplishes image matching processing and image preprocessing. The embedded MPP system is designed as 16-bit fixed array microprocessor and composed of 64 × 64 processing elements (PEs) array. The PEs array is connected as 2-D mesh of circle connected computer. All of PEs perform the same operation according to the mode of single instruction stream multiple data (SIMD) stream. According to traditional idea of the Normalization product correlation algorithm, a fast parallel image matching algorithm based on MPP model is proposed. The result shows that, the algorithm complication is lower and computation speed is faster than the traditional algorithm, and the matching precision is the same as last one.

Published in:

Computer Science and Automation Engineering (CSAE), 2012 IEEE International Conference on  (Volume:1 )

Date of Conference:

25-27 May 2012