Sciweavers

Share
ICPR
2002
IEEE

Relational Graph Labelling Using Learning Techniques and Markov Random Fields

12 years 2 months ago
Relational Graph Labelling Using Learning Techniques and Markov Random Fields
This paper introduces an approach for handling complex labelling problems driven by local constraints. The purpose is illustrated by two applications: detection of the road network on radar satellite images, and recognition of the cortical sulci on MRI images. Features must be initially extracted from the data to build a "feature graph" with structural relations. The goal is to endow each feature with a label representing either a specific object (recognition), or a class of objects (detection). Some contextual constraints have to be respected during this labelling. They are modelled by Markovian potentials assigned to the labellings of "feature clusters". The solution of the labelling problem is the minimum of the energy defined by the sum of the local potentials. This paper develops a method for learning these local potentials using a "congregation" of neural networks and supervised learning.
Denis Rivière, Jean-Francois Mangin, Jean-M
Added 09 Nov 2009
Updated 09 Nov 2009
Type Conference
Year 2002
Where ICPR
Authors Denis Rivière, Jean-Francois Mangin, Jean-Marc Martinez, F. Tupin, Dimitri Papadopoulos-Orfanos, Vincent Frouin
Comments (0)
books