J. B. Roerdink and A. Meijster, The watershed transform: Definitions, algorithms and parallelization strategies, Fundamenta Informaticae, pp.41-187, 2001.

T. M. Bernard and A. Manzanera, Improved low complexity fully parallel thinning algorithm, Proceedings 10th International Conference on Image Analysis and Processing, p.215, 1999.
DOI : 10.1109/ICIAP.1999.797597

URL : https://hal.archives-ouvertes.fr/hal-01245400

B. Jang and R. T. Chin, RECONSTRUCTABLE PARALLEL THINNING, International Journal of Pattern Recognition and Artificial Intelligence, vol.07, issue.05, pp.1145-1181, 1993.
DOI : 10.1142/S0218001493000571

U. Eckhardt and G. Maderlechner, Invariant thinning, Edit. Inst. für Angewandte Mathematik, vol.37, 1993.

Z. Guo and R. W. Hall, Fast fully parallel thinning algorithms, CVGIP: Image Understanding, vol.55, issue.3, pp.317-328, 1992.
DOI : 10.1016/1049-9660(92)90029-3

R. W. Hall, Fast parallel thinning algorithms: parallel speed and connectivity preservation, Communications of the ACM, vol.32, issue.1, pp.124-131, 1989.
DOI : 10.1145/63238.63248

M. Couprie, F. N. Bezerra, and G. Bertrand, Topological operators for grayscale image processing, Journal of Electronic Imaging, vol.10, issue.4, pp.1003-1015, 2001.
DOI : 10.1117/1.1408316

URL : https://hal.archives-ouvertes.fr/hal-00622474

A. Meijster, J. B. Roerdink, and W. H. Hesselink, A General Algorithm for Computing Distance Transforms in Linear Time, Mathematical Morphology and its Applications to Image and Signal Processing, pp.331-340, 2000.
DOI : 10.1007/0-306-47025-X_36

N. Carriero and D. Gelernter, How to write parallel programs: a guide to the perplexed, ACM Computing Surveys, vol.21, issue.3, 1988.
DOI : 10.1145/72551.72553

K. M. Chandy, T. , and S. , An Introduction to Parallel Programming, 1992.

J. Darlington and H. W. To, Building Parallel Applications without Programming. Department of Computing, Imperial College. United Kingdom, Abstract Machine Models, 1993.

J. L. Arjona, Architectural Patterns for Parallel Programming, Models for Performance Estimation, 2006.

G. R. Andrews, Concurrent Programming: Principles and Practice, 1991.

I. Foster, Designing and Building Parallel Programs, Concepts and Tools for Parallel Software Engineering, 1994.

D. Culler, J. P. Singh, and A. Gupta, Parallel Computer Architecture. A Hardware/Software Approach, 1997.

E. W. Dijkstra, Co-operating Sequential Processes. F. Genyus. Ed. Programming Languages, Communicating Sequential Processes, 1968.

P. Brinch-hansen, Distributed Processes: A Concurrent Programming Concept, Communications of the ACM, vol.1921, issue.11, 1978.

G. Bertrand, J. C. Everat, C. , and M. , Topological approach to image segmentation, SPIE Vision Geometry V, pp.65-76, 1996.
URL : https://hal.archives-ouvertes.fr/hal-00622005

G. Bertrand, J. C. Everat, C. , and M. , Image segmentation through operators based on topology, Journal of Electronic Imaging, vol.6, issue.4, pp.395-405, 1997.
DOI : 10.1117/12.276856

M. Couprie, B. , and G. , Topology preserving alternating sequential filter for smoothing two-dimensional and three-dimensional objects, Journal of Electronic Imaging, vol.13, issue.4, pp.720-730, 2004.
DOI : 10.1117/1.1789986

URL : https://hal.archives-ouvertes.fr/hal-00692906

G. Bertrand, On Topological Watersheds, Journal of Mathematical Imaging and Vision, vol.34, issue.6, pp.217-230, 2005.
DOI : 10.1007/s10851-005-4891-5

URL : https://hal.archives-ouvertes.fr/hal-00622398

M. H. Wilkinson, H. Gao, W. H. Hesselink, J. Jonker, and A. Meijster, Concurrent Computation of Attribute Filters on Shared Memory Parallel Machines. Pattern Analysis and Machine Intelligence, IEEE Transactions on, pp.1800-1813, 2008.

