| Fast computation of bipartite graph matching F Serratosa Pattern Recognition Letters 45, 244-250, 2014 | 173 | 2014 |
| Generalized median graph computation by means of graph embedding in vector spaces M Ferrer, E Valveny, F Serratosa, K Riesen, H Bunke Pattern Recognition 43 (4), 1642-1655, 2010 | 130 | 2010 |
| Graph-based representations and techniques for image processing and image analysis A Sanfeliu, R Alquézar, J Andrade, J Climent, F Serratosa, J Vergés Pattern recognition 35 (3), 639-650, 2002 | 122 | 2002 |
| Speeding up fast bipartite graph matching through a new cost matrix F Serratosa International Journal of Pattern Recognition and Artificial Intelligence 29 …, 2015 | 101 | 2015 |
| Function-described graphs for modelling objects represented by sets of attributed graphs F Serratosa, R Alquézar, A Sanfeliu Pattern recognition 36 (3), 781-798, 2003 | 84 | 2003 |
| On the graph edit distance cost: properties and applications A Solé-Ribalta, F Serratosa, A Sanfeliu International Journal of Pattern Recognition and Artificial Intelligence 26 …, 2012 | 82 | 2012 |
| Signatures versus histograms: Definitions, distances and algorithms F Serratosa, A Sanfeliu Pattern recognition 39 (5), 921-934, 2006 | 77 | 2006 |
| Enabling semantic similarity estimation across multiple ontologies: An evaluation in the biomedical domain D Sánchez, A Solé-Ribalta, M Batet, F Serratosa Journal of Biomedical Informatics, 2012 | 69 | 2012 |
| Ligand-based virtual screening using graph edit distance as molecular similarity measure C Garcia-Hernandez, A Fernandez, F Serratosa Journal of chemical information and modeling 59 (4), 1410-1421, 2019 | 68 | 2019 |
| Learning graph-matching edit-costs based on the optimality of the oracle's node correspondences X Cortés, F Serratosa Pattern Recognition Letters 56, 22-29, 2015 | 65 | 2015 |
| A new graph matching method for point-set correspondence using the EM algorithm and Softassign G Sanromà, R Alquézar, F Serratosa Computer Vision and Image Understanding, 2012 | 65 | 2012 |
| Computation of graph edit distance: Reasoning about optimality and speed-up F Serratosa Image and Vision Computing 40, 38-48, 2015 | 63 | 2015 |
| Second-order random graphs for modeling sets of attributed graphs and their application to object learning and recognition A Sanfeliu, F Serratosa, R Alquézar International Journal of Pattern Recognition and Artificial Intelligence 18 …, 2004 | 63 | 2004 |
| Synthesis of function-described graphs and clustering of attributed graphs F Serratosa, R Alquézar, A Sanfeliu International journal of pattern recognition and artificial intelligence 16 …, 2002 | 59 | 2002 |
| La biometría para la identificación de las personas F Serratosa Universitat Oberta de Catalunya, 8-20, 2008 | 55 | 2008 |
| Graph edit distance: Moving from global to local structure to solve the graph-matching problem F Serratosa, X Cortés Pattern recognition letters 65, 204-210, 2015 | 54 | 2015 |
| Towards the estimation of feature-based semantic similarity using multiple ontologies A Solé-Ribalta, D Sánchez, M Batet, F Serratosa Knowledge-Based Systems 55, 101-113, 2014 | 52 | 2014 |
| Graph-Based k-Means Clustering: A Comparison of the Set Median versus the Generalized Median Graph M Ferrer, E Valveny, F Serratosa, I Bardají, H Bunke International conference on computer analysis of images and patterns, 342-350, 2009 | 51 | 2009 |
| Models and algorithms for computing the common labelling of a set of attributed graphs A Solé-Ribalta, F Serratosa Computer Vision and Image Understanding 115 (7), 929-945, 2011 | 49 | 2011 |
| Synthesis of median spectral graph M Ferrer, F Serratosa, A Sanfeliu Pattern Recognition and Image Analysis: Second Iberian Conference, IbPRIA …, 2005 | 47 | 2005 |
Alberto SanfeliuProfessorبريد إلكتروني تم التحقق منه على iri.upc.edu