{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,22]],"date-time":"2025-10-22T17:39:30Z","timestamp":1761154770420},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"2-3","license":[{"start":{"date-parts":[[2005,5,1]],"date-time":"2005-05-01T00:00:00Z","timestamp":1114905600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Math Imaging Vis"],"published-print":{"date-parts":[[2005,5]]},"DOI":"10.1007\/s10851-005-4892-4","type":"journal-article","created":{"date-parts":[[2005,4,14]],"date-time":"2005-04-14T13:05:43Z","timestamp":1113483943000},"page":"231-249","source":"Crossref","is-referenced-by-count":66,"title":["Quasi-Linear Algorithms for the Topological Watershed"],"prefix":"10.1007","volume":"22","author":[{"given":"Michel","family":"Couprie","sequence":"first","affiliation":[]},{"given":"Laurent","family":"Najman","sequence":"additional","affiliation":[]},{"given":"Gilles","family":"Bertrand","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2\/3","key":"CR1","first-page":"??","volume":"22","author":"G. Bertrand","year":"2005","unstructured":"G. Bertrand, ?On topological watersheds?Journal of Mathematical Imaging and Vision, Vol. 22, Nos. 2\/3, pp. ?????, 2005.","journal-title":"Journal of Mathematical Imaging and Vision"},{"issue":"4","key":"CR2","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1117\/12.276856","volume":"6","author":"G. Bertrand","year":"1997","unstructured":"G. Bertrand, J.C. Everat, and M. Couprie, ?Image segmentation through operators based upon topology?Journal of Electronic Imaging, Vol. 6, No. 4, pp. 395-405, 1997.","journal-title":"Journal of Electronic Imaging"},{"key":"CR3","unstructured":"S. Beucher and Ch. Lantu\u00e9joul, ?Use of watersheds in contour detection? inProc. Int. Workshop on Image Processing, Real-Time Edge and Motion Detection\/Estimation, Rennes, France, 1979."},{"key":"CR4","doi-asserted-by":"crossref","unstructured":"S. Beucher and F. Meyer, ?The morphological approach to segmentation: The watershed transformation? inMathematical Morphology in Image Processing, Dougherty (Ed.), Chap. 12, Marcel Dekker, 1993, pp. 433?481.","DOI":"10.1201\/9781482277234-12"},{"key":"CR5","unstructured":"M.A. Bender and M. Farach-Colton, ?The LCA problem revisited? inProc. 4th Latin American Symposium on Theoretical Informatics, LNCS, Springer, Vol. 1776, 2000, pp. 88?94."},{"key":"CR6","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1023\/A:1024476403183","volume":"19","author":"U.M. Braga-Neto","year":"2003","unstructured":"U.M. Braga-Neto and J. Goutsias, ?A theoretical tour of connectivity in image processing and analysis?Journal of Mathematical Imaging and Vision, Vol. 19, pp. 5?31, 2003.","journal-title":"Journal of Mathematical Imaging and Vision"},{"issue":"3","key":"CR7","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1006\/cviu.1996.0066","volume":"64","author":"E.J. Breen","year":"1996","unstructured":"E.J. Breen and R. Jones, ?Attribute openings, thinnings and granulometries?Computer Vision and Image Understanding, Vol. 64, No. 3, pp. 377?389, 1996.","journal-title":"Computer Vision and Image Understanding"},{"key":"CR8","unstructured":"T. H. Cormen, C. Leiserson, and R. Rivest,Introduction to Algorithms, McGraw-Hill, 1990."},{"key":"CR9","doi-asserted-by":"crossref","first-page":"136","DOI":"10.1117\/12.292778","volume":"3168","author":"M. Couprie","year":"1997","unstructured":"M. Couprie and G. Bertrand, ?Topological grayscale watershed transformation? inProc. SPIE Vision Geometry VI, Vol. 3168, 1997, pp. 136?146.","journal-title":"Proc. SPIE Vision Geometry VI"},{"issue":"4","key":"CR10","doi-asserted-by":"crossref","first-page":"1003","DOI":"10.1117\/1.1408316","volume":"10","author":"M. Couprie","year":"2001","unstructured":"M. Couprie, F.N. Bezerra, and G. Bertrand, ?Topological operators for grayscale image processing?Journal of Electronic Imaging, Vol. 10, No. 4, pp. 1003?1015, 2001.","journal-title":"Journal of Electronic Imaging"},{"issue":"12","key":"CR11","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1016\/0031-3203(80)90049-7","volume":"12","author":"V. Goetcherian","year":"1980","unstructured":"V. Goetcherian, ?From binary to grey tone image processing using fuzzy logic concepts?Pattern Recognition, Vol. 12, No. 12, pp. 7?15, 1980.","journal-title":"Pattern Recognition"},{"key":"CR12","unstructured":"P. Guillataud, ?Contribution \u00e1 l?analyse dendroniques des images? PhD thesis of Universit\u00e9 de Bordeaux I, 1992."},{"key":"CR13","unstructured":"P. Hanusse and P. Guillataud, ?S\u00e9mantique des images par analyse dendronique? in8th Conf. Reconnaissance des Formes et Intelligence Artificielle, AFCET Ed., Lyon, Vol. 2, 1992, pp. 577?588."},{"key":"CR14","doi-asserted-by":"crossref","unstructured":"J.A. Hartigan, ?Statistical theory in clustering?Journal of classification, No. 2, pp. 63?76, 1985.","DOI":"10.1007\/BF01908064"},{"issue":"2","key":"CR15","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1137\/0213024","volume":"13","author":"D. Harel","year":"1984","unstructured":"D. Harel and R.E. Tarjan, ?Fast algorithms for finding nearest common ancestors?SIAM J. Comput., Vol. 13, No. 2, pp. 338?355, 1984.","journal-title":"SIAM J. Comput."},{"issue":"3","key":"CR16","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1006\/cviu.1999.0777","volume":"75","author":"R. Jones","year":"1999","unstructured":"R. Jones, ?Connected filtering and segmentation using component trees?Computer Vision and Image Understanding, Vol. 75, No. 3, pp. 215?228, 1999.","journal-title":"Computer Vision and Image Understanding"},{"key":"CR17","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1016\/0734-189X(89)90147-3","volume":"48","author":"T.Y. Kong","year":"1989","unstructured":"T.Y Kong and A. Rosenfeld, ?Digital topology: Introduction and survey?Computer Vision, Graphics and Image Processing, Vol. 48, pp. 357?393, 1989.","journal-title":"Computer Vision, Graphics and Image Processing"},{"key":"CR18","unstructured":"J. Mattes and J. Demongeot, ?Tree representation and implicit tree matching for a coarse to fine image matching algorithm? inProc. MICCAI, LNCS, Springer, Vol. 1679, 1999, pp. 646?655."},{"key":"CR19","unstructured":"J. Mattes and J. Demongeot, ?Efficient algorithms to implement the confinement tree? inProc. DGCI, LNCS, Springer, Vol. 1953, 2000, pp. 392?405."},{"key":"CR20","unstructured":"J. Mattes, M. Richard, and J. Demongeot, ?Tree representation for image matching and object recognition? inProc. DGCI, LNCS, Springer, Vol. 1568, 1999, pp. 298?309."},{"key":"CR21","doi-asserted-by":"crossref","first-page":"484","DOI":"10.1109\/34.993556","volume":"24","author":"A. Meijster","year":"2002","unstructured":"A. Meijster and M. Wilkinson, ?A comparison of algorithms for connected set openings and closings?IEEE PAMI, Vol. 24, pp. 484?494, 2002.","journal-title":"IEEE PAMI"},{"key":"CR22","unstructured":"F. Meyer, ?Un algorithme optimal de ligne de partage des eaux? inProc. 8th Conf. Reconnaissance des Formes et Intelligence Artificielle, AFCET Ed., Lyon, Vol. 2, 1991, pp. 847?859."},{"key":"CR23","unstructured":"L. Najman and M. Couprie, ?Watershed algorithms and contrast preservation? inProc. DGCI, LNCS, Springer, Vol. 2886, 2003, pp. 62?71."},{"key":"CR24","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1117\/12.526592","volume":"5300","author":"L. Najman","year":"2004","unstructured":"L. Najman and M. Couprie, ?Quasi-linear algorithm for the component tree? inProc. SPIE Vision Geometry XII, Vol. 5300, 2004, pp. 98?107.","journal-title":"Proc. SPIE Vision Geometry XII"},{"key":"CR25","doi-asserted-by":"crossref","unstructured":"L. Najman, M. Couprie, and G. Bertrand, ?Watersheds, mosaics, and the emergence paradigm? to appear inDiscrete Applied Mathematics, 2005.","DOI":"10.1016\/j.dam.2004.09.017"},{"key":"CR26","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/0165-1684(94)90059-0","volume":"38","author":"L. Najman","year":"1994","unstructured":"L. Najman and M. Schmitt, ?Watershed of a continuous function?Signal Processing, Vol. 38, pp. 99?112, 1994.","journal-title":"Signal Processing"},{"key":"CR27","doi-asserted-by":"crossref","first-page":"187","DOI":"10.3233\/FI-2000-411207","volume":"41","author":"J.B.T.M. Roerdink","year":"2000","unstructured":"J.B.T.M. Roerdink and A. Meijster, ?The watershed transform: Definitions, algorithms and parallelization strategies?Fundamenta Informaticae, Vol. 41, pp. 187?228, 2000.","journal-title":"Fundamenta Informaticae"},{"key":"CR28","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0031-3203(83)90007-9","volume":"16","author":"A. Rosenfeld","year":"1983","unstructured":"A. Rosenfeld, ?On connectivity properties of grayscale pictures?Pattern Recognition, Vol. 16, pp. 47?50, 1983.","journal-title":"Pattern Recognition"},{"key":"CR29","unstructured":"J. Serra,Image Analysis and Mathematical Morphology, Vol. II:Theoretical Advances, Academic Press, 1988."},{"issue":"4","key":"CR30","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1109\/83.663500","volume":"7","author":"P. Salembier","year":"1998","unstructured":"P. Salembier, A. Oliveras, and L. Garrido, ?Antiextensive connected operators for image and sequence processing?IEEE Trans. on Image Processing, Vol. 7, No. 4, pp. 555?570, 1998.","journal-title":"IEEE Trans. on Image Processing"},{"key":"CR31","unstructured":"R.E. Tarjan, ?Disjoint sets?Data Structures and Network Algorithms, Chap. 2, SIAM, 1978, pp. 23?31."},{"key":"CR32","unstructured":"M. Thorup, ?On RAM priority queues? in7th ACM-SIAM Symposium on Discrete Algorithms, 1996, pp. 59?67."},{"key":"CR33","unstructured":"C. Vachier, ?Extraction de caract\u00e9ristiques, segmentation d?images et Morphologie Math\u00e9matique? PhD Thesis, \u00c9cole des Mines, Paris, 1995."},{"issue":"6","key":"CR34","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1109\/34.87344","volume":"13","author":"L. Vincent","year":"1991","unstructured":"L. Vincent and P. Soille, ?Watersheds in digital spaces: An efficient algorithm based on immersion simulations?IEEE Trans. on Pattern Analysis and Machine Intelligence, Vol. 13, No. 6, pp. 583?598, 1991.","journal-title":"IEEE Trans. on Pattern Analysis and Machine Intelligence"},{"key":"CR35","unstructured":"D. Wishart, ?Mode analysis: A generalization of the nearest neighbor which reduces chaining effects? inNumerical Taxonomy, A.J. Cole (Ed.), Academic Press, 1969, pp. 282?319."}],"container-title":["Journal of Mathematical Imaging and Vision"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10851-005-4892-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10851-005-4892-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10851-005-4892-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,6]],"date-time":"2020-04-06T21:40:07Z","timestamp":1586209207000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10851-005-4892-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,5]]},"references-count":35,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2005,5]]}},"alternative-id":["4892"],"URL":"https:\/\/doi.org\/10.1007\/s10851-005-4892-4","relation":{},"ISSN":["0924-9907","1573-7683"],"issn-type":[{"value":"0924-9907","type":"print"},{"value":"1573-7683","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,5]]}}}