Now showing items 1-2 of 2

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

    Moreno-García, Carlos Francisco; Serratosa, Francesc; Jiang, Xiaoyi (Elsevier https://doi.org/10.1016/j.patrec.2018.08.027, 2018-08-30)
    MORENO-GARCIA, C.F., SERRATOSA, F. and JIANG, X. 2018. Correspondence edit distance to obtain a set of weighted means of graph correspondences. Pattern recognition letters [online], In Press. 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 ...
  • Generalised median of graph correspondences. 

    Moreno-García, Carlos Francisco; Serratosa, Francesc (Elsevier https://doi.org/10.1016/j.patrec.2019.05.015, 2019-05-21)
    MORENO-GARCÍA, C.F. and SERRATOSA, F. 2019. Generalised median of graph correspondences. Pattern recognition letters [online], 125, pages 389-395. Available from: https://doi.org/10.1016/j.patrec.2019.05.015
    A graph correspondence is defined as a function that maps the elements of two attributed graphs. Due to the increasing availability of methods to perform graph matching, numerous graph correspondences can be deducted for ...