Playing with Kruskal: Algorithms for morphological trees in edge-weighted graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 7883 LNCS, Issue , 2013, Pages 135-146

  Najman, Laurent ^a   Cousty, Jean ^a   Perret, Benjamin ^a  

^a UNIVERSITÉ PARIS EST   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EDGE-WEIGHTED GRAPH; KEY STRUCTURES; KRUSKAL; KRUSKAL ALGORITHMS; MINIMUM SPANNING TREES; QUASI-LINEAR;

ALGORITHMS; IMAGE PROCESSING; MATHEMATICAL MORPHOLOGY;

TREES (MATHEMATICS);

EID: 84884294385     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-38294-9_12     Document Type: Conference Paper

References (16)

1. 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. 7883, pp. 86-97. Springer, Heidelberg (2013)
2. Salembier, P., Oliveras, A., Garrido, L.: Anti-extensive connected operators for image and sequence processing. IEEE TIP 7(4), 555-570 (1998)
3. Nagao, M., Matsuyama, T., Ikeda, Y.: Region extraction and shape analysis in aerial photographs. CGIP 10(3), 195-223 (1979)
4. 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. 1682, pp. 187-198. Springer, Heidelberg (1999)
5. Salembier, P., Garrido, L.: Binary partition tree as an efficient representation for image processing, segmentation, and information retrieval. IEEE TIP 9(4), 561-576 (2000)
6. Najman, L., Schmitt, M.: Geodesic saliency of watershed contours and hierarchical segmentation. IEEE PAMI 18(12), 1163-1173 (1996)
7. 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 133(2), 146-152 (1986)
8. Ouzounis, G., Soille, P.: Pattern spectra from partition pyramids and hierarchies. In: Soille, P., Pesaresi, M., Ouzounis, G.K. (eds.) ISMM 2011. LNCS, vol. 6671, pp. 108-119. Springer, Heidelberg (2011)
9. Cousty, J., Bertrand, G., Najman, L., Couprie, M.: Watershed Cuts: Minimum Spanning Forests and the Drop of Water Principle. IEEE PAMI 31(8), 1362-1374 (2009)
10. Soille, P.: Constrained connectivity for hierarchical image partitioning and simplification. IEEE PAMI 30(7), 1132-1145 (2008)
11. Meyer, F., Najman, L.: Segmentation, minimum spanning tree and hierarchies. In: Najman, L., Talbot, H. (eds.) Mathematical Morphology: From Theory to Application, pp. 229-261. ISTE-Wiley, London (2010)
12. Najman, L.: On the equivalence between hierarchical segmentations and ultrametric watersheds. JMIV 40(3), 231-247 (2011) arXiv:1002.1887v2
13. 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-283. Springer, Heidelberg (2011)
14. Kruskal, J.B.: On the shortest spanning subtree of a graph and the traveling salesman problem. In: Proceedings of the AMS, vol. 7, pp. 48-50 (February 1956)
15. Tarjan, R.: Efficiency of a good but not linear set union algorithm. Journal of the ACM 22, 215-225 (1975)
16. Meyer, F.: Minimum spanning forests for morphological segmentation. In: ISMM, pp. 77-84 (September 1994)