H. M. Alnuweiri and V. K. Prasanna, Parallel architectures and algorithms for image component labeling, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.14, issue.10, pp.1014-1034, 1992.
DOI : 10.1109/34.159904

C. Berger, T. Geraud, R. Levillain, N. Widynski, A. Baillard et al., Effective Component Tree Computation with Application to Pattern Recognition in Astronomical Imaging, 2007 IEEE International Conference on Image Processing, pp.41-44, 2007.
DOI : 10.1109/ICIP.2007.4379949

C. Berger and N. Widynski, Using connected operators to manipulate, LRDE Seminar, 2005.

Y. Chiang, T. Lenz, X. Lu, and G. Rote, Simple and optimal output-sensitive construction of contour trees using monotone paths, Computational Geometry, vol.30, issue.2, pp.165-195, 2005.
DOI : 10.1016/j.comgeo.2004.05.002

H. Thomas, C. E. Cormen, R. L. Leiserson, C. Rivest, and . Stein, Introduction to Algorithms, 2001.

M. Couprie, L. Najman, and G. Bertrand, Quasi-Linear Algorithms for the Topological Watershed, Journal of Mathematical Imaging and Vision, vol.13, issue.6, pp.231-249, 2005.
DOI : 10.1007/s10851-005-4892-4
URL : https://hal.archives-ouvertes.fr/hal-00622399

J. Crespo, J. Serra, and R. W. Schafer, Theoretical aspects of morphological filters by reconstruction, Signal Processing, vol.47, issue.2, pp.201-225, 1995.
DOI : 10.1016/0165-1684(95)00108-5

O. Cuisenaire and E. Romero, Automatic segmentation and measurement of axones in microscopic images, SPIE Medical Imaging, pp.920-929, 1999.

N. Michael-delorimier, N. Kapre, D. Mehta, I. Rizzo, R. Eslick et al., GraphStep: A System Architecture for Sparse-Graph Algorithms, 2006 14th Annual IEEE Symposium on Field-Programmable Custom Computing Machines, pp.143-151, 2006.
DOI : 10.1109/FCCM.2006.45

J. Fabrizio and B. Marcotegui, Fast Implementation of the Ultimate Opening, Proceedings of the 9th International Symposium on Mathematical Morphology and Its Application to Signal and Image Processing, ISMM '09, pp.272-281, 2009.
DOI : 10.1109/TIP.2006.877518
URL : https://hal.archives-ouvertes.fr/hal-00834197

H. Flatt, S. Blume, S. Hesselbarth, T. Schunemann, and P. Pirsch, A parallel hardware architecture for connected component labeling based on fast label merging, 2008 International Conference on Application-Specific Systems, Architectures and Processors, pp.144-149, 2008.
DOI : 10.1109/ASAP.2008.4580169

H. Seth-copen-goldstein, M. Schmit, S. Budiu, M. Cadambi, R. R. Moe et al., PipeRench: a reconfigurable architecture and compiler, Computer, vol.33, issue.4, pp.70-77, 2000.
DOI : 10.1109/2.839324

R. Hartenstein, A decade of reconfigurable computing: a visionary retrospective, Proceedings Design, Automation and Test in Europe. Conference and Exhibition 2001, pp.642-649, 2001.
DOI : 10.1109/DATE.2001.915091

W. Reiner, M. Hartenstein, T. Herz, U. Hoffmann, and . Nageldinger, Mapping applications onto reconfigurable kress arrays, FPL '99: Proceedings of the 9th International Workshop on Field- Programmable Logic and Applications, pp.385-390, 1999.

A. C. Jalba, M. H. Wilkinson, and J. B. Roerdink, Morphological hat-transform scale spaces and their use in pattern classification, Pattern Recognition, vol.37, issue.5, pp.901-915, 2004.
DOI : 10.1016/j.patcog.2003.09.009

C. Shuenn-der-jean, C. Liu, Z. Chang, and . Chen, A new algorithm and its vlsi architecture design for connected component labelling, International Symposium on Circuits and Systems (ISCAS), pp.565-568, 1994.

T. Christopher, D. G. Johnston, and . Bailey, Fpga implementation of a single pass connected components algorithm. Electronic Design, Test and Applications, IEEE International Workshop on, pp.228-231, 2008.

R. Jones, Component trees for image filtering and segmentation, Proceedings of the 1997 IEEE Workshop on Nonlinear Signal and Image Processing, 1997.

P. Matas, E. Dokladalova, M. Akil, T. Grandpierre, L. Najman et al., Parallel Algorithm for Concurrent Computation of Connected Component Tree, ACIVS, pp.230-241, 2008.
DOI : 10.1007/3-540-44438-6_32
URL : https://hal.archives-ouvertes.fr/hal-00622406

J. Mattes and J. Demongeot, Efficient Algorithms to Implement the Confinement Tree, DGCI '00: Proceedings of the 9th International Conference on Discrete Geometry for Computer Imagery, pp.392-405, 2000.
DOI : 10.1007/3-540-44438-6_32