F. J. Seinstra, D. Koelma, and J. M. Geusebroek, A Software Architecture for User Transparent Parallel Image Processing on MIMD Computers, International Euro-Par conference, pp.653-662, 2001.
DOI : 10.1007/3-540-44681-8_94

T. G. Mattson, B. A. Sanders, B. S. Sgall, J. Teng, and S. , Patterns for parallel programming, Dynamic scheduling on parallel machines. 32nd Annual Symposium on Foundations of Computer Science, pp.111-129, 1991.

L. Wangqing, S. Mingren, and P. Ogunbona, A New Divide and Conquer Algorithm for Graph-based Image and Video Segmentation. Multimedia Signal Processing IEEE 7th processing, pp.1-4, 2005.

J. M. Quinn, Parallel Computing: theory and practice, 1994.

A. J. Steen and J. J. Dongarra, Overview of recent supercomputers, NCF report of Utrecht University, 2005.

B. L. Buzbee, I. Foster, R. Chandra, R. Menon, L. Dagum et al., Applications of MIMD machines Designing and Building Parallel Programs 430 pages Parallel Programming in OpenMP A framework for exploiting task and data parallelism on distributed memory multicomputers. Parallel and Distributed Systems, Computer Physics Communications, pp.1-51098, 1995.

G. M. Amdahl, Validity of the single processor approach to achieving large scale computing capabilities, Proceedings of the April 18-20, 1967, spring joint computer conference on, AFIPS '67 (Spring), pp.483-485, 1967.
DOI : 10.1145/1465482.1465560

J. L. Gustafson, Reevaluating Amdahl's law, Communications of the ACM, vol.31, issue.5, pp.532-533, 1988.
DOI : 10.1145/42411.42415

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.509.6892

U. A. Acar, G. E. Blelloch, and R. D. Blumofe, The data locality of work stealing, Proceedings of the 20th ACM symposium on Parallel algorithms and architectures, pp.1-12, 2000.

S. Natarajan, A. Tilborg, G. M. Koob, J. Leung, and H. Zhao, Imprecise and Approximate Computation Foundations of Real-Time Computing: Scheduling and Resources Management, ) 134 pages. [43] Kolivas, C.: RSDL completely fair starvation free 64 interactive cpu scheduler. lwn.net, 1991.

I. Molnar, Modular Scheduler Core and Completely Fair Scheduler. lwn.net, 2007.

D. James, J. H. Mooney46-]-anderson, S. Ramamurthy, and K. Jeffay, Strategies for Supporting Application Portability Real Time computing with lock-free shared Object, ACM Transaction on Computer System, vol.15, pp.134-165, 1997.

M. Herlihy, Wait-free synchronization, ACM Transactions on Programming Languages and Systems, vol.13, issue.1, pp.124-149, 1991.
DOI : 10.1145/114005.102808

T. E. Anderson, The performance of spin lock alternatives for shared-money multiprocessors, IEEE Transactions on Parallel and Distributed Systems, vol.1, issue.1, pp.6-16, 1990.
DOI : 10.1109/71.80120

G. Kahn, The Semantics of a Simple Language for Parallel Programming, IFIP Congress 74 Proc. North, 1974.

H. Nikolov, M. Thompson, T. Stefanov, A. D. Pimentel, S. Polstra et al., Daedalus, Proceedings of the 45th annual conference on Design automation, DAC '08, pp.574-579, 2008.
DOI : 10.1145/1391469.1391615

L. Giavitto and P. Sansonnet, Ambric's New Parallel Processor. Microprocessor Report. mdronline.com, 1994.

L. Giavitto and P. Sansonnet, data-parallélisme et data-flow, Techniques et Sciences Informatiques, vol.82, issue.12, 1993.

A. Mahiout, J. Giavitto, L. Sansonnet, and P. , Distribution and scheduling data-parallel dataflow programs on massively parallel architectures. Software for Multiprocessors and Supercomputers, Office of Naval Research USA & Russian Basic Research Foundation, 1994.

J. Maxwell, On Hills and Dales, Philosophical Magazine, vol.4, issue.40, pp.421-427, 1870.
DOI : 10.1017/CBO9780511710377.018

