Quasi-linear algorithm for the component tree

Proceedings of SPIE - The International Society for Optical Engineering

Volumn 5300, Issue , 2004, Pages 98-107

  Najman, L ^a   Couprie, M ^a  

^a Groupe ESIEE   (France)

Author keywords

Component tree; Mathematical morphology

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; FUNCTIONS; IMAGE SEGMENTATION; MATHEMATICAL MORPHOLOGY;

COMPONENT TREE; EXTINCTION FUNCTION; GRANULOMETRIES;

TREES (MATHEMATICS);

EID: 8844252292     PISSN: 0277786X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1117/12.526592     Document Type: Conference Paper

References (17)

1. P. Hanusse and P. Guillataud. "Sémantique des images par analyse dendronique," in 8th Conf. Reconnaissance des Formes et Intelligence Artificielle, 2, pp. 577-588, AFCET, (Lyon), 1992.
2. P. Guillataud, Contribution à l'analyse, dendroniques des images. PhD thesis, Université de Bordeaux I, 1992.
3. M. Couprie and G. Bertrand, "Topological grayscale watershed transform," in SPIE Vision Geometry V Proceedings, 3168, pp. 136-146, 1997.
4. R. Jones, "Component trees for image filtering and segmentation," in NSIP'97, 1997.
5. P. Salembier, A. Oliveras, and L. Garrido, "Anti-extensive connected operators for image and sequence processing," IEEE Trans. on Image Proc. 7, pp. 555-570, April 1998.
6. J. Mattes, M. Richard, and J. Demongeot, "Tree representation for image matching and object recognition," in DGCI 99, G. Bertrand, M. Couprie, arid L. Perroton, eds., LNCS, pp. 298-309, 1999.
7. P. Monasse, Morphological representation of digital images and application to registration. PhD thesis, Paris-Dauphine University, June 2000.
8. Y.-J. Chiang, T. Lenz, X. Lu, and G. Rote, "Simple and optimal output-sensitive construction of contour trees using monotone paths," tech. rep., Polytechnic University, Brooklin, NY, USA, 2003. http://cis.poly.edu/ chiang/contour.pdf.
9. M. Couprie, L. Najman. and G. Bertrand, "Quasi-linear algorithms for topological watershed," Journal of Mathematical Imaging and Vision, 2004. submitted.
10. D. Wishart, "Mode analysis: A generalization of the nearest neighbor which reduces chaining effects," in Numerical Taxonomy, A. Cole, ed., pp. 282-319, Academic Press, (London), 1969.
11. J. Hartigan, "Statistical theory in clustering," J. of Classification 2, pp. 63-76, 1985.
12. C. Vachier, Extraction de caractéristiques, segmentation d'images et Morphologie Mathématique. PhD thesis, École National Supérieure des Mines de Paris, 1995.
13. E. Breen and R. Jones, "Attribute openings, thinnings arid granulometries," Computer Vision and Image Understanding 64, pp. 377-389, November 1996.
14. J. Mattes and J. Demongeot, "Efficient algorithms to implement the confinement tree," in 9th Conf. on D.G.C.I., LNCS 1953, pp. 392-405, Springer Verlag, 2000.
15. R. Tarjan, "Efficiency of a good but not linear set union algorithm," Journal of the ACM 22, pp. 215-225, 1975.
16. T. H. Cormen, C. L. Leiserson, and R. L. Rivest, Introduction to Algorithms, MIT Press, Cambridge, MA, 1990.
17. A. Andersson, T. Hagerup, S. Nilsson, and R. Raman, "Sorting in linear time?," in STOC: ACM Symposium on Theory of Computing, 1995.