首页> 外文期刊>Pattern Recognition: The Journal of the Pattern Recognition Society >Least-commitment graph matching with genetic algorithms
【24h】

Least-commitment graph matching with genetic algorithms

机译:最小承诺图与遗传算法匹配

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

摘要

This paper concerns the correspondence matching of ambiguous feature sets extracted from images. The first contribution made in this paper is to extend Wilson and Hancock's Bayesian matching framework (Wilson and Hancock, IEEE Trans. Pattern Anal. Mach. Intell. 19 (1997) 634-648) by considering the case where the feature measurements are ambiguous. The second contribution is the development of a multimodal evolutionary optimisation framework which is capable of simultaneously producing several good alternative solutions. Previous multimodal genetic algorithms have required additional parameters to be added to a method which is already over-parameterised. The algorithm presented in this paper requires no extra parameters: solution yields are maximised by removing bias in the selection step, while optimisation performance is maintained by a local search step. This framework is in principle applicable to any multimodal optimisation problem where local search performs well. An experimental study demonstrates the effectiveness of the new approach on synthetic and real data. (C) 2000 Pattern Recognition Society. Published by Elsevier Science Ltd. All rights reserved. [References: 64]
机译:本文涉及从图像中提取的模糊特征集的对应匹配。本文的第一个贡献是通过考虑特征量度不明确的情况来扩展Wilson和Hancock的贝叶斯匹配框架(Wilson和Hancock,IEEE Trans。Pattern Anal。Mach。Intell。19(1997)634-648)。第二个贡献是开发了一种多模式进化优化框架,该框架能够同时产生多个良好的替代解决方案。先前的多峰遗传算法要求将附加参数添加到已经过参数化的方法中。本文提出的算法不需要额外的参数:通过在选择步骤中消除偏差来最大化解决方案的产量,而通过局部搜索步骤来保持优化性能。该框架原则上适用于本地搜索效果良好的任何多模式优化问题。实验研究证明了这种新方法对合成和真实数据的有效性。 (C)2000模式识别学会。由Elsevier Science Ltd.出版。保留所有权利。 [参考:64]

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号