{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T08:06:25Z","timestamp":1726041985108},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030298876"},{"type":"electronic","value":"9783030298883"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","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":[[2019]]},"DOI":"10.1007\/978-3-030-29888-3_36","type":"book-chapter","created":{"date-parts":[[2019,8,22]],"date-time":"2019-08-22T23:12:33Z","timestamp":1566515553000},"page":"447-456","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Learning the Graph Edit Distance Parameters for Point-Set Image Registration"],"prefix":"10.1007","author":[{"given":"Shaima","family":"Algabli","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pep","family":"Santacruz","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":[[2019,8,22]]},"reference":[{"key":"36_CR1","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1016\/j.patrec.2018.08.026","volume":"112","author":"S Algabli","year":"2018","unstructured":"Algabli, S., Serratosa, F.: Embedding the node-to-node mappings to learn the graph edit distance parameters. Pattern Recogn. Lett. 112, 353\u2013360 (2018)","journal-title":"Pattern Recogn. Lett."},{"issue":"1","key":"36_CR2","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s11336-004-1160-5","volume":"71","author":"JMF Berge","year":"2006","unstructured":"Berge, J.M.F.: The rigid orthogonal procrustes rotation problem. Psychometrika 71(1), 201\u2013205 (2006). https:\/\/doi.org\/10.1007\/s11336-004-1160-5","journal-title":"Psychometrika"},{"key":"36_CR3","unstructured":"Chui, H., Rangarajan, A.: A new algorithm for non-rigid point matching. In: CVPR (2000)"},{"key":"36_CR4","doi-asserted-by":"publisher","first-page":"1236","DOI":"10.1109\/34.730557","volume":"20","author":"ADJ Cross","year":"1998","unstructured":"Cross, A.D.J., Hancock, E.E.: Graph matching with a dual-step EM algorithm. IEEE Trans. Pattern Anal. Mach. Intell. 20, 1236\u20131253 (1998)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"36_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1111\/j.2517-6161.1977.tb01600.x","volume":"39","author":"AP Dempster","year":"1977","unstructured":"Dempster, A.P., Laird, N.M., Rubin, D.B.: Maximum likelihood from incomplete data via the EM algorithm. Statist. Soc. Ser. B (Methodol.) 39, 1\u201322 (1977)","journal-title":"Statist. Soc. Ser. B (Methodol.)"},{"key":"36_CR6","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/j.patrec.2015.07.010","volume":"65","author":"M Ferrer","year":"2015","unstructured":"Ferrer, M., Serratosa, F., Riesen, K.: Improving bipartite graph matching by assessing the assignment confidence. Pattern Recogn. Lett. 65, 29\u201336 (2015). https:\/\/doi.org\/10.1016\/j.patrec.2015.07.010","journal-title":"Pattern Recogn. Lett."},{"key":"36_CR7","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 Trans. Pattern Anal. Mach. Intell. 18, 377\u2013388 (1996)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"36_CR8","doi-asserted-by":"publisher","first-page":"1019","DOI":"10.1016\/S0031-3203(98)80010-1","volume":"31","author":"S Gold","year":"1998","unstructured":"Gold, S., Rangarajan, A., Lu, C.P., Pappu, S., Mjolsness, E.: New algorithms for 2D and 3D point matching: pose estimation and correspondence. Pattern Recogn. 31, 1019\u20131031 (1998)","journal-title":"Pattern Recogn."},{"issue":"4","key":"36_CR9","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 Trans. Pattern Anal. Mach. Intell. 18(4), 377\u2013388 (1996). https:\/\/doi.org\/10.1109\/34.491619","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"6","key":"36_CR10","doi-asserted-by":"publisher","first-page":"1426","DOI":"10.1109\/21.44063","volume":"19","author":"RM Haralick","year":"1989","unstructured":"Haralick, R.M., Joo, H., Lee, C., Zhuang, X., Vaidya, V.G., Kim, M.B.: Pose estimation from corresponding point data. IEEE Trans. Syst. Man Cybern. 19(6), 1426\u20131446 (1989)","journal-title":"IEEE Trans. Syst. Man Cybern."},{"key":"36_CR11","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511811685","volume-title":"Multiple View Geometry in Computer Vision","author":"RI Hartley","year":"2004","unstructured":"Hartley, R.I., Zisserman, A.: Multiple View Geometry in Computer Vision, 2nd edn. Cambridge University Press, Cambridge (2004). ISBN: 0521540518","edition":"2"},{"key":"36_CR12","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1016\/j.cviu.2010.07.007","volume":"115","author":"J Ho","year":"2011","unstructured":"Ho, J., Yang, M.H.: On affine registration of planar point sets using complex numbers. Comput. Vis. Image Underst. 115, 50\u201358 (2011)","journal-title":"Comput. Vis. Image Underst."},{"key":"36_CR13","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1112\/blms\/16.2.81","volume":"16","author":"D Kendall","year":"1984","unstructured":"Kendall, D.: Shape manifolds, procrustean metrics, and complex projective spaces. Lond Math. Soc. 16, 81\u2013121 (1984)","journal-title":"Lond Math. Soc."},{"key":"36_CR14","volume-title":"Statistical Shape Analysis, Wiley Series in Probability and Statistics: Probability and Statistics","author":"IL Dryden","year":"1998","unstructured":"Dryden, I.L., Mardia, K.V.: Statistical Shape Analysis, Wiley Series in Probability and Statistics: Probability and Statistics. Wiley, Hoboken (1998). ISBN: 9780470699621"},{"key":"36_CR15","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1016\/S1077-3142(03)00097-3","volume":"92","author":"B Luo","year":"2003","unstructured":"Luo, B., Hancock, E.: A unified framework for alignment and correspondence. Comput. Vis. Image Underst. 92, 26\u201355 (2003)","journal-title":"Comput. Vis. Image Underst."},{"key":"36_CR16","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":"36_CR17","doi-asserted-by":"publisher","first-page":"2262","DOI":"10.1109\/TPAMI.2010.46","volume":"32","author":"A Myronenko","year":"2010","unstructured":"Myronenko, A., Song, X.: Point set registration coherent point drift. IEEE Trans. Pattern Anal. Mach. Intell. 32, 2262\u20132275 (2010)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"36_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/3-540-63046-5_3","volume-title":"Information Processing in Medical Imaging","author":"A Rangarajan","year":"1997","unstructured":"Rangarajan, A., Chui, H., Bookstein, F.L.: The softassign procrustes matching algorithm. In: Duncan, J., Gindi, G. (eds.) IPMI 1997. LNCS, vol. 1230, pp. 29\u201342. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/3-540-63046-5_3"},{"key":"36_CR19","series-title":"Advances in Computer Vision and Pattern Recognition","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-27252-8","volume-title":"Structural Pattern Recognition with Graph Edit Distance","author":"K Riesen","year":"2015","unstructured":"Riesen, K.: Structural Pattern Recognition with Graph Edit Distance. ACVPR. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-27252-8"},{"issue":"7","key":"36_CR20","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(7), 950\u2013959 (2009)","journal-title":"Image Vis. Comput."},{"issue":"15","key":"36_CR21","doi-asserted-by":"publisher","first-page":"2029","DOI":"10.1016\/j.patrec.2012.04.008","volume":"33","author":"G Sanroma","year":"2012","unstructured":"Sanroma, G., Alqu\u00e9zar, R., Serratosa, F., Herrera, B.: Smooth point-set registration using neighboring constraints. Pattern Recogn. Lett. 33(15), 2029\u20132037 (2012)","journal-title":"Pattern Recogn. Lett."},{"key":"36_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1007\/978-3-319-97785-0_27","volume-title":"Structural, Syntactic, and Statistical Pattern Recognition","author":"P Santacruz","year":"2018","unstructured":"Santacruz, P., Serratosa, F.: Learning the sub-optimal graph edit distance edit costs based on an embedded model. In: Bai, X., Hancock, E.R., Ho, T.K., Wilson, R.C., Biggio, B., Robles-Kelly, A. (eds.) S+SSPR 2018. LNCS, vol. 11004, pp. 282\u2013292. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-97785-0_27"},{"key":"36_CR23","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":"36_CR24","doi-asserted-by":"publisher","first-page":"1550010","DOI":"10.1142\/S021800141550010X","volume":"29","author":"F Serratosa","year":"2014","unstructured":"Serratosa, F.: Speeding up fast bipartite graph matching through a new cost matrix. Int. J. Pattern Recogn. Artif. Intell. 29, 1550010 (2014). https:\/\/doi.org\/10.1142\/S021800141550010X","journal-title":"Int. J. Pattern Recogn. Artif. Intell."},{"key":"36_CR25","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."},{"key":"36_CR26","unstructured":"Serratosa, F.: Graph databases (2015). http:\/\/deim.urv.cat\/~francesc.serratosa\/databases\/"},{"key":"36_CR27","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1016\/j.patcog.2019.01.043","volume":"90","author":"F Serratosa","year":"2019","unstructured":"Serratosa, F.: Graph edit distance: restrictions to be a metric. Pattern Recogn. 90, 250\u2013256 (2019). https:\/\/doi.org\/10.1016\/j.patcog.2019.01.043","journal-title":"Pattern Recogn."},{"issue":"4","key":"36_CR28","doi-asserted-by":"publisher","first-page":"1364","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 Recogn. 48(4), 1364\u20131373 (2015). https:\/\/doi.org\/10.1016\/j.patcog.2014.10.033","journal-title":"Pattern Recogn."},{"key":"36_CR29","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1109\/34.88573","volume":"13","author":"S Umeyama","year":"1991","unstructured":"Umeyama, S.: Least squares estimation of transformation parameters between two point patterns. IEEE Trans. Pattern Anal. Mach. Intell. 13, 376\u2013380 (1991)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."}],"container-title":["Lecture Notes in Computer Science","Computer Analysis of Images and Patterns"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-29888-3_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,22]],"date-time":"2024-07-22T12:20:40Z","timestamp":1721650840000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-29888-3_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030298876","9783030298883"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-29888-3_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"22 August 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CAIP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computer Analysis of Images and Patterns","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Salerno","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 September 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 September 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"caip2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/caip2019.unisa.it\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"176","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"106","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"60% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.68","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.40","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}