{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T20:40:54Z","timestamp":1725828054562},"publisher-location":"Cham","reference-count":30,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319231914"},{"type":"electronic","value":"9783319231921"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-23192-1_10","type":"book-chapter","created":{"date-parts":[[2015,8,24]],"date-time":"2015-08-24T06:52:27Z","timestamp":1440399147000},"page":"113-124","source":"Crossref","is-referenced-by-count":0,"title":["Ground Truth Correspondence Between Nodes to Learn Graph-Matching Edit-Costs"],"prefix":"10.1007","author":[{"given":"Xavier","family":"Cort\u00e9s","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Francesc","family":"Serratosa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carlos Francisco","family":"Moreno-Garc\u00eda","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,8,25]]},"reference":[{"issue":"11","key":"10_CR1","doi-asserted-by":"publisher","first-page":"4054","DOI":"10.1016\/j.patcog.2012.04.016","volume":"45","author":"S Jouili","year":"2012","unstructured":"Jouili, S., Tabbone, S.: Hypergraph-based image retrieval for graph-based representation. Pattern Recognition 45(11), 4054\u20134068 (2012)","journal-title":"Pattern Recognition"},{"key":"10_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/11527923_20","volume-title":"Audio- and Video-Based Biometric Person Authentication","author":"M Neuhaus","year":"2005","unstructured":"Neuhaus, M., Bunke, H.: A graph matching based approach to fingerprint classification using directional variance. In: Kanade, T., Jain, A., Ratha, N.K. (eds.) AVBPA 2005. LNCS, vol. 3546, pp. 191\u2013200. Springer, Heidelberg (2005)"},{"issue":"7","key":"10_CR3","doi-asserted-by":"publisher","first-page":"2493","DOI":"10.1016\/j.eswa.2012.10.071","volume":"40","author":"F Serratosa","year":"2013","unstructured":"Serratosa, F., Cort\u00e9s, X., Sol\u00e9-Ribalta, A.: Component retrieval based on a database of graphs for Hand-Written Electronic-Scheme Digitalisation. Expert Syst. Appl. 40(7), 2493\u20132502 (2013)","journal-title":"Expert Syst. Appl."},{"issue":"1","key":"10_CR4","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10994-008-5086-2","volume":"75","author":"P Mah\u00e9","year":"2009","unstructured":"Mah\u00e9, P., Vert, J.-P.: Graph kernels based on tree patterns for molecules. Machine Learning 75(1), 3\u201335 (2009)","journal-title":"Machine Learning"},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"Fan, W.: Graph pattern matching revised for social network analysis. In: ICDT 2012, pp. 8\u201321","DOI":"10.1145\/2274576.2274578"},{"key":"10_CR6","first-page":"149","volume":"7","author":"X Qi","year":"2011","unstructured":"Qi, X., Wu, Q., Zhang, Y., Fuller, E., Zhang, C.-Q.: A novel model for DNA sequence similarity analysis based on graph theory. Evolutionary Bioinformatics 7, 149\u2013154 (2011)","journal-title":"Evolutionary Bioinformatics"},{"issue":"3","key":"10_CR7","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. on Systems, Man, and Cybernetics 13(3), 353\u2013362 (1983)","journal-title":"IEEE Trans. on Systems, Man, and Cybernetics"},{"issue":"1","key":"10_CR8","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/s10044-008-0141-y","volume":"13","author":"X Gao","year":"2010","unstructured":"Gao, X., et al.: A survey of graph edit distance. Pattern Analysis and Applications 13(1), 113\u2013129 (2010)","journal-title":"Pattern Analysis and Applications"},{"issue":"4","key":"10_CR9","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., Allermann, G.: Inexact graph matching for structural pattern recognition. Pattern Recognition Letters 1(4), 245\u2013253 (1983)","journal-title":"Pattern Recognition Letters"},{"key":"10_CR10","doi-asserted-by":"crossref","unstructured":"Sol\u00e9, A., Serratosa, F., Sanfeliu, A.: On the Graph Edit Distance cost: Properties and Applications. Intern. Journal Pattern Recognition & Artificial Intelligence 26(5) (2012)","DOI":"10.1142\/S021800141260004X"},{"issue":"3","key":"10_CR11","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. on Sys., Man, and Cybernetics, Part B 35(3), 503\u2013514 (2005)","journal-title":"IEEE Trans. on Sys., Man, and Cybernetics, Part B"},{"issue":"1","key":"10_CR12","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/j.ins.2006.02.013","volume":"177","author":"M Neuhaus","year":"2007","unstructured":"Neuhaus, M., Bunke, H.: Automatic learning of cost functions for graph edit distance. Information Sciences 177(1), 239\u2013247 (2007)","journal-title":"Information Sciences"},{"issue":"1","key":"10_CR13","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. International Journal of Computer Vision 96(1), 28\u201345 (2012)","journal-title":"International Journal of Computer Vision"},{"issue":"6","key":"10_CR14","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. Transaction on Pattern Analysis and Machine Intelligence 31(6), 1048\u20131058 (2009)","journal-title":"Transaction on Pattern Analysis and Machine Intelligence"},{"key":"10_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1007\/978-3-642-20844-7_16","volume-title":"Graph-Based Representations in Pattern Recognition","author":"F Serratosa","year":"2011","unstructured":"Serratosa, F., Sol\u00e9-Ribalta, A., Cort\u00e9s, X.: Automatic learning of edit costs based on interactive and adaptive graph recognition. In: Jiang, X., Ferrer, M., Torsello, A. (eds.) GbRPR 2011. LNCS, vol. 6658, pp. 152\u2013163. Springer, Heidelberg (2011)"},{"key":"10_CR16","unstructured":"Moreno, C., Serratosa, F.: Consensus of Two Sets of Correspondences through Optimisation Functions, Pattern Analysis and Applications (2015)"},{"key":"10_CR17","unstructured":"Mohri, M., Rostamizadeh, A., Talwalkar, A.: Foundations of Machine Learning. The MIT Press (2012). ISBN: 9780262018258"},{"key":"10_CR18","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 Recognition Letters 56, 22\u201329 (2015)","journal-title":"Pattern Recognition Letters"},{"issue":"10","key":"10_CR19","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.J.: Symbol Recognition by Error-Tolerant Subgraph Matching between Region Adjacency Graphs. IEEE Trans. Pattern Anal. Mach. Intell. 23(10), 1137\u20131143 (2001)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"4","key":"10_CR20","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1109\/34.491619","volume":"18","author":"S Gold","year":"1996","unstructured":"Gold, S., Rangarajan, A.: A Graduated Assignment Algorithm for Graph Matching. IEEE TPAMI 18(4), 377\u2013388 (1996)","journal-title":"IEEE TPAMI"},{"issue":"7","key":"10_CR21","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 Vision Computing 27(7), 950\u2013959 (2009)","journal-title":"Image Vision Computing"},{"key":"10_CR22","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 Recognition Letters 45, 244\u2013250 (2014)","journal-title":"Pattern Recognition Letters"},{"key":"10_CR23","doi-asserted-by":"crossref","unstructured":"Serratosa, F.: Speeding up Fast Bipartite Graph Matching trough a new cost matrix. International Journal of Pattern Recognition and Artificial Intelligence 29(2) (2015)","DOI":"10.1142\/S021800141550010X"},{"key":"10_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1007\/978-3-642-40246-3_57","volume-title":"Computer Analysis of Images and Patterns","author":"X Cort\u00e9s","year":"2013","unstructured":"Cort\u00e9s, X., Moreno, C., Serratosa, F.: Improving the correspondence establishment based on interactive homography estimation. In: Wilson, R., Hancock, E., Bors, A., Smith, W. (eds.) CAIP 2013, Part II. LNCS, vol. 8048, pp. 457\u2013465. Springer, Heidelberg (2013)"},{"key":"10_CR25","doi-asserted-by":"publisher","first-page":"1360","DOI":"10.1016\/j.patcog.2014.10.033","volume":"48","author":"F Serratosa","year":"2015","unstructured":"Serratosa, F., Cort\u00e9s, X.: Interactive Graph-Matching using Active Query Strategies. Pattern Recognition 48, 1360\u20131369 (2015)","journal-title":"Pattern Recognition"},{"issue":"1","key":"10_CR26","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/j.eswa.2014.07.051","volume":"42","author":"X Cort\u00e9s","year":"2015","unstructured":"Cort\u00e9s, X., Serratosa, F.: An Interactive Method for the Image Alignment problem based on Partially Supervised Correspondence. Expert Systems with Applications 42(1), 179\u2013192 (2015)","journal-title":"Expert Systems with Applications"},{"key":"10_CR27","unstructured":"http:\/\/www.featurespace.org"},{"issue":"3","key":"10_CR28","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1016\/j.cviu.2007.09.014","volume":"110","author":"H Bay","year":"2008","unstructured":"Bay, H., Ess, A., Tuytelaars, T., Van Gool, L.: SURF: Speeded Up Robust Features. Comp. Vision and Image Unders. 110(3), 346\u2013359 (2008)","journal-title":"Comp. Vision and Image Unders."},{"key":"10_CR29","first-page":"793","volume":"7","author":"B Delaunay","year":"1934","unstructured":"Delaunay, B.: Sur la sph\u00e8re vide. Izvestia Akademii Nauk SSSR, Otdelenie Matematicheskikh i Estestvennykh Nauk 7, 793\u2013800 (1934)","journal-title":"Izvestia Akademii Nauk SSSR, Otdelenie Matematicheskikh i Estestvennykh Nauk"},{"key":"10_CR30","doi-asserted-by":"crossref","unstructured":"Nelder, J.A., Mead, R.: Computer Journal 7, 308\u2013313 (1965)","DOI":"10.1093\/comjnl\/7.4.308"}],"container-title":["Lecture Notes in Computer Science","Computer Analysis of Images and Patterns"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-23192-1_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T14:31:35Z","timestamp":1559226695000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-23192-1_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319231914","9783319231921"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-23192-1_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}