S. Beucher and C. Lantuéjoul, Use of watersheds in contour detection. International Workshop on Image Processing Real- Time Edge and Motion Detection Estimation, 1979.

S. Beucher, M. , and F. , The morphological approach to segmentation: the watershed transformation, Mathematical Morphology in Image Processing, pp.433-481, 1993.

J. Serra, M. Straka, A. Cruz, A. Köchl, M. ?rámek et al., Image Analysis and Mathematical Morphology Academic Press. (1982) 610 pages 3D Watershed Transform Combined with a Probabilistic Atlas for Medical Image Segmentation, Journal of Medical Informatics and Technologies, 2003.

R. Audigier, L. , and R. A. , Watershed by image foresting transform, tie-zone, and theoretical relationship with other watershed definitions, Mathematical Morphology and its Applications to Signal and Image Processing, pp.277-288, 2007.

L. Najman, C. , and M. , Watershed Algorithms and Contrast Preservation, Lecture Notes in Computer Science, vol.2886, pp.62-71, 2003.
DOI : 10.1007/978-3-540-39966-7_5

URL : https://hal.archives-ouvertes.fr/hal-00622112

P. Soille, Morphological Image Analysis, 1999.

E. Dougherty and R. Lotufo, Hands-on Morphological Image Processing, 2003.
DOI : 10.1117/3.501104

L. Najman, M. Couprie, B. , and G. , Watersheds, mosaics, and the emergence paradigm, Discrete Applied Mathematics, vol.147, issue.2-3, pp.301-324, 2005.
DOI : 10.1016/j.dam.2004.09.017

URL : https://hal.archives-ouvertes.fr/hal-00622113

L. Vincent and P. Soille, Watersheds in digital spaces: an efficient algorithm based on immersion simulations, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.13, issue.6, pp.583-598, 1991.
DOI : 10.1109/34.87344

P. Shengcai, L. , and G. , A Novel Implementation of Watershed Transform Using Multi-Degree Immersion Simulation, 2005 IEEE Engineering in Medicine and Biology 27th Annual Conference, pp.1754-1757, 2005.
DOI : 10.1109/IEMBS.2005.1616785

F. Meyer, Topographic distance and watershed lines, Signal Processing, vol.38, issue.1, pp.113-125, 1993.
DOI : 10.1016/0165-1684(94)90060-4

L. Najman and M. Schmitt, Watershed of a continuous function, Signal Processing, vol.38, issue.1, pp.68-86, 1993.
DOI : 10.1016/0165-1684(94)90059-0

URL : https://hal.archives-ouvertes.fr/hal-00622129

A. X. Falcão, J. Stolfi, and R. A. Lotufo, The image foresting transform: theory, algorithms, and applications, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.26, issue.1, pp.19-29, 2004.
DOI : 10.1109/TPAMI.2004.1261076

R. A. Lotufo and A. X. Falcão, The Ordered Queue and the Optimality of the Watershed Approaches, Procs. 5th International Symposium on Mathematical Morphology, pp.341-350, 2000.
DOI : 10.1007/0-306-47025-X_37

E. W. Dijkstra, A note on two problems in connexion with graphs, Numerische Mathematik, vol.4, issue.1, pp.269-271, 1959.
DOI : 10.1007/BF01386390

U. Pape, Implementation and efficiency of Moore-algorithms for the shortest route problem, Mathematical Programming, vol.8, issue.1, pp.212-222, 1974.
DOI : 10.1007/BF01585517

R. B. Dial, F. Glover, D. Karney, and D. Klingman, A computational analysis of alternative algorithms and labeling techniques for finding shortest path trees, Networks, vol.19, issue.3, pp.215-248, 1979.
DOI : 10.1002/net.3230090304

R. A. Lotufo, A. X. Falcão, and F. A. Zampirolli, IFT-Watershed from gray-scale marker, Proceedings. XV Brazilian Symposium on Computer Graphics and Image Processing, 2002.
DOI : 10.1109/SIBGRA.2002.1167137

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.59.2667

M. Couprie, B. , and G. , Topological grayscale watersheds transform, SPIE Vision Geometry V Proceedings, pp.136-146, 1997.

M. Couprie, L. Najman, B. , and G. , 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

