{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T15:05:23Z","timestamp":1743087923682,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031490170"},{"type":"electronic","value":"9783031490187"}],"license":[{"start":{"date-parts":[[2023,11,27]],"date-time":"2023-11-27T00:00:00Z","timestamp":1701043200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,11,27]],"date-time":"2023-11-27T00:00:00Z","timestamp":1701043200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-49018-7_14","type":"book-chapter","created":{"date-parts":[[2023,11,26]],"date-time":"2023-11-26T23:02:21Z","timestamp":1701039741000},"page":"189-200","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Interactive Segmentation with\u00a0Incremental Watershed Cuts"],"prefix":"10.1007","author":[{"given":"Quentin","family":"Lebon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Josselin","family":"Lef\u00e8vre","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jean","family":"Cousty","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Benjamin","family":"Perret","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,11,27]]},"reference":[{"issue":"10","key":"14_CR1","doi-asserted-by":"publisher","first-page":"1460","DOI":"10.1016\/j.imavis.2009.06.017","volume":"28","author":"C All\u00e8ne","year":"2010","unstructured":"All\u00e8ne, C., Audibert, J.Y., Couprie, M., Keriven, R.: Some links between extremum spanning forests, watersheds and min-cuts. Image Vis. Comput. 28(10), 1460\u20131471 (2010)","journal-title":"Image Vis. Comput."},{"key":"14_CR2","doi-asserted-by":"publisher","unstructured":"Arbel\u00e1ez, P., Maire, M., Fowlkes, C., Malik, J.: Contour detection and hierarchical image segmentation. IEEE Trans. Pattern Anal. Mach. Intell. 33(5), 898\u2013916 (2011). https:\/\/doi.org\/10.1109\/TPAMI.2010.161, conference Name: IEEE Transactions on Pattern Analysis and Machine Intelligence","DOI":"10.1109\/TPAMI.2010.161"},{"key":"14_CR3","doi-asserted-by":"publisher","unstructured":"Beucher, S., Meyer, F.: The morphological approach to segmentation: the watershed transformation. Math. Morphol. Image Process. 34, 433\u2013481 (1993). https:\/\/doi.org\/10.1201\/9781482277234-12","DOI":"10.1201\/9781482277234-12"},{"key":"14_CR4","unstructured":"Bradski, G.: The OpenCV library. Dr. Dobb\u2019s J. Softw. Tools (2000)"},{"key":"14_CR5","doi-asserted-by":"publisher","unstructured":"Carlinet, E., Geraud, T.: Morphological object picking based on the color tree of shapes. In: 2015 IPTA, pp. 125\u2013130. IEEE, Orleans, France, November 2015. https:\/\/doi.org\/10.1109\/IPTA.2015.7367111","DOI":"10.1109\/IPTA.2015.7367111"},{"key":"14_CR6","doi-asserted-by":"crossref","unstructured":"Cheng, H.K., Chung, J., Tai, Y.W., Tang, C.K.: CascadePSP: toward class-agnostic and very high-resolution segmentation via global and local refinement. In: CVPR (2020)","DOI":"10.1109\/CVPR42600.2020.00891"},{"issue":"8","key":"14_CR7","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 TPAMI 31(8), 1362\u20131374 (2009)","journal-title":"IEEE TPAMI"},{"key":"14_CR8","doi-asserted-by":"crossref","unstructured":"Cousty, J., Najman, L., Perret, B.: Constructive links between some morphological hierarchies on edge-weighted graphs. In: ISMM, pp. 86\u201397 (2013)","DOI":"10.1007\/978-3-642-38294-9_8"},{"key":"14_CR9","doi-asserted-by":"crossref","unstructured":"Eschweiler, D., Spina, T.V., Choudhury, R.C., Meyerowitz, E., Cunha, A., Stegmaier, J.: CNN-based preprocessing to optimize watershed-based cell segmentation in 3D confocal microscopy images. In: 2019 IEEE 16th International Symposium on Biomedical Imaging (ISBI 2019), pp. 223\u2013227. IEEE, Piscataway, NJ, April 2019","DOI":"10.1109\/ISBI.2019.8759242"},{"key":"14_CR10","doi-asserted-by":"publisher","unstructured":"Falcao, A., Bergo, F.: Interactive volume segmentation with differential image foresting transforms. IEEE Trans. Med. Imaging 23(9), 1100\u20131108 (2004). https:\/\/doi.org\/10.1109\/TMI.2004.829335","DOI":"10.1109\/TMI.2004.829335"},{"key":"14_CR11","doi-asserted-by":"publisher","unstructured":"Falc\u00e3o, A., Stolfi, J., de Alencar Lotufo, R.: The image foresting transform: theory, algorithms, and applications. IEEE TPAMI 26(1), 19\u201329 (2004). https:\/\/doi.org\/10.1109\/TPAMI.2004.1261076","DOI":"10.1109\/TPAMI.2004.1261076"},{"key":"14_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"304","DOI":"10.1007\/978-3-540-88682-2_24","volume-title":"Computer Vision \u2013 ECCV 2008","author":"H Jegou","year":"2008","unstructured":"Jegou, H., Douze, M., Schmid, C.: Hamming embedding and weak geometric consistency for large scale image search. In: Forsyth, D., Torr, P., Zisserman, A. (eds.) ECCV 2008. LNCS, vol. 5302, pp. 304\u2013317. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-88682-2_24"},{"key":"14_CR13","doi-asserted-by":"publisher","unstructured":"Lux, F., Matula, P.: DIC image segmentation of dense cell populations by combining deep learning and watershed. In: 16th IEEE ISBI, pp. 236\u2013239 (2019). https:\/\/doi.org\/10.1109\/ISBI.2019.8759594","DOI":"10.1109\/ISBI.2019.8759594"},{"key":"14_CR14","doi-asserted-by":"publisher","first-page":"3707","DOI":"10.1109\/TIP.2015.2451011","volume":"24","author":"V Machairas","year":"2015","unstructured":"Machairas, V., Faessel, M., Cardenas, D., Chabardes, T., Walter, T., Decenci\u00e8re, E.: Waterpixels. IEEE TIP 24, 3707\u20133716 (2015). https:\/\/doi.org\/10.1109\/TIP.2015.2451011","journal-title":"IEEE TIP"},{"key":"14_CR15","unstructured":"Meyer, F.: Color image segmentation. In: 1992 International Conference on Image Processing and its Applications, pp. 303\u2013306 (1992)"},{"key":"14_CR16","unstructured":"Meyer, F.: The watershed concept and its use in segmentation : a brief history, February 2012. http:\/\/arxiv.org\/1202.0216, arXiv:1202.0216 [cs]"},{"issue":"12","key":"14_CR17","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 TPAMI 18(12), 1163\u20131173 (1996). https:\/\/doi.org\/10.1109\/34.546254","journal-title":"IEEE TPAMI"},{"key":"14_CR18","doi-asserted-by":"crossref","unstructured":"Najman, L., Cousty, J., Perret, B.: Playing with kruskal: algorithms for morphological trees in edge-weighted graphs. In: ISMM, pp. 135\u2013146 (2013)","DOI":"10.1007\/978-3-642-38294-9_12"},{"key":"14_CR19","first-page":"109","volume":"136","author":"M\u00d4V Ngoc","year":"2023","unstructured":"Ngoc, M.\u00d4.V., Carlinet, E., Fabrizio, J., G\u00e9raud, T.: The Dahu graph-cut for interactive segmentation on 2D\/3D images. Pattern Recogn. 136, 109\u2013207 (2023)","journal-title":"Pattern Recogn."},{"key":"14_CR20","doi-asserted-by":"publisher","unstructured":"Passat, N., Naegel, B., Rousseau, F., Koob, M., Dietemann, J.L.: Interactive segmentation based on component-trees. Pattern Recogn. 44(10), 2539\u20132554 (2011). https:\/\/doi.org\/10.1016\/j.patcog.2011.03.025, Semi-Supervised Learning for Visual Content Analysis and Understanding","DOI":"10.1016\/j.patcog.2011.03.025"},{"key":"14_CR21","doi-asserted-by":"publisher","unstructured":"Perret, B., Chierchia, G., Cousty, J., F. Guimar\u00e3es, S., Kenmochi, Y., Najman, L.: Higra: hierarchical graph analysis. SoftwareX 10, 100335 (2019). https:\/\/doi.org\/10.1016\/j.softx.2019.100335","DOI":"10.1016\/j.softx.2019.100335"},{"issue":"4","key":"14_CR22","first-page":"561","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. TIP 9(4), 561\u2013576 (2000)","journal-title":"TIP"},{"issue":"6","key":"14_CR23","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1109\/34.87344","volume":"13","author":"L Vincent","year":"1991","unstructured":"Vincent, L., Soille, P.: Watersheds in digital spaces: an efficient algorithm based on immersion simulations. IEEE TPAMI 13(6), 583\u2013598 (1991). https:\/\/doi.org\/10.1109\/34.87344","journal-title":"IEEE TPAMI"},{"key":"14_CR24","doi-asserted-by":"publisher","unstructured":"Wolf, S., Schott, L., K\u00f6the, U., Hamprecht, F.: Learned watershed: end-to-end learning of seeded segmentation, September 2017. https:\/\/doi.org\/10.48550\/arXiv.1704.02249, arXiv:1704.02249 [cs]","DOI":"10.48550\/arXiv.1704.02249"}],"container-title":["Lecture Notes in Computer Science","Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-49018-7_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,26]],"date-time":"2023-11-26T23:10:12Z","timestamp":1701040212000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-49018-7_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11,27]]},"ISBN":["9783031490170","9783031490187"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-49018-7_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023,11,27]]},"assertion":[{"value":"27 November 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CIARP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Iberoamerican Congress on Pattern Recognition","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Coimbra","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 November 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 November 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ciarp2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Conftool","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"106","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":"61","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":"58% - 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","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":"5","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)"}}]}}