{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T03:44:45Z","timestamp":1725594285851},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642215681"},{"type":"electronic","value":"9783642215698"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-21569-8_24","type":"book-chapter","created":{"date-parts":[[2011,6,29]],"date-time":"2011-06-29T07:21:56Z","timestamp":1309332116000},"page":"272-283","source":"Crossref","is-referenced-by-count":42,"title":["Incremental Algorithm for Hierarchical Minimum Spanning Forests and Saliency of Watershed Cuts"],"prefix":"10.1007","author":[{"given":"Jean","family":"Cousty","sequence":"first","affiliation":[]},{"given":"Laurent","family":"Najman","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"10","key":"24_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. IVC\u00a028(10), 1460\u20131471 (2010)","journal-title":"IVC"},{"issue":"1","key":"24_CR2","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/s11263-006-6857-5","volume":"69","author":"P.A. Arbel\u00e1ez","year":"2006","unstructured":"Arbel\u00e1ez, P.A., Cohen, L.D.: A metric approach to vector-valued image segmentation. IJCV\u00a069(1), 119\u2013126 (2006)","journal-title":"IJCV"},{"key":"24_CR3","doi-asserted-by":"crossref","unstructured":"Audigier, R., Lotufo, R.: Seed-relative segmentation robustness of watershed and fuzzy connectedness approaches. In: IEEE SIBGRAPI 2007, pp. 61\u201370 (2007)","DOI":"10.1109\/SIBGRAPI.2007.26"},{"key":"24_CR4","doi-asserted-by":"crossref","unstructured":"Bender, M.A., Farach-Colton, M.: The LCA problem revisited. In: Latin American Theoretical Informatics, pp. 88\u201394 (2000)","DOI":"10.1007\/10719839_9"},{"key":"24_CR5","doi-asserted-by":"crossref","unstructured":"Beucher, S.: Watershed, hierarchical segmentation and waterfall algorithm. In: ISMM 1994, pp. 69\u201376 (1994)","DOI":"10.1007\/978-94-011-1040-2_10"},{"key":"24_CR6","doi-asserted-by":"crossref","unstructured":"Couprie, C., Grady, L., Najman, L., Talbot, H.: Power Watersheds: A Unifying Graph Based Optimization Framework. PAMI (to appear, 2011)","DOI":"10.1109\/TPAMI.2010.200"},{"issue":"2-3","key":"24_CR7","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/s10851-005-4892-4","volume":"22","author":"M. Couprie","year":"2005","unstructured":"Couprie, M., Najman, L., Bertrand, G.: Quasi-linear algorithms for the topological watershed. JMIV\u00a022(2-3), 231\u2013249 (2005)","journal-title":"JMIV"},{"key":"24_CR8","doi-asserted-by":"crossref","unstructured":"Cousty, J., Najman, L., Serra, J.: Raising in watershed lattices. In: 15th IEEE ICIP 2008, pp. 2196\u20132199 (2008)","DOI":"10.1109\/ICIP.2008.4712225"},{"issue":"8","key":"24_CR9","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. PAMI\u00a031(8), 1362\u20131374 (2009)","journal-title":"PAMI"},{"issue":"5","key":"24_CR10","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. PAMI\u00a032(5), 925\u2013939 (2010)","journal-title":"PAMI"},{"issue":"15","key":"24_CR11","first-page":"3011","volume":"156","author":"J. Cousty","year":"2008","unstructured":"Cousty, J., Najman, L., Bertrand, G., Couprie, M.: Weighted fusion graphs: merging properties and watersheds. DAM\u00a0156(15 ), 3011\u20133027 (2008)","journal-title":"DAM"},{"key":"24_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/978-3-642-03613-2_14","volume-title":"Mathematical Morphology and Its Application to Signal and Image Processing","author":"J. Cousty","year":"2009","unstructured":"Cousty, J., Najman, L., Serra, J.: Some morphological operators in graph spaces. In: Wilkinson, M.H.F., Roerdink, J.B.T.M. (eds.) ISMM 2009. LNCS, vol.\u00a05720, pp. 149\u2013160. Springer, Heidelberg (2009)"},{"key":"24_CR13","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1023\/B:VISI.0000022288.19776.77","volume":"59","author":"P. Felzenszwalb","year":"2004","unstructured":"Felzenszwalb, P., Huttenlocher, D.: Efficient graph-based image segmentation. International Journal of Computer Vision\u00a059, 167\u2013181 (2004)","journal-title":"International Journal of Computer Vision"},{"key":"24_CR14","doi-asserted-by":"publisher","first-page":"596","DOI":"10.1145\/28869.28874","volume":"34","author":"M.L. Fredman","year":"1987","unstructured":"Fredman, M.L., Tarjan, R.E.: Fibonacci heaps and their uses in improved network optimization algorithms. J. ACM\u00a034, 596\u2013615 (1987)","journal-title":"J. ACM"},{"key":"24_CR15","doi-asserted-by":"publisher","first-page":"54","DOI":"10.2307\/2346439","volume":"18","author":"J.C. Gower","year":"1969","unstructured":"Gower, J.C., Ross, G.J.S.: Minimum spanning tree and single linkage cluster analysis. Appl. Stats.\u00a018, 54\u201364 (1969)","journal-title":"Appl. Stats."},{"issue":"3","key":"24_CR16","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/s11263-005-6299-0","volume":"68","author":"L. Guigues","year":"2006","unstructured":"Guigues, L., Cocquerez, J.P., Men, H.L.: Scale-sets image analysis. IJCV\u00a068(3), 289\u2013317 (2006)","journal-title":"IJCV"},{"volume-title":"Mathematical taxonomy","year":"1971","author":"N. Jardine","key":"24_CR17","unstructured":"Jardine, N., Sibson, R.: Mathematical taxonomy. Wiley, Chichester (1971)"},{"key":"24_CR18","doi-asserted-by":"crossref","unstructured":"Marcotegui, B., Beucher, S.: Fast implementation of waterfall based on graphs. In: ISMM 2005, pp. 177\u2013186 (2005)","DOI":"10.1007\/1-4020-3443-1_16"},{"key":"24_CR19","doi-asserted-by":"crossref","unstructured":"Meyer, F.: Minimum spanning forests for morphological segmentation. In: ISMM 1994, pp. 77\u201384 (1994)","DOI":"10.1007\/978-94-011-1040-2_11"},{"key":"24_CR20","doi-asserted-by":"crossref","unstructured":"Meyer, F.: The dynamics of minima and contours. In: ISMM, pp. 329\u2013336 (1996)","DOI":"10.1007\/978-1-4613-0469-2_38"},{"key":"24_CR21","doi-asserted-by":"crossref","unstructured":"Meyer, F., Najman, L.: Segmentation, minimum spanning tree and hierarchies. In: Mathematical Morphology, ch.\u00a09, pp. 229\u2013261. ISTE-Wiley (2010)","DOI":"10.1002\/9781118600788.ch9"},{"issue":"2","key":"24_CR22","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1049\/ip-f-1.1986.0025","volume":"133","author":"O.J. Morris","year":"1986","unstructured":"Morris, O.J., Lee, M.d.J., Constantinides, A.G.: Graph theory for image analysis: an approach based on the shortest spanning tree. IEE Proc. on Communications, Radar and Signal\u00a0133(2), 146\u2013152 (1986)","journal-title":"IEE Proc. on Communications, Radar and Signal"},{"issue":"12","key":"24_CR23","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. PAMI\u00a018(12), 1163\u20131173 (1996)","journal-title":"PAMI"},{"issue":"3","key":"24_CR24","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/s10851-011-0259-1","volume":"40","author":"L. Najman","year":"2011","unstructured":"Najman, L.: On the equivalence between hierarchical segmentations and ultrametric watersheds. JMIV\u00a040(3), 231\u2013247 (2011)","journal-title":"JMIV"},{"issue":"11","key":"24_CR25","first-page":"3531","volume":"15","author":"L. Najman","year":"2006","unstructured":"Najman, L., Couprie, M.: Building the component tree in quasi-linear time. IEEE TIP\u00a015(11), 3531\u20133539 (2006)","journal-title":"IEEE TIP"},{"issue":"2-3","key":"24_CR26","first-page":"301","volume":"147","author":"L. Najman","year":"2005","unstructured":"Najman, L., Couprie, M., Bertrand, G.: Watersheds, mosaics and the emergence paradigm. DAM\u00a0147(2-3), 301\u2013324 (2005)","journal-title":"DAM"},{"issue":"3","key":"24_CR27","doi-asserted-by":"publisher","first-page":"588","DOI":"10.1016\/j.patcog.2010.09.016","volume":"44","author":"S. Philipp-Foliguet","year":"2011","unstructured":"Philipp-Foliguet, S., Jordan, M., Najman, L., Cousty, J.: Artwork 3D Model Database Indexing and Classification. Patt. Recogn.\u00a044(3), 588\u2013597 (2011)","journal-title":"Patt. Recogn."},{"issue":"4","key":"24_CR28","first-page":"555","volume":"7","author":"P. Salembier","year":"1998","unstructured":"Salembier, P., Oliveras, A., Garrido, L.: Anti-extensive connected operators for image and sequence processing. IEEE TIP\u00a07(4), 555\u2013570 (1998)","journal-title":"IEEE TIP"},{"key":"24_CR29","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1145\/321879.321884","volume":"22","author":"R.E. Tarjan","year":"1975","unstructured":"Tarjan, R.E.: Efficiency of a good but not linear set union algorithm. J. ACM\u00a022, 215\u2013225 (1975)","journal-title":"J. ACM"},{"key":"24_CR30","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)"},{"issue":"1","key":"24_CR31","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1109\/T-C.1971.223083","volume":"C-20","author":"C.T. Zahn","year":"1971","unstructured":"Zahn, C.T.: Graph-theoretical methods for detecting and descibing gestalt clusters. IEEE Transactions on Computers\u00a0C-20(1), 99\u2013112 (1971)","journal-title":"IEEE Transactions on Computers"}],"container-title":["Lecture Notes in Computer Science","Mathematical Morphology and Its Applications to Image and Signal Processing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-21569-8_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,12]],"date-time":"2019-06-12T10:02:58Z","timestamp":1560333778000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-21569-8_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642215681","9783642215698"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-21569-8_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}