Y. C. Lin, Y. P. Tsai, Y. P. Hung, and Z. C. Shih, Comparison Between Immersion-Based and Toboggan-Based Watershed Image Segmentation, 15th IEEE Transactions on Image Processing, pp.632-640, 2006.

E. N. Mortensen and W. A. Barrett, Toboggan-based intelligent scissors with a four-parameter edge model, Proceedings. 1999 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (Cat. No PR00149), pp.452-458, 1999.
DOI : 10.1109/CVPR.1999.784720

. F. Meyer, Minimum Spanning Forests for Morphological Segmentation, Proc. 2nd International Conference on Math. Morphology. and Its Applications to Image Processing, pp.77-84, 1994.
DOI : 10.1007/978-94-011-1040-2_11

H. T. Kumm, L. , and R. M. , Parallel Computing Efficiency: Climbing the Learning Curve. 10's Ninth Annual International Conference, Theme: Frontiers of Computer Technology, pp.728-732, 1994.

J. Fruehe, Planning Considerations for Multicore Processor Technology, 2005.

E. Khalimsky, Topological graph theory foundations of design and control in multidimensional discrete systems, Proceedings of IEEE International Conference on Systems, Man and Cybernetics, pp.1628-1933, 1994.
DOI : 10.1109/ICSMC.1994.400080

E. Khalimsky, Topological structures in computer science, Journal of Applied Mathematics and Simulation, vol.1, issue.1, pp.25-40, 1987.
DOI : 10.1155/S1048953388000036

A. K. Jain, Fundamentals of Digital Image Processing, 1988.

C. Arcelli, L. P. Cordella, L. , and S. , Parallel thinning of binary pictures, Electronic Letters, pp.148-149, 1975.
DOI : 10.1049/el:19750113

T. M. Bernard and A. Manzanera, Improved low complexity fully parallel thinning algorithm, Proceedings 10th International Conference on Image Analysis and Processing, 1999.
DOI : 10.1109/ICIAP.1999.797597

URL : https://hal.archives-ouvertes.fr/hal-01245400

R. T. Chin, H. K. Wan, D. L. Stover, and R. D. Iverson, A one-pass thinning algorithm and its parallel implementation, Computer Vision, Graphics, and Image Processing, vol.40, issue.1, pp.30-40, 1987.
DOI : 10.1016/0734-189X(87)90054-5

R. W. Hall, Fast parallel thinning algorithms: parallel speed and connectivity preservation, Communications of the ACM, vol.32, issue.1, pp.124-131, 1989.
DOI : 10.1145/63238.63248

M. Couprie, Note on fifteen 2d parallel thinning algorithms, UMLV Internal Report, IGM, 2005.

T. Pavlidis, An asynchronous thinning algorithm, Computer Graphics and Image Processing, vol.20, issue.2, pp.133-157, 1966.
DOI : 10.1016/0146-664X(82)90041-7

C. M. Holt, A. Stewart, M. Clint, and R. H. Perrott, An improved parallel thinning algorithm, Communications of the ACM, vol.30, issue.2, pp.156-160, 1987.
DOI : 10.1145/12527.12531

Y. Y. Zhang, W. , and P. S. , A modified parallel thinning algorithm, [1988 Proceedings] 9th International Conference on Pattern Recognition, pp.1023-1025, 1988.
DOI : 10.1109/ICPR.1988.28429

R. Y. Wu and W. H. Tsai, A new one-pass parallel thinning algorithm for binary images, Pattern Recognition Letters, vol.13, issue.10, pp.715-723, 1992.
DOI : 10.1016/0167-8655(92)90101-5

Z. Guo and R. W. Hall, Fast fully parallel thinning algorithms, CVGIP: Image Understanding, vol.55, issue.3, pp.317-328, 1992.
DOI : 10.1016/1049-9660(92)90029-3

B. K. Jang, C. , and R. T. , One-pass parallel thinning: Analysis, properties, and quantitative evaluation. Pattern Analysis and Machine Intelligence, IEEE Transactions on, pp.1129-1140, 1992.
DOI : 10.1109/34.166630

B. Jang, C. , and R. T. , RECONSTRUCTABLE PARALLEL THINNING, International Journal of Pattern Recognition and Artificial Intelligence, vol.07, issue.05, pp.1145-1181, 1993.
DOI : 10.1142/S0218001493000571

