{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T09:08:58Z","timestamp":1743066538908,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"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_4","type":"book-chapter","created":{"date-parts":[[2022,10,20]],"date-time":"2022-10-20T17:14:33Z","timestamp":1666286073000},"page":"35-47","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Gradient Vector Fields of\u00a0Discrete Morse Functions and\u00a0Watershed-Cuts"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6278-4638","authenticated-orcid":false,"given":"Nicolas","family":"Boutry","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gilles","family":"Bertrand","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6190-0235","authenticated-orcid":false,"given":"Laurent","family":"Najman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,10,20]]},"reference":[{"key":"4_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/978-3-030-20867-7_5","volume-title":"Mathematical Morphology and Its Applications to Signal and Image Processing","author":"N Boutry","year":"2019","unstructured":"Boutry, N., G\u00e9raud, T., Najman, L.: An equivalence relation between morphological dynamics and persistent homology in 1D. In: Burgeth, B., Kleefeld, A., Naegel, B., Passat, N., Perret, B. (eds.) ISMM 2019. LNCS, vol. 11564, pp. 57\u201368. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-20867-7_5"},{"key":"4_CR2","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":"4_CR3","doi-asserted-by":"publisher","unstructured":"Boutry, N., Najman, L., G\u00e9raud, T.: Some equivalence relation between persistent homology and morphological dynamics. J. Math. Imaging Vis. (2022). https:\/\/doi.org\/10.1007\/s10851-022-01104-z, https:\/\/hal.archives-ouvertes.fr\/hal-03676854","DOI":"10.1007\/s10851-022-01104-z"},{"key":"4_CR4","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to Algorithms. 23rd printing (1999)"},{"issue":"4","key":"4_CR5","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1109\/TPAMI.2008.117","volume":"31","author":"M Couprie","year":"2008","unstructured":"Couprie, M., Bertrand, G.: New characterizations of simple points in 2D, 3D, and 4D discrete spaces. IEEE Trans. Pattern Anal. Mach. Intell. 31(4), 637\u2013648 (2008)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"4_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/978-3-642-10210-3_31","volume-title":"Combinatorial Image Analysis","author":"J Cousty","year":"2009","unstructured":"Cousty, J., Bertrand, G., Couprie, M., Najman, L.: Collapses and watersheds in pseudomanifolds. In: Wiederhold, P., Barneva, R.P. (eds.) IWCIA 2009. LNCS, vol. 5852, pp. 397\u2013410. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-10210-3_31"},{"issue":"3","key":"4_CR7","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/s10851-014-0498-z","volume":"50","author":"J Cousty","year":"2014","unstructured":"Cousty, J., Bertrand, G., Couprie, M., Najman, L.: Collapses and watersheds in pseudomanifolds of arbitrary dimension. J. Math. Imaging Vis. 50(3), 261\u2013285 (2014). https:\/\/doi.org\/10.1007\/s10851-014-0498-z","journal-title":"J. Math. Imaging Vis."},{"issue":"8","key":"4_CR8","doi-asserted-by":"publisher","first-page":"1362","DOI":"10.1109\/TPAMI.2008.173","volume":"31","author":"J Cousty","year":"2009","unstructured":"Cousty, J., Bertrand, G., Najman, L., Couprie, M.: Watershed cuts: minimum spanning forests and the drop of water principle. IEEE Trans. Pattern Anal. Mach. Intell. 31(8), 1362\u20131374 (2009)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"5","key":"4_CR9","doi-asserted-by":"publisher","first-page":"925","DOI":"10.1109\/TPAMI.2009.71","volume":"32","author":"J Cousty","year":"2010","unstructured":"Cousty, J., Bertrand, G., Najman, L., Couprie, M.: Watershed cuts: thinnings, shortest path forests, and topological watersheds. IEEE Trans. Pattern Anal. Mach. Intell. 32(5), 925\u2013939 (2010)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"2","key":"4_CR10","doi-asserted-by":"publisher","first-page":"761","DOI":"10.1111\/cgf.12596","volume":"34","author":"L De Floriani","year":"2015","unstructured":"De Floriani, L., Fugacci, U., Iuricich, F., Magillo, P.: Morse complexes for shape segmentation and homological analysis: discrete models and algorithms. Comput. Graph. Forum 34(2), 761\u2013785 (2015)","journal-title":"Comput. Graph. Forum"},{"key":"4_CR11","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1090\/conm\/453\/08802","volume":"453","author":"H Edelsbrunner","year":"2008","unstructured":"Edelsbrunner, H., Harer, J.: Persistent homology - a survey. Contemp. Math. 453, 257\u2013282 (2008)","journal-title":"Contemp. Math."},{"key":"4_CR12","doi-asserted-by":"crossref","unstructured":"Edelsbrunner, H., Harer, J., Natarajan, V., Pascucci, V.: Morse-Smale complexes for piecewise linear 3-manifolds. In: Proceedings of the Nineteenth Annual Symposium on Computational Geometry, pp. 361\u2013370 (2003)","DOI":"10.1145\/777792.777846"},{"key":"4_CR13","unstructured":"Forman, R.: A Discrete Morse Theory for cell complexes. In: Yau, S.T. (ed.) Geometry. Topology for Raoul Bott. International Press, Somerville MA (1995)"},{"key":"4_CR14","doi-asserted-by":"crossref","unstructured":"Grimaud, M.: New measure of contrast: the dynamics. In: Image Algebra and Morphological Image Processing III, vol. 1769, pp. 292\u2013306. International Society for Optics and Photonics (1992)","DOI":"10.1117\/12.60650"},{"key":"4_CR15","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511814075","volume-title":"Randomized Algorithms","author":"R Motwani","year":"1995","unstructured":"Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press, Cambridge (1995)"},{"issue":"2","key":"4_CR16","first-page":"47","volume":"4","author":"E Munch","year":"2017","unstructured":"Munch, E.: A user\u2019s guide to topological data analysis. J. Learn. Anal. 4(2), 47\u201361 (2017)","journal-title":"J. Learn. Anal."},{"key":"4_CR17","doi-asserted-by":"publisher","DOI":"10.1002\/9781118600788","volume-title":"Mathematical Morphology: From Theory to Applications","author":"L Najman","year":"2013","unstructured":"Najman, L., Talbot, H.: Mathematical Morphology: From Theory to Applications. Wiley, Hoboken (2013)"},{"issue":"8","key":"4_CR18","doi-asserted-by":"publisher","first-page":"1646","DOI":"10.1109\/TPAMI.2011.95","volume":"33","author":"V Robins","year":"2011","unstructured":"Robins, V., Wood, P.J., Sheppard, A.P.: Theory and algorithms for constructing discrete Morse complexes from grayscale digital images. IEEE Trans. Pattern Anal. Mach. Intell. 33(8), 1646\u20131658 (2011)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"4_CR19","doi-asserted-by":"crossref","unstructured":"Scoville, N.A.: Discrete Morse Theory, vol. 90. American Mathematical Soc. (2019)","DOI":"10.1090\/stml\/090"},{"key":"4_CR20","unstructured":"Tierny, J.: Introduction to Topological Data Analysis. Technical report, Sorbonne University, LIP6, APR team, France (2017). https:\/\/hal.archives-ouvertes.fr\/cel-01581941"},{"issue":"1","key":"4_CR21","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1112\/plms\/s2-45.1.243","volume":"2","author":"JHC Whitehead","year":"1939","unstructured":"Whitehead, J.H.C.: Simplicial spaces, nuclei and m-groups. Proc. Lond. Math. Soc. 2(1), 243\u2013327 (1939)","journal-title":"Proc. Lond. Math. Soc."}],"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_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,6]],"date-time":"2024-10-06T07:38:53Z","timestamp":1728200333000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-19897-7_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031198960","9783031198977"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-19897-7_4","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)"}}]}}