{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T08:06:10Z","timestamp":1759133170891,"version":"3.41.0"},"publisher-location":"Cham","reference-count":46,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319490540"},{"type":"electronic","value":"9783319490557"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-49055-7_46","type":"book-chapter","created":{"date-parts":[[2016,11,4]],"date-time":"2016-11-04T14:02:34Z","timestamp":1478268154000},"page":"519-529","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":17,"title":["A Graph Repository for Learning Error-Tolerant Graph Matching"],"prefix":"10.1007","author":[{"given":"Carlos Francisco","family":"Moreno-Garc\u00eda","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xavier","family":"Cort\u00e9s","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Francesc","family":"Serratosa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,11,5]]},"reference":[{"issue":"3","key":"46_CR1","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1142\/S0218001404003228","volume":"18","author":"D Conte","year":"2004","unstructured":"Conte, D., Foggia, P., Sansone, C., Vento, M.: Thirty years of graph matching in pattern recognition. Int. J. Pattern Recogn. Artif. Intell. 18(3), 265\u2013298 (2004)","journal-title":"Int. J. Pattern Recogn. Artif. Intell."},{"issue":"1","key":"46_CR2","doi-asserted-by":"publisher","first-page":"1450001","DOI":"10.1142\/S0218001414500013","volume":"28","author":"P Foggia","year":"2014","unstructured":"Foggia, P., Percannella, G., Vento, M.: Graph matching and learning in pattern recognition in the last ten years. Int. J. Pattern Recogn. Artif. Intell. 28(1), 1450001 (2014)","journal-title":"Int. J. Pattern Recogn. Artif. Intell."},{"issue":"2","key":"46_CR3","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/j.patcog.2014.01.002","volume":"48","author":"M Vento","year":"2015","unstructured":"Vento, M.: A long trip in the charming world of graphs for pattern recognition. Pattern Recogn. 48(2), 291\u2013301 (2015)","journal-title":"Pattern Recogn."},{"issue":"3","key":"46_CR4","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1109\/TSMC.1983.6313167","volume":"13","author":"A Sanfeliu","year":"1983","unstructured":"Sanfeliu, A., Fu, K.S.: A distance measure between attributed relational graphs for pattern recognition. IEEE Trans. Syst. Man Cybern. 13(3), 353\u2013362 (1983)","journal-title":"IEEE Trans. Syst. Man Cybern."},{"key":"46_CR5","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/0167-8655(83)90033-8","volume":"1","author":"H Bunke","year":"1983","unstructured":"Bunke, H.: Inexact graph matching for structural pattern recognition. Pattern Recogn. Lett. 1, 245\u2013253 (1983)","journal-title":"Pattern Recogn. Lett."},{"key":"46_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/978-3-540-89689-0_33","volume-title":"Structural, Syntactic, and Statistical Pattern Recognition","author":"K Riesen","year":"2008","unstructured":"Riesen, K., Bunke, H.: IAM graph database repository for graph based pattern recognition and machine learning. In: da Vitoria Lobo, N., Kasparis, T., Roli, F., Kwok, J.T., Georgiopoulos, M., Anagnostopoulos, G.C., Loog, M. (eds.) SSPR & SPR 2008. LNCS, vol. 5342, pp. 287\u2013297. Springer, Heidelberg (2008)"},{"issue":"5","key":"46_CR7","doi-asserted-by":"publisher","first-page":"599","DOI":"10.1109\/TPAMI.1985.4767707","volume":"7","author":"A Wong","year":"1985","unstructured":"Wong, A., You, M.: Entropy and distance of random graphs with application to structural pattern recognition. IEEE Trans. Pattern Anal. Mach. Intell. 7(5), 599\u2013609 (1985)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"3","key":"46_CR8","doi-asserted-by":"publisher","first-page":"781","DOI":"10.1016\/S0031-3203(02)00107-3","volume":"36","author":"F Serratosa","year":"2003","unstructured":"Serratosa, F., Alqu\u00e9zar, R., Sanfeliu, A.: Function-described graphs for modelling objects represented by attributed graphs. Pattern Recogn. 36(3), 781\u2013798 (2003)","journal-title":"Pattern Recogn."},{"issue":"3","key":"46_CR9","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1142\/S0218001404003253","volume":"18","author":"A Sanfeliu","year":"2004","unstructured":"Sanfeliu, A., Serratosa, F., Alqu\u00e9zar, R.: Second-order random graphs for modelling sets of attributed graphs and their application to object learning and recognition. Int. J. Pattern Recogn. Artif. Intell. 18(3), 375\u2013396 (2004)","journal-title":"Int. J. Pattern Recogn. Artif. Intell."},{"issue":"5","key":"46_CR10","doi-asserted-by":"publisher","first-page":"1260004","DOI":"10.1142\/S021800141260004X","volume":"26","author":"A Sol\u00e9","year":"2012","unstructured":"Sol\u00e9, A., Serratosa, F., Sanfeliu, A.: On the graph edit distance cost: properties and applications. Int. J. Pattern Recogn. Artif. Intell. 26(5), 1260004 (2012)","journal-title":"Int. J. Pattern Recogn. Artif. Intell."},{"issue":"10","key":"46_CR11","doi-asserted-by":"publisher","first-page":"1137","DOI":"10.1109\/34.954603","volume":"23","author":"J Llad\u00f3s","year":"2001","unstructured":"Llad\u00f3s, J., Mart\u00ed, E., Villanueva, J.: Symbol recognition by error-tolerant subgraph matching between region adjacency graphs. Trans. Pattern Anal. Mach. Intell. 23(10), 1137\u20131143 (2001)","journal-title":"Trans. Pattern Anal. Mach. Intell."},{"key":"46_CR12","doi-asserted-by":"publisher","first-page":"950","DOI":"10.1016\/j.imavis.2008.04.004","volume":"27","author":"K Riesen","year":"2009","unstructured":"Riesen, K., Bunke, H.: Approximate graph edit distance computation by means of bipartite graph matching. Image Vis. Comput. 27, 950\u2013959 (2009)","journal-title":"Image Vis. Comput."},{"key":"46_CR13","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1016\/j.patrec.2014.04.015","volume":"45","author":"F Serratosa","year":"2014","unstructured":"Serratosa, F.: Fast computation of bipartite graph matching. Pattern Recogn. Lett. 45, 244\u2013250 (2014)","journal-title":"Pattern Recogn. Lett."},{"key":"46_CR14","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1016\/j.imavis.2015.06.005","volume":"40","author":"F Serratosa","year":"2015","unstructured":"Serratosa, F.: Computation of graph edit distance: reasoning about optimality and speed-up. Image Vis. Comput. 40, 38\u201348 (2015)","journal-title":"Image Vis. Comput."},{"issue":"2","key":"46_CR15","doi-asserted-by":"publisher","first-page":"1550010","DOI":"10.1142\/S021800141550010X","volume":"29","author":"F Serratosa","year":"2015","unstructured":"Serratosa, F.: Speeding up fast bipartite graph matching through a new cost matrix. Int. J. Pattern Recogn. Artif. Intell. 29(2), 1550010 (2015)","journal-title":"Int. J. Pattern Recogn. Artif. Intell."},{"key":"46_CR16","first-page":"1","volume":"2015","author":"CF Moreno-Garc\u00eda","year":"2015","unstructured":"Moreno-Garc\u00eda, C.F., Serratosa, F.: Consensus of two sets of correspondences through optimisation functions. Pattern Anal. Appl. 2015, 1\u201313 (2015)","journal-title":"Pattern Anal. Appl."},{"key":"46_CR17","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1016\/j.cviu.2015.08.008","volume":"142","author":"CF Moreno-Garc\u00eda","year":"2015","unstructured":"Moreno-Garc\u00eda, C.F., Serratosa, F.: Consensus of multiple correspondences between sets of elements. Comput. Vis. Image Underst. 142, 50\u201364 (2015)","journal-title":"Comput. Vis. Image Underst."},{"key":"46_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/978-3-319-18224-7_9","volume-title":"Graph-Based Representations in Pattern Recognition","author":"CF Moreno-Garc\u00eda","year":"2015","unstructured":"Moreno-Garc\u00eda, C.F., Serratosa, F., Cort\u00e9s, X.: Consensus of two graph correspondences through a generalization of the bipartite graph matching. In: Liu, C.-L., Luo, B., Kropatsch, Walter G., Cheng, J. (eds.) GbRPR 2015. LNCS, vol. 9069, pp. 87\u201397. Springer, Heidelberg (2015)"},{"key":"46_CR19","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/j.knosys.2015.09.034","volume":"90","author":"CF Moreno-Garc\u00eda","year":"2015","unstructured":"Moreno-Garc\u00eda, C.F., Serratosa, F.: Online learning the consensus of multiple correspondences between sets. Knowl. Based Syst. 90, 49\u201357 (2015)","journal-title":"Knowl. Based Syst."},{"key":"46_CR20","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2016.09.003","author":"CF Moreno-Garc\u00eda","year":"2016","unstructured":"Moreno-Garc\u00eda, C.F., Serratosa, F.: Obtaining the consensus of multiple correspondences between graphs through online learning. Pattern Recogn. Lett. (2016). doi:10.1016\/j.patrec.2016.09.003","journal-title":"Pattern Recogn. Lett."},{"key":"46_CR21","doi-asserted-by":"publisher","first-page":"2029","DOI":"10.1016\/j.patrec.2012.04.008","volume":"33","author":"G Sanrom\u00e0","year":"2012","unstructured":"Sanrom\u00e0, G., Alqu\u00e9zar, R., Serratosa, F., Herrera, B.: Smooth point-set registration using neighbouring constraints. Pattern Recogn. Lett. 33, 2029\u20132037 (2012)","journal-title":"Pattern Recogn. Lett."},{"issue":"2","key":"46_CR22","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1016\/j.cviu.2011.10.009","volume":"116","author":"G Sanrom\u00e0","year":"2012","unstructured":"Sanrom\u00e0, G., Alqu\u00e9zar, R., Serratosa, F.: A new graph matching method for point-set correspondence using the EM algorithm and softassign. Comput. Vis. Image Underst. 116(2), 292\u2013304 (2012)","journal-title":"Comput. Vis. Image Underst."},{"issue":"1","key":"46_CR23","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/j.ins.2006.02.013","volume":"177","author":"M Neuhaus","year":"2006","unstructured":"Neuhaus, M., Bunke, H.: Automatic learning of cost functions for graph edit distance. Inf. Sci. 177(1), 239\u2013247 (2006)","journal-title":"Inf. Sci."},{"issue":"3","key":"46_CR24","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1109\/TSMCB.2005.846635","volume":"35","author":"M Neuhaus","year":"2005","unstructured":"Neuhaus, M., Bunke, H.: Self-organizing maps for learning the edit costs in graph matching. IEEE Trans. Syst. Man Cybern. Part B 35(3), 503\u2013514 (2005)","journal-title":"IEEE Trans. Syst. Man Cybern. Part B"},{"unstructured":"http:\/\/www.iam.unibe.ch\/fki\/databases\/iam-graph-database","key":"46_CR25"},{"unstructured":"Foggia, P., Sansone, C., Vento, M.: A database of graphs for isomorphism and subgraph isomorphism benchmarking. In: Proceedings of 3rd International Workshop on Graph Based Representations in Pattern Recognition, pp. 176\u2013187 (2001)","key":"46_CR26"},{"key":"46_CR27","doi-asserted-by":"publisher","first-page":"1067","DOI":"10.1016\/S0167-8655(02)00253-2","volume":"24","author":"M De Santo","year":"2003","unstructured":"De Santo, M., Foggia, P., Sansone, C., Vento, M.: A large database of graphs and its use for benchmarking graph isomorphism algorithms. Pattern Recogn. Lett. 24, 1067\u20131079 (2003)","journal-title":"Pattern Recogn. Lett."},{"unstructured":"http:\/\/iapr-tc15.greyc.fr\/links.html","key":"46_CR28"},{"doi-asserted-by":"crossref","unstructured":"Abu-Aisheh, Z., Raveaux, R., Ramel, J.Y.: A graph database repository and performance evaluation metrics for graph edit distance. In: IAPR International Workshop on Graph Based Representation (2015)","key":"46_CR29","DOI":"10.1007\/978-3-319-18224-7_14"},{"unstructured":"http:\/\/www.rfai.li.univ-tours.fr\/PublicData\/GDR4GED\/home.html","key":"46_CR30"},{"issue":"1","key":"46_CR31","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/s10044-008-0141-y","volume":"13","author":"X Gao","year":"2010","unstructured":"Gao, X., Xiao, B., Tao, D., Li, X.: A survey of graph edit distance. Pattern Anal. Appl. 13(1), 113\u2013129 (2010)","journal-title":"Pattern Anal. Appl."},{"issue":"10","key":"46_CR32","doi-asserted-by":"publisher","first-page":"1646","DOI":"10.1109\/TPAMI.2006.207","volume":"28","author":"T Caetano","year":"2006","unstructured":"Caetano, T., Caelli, T., Schuurmans, D., Barone, D.: Graphical models and point pattern matching. IEEE Trans. Pattern Anal. Mach. Intell. 28(10), 1646\u20131663 (2006)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"6","key":"46_CR33","doi-asserted-by":"publisher","first-page":"1048","DOI":"10.1109\/TPAMI.2009.28","volume":"31","author":"T Caetano","year":"2009","unstructured":"Caetano, T., et al.: Learning graph matching. Trans. Pattern Anal. Mach. Intell. 31(6), 1048\u20131058 (2009)","journal-title":"Trans. Pattern Anal. Mach. Intell."},{"unstructured":"http:\/\/www.cs.cmu.edu\/afs\/cs\/project\/vision\/vasc\/idb\/www\/html_permanent\/\/index.html","key":"46_CR34"},{"issue":"2","key":"46_CR35","doi-asserted-by":"publisher","first-page":"1650005","DOI":"10.1142\/S0218001416500051","volume":"30","author":"X Cort\u00e9s","year":"2016","unstructured":"Cort\u00e9s, X., Serratosa, F.: Learning graph matching substitution weights based on the ground-truth node correspondence. Int. J. Pattern Recogn. Artif. Intell. 30(2), 1650005 (2016)","journal-title":"Int. J. Pattern Recogn. Artif. Intell."},{"issue":"1","key":"46_CR36","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1007\/s11263-011-0442-2","volume":"96","author":"M Leordeanu","year":"2012","unstructured":"Leordeanu, M., Sukthankar, R., Hebert, M.: Unsupervised learning for graph matching. Int. J. Comput. Vis. 96(1), 28\u201345 (2012)","journal-title":"Int. J. Comput. Vis."},{"key":"46_CR37","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1016\/j.patrec.2015.01.009","volume":"56","author":"X Cort\u00e9s","year":"2015","unstructured":"Cort\u00e9s, X., Serratosa, F.: Learning graph-matching edit-costs based on the optimality of the oracle\u2019s node correspondences. Pattern Recogn. Lett. 56, 22\u201329 (2015)","journal-title":"Pattern Recogn. Lett."},{"unstructured":"http:\/\/deim.urv.cat\/~francesc.serratosa\/databases\/","key":"46_CR38"},{"unstructured":"http:\/\/www.featurespace.org","key":"46_CR39"},{"issue":"2","key":"46_CR40","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1023\/B:VISI.0000029664.99615.94","volume":"60","author":"DG Lowe","year":"2004","unstructured":"Lowe, D.G.: Distinctive image features from scale-invariant keypoints. Int. J. Comput. Vis. 60(2), 91\u2013110 (2004)","journal-title":"Int. J. Comput. Vis."},{"issue":"8","key":"46_CR41","doi-asserted-by":"publisher","first-page":"1618","DOI":"10.1109\/TPAMI.2011.237","volume":"34","author":"J Dai","year":"2012","unstructured":"Dai, J., Feng, J., Zhou, J.: Robust and efficient ridge based palmprint matching. IEEE Trans. Pattern Anal. Mach. Intell. 34(8), 1618\u20131632 (2012)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"5","key":"46_CR42","doi-asserted-by":"publisher","first-page":"945","DOI":"10.1109\/TPAMI.2010.164","volume":"33","author":"J Dai","year":"2011","unstructured":"Dai, J., Zhou, J.: Multi-feature based high-resolution palmprint recognition. IEEE Trans. Pattern Anal. Mach. Intell. 33(5), 945\u2013957 (2011)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"8","key":"46_CR43","doi-asserted-by":"publisher","first-page":"799","DOI":"10.1109\/34.531800","volume":"18","author":"NK Ratha","year":"1996","unstructured":"Ratha, N.K., Karu, K., Chen, S., Jain, A.K.: A real-time matching system for large fingerprint databases. IEEE Trans. Pattern Anal. Mach. Intell. 18(8), 799\u2013813 (1996)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"unstructured":"http:\/\/www.cs.cornell.edu\/~snavely\/bundler\/","key":"46_CR44"},{"doi-asserted-by":"crossref","unstructured":"Snavely, N., Todorovic, S.: From contours to 3D object detection and pose estimation. In: International Congress on Computer Vision (ICVV), pp. 983\u2013990 (2011)","key":"46_CR45","DOI":"10.1109\/ICCV.2011.6126342"},{"unstructured":"http:\/\/vasc.ri.cmu.edu\/idb\/html\/motion\/","key":"46_CR46"}],"container-title":["Lecture Notes in Computer Science","Structural, Syntactic, and Statistical Pattern Recognition"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-49055-7_46","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,12]],"date-time":"2025-06-12T00:15:13Z","timestamp":1749687313000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-49055-7_46"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319490540","9783319490557"],"references-count":46,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-49055-7_46","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"5 November 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"S+SSPR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Joint IAPR International Workshops on Statistical Techniques in Pattern Recognition (SPR) and Structural and Syntactic Pattern Recognition (SSPR)","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"M\u00e9rida","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Mexico","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2016","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 November 2016","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 December 2016","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sspr2016","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}