Spectral grouping using the Nyström method

Context-based segmentation of image sequences

We describe an algorithm for context-based segmentation of visual data. New frames in an image sequence (video) are segmented based on the prior segmentation of earlier frames in the sequence. The segmentation is performed by adapting a probabilistic model learned on previous frames, according to the content of the new frame. We utilize the maximum a posteriori version of the EM algorithm to segment the new image. The Gaussian mixture distribution that is used to model the current frame is transformed into a conjugate-prior distribution for the parametric model describing the segmentation of the new frame. This semisupervised method improves the segmentation quality and consistency and enables a propagation of segments along the segmented images. The performance of the proposed approach is illustrated on both simulated and real image data.

Ultrasound image segmentation using spectral clustering

Segmentation of ultrasound images is necessary in a variety of clinical applications, but the development of automatic techniques is still an open problem. Spectral clustering techniques have recently become popular for data and image analysis. In particular, image segmentation has been proposed via the normalized cut (NCut) criterion. This article describes an initial investigation to determine the suitability of such segmentation techniques for ultrasound images. The adaptation of the NCut technique to ultrasound is described first. Segmentation is then performed on simulated ultrasound images. Tests are also performed on abdominal and fetal images with the segmentation results compared to manual segmentation. The success of the segmentation on these test cases warrants further research into NCut-based segmentation of ultrasound images.

Geometric diffusions as a tool for harmonic analysis and structure definition of data: multiscale methods

In the companion article, a framework for structural multiscale geometric organization of subsets of R(n) and of graphs was introduced. Here, diffusion semigroups are used to generate multiscale analyses in order to organize and represent complex structures. We emphasize the multiscale nature of these problems and build scaling functions of Markov matrices (describing local transitions) that lead to macroscopic descriptions at different scales. The process of iterating or diffusing the Markov matrix is seen as a generalization of some aspects of the Newtonian paradigm, in which local infinitesimal transitions of a system lead to global macroscopic descriptions by integration. This article deals with the construction of fast-order N algorithms for data representation and for homogenization of heterogeneous structures.