DI-ENS - Département d'informatique de l'École normale supérieure, ENS Paris - École normale supérieure - Paris, Inria Paris-Rocquencourt, CNRS - Centre National de la Recherche Scientifique : UMR8548
Abstract : This paper introduces an extension to undirected graphical models of the classical continuous time Markov chains. This model can be used to solve a transductive or unsupervised multi-class classi- fication problem at each point of a network de- fined as a set of nodes connected by segments of different lengths. The classification is performed not only at the nodes, but at every point of the edge connecting two nodes. This is achieved by constructing a Potts process indexed by the con- tinuum of points forming the edges of the graph. We propose a homogeneous parameterization which satisfies Kolmogorov consistency, and show that classical inference and learning algo- rithms can be applied. We then apply our model to a problem from geo- matics, namely that of labelling city blocks auto- matically with a simple typology of classes (e.g. collective housing) from simple properties of the shape and sizes of buildings of the blocks. Our experiments shows that our model outperform standard MRFs and a discriminative model like logistic regression.
https://hal-enpc.archives-ouvertes.fr/hal-01060957
Contributeur : Loic Landrieu
<>
Soumis le : jeudi 4 septembre 2014 - 16:24:32
Dernière modification le : jeudi 7 février 2019 - 15:49:17
Document(s) archivé(s) le : vendredi 5 décembre 2014 - 10:40:06
