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

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

作　　者：邹国良[1] 张石明 陈长吉 王振华[1] ZOU Guoliang;ZHANG Shiming;CHEN Changji;WANG Zhenhua(College of Information Technology,Shanghai Ocean University,Shanghai 201306,China)

机构地区：[1]上海海洋大学信息学院,上海201306

出　　处：《计算机工程》2018年第9期218-223,共6页Computer Engineering

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

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

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

分 类 号：TP391.41[自动化与计算机技术—计算机应用技术]