{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T08:10:21Z","timestamp":1759133421767,"version":"3.41.0"},"publisher-location":"Cham","reference-count":29,"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_45","type":"book-chapter","created":{"date-parts":[[2016,11,4]],"date-time":"2016-11-04T14:02:34Z","timestamp":1478268154000},"page":"507-518","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Generalised Median of a Set of Correspondences Based on the Hamming Distance"],"prefix":"10.1007","author":[{"given":"Carlos Francisco","family":"Moreno-Garc\u00eda","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Francesc","family":"Serratosa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xavier","family":"Cort\u00e9s","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,11,5]]},"reference":[{"issue":"11","key":"45_CR1","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."},{"issue":"1","key":"45_CR2","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":"9","key":"45_CR3","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. Theoret. Comput. Sci. 337(9), 217\u2013239 (2005)","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"45_CR4","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 Recognit. Artif Intell. 18(3), 265\u2013298 (2004)","journal-title":"Int. J. Pattern Recognit. Artif Intell."},{"issue":"1","key":"45_CR5","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 Recognit. Artif Intell. 28(1), 1450001 (2014)","journal-title":"Int. J. Pattern Recognit. Artif Intell."},{"key":"45_CR6","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":"45_CR7","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":"45_CR8","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 Recognit. Artif. Intell. 29(2), 1550010 (2015)","journal-title":"Int. J. Pattern Recognit. Artif. Intell."},{"issue":"5","key":"45_CR9","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 Recognit. Artif Intell. 26(5), 1260004 (2012)","journal-title":"Int. J. Pattern Recognit. Artif Intell."},{"key":"45_CR10","doi-asserted-by":"crossref","unstructured":"Serratosa, F., Alqu\u00e9zar, R., Sanfeliu, A.: Efficient algorithms for matching attributed graphs and function-described graphs. In: Proceedings of the 15th International Conference on Pattern Recognition, (ICPR), vol. 2, pp. 871\u2013876 (2000)","DOI":"10.1109\/ICPR.2000.906212"},{"issue":"10","key":"45_CR11","doi-asserted-by":"publisher","first-page":"1144","DOI":"10.1109\/34.954604","volume":"23","author":"X Jiang","year":"2001","unstructured":"Jiang, X., Munger, A., Bunke, H.: On median graphs: properties, algorithms, and applications. IEEE Trans. Pattern Anal. Mach. Intell. 23(10), 1144\u20131151 (2001)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"45_CR12","unstructured":"Jiang, X., Bunke H.: Learning by generalized median concept. In: Wang, P. (ed) Pattern Recognition and Machine Vision, Chap. 15, pp. 231\u2013246. River Publisher (2010)"},{"issue":"3","key":"45_CR13","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1142\/S0218001411008683","volume":"25","author":"S Vega-Pons","year":"2011","unstructured":"Vega-Pons, S., Ruiz-Shulcloper, J.: A survey of clustering ensemble algorithms. Int. J. Pattern Recognit. Artif Intell. 25(3), 337\u2013372 (2011)","journal-title":"Int. J. Pattern Recognit. Artif Intell."},{"key":"45_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, 842\u2013852 (2012)","journal-title":"Pattern Recogn. Lett."},{"key":"45_CR15","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. Patter Recognit. 43, 1642\u20131655 (2010)","journal-title":"Patter Recognit."},{"issue":"2","key":"45_CR16","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."},{"key":"45_CR17","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, 23\u201330 (2002)","journal-title":"Pattern Anal. Appl."},{"key":"45_CR18","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/s006070170006","volume":"67","author":"H Bunke","year":"2001","unstructured":"Bunke, H., Gunter, S.: Weighted mean of a pair of graphs. Computing 67, 209\u2013224 (2001)","journal-title":"Computing"},{"key":"45_CR19","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, 153\u2013166 (2014)","journal-title":"Pattern Anal. Appl."},{"key":"45_CR20","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1007\/978-3-642-34166-3_8","volume-title":"Syntactic and Structural Pattern Recognition (SSPR)","author":"L Franek","year":"2012","unstructured":"Franek, L., Jiang, X.: Evolutionary weighted mean based framework for generalized median computation with application to strings. In: Gimel, G., et al. (eds.) SSPR & SPR 2012. LNCS, vol. 7626, pp. 70\u201378. Springer, Heidelberg (2012)"},{"key":"45_CR21","doi-asserted-by":"crossref","unstructured":"Moreno-Garc\u00eda, C.F., Serratosa, F.: Consensus of two sets of correspondences through optimisation functions. Pattern Anal. Appl., 1\u201313 (2015)","DOI":"10.1007\/s10044-015-0486-y"},{"key":"45_CR22","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":"45_CR23","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 Generalisation of the Bipartite Graph Matching. In: Liu, C.-L., Luo, B., Kropatsch, W.G., Cheng, J. (eds.) GbRPR 2015. LNCS, vol. 9069, pp. 87\u201397. Springer, Heidelberg (2015)"},{"key":"45_CR24","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":"45_CR25","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 Recognit. Letters. (2016). doi:10.1016\/j.patrec.2016.09.003","journal-title":"Pattern Recognit. Letters."},{"key":"45_CR26","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/j.datak.2012.06.003","volume":"85","author":"S Saha","year":"2013","unstructured":"Saha, S., Ekbal, A.: Combining multiple classifiers using vote based classifier ensemble technique for named entity recognition. Data Knowl. Eng. 85, 15\u201339 (2013)","journal-title":"Data Knowl. Eng."},{"issue":"1\u20132","key":"45_CR27","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 export. Naval Res. Logistics Q. 2(1\u20132), 83\u201397 (1955)","journal-title":"Naval Res. Logistics Q."},{"issue":"1","key":"45_CR28","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. of Ind. Appl. Math. 5(1), 32\u201338 (1957)","journal-title":"J. Soc. of Ind. Appl. Math."},{"issue":"4","key":"45_CR29","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/0167-6377(86)90073-8","volume":"5","author":"R Jonker","year":"1986","unstructured":"Jonker, R., Volgenant, T.: Improving the hungarian assignment algorithm. Oper. Res. Lett. 5(4), 171\u2013175 (1986)","journal-title":"Oper. Res. Lett."}],"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_45","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,12]],"date-time":"2025-06-12T00:15:01Z","timestamp":1749687301000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-49055-7_45"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319490540","9783319490557"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-49055-7_45","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"}]}}