{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T04:52:59Z","timestamp":1743051179182,"version":"3.40.3"},"publisher-location":"Cham","reference-count":32,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319977843"},{"type":"electronic","value":"9783319977850"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-97785-0_26","type":"book-chapter","created":{"date-parts":[[2018,8,1]],"date-time":"2018-08-01T14:49:17Z","timestamp":1533134957000},"page":"271-281","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Modelling the Generalised Median Correspondence Through an Edit Distance"],"prefix":"10.1007","author":[{"given":"Carlos Francisco","family":"Moreno-Garc\u00eda","sequence":"first","affiliation":[]},{"given":"Francesc","family":"Serratosa","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,8,2]]},"reference":[{"issue":"1\u20133","key":"26_CR1","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/j.tcs.2004.12.030","volume":"337","author":"P Bille","year":"2005","unstructured":"Bille, P.: A survey on tree edit distance and related problems. Theor. Comput. Sci. 337(1\u20133), 217\u2013239 (2005)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"26_CR2","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/s006070170006","volume":"67","author":"H Bunke","year":"2001","unstructured":"Bunke, H., G\u00fcnter, S.: Weighted mean of a pair of graphs. Computing 67(3), 209\u2013224 (2001)","journal-title":"Computing"},{"issue":"1","key":"26_CR3","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/s100440200003","volume":"5","author":"H Bunke","year":"2002","unstructured":"Bunke, H., Jiang, X., Abegglen, K., Kandel, A.: On the weighted mean of a pair of strings. Pattern Anal. Appl. 5(1), 23\u201330 (2002)","journal-title":"Pattern Anal. Appl."},{"issue":"6","key":"26_CR4","doi-asserted-by":"publisher","first-page":"1048","DOI":"10.1109\/TPAMI.2009.28","volume":"31","author":"TS Caetano","year":"2009","unstructured":"Caetano, T.S., McAuley, J.J., Cheng, L., Le, Q.V., Smola, A.J.: Learning graph matching. IEEE Trans. Pattern Anal. Mach. Intell. 31(6), 1048\u20131058 (2009)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"26_CR5","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. LNCS, vol. 8048, pp. 457\u2013465. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40246-3_57"},{"issue":"02","key":"26_CR6","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(02), 1650005 (2016)","journal-title":"Int. J. Pattern Recogn. Artif. Intell."},{"key":"26_CR7","doi-asserted-by":"crossref","unstructured":"Cort\u00e9s, X., Serratosa, F., Moreno-Garc\u00eda, C.F.: Semi-automatic pose estimation of a fleet of robots with embedded stereoscopic cameras. In: Emerging Technologies and Factory Automation (2016)","DOI":"10.1109\/ETFA.2016.7733640"},{"issue":"4","key":"26_CR8","doi-asserted-by":"publisher","first-page":"1642","DOI":"10.1016\/j.patcog.2009.10.013","volume":"43","author":"M Ferrer","year":"2010","unstructured":"Ferrer, M., Valveny, E., Serratosa, F., Riesen, K., Bunke, H.: Generalized median graph computation by means of graph embedding in vector spaces. Pattern Recogn. 43(4), 1642\u20131655 (2010)","journal-title":"Pattern Recogn."},{"key":"26_CR9","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1007\/978-3-642-34166-3_8","volume-title":"SSPR & SPR","author":"L Franek","year":"2012","unstructured":"Franek, L., Jiang, X.: Evolutionary weighted mean based framework for generalized median computation with application to strings. In: Gimelfarb, G., et al. (eds.) SSPR & SPR, pp. 70\u201378. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-34166-3_8"},{"issue":"2","key":"26_CR10","doi-asserted-by":"publisher","first-page":"833","DOI":"10.1016\/j.patcog.2013.08.019","volume":"47","author":"L Franek","year":"2014","unstructured":"Franek, L., Jiang, X.: Ensemble clustering by means of clustering embedding in vector spaces. Pattern Recogn. 47(2), 833\u2013842 (2014)","journal-title":"Pattern Recogn."},{"issue":"1","key":"26_CR11","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/s10044-012-0304-8","volume":"17","author":"L Franek","year":"2014","unstructured":"Franek, L., Jiang, X., He, C.: Weighted mean of a pair of clusterings. Pattern Anal. Appl. 17(1), 153\u2013166 (2014)","journal-title":"Pattern Anal. Appl."},{"issue":"1","key":"26_CR12","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."},{"key":"26_CR13","unstructured":"Jiang, X., Bunke, H.: Learning by generalized median concept. In: Wang, P.S.-P. (ed), Pattern Recognition and Machine Vision, Chap. 15, pp. 231\u2013246. River Publishers (2010)"},{"issue":"7","key":"26_CR14","doi-asserted-by":"publisher","first-page":"842","DOI":"10.1016\/j.patrec.2011.07.006","volume":"33","author":"X Jiang","year":"2012","unstructured":"Jiang, X., Wentker, J., Ferrer, M.: Generalized median string computation by means of string embedding in vector spaces. Pattern Recogn. Lett. 33(7), 842\u2013852 (2012)","journal-title":"Pattern Recogn. Lett."},{"issue":"4","key":"26_CR15","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/BF02278710","volume":"38","author":"R Jonker","year":"1987","unstructured":"Jonker, R., Volgenant, A.: A shortest augmenting path algorithm for dense and sparse linear assignment problems. Computing 38(4), 325\u2013340 (1987)","journal-title":"Computing"},{"key":"26_CR16","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1002\/nav.3800020109","volume":"2","author":"HW Kuhn","year":"1955","unstructured":"Kuhn, H.W.: The Hungarian method for the assignment problem. Naval Res. Log. Q. 2, 83\u201397 (1955)","journal-title":"Naval Res. Log. Q."},{"key":"26_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1007\/978-3-319-49055-7_46","volume-title":"Structural, Syntactic, and Statistical Pattern Recognition","author":"CF Moreno-Garc\u00eda","year":"2016","unstructured":"Moreno-Garc\u00eda, C.F., Cort\u00e9s, X., Serratosa, F.: A graph repository for learning error-tolerant graph matching. In: Robles-Kelly, A., Loog, M., Biggio, B., Escolano, F., Wilson, R. (eds.) S+SSPR 2016. LNCS, vol. 10029, pp. 519\u2013529. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-49055-7_46"},{"key":"26_CR18","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":"26_CR19","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1016\/j.cviu.2015.08.008","volume":"142","author":"CF Moreno-Garc\u00eda","year":"2016","unstructured":"Moreno-Garc\u00eda, C.F., Serratosa, F.: Consensus of multiple correspondences between sets of elements. Comput. Vis. Image Underst. 142, 50\u201364 (2016)","journal-title":"Comput. Vis. Image Underst."},{"key":"26_CR20","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/j.patrec.2016.09.003","volume":"87","author":"CF Moreno-Garc\u00eda","year":"2017","unstructured":"Moreno-Garc\u00eda, C.F., Serratosa, F.: Obtaining the consensus of multiple correspondences between graphs through online learning. Pattern Recogn. Lett. 87, 79\u201386 (2017)","journal-title":"Pattern Recogn. Lett."},{"issue":"1","key":"26_CR21","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s10044-015-0486-y","volume":"20","author":"CF Moreno-Garc\u00eda","year":"2017","unstructured":"Moreno-Garc\u00eda, C.F., Serratosa, F.: Correspondence consensus of two sets of correspondences through optimisation functions. Pattern Anal. Appl. 20(1), 201\u2013213 (2017)","journal-title":"Pattern Anal. Appl."},{"key":"26_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1007\/978-3-319-49055-7_45","volume-title":"Structural, Syntactic, and Statistical Pattern Recognition","author":"CF Moreno-Garc\u00eda","year":"2016","unstructured":"Moreno-Garc\u00eda, C.F., Serratosa, F., Cort\u00e9s, X.: Generalised median of a set of correspondences based on the hamming distance. In: Robles-Kelly, A., Loog, M., Biggio, B., Escolano, F., Wilson, R. (eds.) S+SSPR 2016. LNCS, vol. 10029, pp. 507\u2013518. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-49055-7_45"},{"key":"26_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1007\/978-3-319-58961-9_21","volume-title":"Graph-Based Representations in Pattern Recognition","author":"CF Moreno-Garc\u00eda","year":"2017","unstructured":"Moreno-Garc\u00eda, C.F., Serratosa, F., Jiang, X.: An edit distance between graph correspondences. In: Foggia, P., Liu, C.-L., Vento, M. (eds.) GbRPR 2017. LNCS, vol. 10310, pp. 232\u2013241. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-58961-9_21"},{"issue":"1","key":"26_CR24","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1137\/0105003","volume":"5","author":"J Munkres","year":"1957","unstructured":"Munkres, J.: Algorithms for the assignment and transportation problems. J. Soc. Ind. Appl. Math. 5(1), 32\u201338 (1957)","journal-title":"J. Soc. Ind. Appl. Math."},{"issue":"1","key":"26_CR25","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1145\/375360.375365","volume":"33","author":"G Navarro","year":"2001","unstructured":"Navarro, G.: A guided tour to approximate string matching. ACM Comput. Surv. 33(1), 31\u201388 (2001)","journal-title":"ACM Comput. Surv."},{"issue":"3","key":"26_CR26","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.: A distance measure between attributed relational graphs for pattern recognition. IEEE Trans. Syst. Man Cybern. SMC 13(3), 353\u2013362 (1983)","journal-title":"IEEE Trans. Syst. Man Cybern. SMC"},{"key":"26_CR27","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."},{"issue":"05","key":"26_CR28","doi-asserted-by":"publisher","first-page":"1260004","DOI":"10.1142\/S021800141260004X","volume":"26","author":"A Sol\u00e9-Ribalta","year":"2012","unstructured":"Sol\u00e9-Ribalta, A., Serratosa, F., Sanfeliu, A.: On the graph edit distance cost: properties and applications. Int. J. Pattern Recogn. Artif. Intell. 26(05), 1260004 (2012)","journal-title":"Int. J. Pattern Recogn. Artif. Intell."},{"issue":"2","key":"26_CR29","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":"1","key":"26_CR30","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1145\/321796.321811","volume":"21","author":"RA Wagner","year":"1974","unstructured":"Wagner, R.A., Fischer, M.J.: The string-to-string correction problem. J. ACM 21(1), 168\u2013173 (1974)","journal-title":"J. ACM"},{"issue":"9","key":"26_CR31","doi-asserted-by":"publisher","first-page":"1774","DOI":"10.1109\/TPAMI.2015.2501802","volume":"38","author":"F Zhou","year":"2016","unstructured":"Zhou, F., De La Torre, F.: Factorized graph matching. IEEE Trans. Pattern Anal. Mach. Intell. 38(9), 1774\u20131789 (2016)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"11","key":"26_CR32","doi-asserted-by":"publisher","first-page":"977","DOI":"10.1016\/S0262-8856(03)00137-9","volume":"21","author":"B Zitov\u00e1","year":"2003","unstructured":"Zitov\u00e1, B., Flusser, J.: Image registration methods: a survey. Image Vis. Comput. 21(11), 977\u20131000 (2003)","journal-title":"Image Vis. Comput."}],"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-97785-0_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T16:41:54Z","timestamp":1710348114000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-97785-0_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319977843","9783319977850"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-97785-0_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"2 August 2018","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":"Beijing","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 August 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 August 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sspr2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/ssspr2018.buaa.edu.cn\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}