Articles producció científica> Enginyeria Informàtica i Matemàtiques

Correspondence consensus of two sets of correspondences through optimisation functions

  • Datos identificativos

    Identificador: imarina:5128993
    Autores:
    Moreno-García CSerratosa F
    Resumen:
    We present a consensus method which, given the two correspondences between sets of elements generated by separate entities, enounces a final correspondence consensus considering the existence of outliers. Our method is based on an optimisation technique that minimises the cost of the correspondence while forcing (to the most) to be the mean correspondence of the two original correspondences. The method decides the mapping of the elements that the original correspondences disagree and returns the same element mapping when both correspondences agree. We first show the validity of the method through an experiment in ideal conditions based on palmprint identification, and subsequently present two practical experiments based on image retrieval.
  • Otros:

    Autor según el artículo: Moreno-García C; Serratosa F
    Departamento: Enginyeria Informàtica i Matemàtiques
    Autor/es de la URV: MORENO GARCIA, CARLOS FRANCISCO / Serratosa Casanelles, Francesc d'Assís
    Palabras clave: Munkres algorithm Graph edit distance Bipartite graph matching
    Resumen: We present a consensus method which, given the two correspondences between sets of elements generated by separate entities, enounces a final correspondence consensus considering the existence of outliers. Our method is based on an optimisation technique that minimises the cost of the correspondence while forcing (to the most) to be the mean correspondence of the two original correspondences. The method decides the mapping of the elements that the original correspondences disagree and returns the same element mapping when both correspondences agree. We first show the validity of the method through an experiment in ideal conditions based on palmprint identification, and subsequently present two practical experiments based on image retrieval.
    Áreas temáticas: Medicina i Matemática / probabilidade e estatística Interdisciplinar Engenharias iv Computer vision and pattern recognition Computer science, artificial intelligence Ciências biológicas i Ciência da computação Artificial intelligence Administração pública e de empresas, ciências contábeis e turismo
    Acceso a la licencia de uso: https://creativecommons.org/licenses/by/3.0/es/
    Direcció de correo del autor: francesc.serratosa@urv.cat
    Identificador del autor: 0000-0001-6112-5913
    Fecha de alta del registro: 2024-09-07
    Versión del articulo depositado: info:eu-repo/semantics/acceptedVersion
    Enlace a la fuente original: https://link.springer.com/article/10.1007/s10044-015-0486-y
    URL Documento de licencia: https://repositori.urv.cat/ca/proteccio-de-dades/
    Referencia al articulo segun fuente origial: Pattern Analysis And Applications. 20 (1): 201-213
    Referencia de l'ítem segons les normes APA: Moreno-García C; Serratosa F (2017). Correspondence consensus of two sets of correspondences through optimisation functions. Pattern Analysis And Applications, 20(1), 201-213. DOI: 10.1007/s10044-015-0486-y
    DOI del artículo: 10.1007/s10044-015-0486-y
    Entidad: Universitat Rovira i Virgili
    Año de publicación de la revista: 2017
    Tipo de publicación: Journal Publications
  • Palabras clave:

    Artificial Intelligence,Computer Science, Artificial Intelligence,Computer Vision and Pattern Recognition
    Munkres algorithm
    Graph edit distance
    Bipartite graph matching
    Medicina i
    Matemática / probabilidade e estatística
    Interdisciplinar
    Engenharias iv
    Computer vision and pattern recognition
    Computer science, artificial intelligence
    Ciências biológicas i
    Ciência da computação
    Artificial intelligence
    Administração pública e de empresas, ciências contábeis e turismo
  • Documentos:

  • Cerca a google

    Search to google scholar