Correspondence edit distance to obtain a set of weighted means of graph correspondences.
(2018)
Journal Article
MORENO-GARCÍA, C.F., SERRATOSA, F. and XIAOYI, J. 2020. Correspondence edit distance to obtain a set of weighted means of graph correspondences. Pattern recognition letters [online], 134, pages 29-36. Available from: https://doi.org/10.1016/j.patrec.2018.08.027
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 l... Read More about Correspondence edit distance to obtain a set of weighted means of graph correspondences..