首页> 外国专利> Fast method and system for template matching acquiring global optima

Fast method and system for template matching acquiring global optima

机译:模板匹配获取全局最优的快速方法和系统

摘要

A method is described that greatly reduces the computational cost of determining the globally optimal match between a template and one or more samples. For every sample in a search range, intermediate distance measures between the template and each sample are first computed in one designated dimension. The computed distance measures are then sorted according to their magnitude. The sample with the minimal distance measure is selected to accumulate a new distance measure in the next higher dimension. This new distance measure is recorded and the samples are sorted again according to the updated distance measures. The above process is repeated until a minimal distance measure has been computed in all dimensions. For motion estimate, this method can reduce the number of computational operations by about 90% to 99%. This method can also provide a list of globally best matches. By sacrificing the global optimality, this method can satisfy the time constraint required by some applications and provide a suboptimal match.
机译:描述了一种方法,该方法大大降低了确定模板和一个或多个样本之间的全局最佳匹配的计算成本。对于搜索范围内的每个样本,首先要在一个指定的维度上计算模板与每个样本之间的中间距离度量。然后根据计算的距离量度的大小对其进行排序。选择具有最小距离度量的样本以在下一个更高维度上累积新的距离度量。记录此新的距离度量,并根据更新的距离度量再次对样本进行分类。重复上述过程,直到已在所有维度上计算出最小距离度量。对于运动估计,此方法可以将计算操作的数量减少大约90%至99%。此方法还可以提供全局最佳匹配的列表。通过牺牲全局最优性,该方法可以满足某些应用程序所需的时间限制,并提供次优匹配。

著录项

  • 公开/公告号US6360013B1

    专利类型

  • 公开/公告日2002-03-19

    原文格式PDF

  • 申请/专利权人 ACADEMIA SINICA;

    申请/专利号US19990270556

  • 发明设计人 YI-PING HUNG;YONG-SHENG CHEN;

    申请日1999-03-16

  • 分类号G06K96/40;

  • 国家 US

  • 入库时间 2022-08-22 00:48:49

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号