{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,15]],"date-time":"2025-05-15T04:15:23Z","timestamp":1747282523680,"version":"3.40.5"},"publisher-location":"Cham","reference-count":37,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030766566"},{"type":"electronic","value":"9783030766573"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"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":[[2021]]},"DOI":"10.1007\/978-3-030-76657-3_4","type":"book-chapter","created":{"date-parts":[[2021,5,15]],"date-time":"2021-05-15T20:02:23Z","timestamp":1621108943000},"page":"67-78","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A New Matching Algorithm Between Trees of Shapes and Its Application to Brain Tumor Segmentation"],"prefix":"10.1007","author":[{"given":"Nicolas","family":"Boutry","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thierry","family":"G\u00e9raud","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,5,16]]},"reference":[{"issue":"9","key":"4_CR1","doi-asserted-by":"publisher","first-page":"1921","DOI":"10.1109\/TIP.2009.2021548","volume":"18","author":"T Arici","year":"2009","unstructured":"Arici, T., Dikbas, S., Altunbasak, Y.: A histogram modification framework and its application for image contrast enhancement. IEEE Trans. Image Process. 18(9), 1921\u20131935 (2009)","journal-title":"IEEE Trans. Image Process."},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"Bauer, U., Ge, X., Wang, Y.: Measuring distance between Reeb graphs. In: Proceedings of the Thirtieth Annual Symposium on Computational Geometry, pp. 464\u2013473 (2014)","DOI":"10.1145\/2582112.2582169"},{"issue":"1\u20133","key":"4_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(1\u20133), 217\u2013239 (2005)","journal-title":"Theoret. Comput. Sci."},{"issue":"9","key":"4_CR4","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1145\/362342.362367","volume":"16","author":"C Bron","year":"1973","unstructured":"Bron, C., Kerbosch, J.: Finding all cliques of an undirected graph (algorithm 457). Commun. ACM 16(9), 575\u2013576 (1973)","journal-title":"Commun. ACM"},{"issue":"3\u20134","key":"4_CR5","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/S0167-8655(97)00179-7","volume":"19","author":"H Bunke","year":"1998","unstructured":"Bunke, H., Shearer, K.: A graph distance metric based on the maximal common subgraph. Pattern Recogn. Lett. 19(3\u20134), 255\u2013259 (1998)","journal-title":"Pattern Recogn. Lett."},{"key":"4_CR6","unstructured":"Caetano, T.S., Caelli, T., Barone, D.A.C.: Graphical models for graph matching. In: Proceedings of the 2004 IEEE Computer Society Conference on Computer Vision and Pattern Recognition. IEEE (2004)"},{"issue":"6","key":"4_CR7","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":"4_CR8","doi-asserted-by":"crossref","unstructured":"Carlinet, E., G\u00e9raud, T.: Getting a morphological tree of shapes for multivariate images: paths, traps, and pitfalls. In: Proceedings of the IEEE International Conference on Image Processing, Paris, France, October 2014","DOI":"10.1109\/ICIP.2014.7025123"},{"issue":"3","key":"4_CR9","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1023\/A:1020715626538","volume":"17","author":"V Caselles","year":"2002","unstructured":"Caselles, V., Monasse, P.: Grain filters. J. Math. Imaging Vis. 17(3), 249\u2013270 (2002)","journal-title":"J. Math. Imaging Vis."},{"key":"4_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04611-7","volume-title":"Geometric Description of Images as Topographic Maps","author":"V Caselles","year":"2009","unstructured":"Caselles, V., Monasse, P.: Geometric Description of Images as Topographic Maps. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-04611-7"},{"key":"4_CR11","unstructured":"Chung, F.R.K., Graham, F.C.: Spectral graph theory. Number 92. American Mathematical Society (1997)"},{"issue":"03","key":"4_CR12","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(03), 265\u2013298 (2004)","journal-title":"Int. J. Pattern Recognit Artif Intell."},{"issue":"3","key":"4_CR13","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1023\/A:1011290230196","volume":"14","author":"A Desolneux","year":"2001","unstructured":"Desolneux, A., Moisan, L., Morel, J.-M.: Edge detection by Helmholtz principle. J. Math. Imaging Vis. 14(3), 271\u2013284 (2001)","journal-title":"J. Math. Imaging Vis."},{"issue":"1","key":"4_CR14","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1109\/T-C.1973.223602","volume":"100","author":"MA Fischler","year":"1973","unstructured":"Fischler, M.A., Elschlager, R.A.: The representation and matching of pictorial structures. IEEE Trans. Comput. 100(1), 67\u201392 (1973)","journal-title":"IEEE Trans. Comput."},{"key":"4_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1007\/978-3-319-18720-4_48","volume-title":"Mathematical Morphology and Its Applications to Signal and Image Processing","author":"T G\u00e9raud","year":"2015","unstructured":"G\u00e9raud, T., Carlinet, E., Crozet, S.: Self-duality and digital topology: links between the morphological tree of shapes and well-composed gray-level images. In: Benediktsson, J.A., Chanussot, J., Najman, L., Talbot, H. (eds.) ISMM 2015. LNCS, vol. 9082, pp. 573\u2013584. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-18720-4_48"},{"key":"4_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1007\/978-3-642-38294-9_9","volume-title":"Mathematical Morphology and Its Applications to Signal and Image Processing","author":"T G\u00e9raud","year":"2013","unstructured":"G\u00e9raud, T., Carlinet, E., Crozet, S., Najman, L.: A quasi-linear algorithm to compute the tree of shapes of nD images. In: Hendriks, C.L.L., Borgefors, G., Strand, R. (eds.) ISMM 2013. LNCS, vol. 7883, pp. 98\u2013110. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38294-9_9"},{"issue":"4","key":"4_CR17","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)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"9","key":"4_CR18","doi-asserted-by":"publisher","first-page":"850","DOI":"10.1109\/34.232073","volume":"15","author":"DP Huttenlocher","year":"1993","unstructured":"Huttenlocher, D.P., Klanderman, G.A., Rucklidge, W.J.: Comparing images using the Hausdorff distance. IEEE Trans. Pattern Anal. Mach. Intell. 15(9), 850\u2013863 (1993)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"4_CR19","doi-asserted-by":"crossref","unstructured":"Huttenlocher, D.P., Leventon, M.E., Rucklidge, W.J.: Visually-guided navigation by comparing two-dimensional edge images. Cornell University, Department of Computer Science (1994)","DOI":"10.1109\/CVPR.1994.323910"},{"key":"4_CR20","doi-asserted-by":"crossref","unstructured":"Kitchen, L.: Discrete relaxation for matching relational structures. Technical report, Maryland Univ College Park Computer Science Center (1978)","DOI":"10.21236\/ADA071601"},{"key":"4_CR21","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1016\/j.patrec.2018.12.007","volume":"120","author":"S Kosub","year":"2019","unstructured":"Kosub, S.: A note on the triangle inequality for the Jaccard distance. Pattern Recogn. Lett. 120, 36\u201338 (2019)","journal-title":"Pattern Recogn. Lett."},{"key":"4_CR22","first-page":"24","volume":"5","author":"AS Kronrod","year":"1950","unstructured":"Kronrod, A.S.: On functions of two variables. Uspehi Math. Sci. 5, 24\u2013134 (1950). In Russian","journal-title":"Uspehi Math. Sci."},{"key":"4_CR23","doi-asserted-by":"crossref","unstructured":"LaMontagne, P.J., et al.: OASIS-3: longitudinal neuroimaging, clinical, and cognitive dataset for normal aging and Alzheimer disease. medRxiv (2019)","DOI":"10.1101\/2019.12.13.19014902"},{"issue":"2","key":"4_CR24","doi-asserted-by":"publisher","first-page":"1451","DOI":"10.1109\/TGRS.2013.2251468","volume":"52","author":"B Luo","year":"2014","unstructured":"Luo, B., Zhang, L.: Robust autodual morphological profiles for the classification of high-resolution satellite images. IEEE Trans. Geosci. Remote Sens. 52(2), 1451\u20131462 (2014)","journal-title":"IEEE Trans. Geosci. Remote Sens."},{"key":"4_CR25","unstructured":"McKay, B.D., et al.: Practical graph isomorphism. Department of Computer Science, Vanderbilt University Tennessee, USA (1981)"},{"key":"4_CR26","unstructured":"Memoli, F.: On the use of Gromov-Hausdorff distances for shape comparison. In: Botsch, M., Pajarola, R., Chen, B., Zwicker, M. (eds.) Eurographics Symposium on Point-Based Graphics. The Eurographics Association (2007)"},{"issue":"5","key":"4_CR27","doi-asserted-by":"publisher","first-page":"860","DOI":"10.1109\/83.841532","volume":"9","author":"P Monasse","year":"2000","unstructured":"Monasse, P., Guichard, F.: Fast computation of a contrast-invariant image representation. IEEE Trans. Image Process. 9(5), 860\u2013872 (2000)","journal-title":"IEEE Trans. Image Process."},{"issue":"4","key":"4_CR28","doi-asserted-by":"publisher","first-page":"854","DOI":"10.1109\/TIP.2008.2010202","volume":"18","author":"Y Pan","year":"2009","unstructured":"Pan, Y., Birdwell, J.D., Djouadi, S.M.: Preferential image segmentation using trees of shapes. IEEE Trans. Image Process. 18(4), 854\u2013866 (2009)","journal-title":"IEEE Trans. Image Process."},{"key":"4_CR29","first-page":"1933","volume":"11","author":"M Pelillo","year":"1999","unstructured":"Pelillo, M.: Replicator equations, maximal cliques, and graph isomorphism. Adv. Neural. Inf. Process. Syst. 11, 1933\u20131955 (1999)","journal-title":"Adv. Neural. Inf. Process. Syst."},{"issue":"4","key":"4_CR30","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1109\/83.663500","volume":"7","author":"P Salembier","year":"1998","unstructured":"Salembier, P., Oliveras, A., Garrido, L.: Antiextensive connected operators for image and sequence processing. IEEE Trans. Image Process. 7(4), 555\u2013570 (1998)","journal-title":"IEEE Trans. Image Process."},{"key":"4_CR31","doi-asserted-by":"publisher","first-page":"753","DOI":"10.1016\/j.nicl.2016.09.021","volume":"12","author":"N Sauwen","year":"2016","unstructured":"Sauwen, N., et al.: Comparison of unsupervised classification methods for brain tumor segmentation using multi-parametric MRI. NeuroImage Clin. 12, 753\u2013764 (2016)","journal-title":"NeuroImage Clin."},{"key":"4_CR32","unstructured":"Schellewald, C.: Convex mathematical programs for relational matching of object views. Ph.D. thesis, Universit\u00e4t Mannheim (2004)"},{"key":"4_CR33","unstructured":"Bakas, S., et al.: Identifying the best machine learning algorithms for brain tumor segmentation, progression assessment, and overall survival prediction in the brats challenge. arXiv preprint arXiv:1811.02629 (2018)"},{"issue":"12","key":"4_CR34","doi-asserted-by":"publisher","first-page":"757","DOI":"10.1109\/TSMC.1979.4310127","volume":"9","author":"W-H Tsai","year":"1979","unstructured":"Tsai, W.-H., King-Sun, F.: Error-correcting isomorphisms of attributed relational graphs for pattern analysis. IEEE Trans. Syst. Man Cybern. 9(12), 757\u2013768 (1979)","journal-title":"IEEE Trans. Syst. Man Cybern."},{"issue":"5","key":"4_CR35","doi-asserted-by":"publisher","first-page":"695","DOI":"10.1109\/34.6778","volume":"10","author":"S Umeyama","year":"1988","unstructured":"Umeyama, S.: An eigendecomposition approach to weighted graph matching problems. IEEE Trans. Pattern Anal. Mach. Intell. 10(5), 695\u2013703 (1988)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"3","key":"4_CR36","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1007\/s11263-009-0312-3","volume":"88","author":"G-S Xia","year":"2010","unstructured":"Xia, G.-S., Delon, J., Gousseau, Y.: Shape-based invariant texture indexing. Int. J. Comput. Vision 88(3), 382\u2013403 (2010)","journal-title":"Int. J. Comput. Vision"},{"key":"4_CR37","doi-asserted-by":"crossref","unstructured":"Xu, Y., G\u00e9raud, T., Najman, L.: Salient level lines selection using the Mumford-Shah functional. In: Proceedings of the IEEE International Conference on Image Processing, pp. 1\u20135 (2013)","DOI":"10.1109\/ICIP.2013.6738253"}],"container-title":["Lecture Notes in Computer Science","Discrete Geometry and Mathematical Morphology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-76657-3_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,14]],"date-time":"2025-05-14T22:02:39Z","timestamp":1747260159000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-76657-3_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030766566","9783030766573"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-76657-3_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"16 May 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DGMM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Discrete Geometry and Mathematical Morphology","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Uppsala","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Sweden","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 May 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 May 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dgmm2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.dgmm2021.se\/","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":"59","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":"36","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":"61% - 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":"3","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":"1,3","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)"}}]}}