U. Eckhardt and M. G. , INVARIANT THINNING, International Journal of Pattern Recognition and Artificial Intelligence, vol.07, issue.05, pp.1115-1144, 1993.
DOI : 10.1142/S021800149300056X

S. S. Choy, C. S. Choy, and W. C. Siu, New Single-Pass Algorithm for Parallel Thinning, Computer Vision and Image Understanding, vol.62, issue.1, pp.69-77, 1995.
DOI : 10.1006/cviu.1995.1042

B. K. Jang, C. , and R. T. , One-pass parallel thinning: Analysis, properties and quantitative evaluation. Pattern Analysis and Machine Intelligence, IEEE Transactions on, vol.14, issue.11, pp.1129-1140, 1992.

G. Taubin, Curve and surface smoothing without shrinkage, Proceedings of IEEE International Conference on Computer Vision, pp.852-857, 1999.
DOI : 10.1109/ICCV.1995.466848

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.85.6829

X. Liu, H. Bao, H. Shum, and Q. Peng, A Novel Volume Constrained Smoothing Method for Meshes, Graphical Models, vol.64, issue.3-4, pp.169-182, 2002.
DOI : 10.1006/gmod.2002.0576

A. Asano, T. Yamashita, and S. Yokozeki, Active contour model based on mathematical morphology, Proceedings. Fourteenth International Conference on Pattern Recognition (Cat. No.98EX170), pp.1455-1457, 1998.
DOI : 10.1109/ICPR.1998.711978

F. Leymarie and M. D. Levine, Curvature morphology, Proceedings of Vision Interface, pp.102-109, 1989.

Y. Kong, T. Rosenfeld, and A. , Digital topology: Introduction and survey, Computer Vision, Graphics, and Image Processing, vol.48, issue.3, pp.357-393, 1989.
DOI : 10.1016/0734-189X(89)90147-3

S. R. Sternberg, Grayscale morphology, Computer Vision, Graphics, and Image Processing, vol.35, issue.3, pp.333-355, 1986.
DOI : 10.1016/0734-189X(86)90004-6

G. Bertrand, Simple points, topological numbers and geodesic neighborhoods in cubic grids, Pattern Recognition Letters, vol.15, issue.10, pp.1003-1011, 1994.
DOI : 10.1016/0167-8655(94)90032-9

URL : https://hal.archives-ouvertes.fr/hal-00621999

P. E. Danielsson, Euclidean distance mapping, Computer Graphics and Image Processing, vol.14, issue.3, pp.227-248, 1980.
DOI : 10.1016/0146-664X(80)90054-4

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.322.7605

D. Lemire, Streaming Maximum-Minimum Filter Using No More than Three Comparisons per Element, Nordic Journal of Computing, vol.13, issue.4, pp.328-339, 2006.

F. Y. Shih and Y. Wu, Fast Euclidean distance transformation in two scans using a 3x3 neighborhood, Computer Vision and Image Understanding, issue.94, pp.195-205, 2004.

O. Cuisenaire and B. Macq, Fast Euclidean Distance Transformation by Propagation Using Multiple Neighborhoods, Computer Vision and Image Understanding, vol.76, issue.2, pp.163-172, 1999.
DOI : 10.1006/cviu.1999.0783

O. Cuisenaire and B. Macq, Fast and exact signed Euclidean distance transformation with linear complexity, 1999 IEEE International Conference on Acoustics, Speech, and Signal Processing. Proceedings. ICASSP99 (Cat. No.99CH36258), pp.3293-3296, 1999.
DOI : 10.1109/ICASSP.1999.757545

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.87.7688

R. Fabbri, L. F. Costa, J. C. Torelli, and O. M. Bruno, 2D Euclidean distance transform algorithms, ACM Computing Surveys, vol.40, issue.1, p.2, 2008.
DOI : 10.1145/1322432.1322434

J. Cousty, L. Najman, M. Couprie, S. Clément-guinaudeau, T. Goissen et al., Automated, Accurate and Fast Segmentation of 4D Cardiac MR Images, Procs. of Functional Imaging an Modeling of the Heart, pp.474-483, 2007.
DOI : 10.1007/978-3-540-72907-5_48

URL : https://hal.archives-ouvertes.fr/hal-00622242