• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Pattern recognition letters >Correspondence edit distance to obtain a set of weighted means of graph correspondences
【24h】

Correspondence edit distance to obtain a set of weighted means of graph correspondences

机译：对应编辑距离以获得一组加权手段的图对应关系

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

摘要

Given a pair of data structures, such as strings, trees, graphs or sets of points, several correspondences (also referred in literature as labellings, matchings or assignments) can be defined between their local parts. The Hamming distance has been largely used to define the dissimilarity of a pair of correspondences between two data structures. Although it has the advantage of being simple in computation, it does not consider the data structures themselves, which the correspondences relate to. In this paper, we extend the definitions of a recently presented distance between correspondences based on the concept of the edit distance, which we called Correspondence edit distance. Moreover, we present an algorithm to compute the set of weighted means between a pair of graph correspondences. Both the Correspondence edit distance and the computation of the set of weighted means are necessary for the calculation of a more representative prototype between a set of correspondences. In the validation section, we show how the use of the Correspondence edit distance increases the quality of the set of weighted means compared to using the Hamming distance. (C) 2018 Elsevier B.V. All rights reserved.
机译：给定一对数据结构，例如字符串，树木，图形或点组，可以在其本地部分之间定义几个对应关系（也称为签字，匹配或分配）。汉明距离主要用于在两个数据结构之间定义一对对应关系的不相似性。虽然它具有简单的计算优势，但它不考虑对应关系的数据结构本身。在本文中，我们基于编辑距离的概念扩展了对应关系之间最近呈现的距离的定义，我们称之为对应距离。此外，我们提出了一种算法来计算一对图对应答之间的加权装置集。对应编辑距离和对加权装置集的计算都是为了计算一组对应关系之间的更代表性的原型所必需的。在验证部分中，我们展示了与使用汉明距离相比，使用对应编辑距离的使用增加了加权装置集的质量。 （c）2018年elestvier b.v.保留所有权利。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号