J. Mattes, M. Richard, and J. Demongeot, Tree Representation for Image Matching and Object Recognition, DCGI '99: Proceedings of the 8th International Conference on Discrete Geometry for Computer Imagery, pp.298-312, 1999.
DOI : 10.1007/3-540-49126-0_23

B. Mei, S. Vernalde, D. Verkest, H. D. Man, and R. Lauwereins, ADRES: An Architecture with Tightly Coupled VLIW Processor and Coarse-Grained Reconfigurable Matrix, Field-Programmable Logic and Applications, pp.61-70, 2003.
DOI : 10.1007/978-3-540-45234-8_7

A. Meijster, Efficient Sequential and Parallel Algorithms for Morphological Image Processing, 2004.

D. Menotti-gomes, L. Najman, A. De-albuquerque, and . Araujo, 1d component tree in linear time and space and its application to gray-level image multithresholding, International Symposium on Mathematical Morphology, pp.437-448, 2007.
URL : https://hal.archives-ouvertes.fr/hal-00622373

A. Mérigot, Associative nets: a graph-based parallel computing model, IEEE Transactions on Computers, vol.46, issue.5, pp.558-571, 1997.
DOI : 10.1109/12.589222

F. Meyer and S. Beucher, Morphological segmentation, Journal of Visual Communication and Image Representation, vol.1, issue.1, pp.21-46, 1990.
DOI : 10.1016/1047-3203(90)90014-M

T. Miyamori and K. Olukotun, REMARC (abstract), Proceedings of the 1998 ACM/SIGDA sixth international symposium on Field programmable gate arrays , FPGA '98, pp.389-397, 1998.
DOI : 10.1145/275107.275164

A. N. Moga and M. Gabbouj, Parallel image component labelling with watershed transformation, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.19, issue.5, pp.441-450, 1997.
DOI : 10.1109/34.589204
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.161.1639

L. Najman and M. Couprie, Watershed Algorithms and Contrast Preservation, DGCI'03, pp.62-71, 2003.
DOI : 10.1007/978-3-540-39966-7_5
URL : https://hal.archives-ouvertes.fr/hal-00622112

L. Najman and M. Couprie, Building the Component Tree in Quasi-Linear Time, IEEE Transactions on Image Processing, vol.15, issue.11, pp.3531-3539, 2006.
DOI : 10.1109/TIP.2006.877518
URL : https://hal.archives-ouvertes.fr/hal-00622110

N. Ngan, F. Contou-carrère, B. Marcon, S. Guerin, E. Dokládalova et al., Efficient Hardware Implementation of Connected Component Tree Algorithm, Workshop on Design and Architectures For Signal and Image Processing, 2007.
URL : https://hal.archives-ouvertes.fr/hal-00622340

P. Piscaglia, A. Cavallaro, M. Bonnet, and D. Douxchamps, High Level Description of Video Surveillance Sequences, EC- MAST '99: Proceedings of the 4th European Conference on Multimedia Applications, Services and Techniques, pp.316-331, 1999.
DOI : 10.1007/3-540-48757-3_22

P. Salembier and L. Garrido, Binary partition tree as an efficient representation for image processing, segmentation, and information retrieval, IEEE Transactions on Image Processing, vol.9, issue.4, pp.561-576, 2000.
DOI : 10.1109/83.841934

P. Salembier and J. Serra, Flat zones filtering, connected operators, and filters by reconstruction, IEEE Transactions on Image Processing, vol.4, issue.8, pp.1153-1160, 1995.
DOI : 10.1109/83.403422

P. Salembier and L. Garrido, Connected operators based on region-tree pruning strategies, Proceedings 15th International Conference on Pattern Recognition. ICPR-2000, pp.169-178, 2002.
DOI : 10.1109/ICPR.2000.903561

P. Salembier, A. Oliveras, and L. Garrido, Antiextensive connected operators for image and sequence processing, IEEE Transactions on Image Processing, vol.7, issue.4, pp.555-570, 1998.
DOI : 10.1109/83.663500

P. Soille, Constrained connectivity for hierarchical image partitioning and simplification, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.30, issue.7, pp.1132-1145, 2008.
DOI : 10.1109/TPAMI.2007.70817

. Robert-endre-tarjan, Efficiency of a Good But Not Linear Set Union Algorithm, Journal of the ACM, vol.22, issue.2, pp.215-225, 1975.
DOI : 10.1145/321879.321884

L. Vincent, Morphological Area Openings and Closings for Grey-scale Images, Proc. NATO Shape in Picture Workshop, pp.197-208, 1992.
DOI : 10.1007/978-3-662-03039-4_13

M. Wilkinson and J. Roerdink, Fast morphological attribute operations using tarjan 's union-find algorithm, Mathematical Morphology and its Applications to Image and Signal Processing, pp.311-320, 2000.
DOI : 10.1007/0-306-47025-x_34
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.16.2632

H. F. Michael, H. Wilkinson, W. H. Gao, J. Hesselink, A. Jonker et al., Concurrent computation of attribute filters on shared memory parallel machines, IEEE Trans. Pattern Anal. Mach. Intell, vol.30, issue.10, pp.1800-1813, 2008.