Parallel algorithm for concurrent computation of connected component Tree

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

Volumn 5259 LNCS, Issue , 2008, Pages 230-241

  Matas, P ^a,b   Dokladalova E ^a   Akil, M ^a   Grandpierre, T ^a   Najman, L ^a   Poupa, M ^b   Georgiev, V ^b  

^a CNRS   (France)

^b UNIVERSITY OF WEST BOHEMIA   (Czech Republic)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER VISION; FORESTRY; MEMORY ARCHITECTURE;

COMMUNICATION MINIMIZATION; CONCURRENT COMPUTATION; CONNECTED COMPONENT; INPUT AND OUTPUTS; PARALLEL-CONNECTED; PARALLELIZATION STRATEGIES; PERFORMANCE COMPARISON; SEQUENTIAL ALGORITHM;

TREES (MATHEMATICS);

EID: 57049173424     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-88458-3_21     Document Type: Conference Paper

References (14)

1. Salembier, P., Oliveras, A., Garrido, L.: Anti-extensive connected operators for image and sequence processing. IEEE Trans. on Image Proc. 7(4), 555-570 (1998)
2. Najman, L., Couprie, M.: Building the component tree in quasi-linear time. IEEE Transactions on Image Processing 15(11), 3531-3539 (2006)
3. Berger, C., Géraud, T., Levillain, R., Widynski, N., Baillard, A., Bertin, E.: Effective component tree computation with application to pattern recognition in astronomical imaging. In: ICIP 2007 (2007)
4. Menotti, D., Najman, L., de Albuquerque Araüjo, A.: ID Component Tree in Linear Time and Space and its Application to Gray-Level Image Multithresholding. In: Proceedings of the 8th International Symposium on Mathematical Morphology, Rio de Janeiro, Brazil, October 10-13, MCT/INPE, vol. 1, pp. 437-448 (2007)
5. Wilkinson, M.H.F., Gao, H., Hesselink, W.H., Jonker, J.-E., Meijster, A.: Concurrent Computation of Attribute Filters on Shared Memory Parallel Machines. Transactions on Pattern Analysis and Machine Intelligence (submitted, 2007)
6. Couprie, M., Najman, L., Bertrand, G.: Quasi-linear algorithms for the topological watershed. Journal of Mathematical Imaging and Vision 22(2-3), 231-249 (2005)
7. Tarjan, R.E.: Efficiency of a good but not linear set union algorithm. Journal of the ACM 22, 215-225 (1975)
8. Ngan, N., Contou-Carrère, F., Marcon, B., Guérin, S., Dokládalová, E., Akil, M.: Efficient hardware implementation of connected component tree algorithm. In: Workshop on Design and Architectures for Signal and Image Processing, DASIP 2007, Grenoble, France (2007)
9. Berger, C., Widynsky, N.: Using connected operators to manipulate image components. Report, LRDE Seminar (July 2005)
10. Meijster, A.: Efficient Sequential and Parallel Algorithms for Morphological Image Processing. PhD thesis, Rijksuniversiteit Groningen
11. Berger, C., Geraud, T., Levillain, R., Widynski, N., Baillard, A., Bertin, E.: Image Processing. In: IEEE International Conference on ICIP 2007, September 16 -October 19, vol. 4, IV - 41- IV - 44 (2007)
12. Deloison, B.: Recherche et développement en traitement d'image: Utilisation de l'arbre des composantes pour la fusion d'images. Report from graduate project, ESIEE Paris (June 2007)
13. Chiang, Y.-J., Lenz, T., Lu, X., Rote, G.: Simple and optimal output sensitive construction of contour trees using monotone paths. Comp. Geometry: Theory and Applications 30(2), 165-195 (2005)
14. Mattes, J., Demongeot, J.: Efficient algorithms to implement the confinement tree. In: Nyström, I., Sanniti di Baja, G., Borgefors, G. (eds.) DGCI 2000. LNCS, vol. 1953, pp. 392-405. Springer, Heidelberg (2000)