Writing Reusable Digital Geometry Algorithms in a Generic Image Processing Framework

Digital Geometry software should reflect the generality of the underlying mathe- matics: mapping the latter to the former requires genericity. By designing generic solutions, one can effectively reuse digital geometry data structures and algorithms. We propose an image processing framework focused on the Generic Programming paradigm in which an algorithm on the paper can be turned into a single code, written once and usable with various input types. This approach enables users to design and implement new methods at a lower cost, try cross-domain experiments and help generalize resultsComment: Workshop on Applications of Discrete Geometry and Mathematical Morphology, Istanb : France (2010

On the equivalence between hierarchical segmentations and ultrametric watersheds

We study hierarchical segmentation in the framework of edge-weighted graphs. We define ultrametric watersheds as topological watersheds null on the minima. We prove that there exists a bijection between the set of ultrametric watersheds and the set of hierarchical segmentations. We end this paper by showing how to use the proposed framework in practice in the example of constrained connectivity; in particular it allows to compute such a hierarchy following a classical watershed-based morphological scheme, which provides an efficient algorithm to compute the whole hierarchy.Comment: 19 pages, double-colum

On morphological hierarchical representations for image processing and spatial data clustering

Hierarchical data representations in the context of classi cation and data clustering were put forward during the fties. Recently, hierarchical image representations have gained renewed interest for segmentation purposes. In this paper, we briefly survey fundamental results on hierarchical clustering and then detail recent paradigms developed for the hierarchical representation of images in the framework of mathematical morphology: constrained connectivity and ultrametric watersheds. Constrained connectivity can be viewed as a way to constrain an initial hierarchy in such a way that a set of desired constraints are satis ed. The framework of ultrametric watersheds provides a generic scheme for computing any hierarchical connected clustering, in particular when such a hierarchy is constrained. The suitability of this framework for solving practical problems is illustrated with applications in remote sensing

Plasma medicine: The great prospects when physics meets medicine

The research has demonstrated the antimicrobial properties of plasma urging the incorporation of cold atmospheric plasma (CAP) decontamination in current clinical therapies with the aim to improve the benefits on the patients and on society.Postprint (published version

On the probabilities of hierarchical watersheds

International audienceHierarchical watersheds are obtained by iteratively merging the regions of a watershed segmentation. In the watershed segmentation of an image, each region contains exactly one (local) minimum of the original image. Therefore, the construction of a hierarchical watershed of any image I can be guided by a total order ≺ on the set of minima of I. The regions that contain the least minima according to the order ≺ are the first regions to be merged in the hierarchy. In fact, given any image I, for any hierarchical watershed H of I, there exists more than one total order on the set of minima of I which could be used to obtain H. In this article, we define the probability of a hierarchical watershed H as the probability of H to be the hierarchical watershed of I for an arbitrary total order on the set of minima of I. We introduce an efficient method to obtain the probability of hierarchical watersheds and we provide a characterization of the most probable hierarchical watersheds

Adsorption of alkali metals on W(100) : an EELS study

Room temperature adsorption of Na and K on the W(100) face is studied by work function changes, LEED and angular resolved electron energy loss spectroscopy (EELS). C(2 x 2) patterns are observed up to the monolayer for both alkalies. At low coverage, this pattern is interpreted as the result of a reconstruction of the W(100) face induced by alkali adsorption. The changes of the energy loss versus alkali coverage exhibit a deep (shallow) minimum for Na(K). Collective oscillations are assumed for coverage beyond the minima. This behaviour is discussed in regard to previous studies, particularly that of Cs on W(100). We conclude that the bonds between Na, K and Cs atoms and the W(100) face have the same nature.Nous avons étudié l'adsorption de Na et de K sur la face (100) du W à la température ambiante par variation du travail de sortie, diffraction d'électrons lents et spectroscopie de perte d'énergie d'électrons résolue angulairement. Pour ces deux alcalins, des diagrammes de diffraction C(2 x 2) sont observés jusqu'à la mono-couche. Nous interprétons ces diagrammes à bas taux de couverture par une reconstruction du substrat provoquée par l'alcalin adsorbé. La variation de l'énergie de la perte principale en fonction du taux de couverture présente un minimum marqué (peu accentué) pour Na(K). Au-delà de ce minimum, la perte est due à l'excitation d'oscillations collectives. Ce comportement est comparé à celui observé pour une couche de Cs adsorbée sur le même substrat : les liaisons entre les atomes de Na, K et Cs et la face (100) du W sont de même nature