Connected operators are morphological tools that have the property of filtering images
without creating new contours and without moving the contours that are preserved. Those …

In this paper a new algorithm to compute the component tree is presented. As compared to
the state-of-the-art, this algorithm does not use excessive memory and is able to work …

The level sets of a map are the sets of points with level above a given threshold. The
connected components of the level sets, thanks to the inclusion relation, can be organized in …

Abstract The Image Foresting Transform (IFT) is a tool for the design of image processing
operators based on connectivity, which reduces image processing problems into an …

This paper discusses the interest of binary partition trees as a region-oriented image
representation. Binary partition trees concentrate in a compact and structured representation …

This paper deals with a class of morphological operators called connected operators. These
operators filter the signal by merging its flat zones. As a result, they do not create any new …

The aim of this paper is to present a new algorithm to calculate the confinement tree of an
image-also known as component tree or dendrone-for which we can prove that its worst …

The implementation of morphological connected set operators for image filtering and pattern
recognition is discussed. Two earlier algorithms based on priority queues and hierarchical …

Connected filters are well-known for their good contour preservation property. A popular
implementation strategy relies on tree-based image representations: for example, one can …

We introduce an optimal topdown algorithm for computing and representing level line trees
of 2-D intensity images. The running time of the algorithm is \rmO(n+t), where n is the size of …