Showing papers by "Fernand Meyer published in 2013"
TL;DR: In this paper, a complete prototype for the automatic detection of normal examinations on a teleophthalmology network for diabetic retinopathy screening is presented, which combines pathological pattern mining methods, with specific lesion detection methods, to extract information from the images.
Abstract: A complete prototype for the automatic detection of normal examinations on a teleophthalmology network for diabetic retinopathy screening is presented. The system combines pathological pattern mining methods, with specific lesion detection methods, to extract information from the images. This information, plus patient and other contextual data, is used by a classifier to compute an abnormality risk. Such a system should reduce the burden on readers on teleophthalmology networks.
316 citations
15 May 2013
TL;DR: Dendrograms are used in hierarchical classification and are useful structures in image processing, for segmentation or filtering purposes.
Abstract: Dendrograms are used in hierarchical classification. They also are useful structures in image processing, for segmentation or filtering purposes. The structure of a hierarchy is univocally expressed by a ultrametric ecart. The hierarchies form a complete lattice on which two adjunctions will be defined.
5 citations
Posted Content•
TL;DR: Watersheds have been defined both for node and edge weighted graphs and it is shown that they are identical: for each edge of a weighted graph exists a node with the same minima and catchment basin.
Abstract: Watersheds have been defined both for node and edge weighted graphs. We show that they are identical: for each edge (resp.\ node) weighted graph exists a node (resp. edge) weighted graph with the same minima and catchment basin.
2 citations
15 May 2013
TL;DR: This paper characterizes floodings on edge weighted graphs and presents two classes of algorithms for their construction on the dendrogram representing the hierarchy associated to the edge weighted graph.
Abstract: This paper characterizes floodings on edge weighted graphs. Of particular interest are the highest floodings of a graph below a ceiling function defined on the nodes. Two classes of algorithms for their construction are presented. The first are applied on the dendrogram representing the hierarchy associated to the edge weighted graph. The second consist in shortest distance algorithms on the graph itself.