{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T16:28:13Z","timestamp":1725726493537},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642382932"},{"type":"electronic","value":"9783642382949"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38294-9_12","type":"book-chapter","created":{"date-parts":[[2013,5,12]],"date-time":"2013-05-12T22:52:56Z","timestamp":1368399176000},"page":"135-146","source":"Crossref","is-referenced-by-count":51,"title":["Playing with Kruskal: Algorithms for Morphological Trees in Edge-Weighted Graphs"],"prefix":"10.1007","author":[{"given":"Laurent","family":"Najman","sequence":"first","affiliation":[]},{"given":"Jean","family":"Cousty","sequence":"additional","affiliation":[]},{"given":"Benjamin","family":"Perret","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"12_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1007\/978-3-642-38294-9_8","volume-title":"ISMM 2013","author":"J. Cousty","year":"2013","unstructured":"Cousty, J., Najman, L., Perret, B.: Constructive links between some morphological hierarchies on edge-weighted graphs. In: Luengo Hendriks, C.L., Borgefors, G., Strand, R. (eds.) ISMM 2013. LNCS, vol.\u00a07883, pp. 86\u201397. Springer, Heidelberg (2013)"},{"issue":"4","key":"12_CR2","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"},{"issue":"3","key":"12_CR3","first-page":"195","volume":"10","author":"M. Nagao","year":"1979","unstructured":"Nagao, M., Matsuyama, T., Ikeda, Y.: Region extraction and shape analysis in aerial photographs. CGIP\u00a010(3), 195\u2013223 (1979)","journal-title":"CGIP"},{"key":"12_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/3-540-48236-9_17","volume-title":"Scale-Space Theories in Computer Vision","author":"F. Meyer","year":"1999","unstructured":"Meyer, F., Maragos, P.: Morphological scale-space representation with levelings. In: Nielsen, M., Johansen, P., Fogh Olsen, O., Weickert, J. (eds.) Scale-Space 1999. LNCS, vol.\u00a01682, pp. 187\u2013198. Springer, Heidelberg (1999)"},{"issue":"4","key":"12_CR5","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. IEEE TIP\u00a09(4), 561\u2013576 (2000)","journal-title":"IEEE TIP"},{"issue":"12","key":"12_CR6","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 PAMI\u00a018(12), 1163\u20131173 (1996)","journal-title":"IEEE PAMI"},{"issue":"2","key":"12_CR7","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1049\/ip-f-1.1986.0025","volume":"133","author":"O.J. Morris","year":"1986","unstructured":"Morris, O.J., de Lee, M.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"},{"key":"12_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1007\/978-3-642-21569-8_10","volume-title":"Mathematical Morphology and Its Applications to Image and Signal Processing","author":"G. Ouzounis","year":"2011","unstructured":"Ouzounis, G., Soille, P.: Pattern spectra from partition pyramids and hierarchies. In: Soille, P., Pesaresi, M., Ouzounis, G.K. (eds.) ISMM 2011. LNCS, vol.\u00a06671, pp. 108\u2013119. Springer, Heidelberg (2011)"},{"issue":"8","key":"12_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. IEEE PAMI\u00a031(8), 1362\u20131374 (2009)","journal-title":"IEEE PAMI"},{"issue":"7","key":"12_CR10","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 partitioning and simplification. IEEE PAMI\u00a030(7), 1132\u20131145 (2008)","journal-title":"IEEE PAMI"},{"key":"12_CR11","first-page":"229","volume-title":"Mathematical Morphology: From Theory to Application","author":"F. Meyer","year":"2010","unstructured":"Meyer, F., Najman, L.: Segmentation, minimum spanning tree and hierarchies. In: Najman, L., Talbot, H. (eds.) Mathematical Morphology: From Theory to Application, pp. 229\u2013261. ISTE-Wiley, London (2010)"},{"issue":"3","key":"12_CR12","doi-asserted-by":"crossref","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) arXiv:1002.1887v2","journal-title":"JMIV"},{"key":"12_CR13","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.\u00a06671, pp. 272\u2013283. Springer, Heidelberg (2011)"},{"key":"12_CR14","doi-asserted-by":"crossref","unstructured":"Kruskal, J.B.: On the shortest spanning subtree of a graph and the traveling salesman problem. In: Proceedings of the AMS, vol.\u00a07, pp. 48\u201350 (February 1956)","DOI":"10.2307\/2033241"},{"key":"12_CR15","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1145\/321879.321884","volume":"22","author":"R. Tarjan","year":"1975","unstructured":"Tarjan, R.: Efficiency of a good but not linear set union algorithm. Journal of the ACM\u00a022, 215\u2013225 (1975)","journal-title":"Journal of the ACM"},{"key":"12_CR16","doi-asserted-by":"crossref","unstructured":"Meyer, F.: Minimum spanning forests for morphological segmentation. In: ISMM, pp. 77\u201384 (September 1994)","DOI":"10.1007\/978-94-011-1040-2_11"}],"container-title":["Lecture Notes in Computer Science","Mathematical Morphology and Its Applications to Signal and Image Processing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38294-9_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,12]],"date-time":"2019-05-12T20:57:04Z","timestamp":1557694624000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38294-9_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642382932","9783642382949"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38294-9_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}
