Building the component tree in quasi-linear time

IEEE Transactions on Image Processing

Volumn 15, Issue 11, 2006, Pages 3531-3539

  Najman, Laurent ^a   Couprie, Michel ^a  

^a Groupe ESIEE   (France)

Author keywords

Classification; Component tree; Connected operators; Disjoint sets; Filtering; Image and signal processing; Mathematical morphology; Union find

Indexed keywords

CLASSIFICATION (OF INFORMATION); COMPUTATIONAL COMPLEXITY; LINEAR PROGRAMMING; MATHEMATICAL MORPHOLOGY; SET THEORY; TREES (MATHEMATICS);

COMPONENT TREE; CONNECTED OPERATORS; DISJOINT SETS;

IMAGE PROCESSING;

ALGORITHM; ARTICLE; ARTIFICIAL INTELLIGENCE; AUTOMATED PATTERN RECOGNITION; COMPUTER ASSISTED DIAGNOSIS; COMPUTER SIMULATION; COMPUTER SYSTEM; EVALUATION; IMAGE ENHANCEMENT; INFORMATION RETRIEVAL; METHODOLOGY; STATISTICAL MODEL;

ALGORITHMS; ARTIFICIAL INTELLIGENCE; COMPUTER SIMULATION; COMPUTER SYSTEMS; IMAGE ENHANCEMENT; IMAGE INTERPRETATION, COMPUTER-ASSISTED; INFORMATION STORAGE AND RETRIEVAL; LINEAR MODELS; PATTERN RECOGNITION, AUTOMATED;

EID: 33746202291     PISSN: 10577149     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIP.2006.877518     Document Type: Article

References (26)

1. A. Andersson, T. Hagerup, S. Nilsson, and R. Raman, "Sorting in linear time?," presented at the STOC: ACM Symp. Theory of Computing 1995.
2. G. Bertand, "On the dynamics," Image Vis. Comput., submitted for publication.
3. G. Bertrand, "On topological watersheds," JMIV, vol. 22, no. 2-3, pp. 217-230, 2005.
4. E. J. Breen and R. Jones, "Attribute openings, thinnings and granulometries," Comp. Vis. Image Understand., vol. 64, no. 3, pp. 377-389, Nov. 1996.
5. Y.-J. Chiang, T. Lenz, X. Lu, and G. Rote, "Simple and optimal outputsensitive construction of contour trees using monotone paths," Comput. Geometry: Theory Appl., vol. 30, no. 2, pp. 165-195, 2005.
6. T. H. Cormen, C. L. Leiserson, and R. L. Rivest, Introduction to Algorithms. Cambridge, MA: MIT Press, 1990.
7. M. Couprie and G. Bertrand, "Topological grayscale watershed transform," in Proc. SPIE Vis. Geometry V, 1997, vol. 3168, pp. 136-146.
8. M. Couprie, L. Najman, and G. Bertrand, "Quasi-linear algorithms for the topological watershed," JMIV, vol. 22, no. 2-3, pp. 231-249, 2005.
9. M. B. Dillencourt, H. Samet, and M. Tamminen, "A general approach to connected-component labeling for arbitrary image representations," J. Assoc. Comput. Mach., vol. 39, no. 2, pp. 253-280, 1992.
10. C. Fiorio and J. Gustedt, "Two linear union-find strategies for image processing," Th. Comput. Sci., vol. 154, pp. 165-181, 1996.
11. P. Guillataud, "Contribution à l'analyse Dendroniques Des Images," Ph.D. dissertation, Univ. Bordeaux I, Bordeaux, France, 1992.
12. P. Hanusse and P. Guillataud, "Sémantique des images par analyse dendronique," in Proc. 8th RFIA, 1992, vol. 2, pp. 577-588.
13. J. A. Hartigan, "Statistical theory in clustering," J. Classif., vol. 2, pp. 63-76, 1985.
14. R. Jones, "Component trees for image filtering and segmentation," presented at the NSIP 1997.
15. J. Mattes and J. Demongeot, Efficient Algorithms to Implement the Confinement Tree. Berlin, Germany: Springer, 2000, vol. 1953, LNCS, pp. 392-405.
16. J. Mattes, M. Richard, and J. Demongeot, Tree Representation for Image Matching and Object Recognition. 1999, vol. 1568, LNCS, pp. 298-309.
17. A. Meijster and M. H. F. Wilkinson, "A comparison of algorithms for connected set openings and closings," IEEE Trans. Pattern Anal. Mach. Intell., vol. 24, no. 4, pp. 484-494, Apr. 2002.
18. P. Monasse, "Morphological Representation of Digital Images and Application to Registration," Ph.D. dissertation, Paris-Dauphine Univ., Paris, France, 2000.
19. L. Najman and M. Couprie, "Quasi-linear algorithm for the component tree," in Proc. SPIE Vis. Geometry XII, 2004, vol. 5300, pp. 98-107.
20. G. K. Ouzounis and M. H. F. Wilkinson, "Second-order connected attribute filters using max-trees," in Mathematical Morphology: 40 years On. Berlin, Germany: Springer, 2005, pp. 65-74.
21. P. Salembier, A. Oliveras, and L. Garrido, "Anti-extensive connected operators for image and sequence processing," IEEE Trans. Image Process., vol. 7, no. 4, pp. 555-570, Apr. 1998.
22. P. Salembier and J. Serra, "Flat zones filtering, connected operators and filter by reconstruction," IEEE Trans. Image Process., vol. 3, no. 8, pp. 1153-1160, Aug. 1995.
23. J. Serra, "Connectivity on complete lattices," JMIV, vol. 9, pp. 231-251, 1998.
24. R. E. Tarjan, "Efficiency of a good but not linear set union algorithm," J. ACM, vol. 22, pp. 215-225, 1975.
25. C. Vachier, "Extraction de Caractéristiques, Segmentation d'images et Morphologie mathématique," Ph.D. dissertation, Ecole Nationale Superieure des Mines de Paris (ENSMP), Paris, France, 1995.
26. D. Wishart, "Mode analysis: A generalization of the nearest neighbor which reduces chaining effects," in Numerical Taxonomy, A.J. Cole, Ed. London, U.K.: Academic, 1969, pp. 282-319.