Showing papers by "Fernand Meyer published in 1994"
TL;DR: The classical shortest paths algorithms of the graph theory are revisited in order to derive new watershed algorithms, which are either new or more easy to implement in hardware.
1,355 citations
01 Jan 1994
TL;DR: This work shows that the watershed of a gradient image from a set of markers can be obtained from the neighbourhood graph of the initial image, and the result of the segmentation is then a minimum spanning forest of the neighbourhoodgraph.
Abstract: Image segmentation in mathematical morphology is essentially based on one method: the watershed of a gradient image from a set of markers. We show that this watershed can be obtained from the neighbourhood graph of the initial image. The result of the segmentation is then a minimum spanning forest of the neighbourhood graph. Powerful interactive and very fast segmentation methods are derived
87 citations
01 Jan 1994
TL;DR: This paper presents a method to segment image sequences, first step of an object-oriented compression system, based on Mathematical Morphology, which is a well suited technique for segmentation purposes.
Abstract: In image compression, object-based approaches are adapted to high compression rates, since they take into account the geometry of the objects and the human eye characteristics. Mathematical Morphology, dealing with geometrical features is a well suited technique for segmentation purposes. This paper presents a method to segment image sequences, first step of an object-oriented compression system, based on Mathematical Morphology.
24 citations
01 Jan 1994
TL;DR: LTS1 Reference LTS-CONF-1994-048 Record created on 2006-06-14, modified on 2016-08-08.
Abstract: Keywords: LTS1 Reference LTS-CONF-1994-048 Record created on 2006-06-14, modified on 2016-08-08
7 citations
01 Jan 1994
TL;DR: A new method to encode and reconstruct the contours of a segmented image is described, based on the morphological skeleton which is extended using geodesic distance functions, and fast algorithms for skeleton reconstruction based on hierarchical queues will be presented.
Abstract: A new method to encode and reconstruct the contours of a segmented image is described in this paper. Encoding is based on the morphological skeleton which is extended using geodesic distance functions. This allows us to fully take into account already coded labels and hence known contours and to avoid coding a contour twice. Moreover, fast algorithms for skeleton reconstruction based on hierarchical queues will be presented.
5 citations