{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,25]],"date-time":"2025-12-25T04:45:39Z","timestamp":1766637939692,"version":"3.40.3"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031198960"},{"type":"electronic","value":"9783031198977"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-19897-7_18","type":"book-chapter","created":{"date-parts":[[2022,10,20]],"date-time":"2022-10-20T17:14:33Z","timestamp":1666286073000},"page":"221-235","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["A Topological Tree of\u00a0Shapes"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0320-4581","authenticated-orcid":false,"given":"Nicolas","family":"Passat","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9648-326X","authenticated-orcid":false,"given":"Yukiko","family":"Kenmochi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,10,20]]},"reference":[{"key":"18_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1007\/978-3-030-76657-3_38","volume-title":"Discrete Geometry and Mathematical Morphology","author":"N Boutry","year":"2021","unstructured":"Boutry, N., G\u00e9raud, T., Najman, L.: An equivalence relation between morphological dynamics and persistent homology in n-D. In: Lindblad, J., Malmberg, F., Sladoje, N. (eds.) DGMM 2021. LNCS, vol. 12708, pp. 525\u2013537. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-76657-3_38"},{"key":"18_CR2","doi-asserted-by":"publisher","first-page":"3885","DOI":"10.1109\/TIP.2014.2336551","volume":"23","author":"E Carlinet","year":"2014","unstructured":"Carlinet, E., G\u00e9raud, T.: A comparative review of component tree computation algorithms. IEEE T Image Proc. 23, 3885\u20133895 (2014)","journal-title":"IEEE T Image Proc."},{"key":"18_CR3","doi-asserted-by":"publisher","first-page":"5330","DOI":"10.1109\/TIP.2015.2480599","volume":"24","author":"E Carlinet","year":"2015","unstructured":"Carlinet, E., G\u00e9raud, T.: MToS: a tree of shapes for multivariate images. IEEE T Image Proc. 24, 5330\u20135342 (2015)","journal-title":"IEEE T Image Proc."},{"key":"18_CR4","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1109\/TPAMI.2008.117","volume":"31","author":"M Couprie","year":"2009","unstructured":"Couprie, M., Bertrand, G.: New characterizations of simple points in 2D, 3D, and 4D discrete spaces. IEEE T Pattern Anal. 31, 637\u2013648 (2009)","journal-title":"IEEE T Pattern Anal."},{"key":"18_CR5","doi-asserted-by":"publisher","first-page":"1003","DOI":"10.1117\/1.1408316","volume":"10","author":"M Couprie","year":"2001","unstructured":"Couprie, M., Nivando Bezerra, F., Bertrand, G.: Topological operators for grayscale image processing. J. Electron. Imaging 10, 1003\u20131015 (2001)","journal-title":"J. Electron. Imaging"},{"key":"18_CR6","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1007\/s00454-002-2885-2","volume":"28","author":"H Edelsbrunner","year":"2002","unstructured":"Edelsbrunner, H., Letscher, D., Zomorodian, A.: Topological persistence and simplification. Discrete Comput. Geom. 28, 511\u2013533 (2002)","journal-title":"Discrete Comput. Geom."},{"key":"18_CR7","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"},{"key":"18_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/978-3-319-18720-4_19","volume-title":"Mathematical Morphology and Its Applications to Signal and Image Processing","author":"BR Kiran","year":"2015","unstructured":"Kiran, B.R., Serra, J.: Braids of partitions. In: Benediktsson, J.A., Chanussot, J., Najman, L., Talbot, H. (eds.) ISMM 2015. LNCS, vol. 9082, pp. 217\u2013228. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-18720-4_19"},{"key":"18_CR9","doi-asserted-by":"publisher","first-page":"5152","DOI":"10.1109\/TIP.2014.2362053","volume":"23","author":"C Kurtz","year":"2014","unstructured":"Kurtz, C., Naegel, B., Passat, N.: Connected filtering based on multivalued component-trees. IEEE T Image Proc. 23, 5152\u20135164 (2014)","journal-title":"IEEE T Image Proc."},{"key":"18_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/978-3-540-79126-3_17","volume-title":"Discrete Geometry for Computer Imagery","author":"R Malgouyres","year":"2008","unstructured":"Malgouyres, R., Franc\u00e9s, A.R.: Determining whether a simplicial 3-complex collapses to a 1-complex is NP-complete. In: Coeurjolly, D., Sivignon, I., Tougne, L., Dupont, F. (eds.) DGCI 2008. LNCS, vol. 4992, pp. 177\u2013188. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-79126-3_17"},{"key":"18_CR11","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 T Image Proc. 9, 860\u2013872 (2000)","journal-title":"IEEE T Image Proc."},{"key":"18_CR12","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1016\/j.patrec.2020.02.032","volume":"135","author":"A Morimitsu","year":"2020","unstructured":"Morimitsu, A., Passat, N., Luz Alves, W.A., Hashimoto, R.F.: Efficient component-hypertree construction based on hierarchy of partitions. Pattern Recogn. Lett. 135, 30\u201337 (2020)","journal-title":"Pattern Recogn. Lett."},{"key":"18_CR13","doi-asserted-by":"publisher","first-page":"1163","DOI":"10.1109\/34.546254","volume":"18","author":"L Najman","year":"1996","unstructured":"Najman, L., Schmitt, M.: Geodesic saliency of watershed contours and hierarchical segmentation. IEEE T Pattern Anal. 18, 1163\u20131173 (1996)","journal-title":"IEEE T Pattern Anal."},{"key":"18_CR14","doi-asserted-by":"publisher","first-page":"1366","DOI":"10.1016\/j.patrec.2009.07.008","volume":"30","author":"N Passat","year":"2009","unstructured":"Passat, N., Mazo, L.: An introduction to simple sets. Pattern Recogn. Lett. 30, 1366\u20131377 (2009)","journal-title":"Pattern Recogn. Lett."},{"key":"18_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1007\/978-3-642-21569-8_25","volume-title":"Mathematical Morphology and Its Applications to Image and Signal Processing","author":"N Passat","year":"2011","unstructured":"Passat, N., Naegel, B.: Component-hypertrees for image segmentation. In: Soille, P., Pesaresi, M., Ouzounis, G.K. (eds.) ISMM 2011. LNCS, vol. 6671, pp. 284\u2013295. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-21569-8_25"},{"key":"18_CR16","doi-asserted-by":"publisher","first-page":"798","DOI":"10.1007\/s10851-019-00872-5","volume":"61","author":"N Passat","year":"2019","unstructured":"Passat, N., Naegel, B., Kurtz, C.: Component-graph construction. J. Math. Imaging Vis. 61, 798\u2013823 (2019). https:\/\/doi.org\/10.1007\/s10851-019-00872-5","journal-title":"J. Math. Imaging Vis."},{"key":"18_CR17","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/s10851-013-0438-3","volume":"49","author":"N Passat","year":"2014","unstructured":"Passat, N., Naegel, N.: Component-trees and multivalued images: structural properties. J. Math. Imaging Vis. 49, 37\u201350 (2014). https:\/\/doi.org\/10.1007\/s10851-013-0438-3","journal-title":"J. Math. Imaging Vis."},{"key":"18_CR18","doi-asserted-by":"publisher","first-page":"1162","DOI":"10.1109\/TPAMI.2014.2366145","volume":"37","author":"B Perret","year":"2015","unstructured":"Perret, B., Cousty, J., Tankyevych, O., Talbot, H., Passat, N.: Directed connected operators: asymmetric hierarchies for image filtering and segmentation. IEEE T Pattern Anal. 37, 1162\u20131176 (2015)","journal-title":"IEEE T Pattern Anal."},{"key":"18_CR19","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/j.patcog.2018.07.003","volume":"84","author":"JF Randrianasoa","year":"2018","unstructured":"Randrianasoa, J.F., Kurtz, C., Desjardin, E., Passat, N.: Binary partition tree construction from multiple features for image segmentation. Pattern Recogn. 84, 237\u2013250 (2018)","journal-title":"Pattern Recogn."},{"key":"18_CR20","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/0304-3975(86)90164-7","volume":"43","author":"C Ronse","year":"1986","unstructured":"Ronse, C.: A topological characterization of thinning. Theor. Comput. Sci. 43, 31\u201341 (1986)","journal-title":"Theor. Comput. Sci."},{"key":"18_CR21","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1016\/S0019-9958(74)90696-2","volume":"26","author":"A Rosenfeld","year":"1974","unstructured":"Rosenfeld, A.: Adjacency in digital pictures. Inf. Control 26, 24\u201333 (1974)","journal-title":"Inf. Control"},{"key":"18_CR22","doi-asserted-by":"publisher","first-page":"621","DOI":"10.1080\/00029890.1979.11994873","volume":"86","author":"A Rosenfeld","year":"1979","unstructured":"Rosenfeld, A.: Digital topology. Am. Math. Mon. 86, 621\u2013630 (1979)","journal-title":"Am. Math. Mon."},{"key":"18_CR23","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1109\/83.841934","volume":"9","author":"P Salembier","year":"2000","unstructured":"Salembier, P., Garrido, L.: Binary partition tree as an efficient representation for image processing, segmentation, and information retrieval. IEEE T Image Proc. 9, 561\u2013576 (2000)","journal-title":"IEEE T Image Proc."},{"key":"18_CR24","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.: Anti-extensive connected operators for image and sequence processing. IEEE T Image Proc. 7, 555\u2013570 (1998)","journal-title":"IEEE T Image Proc."},{"issue":"8","key":"18_CR25","doi-asserted-by":"publisher","first-page":"1153","DOI":"10.1109\/83.403422","volume":"4","author":"P Salembier","year":"1995","unstructured":"Salembier, P., Serra, J.: Flat zones filtering, connected operators, and filters by reconstruction. IEEE T Image Proc. 4(8), 1153\u20131160 (1995)","journal-title":"IEEE T Image Proc."},{"key":"18_CR26","doi-asserted-by":"publisher","first-page":"627","DOI":"10.1007\/s10851-019-00936-6","volume":"62","author":"D Santana Maia","year":"2020","unstructured":"Santana Maia, D., Cousty, J., Najman, L., Perret, B.: Characterization of graph-based hierarchical watersheds: theory and algorithms. J. Math. Imaging Vis. 62, 627\u2013658 (2020). https:\/\/doi.org\/10.1007\/s10851-019-00936-6","journal-title":"J. Math. Imaging Vis."},{"key":"18_CR27","doi-asserted-by":"publisher","first-page":"1132","DOI":"10.1109\/TPAMI.2007.70817","volume":"30","author":"P Soille","year":"2008","unstructured":"Soille, P.: Constrained connectivity for hierarchical image decomposition and simplification. IEEE T Pattern Anal. 30, 1132\u20131145 (2008)","journal-title":"IEEE T Pattern Anal."},{"key":"18_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/3-540-45986-3_10","volume-title":"Discrete Geometry for Computer Imagery","author":"Y Song","year":"2002","unstructured":"Song, Y., Zhang, A.: Monotonic tree. In: Braquelaire, A., Lachaud, J.-O., Vialard, A. (eds.) DGCI 2002. LNCS, vol. 2301, pp. 114\u2013123. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45986-3_10"},{"key":"18_CR29","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1016\/j.patcog.2019.05.029","volume":"95","author":"G Tochon","year":"2019","unstructured":"Tochon, G., Dalla Mura, M., Veganzones, M.A., G\u00e9raud, T., Chanussot, J.: Braids of partitions for the hierarchical representation and segmentation of multimodal images. Pattern Recogn. 95, 162\u2013172 (2019)","journal-title":"Pattern Recogn."}],"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-031-19897-7_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,20]],"date-time":"2022-10-20T17:16:48Z","timestamp":1666286208000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-19897-7_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031198960","9783031198977"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-19897-7_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"20 October 2022","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":"Strasbourg","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 October 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 October 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dgmm2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/dgmm2022.sciencesconf.org\/","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":"45","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":"33","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":"73% - 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":"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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3 invited papers","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}