OPF-MRF: Optimum-path forest and Markov random fields for contextual-based image classification

Some machine learning methods do not exploit contextual information in the process of discovering, describing and recognizing patterns. However, spatial/temporal neighboring samples are likely to have same behavior. Here, we propose an approach which unifies a supervised learning algorithm - namely Optimum-Path Forest - together with a Markov Random Field in order to build a prior model holding a spatial smoothness assumption, which takes into account the contextual information for classification purposes. We show its robustness for brain tissue classification over some images of the well-known dataset IBSR. © 2013 Springer-Verlag.

Topological K-classification of finitely determined map germs

We consider smooth finitely C 0-K-determined map germs f: (ℝn, 0) → (ℝp, 0) and we look at the classification under C 0-K-equivalence. The main tool is the homotopy type of the link, which is obtained by intersecting the image of f with a small enough sphere centered at the origin. When f -1(0) = {0}, the link is a smooth map between spheres and f is C 0-K-equivalent to the cone of its link. When f -1(0) ≠ {0}, we consider a link diagram, which contains some extra information, but again f is C 0-K-equivalent to the generalized cone. As a consequence, we deduce some known results due to Nishimura (for n = p) or the first named author (for n < p). We also prove some new results of the same nature. © 2012 Springer Science+Business Media Dordrecht.