Three-dimensional conditional random field for the dermal-epidermal junction segmentation.

The segmentation of the dermal-epidermal junction (DEJ) in confocal images represents a challenging task due to uncertainty in visual labeling and complex dependencies between skin layers. We propose a method to segment the DEJ surface, which combines random forest classification with spatial regularization based on a three-dimensional conditional random field (CRF) to improve the classification robustness. The CRF regularization introduces spatial constraints consistent with skin anatomy and its biological behavior.

Watershed cuts: thinnings, shortest path forests, and topological watersheds.

We recently introduced watershed cuts, a notion of watershed in edge-weighted graphs. In this paper, our main contribution is a thinning paradigm from which we derive three algorithmic watershed cut strategies: The first one is well suited to parallel implementations, the second one leads to a flexible linear-time sequential implementation, whereas the third one links the watershed cuts and the popular flooding algorithms. We state that watershed cuts preserve a notion of contrast, called connection value, on which several morphological region merging methods are (implicitly) based.

Topology-corrected segmentation and local intensity estimates for improved partial volume classification of brain cortex in MRI.

In magnetic resonance imaging (MRI), accuracy and precision with which brain structures may be quantified are frequently affected by the partial volume (PV) effect. PV is due to the limited spatial resolution of MRI compared to the size of anatomical structures. Accurate classification of mixed voxels and correct estimation of the proportion of each pure tissue (fractional content) may help to increase the precision of cortical thickness estimation in regions where this measure is particularly difficult, such as deep sulci.

Watershed cuts: minimum spanning forests and the drop of water principle.

We study the watersheds in edge-weighted graphs. We define the watershed cuts following the intuitive idea of drops of water flowing on a topographic surface. We first establish the consistency of these watersheds: They can be equivalently defined by their "catchment basins" (through a steepest descent property) or by the "dividing lines" separating these catchment basins (through the drop of water principle).

New characterizations of simple points in 2D, 3D, and 4D discrete spaces.

A point of a discrete object is called simple if it can be deleted from this object without altering topology. In this article, we present new characterizations of simple points which hold in dimensions 2, 3 and 4, and which lead to efficient algorithms for detecting such points. In order to prove these characterizations, we establish two confluence properties of the collapse operation which hold in the neighborhood of a point in spaces of low dimension.

Building the component tree in quasi-linear time.

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 a tree structure, that is called the component tree. This tree, under several variations, has been used in numerous applications.

Computer-assisted analysis helps detect inner dynein arm abnormalities.

The diagnosis of primary ciliary dyskinesia is based on demonstration of ciliary defects, mainly concerning dynein arms. Whereas the absence of outer dynein arms can be easily distinguished, the absence of inner dynein arms is difficult to confirm because of their low contrast on electron microscopy. Ciliary ultrastructure was studied in 40 patients suffering from respiratory tract infections.