Passer à la navigation principale Passer à la recherche Passer au contenu principal

Relational graph labelling using learning techniques and Markov random fields

  • D. Rivière
  • , J. F. Mangin
  • , J. M. Martinez
  • , F. Tupin
  • , D. Papadopoulos-Orfanos
  • , V. Frouin
  • CEA/UVSQ/CNRS
  • Institut Pierre Simon Laplace, CNRS and CEA

Résultats de recherche: Contribution à un journalArticleRevue par des pairs

Résumé

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.

langue originaleAnglais
Pages (de - à)172-175
Nombre de pages4
journalProceedings - International Conference on Pattern Recognition
Volume16
Numéro de publication2
étatPublié - 1 déc. 2002

Empreinte digitale

Examiner les sujets de recherche de « Relational graph labelling using learning techniques and Markov random fields ». Ensemble, ils forment une empreinte digitale unique.

Contient cette citation