Fast Morphological Attribute Operations Using Tarjan's Union-Find Algorithm

Autor:	Michael Wilkinson, Roerdink, Jbtm, Goutsias, J., Vincent, L., Bloomberg, Ds
Přispěvatelé:	Intelligent Systems, Faculty of Science and Engineering, Scientific Visualization and Computer Graphics
Jazyk:	angličtina
Rok vydání:	1999
Předmět:	Discrete mathematics Computer science IMAGE Attribute Operators Computation Granulometries Binary logarithm Union-find Algorithm Disjoint-set Area Operators Variety (universal algebra) Closing (morphology) Time complexity Image resolution
Zdroj:	Mathematical Morphology and its Applications to Image and Signal Processing, 311-320 STARTPAGE=311;ENDPAGE=320;TITLE=Mathematical Morphology and its Applications to Image and Signal Processing ResearcherID MATHEMATICAL MORPHOLOGY AND ITS APPLICATIONS TO IMAGE AND SIGNAL PROCESSING, 311-320 STARTPAGE=311;ENDPAGE=320;TITLE=MATHEMATICAL MORPHOLOGY AND ITS APPLICATIONS TO IMAGE AND SIGNAL PROCESSING Mathematical Morphology and its Applications to Image and Signal Processing ISBN: 0792378628 ISMM
DOI:	10.1007/0-306-47025-X_34
Popis:	Morphological attribute openings and closings and related operators are generalizations of the area opening and closing, and allow filtering of images based on a wide variety of shape or size based criteria. A fast union-find algorithm for the computation of these operators is presented in this paper. The new algorithm has a worst case time complexity of O(N log N) where N is the image size, as opposed to O (N^2 log N) for the existing algorithm. Memory requirements are O(N) for both algorithms.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9a316426f27322a1eec3da830bd21f95 https://doi.org/10.1007/0-306-47025-X_34 Zobrazit plný text záznamu