作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2018, Vol. 44 ›› Issue (9): 218-223. doi: 10.19678/j.issn.1000-3428.0047769

• 图形图像处理 • 上一篇    下一篇

基于改进最小距离法的图像匹配并行算法设计

邹国良,张石明,陈长吉,王振华   

  1. 上海海洋大学 信息学院,上海 201306
  • 收稿日期:2017-06-29 出版日期:2018-09-15 发布日期:2018-09-15
  • 作者简介:邹国良(1962—),男,教授,主研方向为海洋图像处理;张石明、陈长吉,硕士研究生;王振华,副教授。
  • 基金资助:

    国家自然科学基金(41501419)。

Design of Image Matching Parallel Algorithm Based on Improved Minimum Distance Method

ZOU Guoliang,ZHANG Shiming,CHEN Changji,WANG Zhenhua   

  1. College of Information Technology,Shanghai Ocean University,Shanghai 201306,China
  • Received:2017-06-29 Online:2018-09-15 Published:2018-09-15

摘要:

为充分利用多核计算资源提高图像匹配识别的实时性,设计一种基于改进最小距离法的图像匹配并行化算法。选取标准化欧氏距离来代替简单欧氏距离作为特征的相似性度量,同时在多核计算机上采用MPI+OpenMP混合编程模型对该算法进行仿真验证。结果表明,与基于最小 距离法的图像匹配算法相比,该算法可以减少匹配误差和匹配运算时间,并且MPI+OpenMP混合编程模型具有较好的加速比和并行计算效率。

关键词: 图像匹配, 决策理论, 最小距离法, 混合编程模型, 多核计算机

Abstract:

In order to take advantage of multi-core computing resources to improve the real-time performance of image matching identification,image matching parallel algorithm based on improved minimum distance method is designed.The standard euclidean distance is chosen to replace the simple euclidean distance as the similarity measure of the features,and the MPI+OpenMP hybrid programming model is used to verify the algorithm on multi-core computers.The results show that,the algorithm can reduce the matching error and matching operation time,moreover,MPI+OpenMP hybrid programming model has good speed-up ratio and parallel computational efficiency.

Key words: image matching, decision theory, minimum distance method, hybrid programming model, multi-core computer

中图分类号: