References of "Talbot, Hugues"
     in
Bookmark and Share    
Full Text
See detailAlgorithms for mathematical morphology
Géraud, Thierry; Talbot, Hugues; Van Droogenbroeck, Marc ULg

in Najman, Laurent; Talbot, Hugues (Eds.) Mathematical morphology: from theory to applications (2010)

Detailed reference viewed: 52 (8 ULg)
Full Text
See detailMorphologie et Algorithmes
Géraud, Thierry; Talbot, Hugues; Van Droogenbroeck, Marc ULg

in Morphologie mathématique 2: estimation, choix et mise en oeuvre (2010)

Ce chapitre aborde le problème important de la mise en oeuvre des opérateurs, filtres et méthodologies d'analyse d'images.

Detailed reference viewed: 26 (1 ULg)
Full Text
See detailSegmentation by adaptive prediction and region merging
Van Droogenbroeck, Marc ULg; Talbot, Hugues

in Digital Image Computing Techniques and Applications, Volume II (2003, December)

This paper presents a segmentation technique based on prediction and adaptive region merging. While many techniques for segmentation exist, few of them are suited for the segmentation of natural images ... [more ▼]

This paper presents a segmentation technique based on prediction and adaptive region merging. While many techniques for segmentation exist, few of them are suited for the segmentation of natural images containing regular textures defined on non-rectangular segments. In this paper, we propose a description of regions based on a deconvolution algorithm whose purpose is to remove the influence of the shape on region contents. The decoupling of shape and texture information is achieved either by adapting waveforms to the segment shape, which is a time-consuming task that needs to be repeated for each segment shape, or by the extrapolation of a signal to fit a rectangular window, which is the chosen path. The deconvolution algorithm is the key of a new segmentation technique that uses extrapolation as a prediction of neighbouring regions. When the prediction of a region fits the actual content of a connected region reasonably well, both regions are merged. The segmentation process starts with an over-segmented image. It progressively merges neighbouring regions whose extrapolations fit according to an energy criterion. After each merge, the algorithm updates the values of the merging criterion for regions connected to the merged region pair. It stops when no further gain is achieved in merging regions or when mean values of adjacent regions are too different. Simulation results indicate that, although our technique is tailored for natural images containing periodic signals and flat regions, it is in fact usable for a large set of natural images. [less ▲]

Detailed reference viewed: 34 (1 ULg)
Full Text
See detailFast Computation of morphological operations with arbitrary structuring elements
Van Droogenbroeck, Marc ULg; Talbot, Hugues

in Pattern Recognition Letters (1996), 17(14), 1451-1460

Detailed reference viewed: 26 (2 ULg)