2013 | OriginalPaper | Buchkapitel
Faster Fuzzy Connectedness via Precomputation
verfasst von : Filip Malmberg, Robin Strand
Erschienen in: Mathematical Morphology and Its Applications to Signal and Image Processing
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
We propose a method for accelerating the computation of fuzzy connectedness. The method is based on a precomputation step – the construction of a
supervertex
graph whose vertices are clusters of image elements. By constructing this supervertex graph in a specific way, we can perform the bulk of the fuzzy connectedness computations on this graph, rather than on the original image, while guaranteeing exact results. Typically, the number of nodes in the supervertex graph is much smaller than the number of elements in the image, and thus less computation is required. In an experiment, we demonstrate the ability of the proposed method to accelerate the computation of fuzzy connectedness considerably.