{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:34:55Z","timestamp":1742913295714,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319182230"},{"type":"electronic","value":"9783319182247"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-18224-7_9","type":"book-chapter","created":{"date-parts":[[2015,5,4]],"date-time":"2015-05-04T16:48:35Z","timestamp":1430758115000},"page":"87-97","source":"Crossref","is-referenced-by-count":3,"title":["Consensus of Two Graph Correspondences Through a Generalisation of the Bipartite Graph Matching"],"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","reference":[{"key":"9_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/978-3-662-44415-3_31","volume-title":"Structural, Syntactic, and Statistical Pattern Recognition","author":"C.F. Moreno-Garc\u00eda","year":"2014","unstructured":"Moreno-Garc\u00eda, C.F., Serratosa, F.: Weighted Mean Assignment of a Pair of Correspondences Using Optimisation Functions. In: Fr\u00e4nti, P., Brown, G., Loog, M., Escolano, F., Pelillo, M. (eds.) S+SSPR 2014. LNCS, vol.\u00a08621, pp. 301\u2013311. Springer, Heidelberg (2014)"},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"Franek, F., Jiang, X., He, C.: Weighted Mean of a Pair of Clusterings. Pattern Analysis Applications (2012)","DOI":"10.1007\/s10044-012-0304-8"},{"key":"9_CR3","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 Recognition Letters\u00a033, 2029\u20132037 (2012)","journal-title":"Pattern Recognition Letters"},{"issue":"2","key":"9_CR4","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. Computer Vision and Image Understanding\u00a0116(2), 292\u2013304 (2012)","journal-title":"Computer Vision and Image Understanding"},{"issue":"4","key":"9_CR5","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. Pattern Analysis and Machine Intelligence\u00a018(4), 377\u2013388 (1996)","journal-title":"Pattern Analysis and Machine Intelligence"},{"key":"9_CR6","doi-asserted-by":"crossref","unstructured":"Serratosa, F.: Speeding up Fast Bipartite Graph Matching through a New Cost Matrix. International Journal of Pattern Recognition & Artificial Intelligence 29(2) (2015)","DOI":"10.1142\/S021800141550010X"},{"key":"9_CR7","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\u00a045, 244\u2013250 (2014)","journal-title":"Pattern Recognition Letters"},{"issue":"7","key":"9_CR8","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 Comput.\u00a027(7), 950\u2013959 (2009)","journal-title":"Image Vision Comput."},{"key":"9_CR9","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\u00a048, 1360\u20131369 (2015)","journal-title":"Pattern Recognition"},{"issue":"1","key":"9_CR10","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\u00a042(1), 179\u2013192 (2015)","journal-title":"Expert Systems With Applications"},{"key":"9_CR11","unstructured":"Papadimitriou, C., Steiglitz, K.: Combinatorial Optimization: Algorithms and Complexity. Dover Publications (1998)"},{"issue":"1-2","key":"9_CR12","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1002\/nav.3800020109","volume":"2","author":"H.W. Kuhn","year":"1955","unstructured":"Kuhn, H.W.: The Hungarian Method for the Assignment Problem Export. Naval Research Logistics Quarterly\u00a02(1-2), 83\u201397 (1955)","journal-title":"Naval Research Logistics Quarterly"},{"issue":"4","key":"9_CR13","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. Operations Research Letters\u00a05(4), 171\u2013175 (1986)","journal-title":"Operations Research Letters"},{"key":"9_CR14","doi-asserted-by":"crossref","unstructured":"Timofte, R., Van Gool, L.: Adaptive and Weighted Collaborative Representations for Image Classification. Pattern Recognition Letters (Available Online 2014)","DOI":"10.1016\/j.patrec.2013.08.010"},{"key":"9_CR15","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 & Knowledge Engineering\u00a085, 15\u201339 (2013)","journal-title":"Data & Knowledge Engineering"},{"key":"9_CR16","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, A.: Component Retrieval Based on a Database of Graphs for Hand-Written Electronic-Scheme Digitalisation. Expert Systems with Applications\u00a040, 2493\u20132502 (2013)","journal-title":"Expert Systems with Applications"},{"key":"9_CR17","doi-asserted-by":"crossref","unstructured":"Riesen, K., Bunke, H., Fischer, A.: Improving Graph Edit Distance Approximation by Centrality Measures. In: International Conference on Pattern Recognition (2014)","DOI":"10.1109\/ICPR.2014.670"},{"key":"9_CR18","doi-asserted-by":"crossref","unstructured":"Cort\u00e9s, X., Serratosa, F.: Learning Graph-Matching Edit-Costs based on the Optimality of the Oracle\u2019s Node Correspondences. Pattern Recognition Letters (2015)","DOI":"10.1016\/j.patrec.2015.01.009"},{"key":"9_CR19","unstructured":"http:\/\/deim.urv.cat\/~francesc.serratosa\/databases\/"},{"issue":"3","key":"9_CR20","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 Transactions on Systems, Man, and Cybernetics\u00a013(3), 353\u2013362 (1983)","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics"},{"issue":"1","key":"9_CR21","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 Analysis and Applications\u00a013(1), 113\u2013129 (2010)","journal-title":"Pattern Analysis and Applications"},{"key":"9_CR22","doi-asserted-by":"crossref","unstructured":"Sol\u00e9, A., Serratosa, F., Sanfeliu, A.: On the Graph Edit Distance Cost: Properties and Applications. Intern. Journal of Pattern Recognition and Artificial Intell.\u00a026(5) (2012)","DOI":"10.1142\/S021800141260004X"},{"issue":"5","key":"9_CR23","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1016\/j.patrec.2008.12.014","volume":"30","author":"M. Ferrer","year":"2009","unstructured":"Ferrer, M., Valveny, E., Serratosa, F.: Median Graph: A New Exact Algorithm using a Distance Based on the Maximum Common Subgraph. Pattern Recognition Letters\u00a030(5), 579\u2013588 (2009)","journal-title":"Pattern Recognition Letters"},{"key":"9_CR24","unstructured":"http:\/\/www.featurespace.org"},{"key":"9_CR25","doi-asserted-by":"crossref","unstructured":"Moreno-Garc\u00eda, C.F., Serratosa, F., Cort\u00e9s, X.: Iterative Versus Voting Method to Reach Consensus Given Multiple Correspondences of Two Sets. In: IbPRIA 2015 (2015)","DOI":"10.1007\/978-3-319-19390-8_60"},{"issue":"2","key":"9_CR26","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 Space. Pattern Recognition\u00a047(2), 833\u2013842 (2014)","journal-title":"Pattern Recognition"}],"container-title":["Lecture Notes in Computer Science","Graph-Based Representations in Pattern Recognition"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-18224-7_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,10]],"date-time":"2023-02-10T08:15:28Z","timestamp":1676016928000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-18224-7_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319182230","9783319182247"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-18224-7_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}