【24h】

An Efficient Image Matching Algorithm Muhammad Saleem; Adil Masood Siddiqi; Imran Touqir

机译:那就是Imag抽筋抽筋的Muhammad Salim;阿黛尔·布莱克(Adeel Black)是我的朋友;伊姆兰·图基尔(Imran Touqir)

获取原文
获取原文并翻译 | 示例

摘要

The problem of matching two images has been an active topic of research in computer vision, pattern recognition, robotics and image analysis. Matching Algorithms based on low level features are computationally expensive, because the edge image of template or its distance transforms are translated and superimposed on all the pixels of reference image. Matching is achieved by calculating the minimum distance out of all the translations. The problem is further aggravated if reference image is of much greater dimensions as compared to template image. Since the reference image consists of objects and background, calculating the minimum distance for all the pixel locations becomes time consuming. In this paper a method to decrease the computation time of existing algorithms is presented, to make existing schemes suitable for real time matching.
机译:匹配两个图像的问题一直是计算机视觉,模式识别,机器人技术和图像分析领域研究的一个活跃主题。由于模板的边缘图像或其距离转换已转换并叠加在参考图像的所有像素上,因此基于低级特征的匹配算法的计算量很大。通过计算所有平移中的最小距离来实现匹配。如果参考图像与模板图像相比具有更大的尺寸,则该问题将进一步恶化。由于参考图像由对象和背景组成,因此计算所有像素位置的最小距离变得很耗时。本文提出了一种减少现有算法的计算时间的方法,以使现有方案适合于实时匹配。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号