A comparative review of component tree computation algorithms

IEEE Transactions on Image Processing

Volumn 23, Issue 9, 2014, Pages 3885-3895

  Carlinet, Edwin ^a,b   Geraud, Thierry ^a,b  

^a EPITA RESEARCH AND DEVELOPMENT LABORATORY LRDE   (France)

^b UNIVERSITÉ PARIS EST   (France)

Author keywords

algorithms; Component tree; connected operators; filtering; mathematical morphology; max tree; min tree

Indexed keywords

DATA MINING; DECISION TREES; FILTRATION; MATHEMATICAL MORPHOLOGY;

COMPONENT TREE; COMPUTATION ALGORITHM; CONNECTED OPERATOR; MAX-TREE; MIN-TREE; NUMBER OF THREADS; REPRODUCIBLE RESEARCH; USER REQUIREMENTS;

ALGORITHMS;

EID: 84905229819     PISSN: 10577149     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIP.2014.2336551     Document Type: Review

References (31)

1. L. Vincent, "Grayscale area openings and closings, their efficient implementation and applications," in Proc. EURASIP Workshop Math. Morphol. Appl. Signal Process., 1993, pp. 22-27.
2. P. Salembier and J. Serra, "Flat zones filtering, connected operators, and filters by reconstruction," IEEE Trans. Image Process., vol. 4, no. 8, pp. 1153-1160, Aug. 1995.
3. P. Salembier, A. Oliveras, and L. Garrido, "Antiextensive connected operators for image and sequence processing," IEEE Trans. Image Process., vol. 7, no. 4, pp. 555-570, Apr. 1998.
4. R. Jones, "Connected filtering and segmentation using component trees," Comput. Vis. Image Understand., vol. 75, no. 3, pp. 215-228, Sep. 1999.
5. J. Hernández and B. Marcotegui, "Shape ultimate attribute opening," Image Vis. Comput., vol. 29, no. 8, pp. 533-545, Jul. 2011.
6. E. R. Urbach and M. H. F. Wilkinson, "Shape-only granulometries and grey-scale shape filters," in Proc. Int. Symp. Math. Morphol. (ISMM), 2002, pp. 305-314.
7. G. K. Ouzounis and M. H. F. Wilkinson, "Mask-based second-generation connectivity and attribute filters," IEEE Trans. Pattern Anal. Mach. Intell., vol. 29, no. 6, pp. 990-1004, Jun. 2007.
8. P. Monasse and F. Guichard, "Fast computation of a contrast-invariant image representation," IEEE Trans. Image Process., vol. 9, no. 5, pp. 860-872, May 2000.
9. Y. Xu, T. Géraud, and L. Najman, "Morphological filtering in shape spaces: Applications using tree-based image representations," in Proc. Int. Conf. Pattern Recognit. (ICPR), Nov. 2012, pp. 485-488.
10. J. Matas, O. Chum, M. Urban, and T. Pajdla, "Robust wide-baseline stereo from maximally stable extremal regions," Image Vis. Comput., vol. 22, no. 10, pp. 761-767, Sep. 2004.
11. M. A. Westenberg, J. B. T. M. Roerdink, and M. H. F. Wilkinson, "Volumetric attribute filtering and interactive visualization using the max-tree representation," IEEE Trans. Image Process., vol. 16, no. 12, pp. 2943-2952, Dec. 2007.
12. C. Berger, T. Géraud, R. Levillain, N. Widynski, A. Baillard, and E. Bertin, "Effective component tree computation with application to pattern recognition in astronomical imaging," in Proc. IEEE Int. Conf. Image Process. (ICIP), vol. 4. Oct. 2007, pp. IV-41-IV-44.
13. B. Perret, S. Lefevre, C. Collet, and E. Slezak, "Connected component trees for multivariate image processing and applications in astronomy," in Proc. 20th Int. Conf. Pattern Recognit. (ICPR), Aug. 2010, pp. 4089-4092.
14. E. Carlinet and T. Géraud, "A comparison of many max-tree computation algorithms," in Mathematical Morphology and Its Applications to Signal and Image Processing (Lecture Notes on Computer Science), vol. 7883. Berlin, Germany: Springer-Verlag, 2013, pp. 73-85.
15. L. Najman and M. Couprie, "Building the component tree in quasi-linear time," IEEE Trans. Image Process., vol. 15, no. 11, pp. 3531-3539, Nov. 2006.
16. M. H. F. Wilkinson and M. A. Westenberg, "Shape preserving filament enhancement filtering," in Proc. Med. Image Comput. Comput-Assist. Intervent, Oct. 2001, pp. 770-777.
17. M. H. F. Wilkinson, H. Gao, W H. Hesselink, J. E. Jonker, and A. Meijster, "Concurrent computation of attribute filters on shared memory parallel machines," IEEE Trans. Pattern Anal. Mach. Intell., vol. 30, no. 10, pp. 1800-1813, Oct. 2008.
18. A. V. Aho, J. D. Ullman, and J. E. Hopcroft, Data Structures and Algorithms. Reading, MA, USA: Addison-Wesley, 1983.
19. R. E. Tarjan, "Efficiency of a good but not linear set union algorithm," J. ACM, vol. 22, no. 2, pp. 215-225, Apr. 1975.
20. M. H. F. Wilkinson, "A fast component-tree algorithm for high dynamic-range images and second generation connectivity," in Proc. 18th IEEE Int. Conf. Image Process. (ICIP), Sep. 2011, pp. 1021-1024.
21. G. K. Ouzounis and M. H. F Wilkinson, "A parallel implementation of the dual-input max-tree algorithm for attribute filtering," in Proc. 8th Int. Symp. Math. Morphol. (ISMM), vol. 1. Oct. 2007, pp. 449-460.
22. P. Matas et al, "Parallel algorithm for concurrent computation of connected component tree," in Proc. Adv. Concepts Intell. Vis. Syst., Oct. 2008, pp. 230-241.
23. D. Menotti, L. Najman, and A. de Albuquerque Araújo, "1D component tree in linear time and space and its application to gray-level image multithresholding," in Proc. 8th Int. Symp. Math. Morphol. (ISMM), 2007, pp. 437-448.
24. V. Morard, P. Dokládal, and E. Decenciere, "One-dimensional openings, granulometries and component trees in O(1) per pixel," IEEE J. Sel. Topics Signal Process., vol. 6, no. 7, pp. 840-848, Nov. 2012.
25. A. Andersson, T. Hagerup, S. Nilsson, and R. Raman, "Sorting in linear time?" in Proc. Annu. ACM Symp. Theory Comput., 1995, pp. 427-436.
26. D. Nistér and H. Stewénius, "Linear time maximally stable extremal regions," in Proc. 10th Eur. Conf. Comput. Vis., Oct. 2008, pp. 183-196.
27. W. H. Hesselink, "Salembier's min-tree algorithm turned into breadth first search," Inform. Process. Lett., vol. 88, no. 5, pp. 225-229, Dec. 2003.
28. J. Reinders, Intel Threading Building Blocks: Outfitting C++ for Multi-Core Processor Parallelism. Sebastopol, CA, USA: O'Reilly Media, 2007.
29. D. E. Willard "Log-logarithmic worst-case range queries are possible in space ®(N)," Inform. Process. Lett. vol. 17 no. 2 pp. 81-84 Aug. 1983.
30. T. Géraud, E. Carlinet, S. Crozet, and L. Najman, "A quasi-linear algorithm to compute the tree of shapes of nD images," in Mathematical Morphology and Its Applications to Signal and Image Processing (Lecture Notes on Computer Science) vol. 7883. Berlin Germany: Springer-Verlag 2013 pp. 98-110.
31. L. Najman J. Cousty and B. Perret "Playing with Kruskal: Algorithms for morphological trees in edgeweighted graphs," in Mathematical Morphology and Its Applications to Signal and Image Processing (Lecture Notes on Computer Science) vol. 7883. Berlin Germany: Springer-Verlag 2013 pp. 135-146.