Abstract :
[en] Several efficient algorithms for computing erosions and openings have been proposed recently.
They improve on VAN HERK's algorithm in terms of number of comparisons for large structuring
elements. In this paper we introduce a theoretical framework of anchors that aims at a better
understanding of the process involved in the computation of erosions and openings. It is shown
that the knowledge of opening anchors of a signal f is sufficient to perform both the erosion and
the opening of f.
Then we propose an algorithm for one-dimensional erosions and openings which exploits
opening anchors. This algorithm improves on the fastest algorithms available in literature by
approximately 30% in terms of computation speed, for a range of structuring element sizes and
image contents
Scopus citations®
without self-citations
49