{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T05:26:35Z","timestamp":1726032395320},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030208660"},{"type":"electronic","value":"9783030208677"}],"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-20867-7_11","type":"book-chapter","created":{"date-parts":[[2019,6,18]],"date-time":"2019-06-18T19:14:41Z","timestamp":1560885281000},"page":"137-149","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On the Probabilities of Hierarchical Watersheds"],"prefix":"10.1007","author":[{"given":"Deise","family":"Santana Maia","sequence":"first","affiliation":[]},{"given":"Jean","family":"Cousty","sequence":"additional","affiliation":[]},{"given":"Laurent","family":"Najman","sequence":"additional","affiliation":[]},{"given":"Benjamin","family":"Perret","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,5,31]]},"reference":[{"key":"11_CR1","unstructured":"Angulo, J., Jeulin, D.: Stochastic watershed segmentation. In: ISMM. Springer (2007)"},{"issue":"2","key":"11_CR2","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/s10851-007-0780-4","volume":"27","author":"R Audigier","year":"2007","unstructured":"Audigier, R., Lotufo, R.: Uniquely-determined thinning of the tie-zone watershed based on label frequency. JMIV 27(2), 157\u2013173 (2007)","journal-title":"JMIV"},{"key":"11_CR3","first-page":"433","volume":"34","author":"S Beucher","year":"1992","unstructured":"Beucher, S., Meyer, F.: The morphological approach to segmentation: the watershed transformation. Opt. Eng. N.Y. Marcel Dekker Inc. 34, 433\u2013481 (1992)","journal-title":"Opt. Eng. N.Y. Marcel Dekker Inc."},{"issue":"8","key":"11_CR4","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 PAMI 31(8), 1362\u20131374 (2009)","journal-title":"IEEE PAMI"},{"key":"11_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1007\/978-3-642-21569-8_24","volume-title":"Mathematical Morphology and Its Applications to Image and Signal Processing","author":"J Cousty","year":"2011","unstructured":"Cousty, J., Najman, L.: Incremental algorithm for hierarchical minimum spanning forests and saliency of watershed cuts. In: Soille, P., Pesaresi, M., Ouzounis, G.K. (eds.) ISMM 2011. LNCS, vol. 6671, pp. 272\u2013283. Springer, Heidelberg (2011). \n                      https:\/\/doi.org\/10.1007\/978-3-642-21569-8_24"},{"issue":"4","key":"11_CR6","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1007\/s10851-017-0768-7","volume":"60","author":"J Cousty","year":"2018","unstructured":"Cousty, J., Najman, L., Kenmochi, Y., Guimar\u00e3es, S.: Hierarchical segmentations with graphs: quasi-flat zones, minimum spanning trees, and saliency maps. JMIV 60(4), 479\u2013502 (2018)","journal-title":"JMIV"},{"key":"11_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1007\/978-3-642-38294-9_8","volume-title":"Mathematical Morphology and Its Applications to Signal and Image Processing","author":"J Cousty","year":"2013","unstructured":"Cousty, J., Najman, L., Perret, B.: Constructive links between some morphological hierarchies on edge-weighted graphs. In: Hendriks, C.L.L., Borgefors, G., Strand, R. (eds.) ISMM 2013. LNCS, vol. 7883, pp. 86\u201397. Springer, Heidelberg (2013). \n                      https:\/\/doi.org\/10.1007\/978-3-642-38294-9_8"},{"key":"11_CR8","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"},{"issue":"1","key":"11_CR9","first-page":"216","volume":"1","author":"D Jeulin","year":"2016","unstructured":"Jeulin, D.: Morphological probabilistic hierarchies for texture segmentation. Math. Morphol.-Theory Appl. 1(1), 216\u2013324 (2016)","journal-title":"Math. Morphol.-Theory Appl."},{"key":"11_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/978-3-642-38294-9_12","volume-title":"Mathematical Morphology and Its Applications to Signal and Image Processing","author":"L Najman","year":"2013","unstructured":"Najman, L., Cousty, J., Perret, B.: Playing with kruskal: algorithms for morphological trees in edge-weighted graphs. In: Hendriks, C.L.L., Borgefors, G., Strand, R. (eds.) ISMM 2013. LNCS, vol. 7883, pp. 135\u2013146. Springer, Heidelberg (2013). \n                      https:\/\/doi.org\/10.1007\/978-3-642-38294-9_12"},{"issue":"4","key":"11_CR11","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 Trans. Image Process. 9(4), 561\u2013576 (2000)","journal-title":"IEEE Trans. Image Process."},{"key":"11_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/978-3-642-40602-7_40","volume-title":"Pattern Recognition","author":"C Straehle","year":"2013","unstructured":"Straehle, C., Peter, S., K\u00f6the, U., Hamprecht, F.A.: K-smallest spanning tree segmentations. In: Weickert, J., Hein, M., Schiele, B. (eds.) GCPR 2013. LNCS, vol. 8142, pp. 375\u2013384. Springer, Heidelberg (2013). \n                      https:\/\/doi.org\/10.1007\/978-3-642-40602-7_40"},{"key":"11_CR13","unstructured":"Vachier, C., Meyer, F.: Extinction value: a new measurement of persistence. In IEEE Workshop on Nonlinear Signal and Image Processing, pp. 254\u2013257 (1995)"}],"container-title":["Lecture Notes in Computer Science","Mathematical Morphology and Its Applications to Signal and Image Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-20867-7_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,18]],"date-time":"2019-06-18T19:14:50Z","timestamp":1560885290000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-20867-7_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030208660","9783030208677"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-20867-7_11","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":"31 May 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ISMM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Mathematical Morphology and Its Applications to Signal and Image Processing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Saarbr\u00fccken","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","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":"8 July 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 July 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ismm2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/ismm.uni-saarland.de\/","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"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"54","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"41","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"76% - 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"}},{"value":"3-4","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}