...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>International journal of wireless and mobile computing >Fast image matching algorithm based on template partitioning and subtemplate matching
【24h】

Fast image matching algorithm based on template partitioning and subtemplate matching

机译：基于模板分割和子模板匹配的快速图像匹配算法

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Matching algorithms based on pixel grey value are very popular and widely used in image matching. However, these algorithms have high time complexity and are sensitive to the size of image. To reduce the time complexity and sensitivity to the size of image of the matching algorithms based on pixel grey value, a fast image matching algorithm based on template partitioning and subtemplate matching is proposed. The algorithm divides the template into multiple subtemplates, then the eigenvalue of every subtemplate is calculated and the optimal one is chosen when the difference between the eigenvalues of the subtemplates and the subimage is minimum, and finally the best matching position for the reference image is determined by adopting non-ergodic search during image matching processing. The algorithm's time complexity is reduced to O((S-N + l)~2 ×N~2). Experimental results show that the proposed algorithm is superior to the circular projection algorithm and the NCC algorithm and has low computational complexity.
机译：基于像素灰度值的匹配算法非常流行，并广泛应用于图像匹配中。然而，这些算法具有高时间复杂度并且对图像的大小敏感。为了降低基于像素灰度值的匹配算法的时间复杂度和图像尺寸的敏感性，提出了一种基于模板分割和子模板匹配的快速图像匹配算法。该算法将模板分为多个子模板，然后计算每个子模板的特征值，并在子模板和子图像的特征值之差最小时选择最佳特征值，最后确定参考图像的最佳匹配位置在图像匹配处理中采用非遍历搜索。该算法的时间复杂度降低为O（（S-N + l）〜2×N〜2）。实验结果表明，该算法优于圆形投影算法和NCC算法，计算复杂度低。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号