Watersheds in Digital Spaces: An Efficient Algorithm Based on Immersion Simulations

IEEE Transactions on Pattern Analysis and Machine Intelligence

Volumn 13, Issue 6, 1991, Pages 583-598

  Vincent, Luc ^a,b   Soille, Pierre ^b  

^a HARVARD UNIVERSITY   (United States)

^b PSL RESEARCH UNIVERSITY   (France)

Author keywords

Algorithm; digital image; FIFO structure; graph; grid; mathematical morphology; picture segmentation; watersheds

Indexed keywords

COMPUTER PROGRAMMING - ALGORITHMS; MAGNETIC RESONANCE IMAGING - MEDICAL APPLICATIONS; MAPS AND MAPPING;

ELEVATION MODELS; IMAGE SEGMENTATION; WATERSHED ALGORITHM;

IMAGE PROCESSING;

EID: 0026172104     PISSN: 01628828     EISSN: None     Source Type: Journal    
DOI: 10.1109/34.87344     Document Type: Article

References (52)

1. L. E. Band, “Topographic partition of watersheds with digital elevation models,” Water Resources Res., vol. 22, no. 1, pp. 15–24, 1986.
2. M. Benali, “Du choix des mesures dans les procedures de reconnaissances des formes et d’analyse de texture,” Ph.D. dissertation, School of Mines, Paris, 1986.
3. S. Beucher and C. Lantuejoul, “Use of watersheds in contour detection,” in Proc. Int. Workshop Image Processing, RealTime Edge and Motion Detection!Estimation, Rennes, France, Sept. 17–21, 1979.
4. S. Beucher, “Watersheds of functions and picture segmentation,” in Proc. IEEE Int. Conf. Acoustics, Speech, and Signal Processing, Paris, France, May 1982, pp. 1928–1931.
5. S. Beucher, “Obstacle detection and vehicle trajectories,” Prometheus Image Processing Meeting, Paris, France, May 18, 1989.
6. S. Beucher, “Segmentation d’images et morphologie mathematique,” Ph.D. dissertation, School of Mines, Paris, France, June 1990.
7. G. Borgefors, “Distance transformations in digital images,” Comput. Vision, Graphics, Image Processing, vol. 34, pp. 334–371, 1986.
8. J. Canny, “A computational approach to edge detection,” IEEE Trans. Pattern Anal. Machine Intel!, vol. PAMI-8, no. 6, pp. 679–698, Nov. 1986.
9. S. H. Collins, “Terrain parameters directly from a digital terrain model,” Canadian Surveyor, vol. 29, no. 5, pp. 507–518, 1975.
10. P.E. Danielsson, “Euclidean distance mapping,” Comput. Graphics Image Processing, vol. 14, pp. 227–248, 1980.
11. H. Digabel and C. Lantuejoul, “Iterative algorithms,” in Proc. 2nd European Symp. Quantitative Analysis of Microstructures in Material Science, Biology and Medicine, Caen, France, Oct. 1977, J. L. Chermant, Ed. Stuttgart, West Germany: Riederer Verlag, 1978, pp. 85–99.
12. D. Douglas, “Experiments to locate ridges and channels to create a new type of digital elevation model,” Cartographica, vol. 23, no. 4, pp. 29–61, 1986.
13. F. Doyle, “Digital terrain models: An overview,” Photogram. Eng. Remote Sensing, vol. 44, no. 12, pp. 1481–1485, Dec. 1978.
14. F. Friedlander, “A sequential algorithm for detecting watersheds on a gray level image,” Acta Stereologica, vol. 6/III (Proc 7th Int. Cong. For Stereology), Caen, France, pp. 663–668, Sept. 1987.
15. A. Gagalowicz, “A new approach for image segmentation,” in Proc. 8th Int. Conf. Pattern Recognition, Paris, France, Oct. 1986.
16. M. Golay, “Hexagonal pattern transforms,” in Proc. IEEE Trans. Corn-put., vol. C-18, no. 8, Aug. 1969.
17. M. Grimaud, “Intervertebral disk segmentation,” School of Mines, Paris, France, Internal Rep. CMM, Jan. 1990.
18. R. Haralick and L. Shapiro, “Survey: Image segmentation techniques,” Comput. Vision, Graphics, Image Processing, vol. 29, pp. 100–132, 1985.
19. F. Harary, Graph Theory. Reading, MA: Addision-Wesley, 1969.
20. H.J.A.M. Heijmans and A. Toet, Morphological Sampling, Center Math. Comput. Sci., Amsterdam, The Netherlands, Internal Rep. AM-R8913, Aug. 1989.
21. J. L. Horowitz and T. Pavlidis, “Picture segmentation by a directed split and merge procedure,” in Proc 2nd Int. Conf. Pattern Recognition, 1974, pp. 424–433.
22. E. J. Isaac and R. C. Singleton, “Sorting by address calculation,” J. ACM, vol. 3, pp. 169–174, 1956.
23. C. Lantuejoul, “Skeletonization in quantitative metallography,” in Issues of Digital Image Processing, R. M. Haralick and J. C. Simon, Eds. Groningen, The Netherlands: Sijthoff and Noordhoff, 1980.
24. C. Lantuejoul and F. Maisonneuve, “Geodesic methods in quantitative image analysis,” Pattern Recognition, vol. 17, 177–187, 1984.
25. B. Lay, “Recursive algorithms in mathematical morphology,” Acta Stereologica, vol. 6/III (Proc. 7th Int. Cong, for Stereology), Caen, France, pp. 691–696, Sept. 1987.
26. H. Lorin, Sorting and Sort Systems (The System Programming Series). Reading, MA: Addison-Wesley, 1975.
27. F. Maisonneuve, “Sur le partage des eaux,” School of Mines, Paris, France, Internal Rep. CMM, 1982.
28. D. Marks, J. Dozier, and J. Frew, “Automated basin delineation from digital elevation data,” Geoprocessing, vol. 2, pp. 299–311, 1984.
29. D. Marr, Vision. New York: Freeman, 1982.
30. M. Matheron, Random Sets and Integral Geometry. New York: Wiley, 1975.
31. F. Meyer, “Cytologie quantitative et morphologie mathematique,” Ph.D. dissertation, School of Mines, Paris, France, 1979.
32. F. Meyer, “Skeletons and perceptual graphs,” Signal Processing, vol. 16, no. 4, pp. 335–363, Apr. 1989.
33. H. Minkowski, “Allgemein lehrsatze iiber konvexe polyeder,” Nach. Ges. Wiss. Gottingen, pp. 198–219, 1897.
34. O. Monga, “An optimal region growing algorithm for image segmentation,” Int. J. Pattern Recog. Artificial Intell., vol. 3, no. 4, Dec. 1987.
35. J. Piper and E. Granum, “Computing distance transformations in convex and non-convex domains,” Pattern Recog., vol. 20, pp. 599–615, 1987.
36. T. K. Puecker and D. H. Douglas, “Detection of surface-specific points by local parallel processing of discrete terrain elevation data,” Comput. Vision, Graphics, Image Processing, vol. 4, pp. 375–387, 1975.
37. I. Ragnemalm, “Contour processing distance transforms,” in Progress in Image Analysis and Processing, Cantoni et al., Eds. Cleveland, OH: World Scientific, 1990, pp. 204–212.
38. A. Rosenfeld and J. L. Pfaltz, “Sequential operations in digital picture processing,” J. ACM, vol. 13, no. 4, pp. 471–494, 1966.
39. M. Schmitt, “Des algorithmes morphologiques a 1’intelligence artificielle,” Ph.D. dissertation, School of Mines, Paris, France, Feb. 1989.
40. J. Serra, Image Analysis and Mathematical Morphology. London: Academic, 1982.
41. J. Serra, Ed., Image Analysis and Mathematical Morphology, Part II: Theoretical Advances. London: Academic 1988.
42. J. Serra and L. Vincent, Lecture Notes on Morphological Filtering, School of Mines, Cahiers du Centre de Morphologie Mathematique, Paris, France, vol. 8, 98 pp., 1989.
43. P. Soille and M. Ansoult, “Automated basin delineation from DEMs using mathematical morphology,” Signal Processing, vol. 20, pp. 171–182, 1990.
44. P. Soille, “Inversion d’ images multispectrales par la morphologie mathematique,” School of Mines, Paris, France, Internal Rep. CMM, Jan. 1990.
45. S.R. Sternberg, “Grayscale morphology,” Comput. Vision, Graphics, Image Processing, vol. 35, pp. 333–355, 1986.
46. B. J. H. Verwer, P. W. Verbeek and S.T. Dekker, “An efficient uniform cost algorithm applied to distance transforms,” IEEE Trans. Pattern Anal. Machine Intell., vol. 11, pp. 425–429, 1989.
47. L. Vincent, “Graphs and mathematical morphology,” Signal Processing, vol. 16, no. 4, pp. 365–388, Apr. 1989.
48. L. Vincent, “Mathematical morphology for graphs applied to image description and segmentation,” in Proc. Electronic Imaging West, Pasedena, CA, Apr. 1989, pp. 313–318.
49. L. Vincent and S. Beucher, “The morphological approach to Segmentation: An introduction,” School of Mines, Paris, France, Internal Rep. CMM, July 1989.
50. L. Vincent, “Algorithmes morphologiques a base de files d’attente et de lacets. Extension aux graphes,” Ph.D. dissertation, School of Mines, Paris, France, May 1990.
51. L. Vincent, “Morphological transformations of binary images with arbitrary structuring elements,” Signal Processing, vol. 22, no. 1, Jan. 1991.
52. L.J. Van Vliet and B.J.H. Verwer, “A contour processing method for fast binary neighborhood operations,” Pattern Recog. Lett, vol. 7, pp. 27–36, Jan. 1988.