A Markovian Model For Contour Grouping - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 1994

A Markovian Model For Contour Grouping


In order to interpret and analyse a scene, determining the contours is a fundamental step. Classical methods of contour extration do not always allow the detection of all the controus. We notice, for exemple, that the contours obtained by a Canny-Deriche filter have some gaps, especially at corners or at T-junctions. In short, the boundaries which are detected are not always closed. In this report, we present an algorith that restores incomplete contours. We model the image by Markov Random Fields and we define the Gibbs Distribution associated with it. In order to complete the contours, several criteria are defined and introduced in an energy function, which has to be optimized. The deterministic ICM "Iterated Conditional Mode" relaxation algorithm is implemented to minimize this energy function. The result is a contour image consisting of closed contours. This method has been tested on different images which present different types of difficulties (indoors, outdoors, satellite (SPOT), industrial and medical images).


Other [cs.OH]
Fichier principal
Vignette du fichier
RR-2122.pdf (211.1 Ko) Télécharger le fichier

Dates and versions

inria-00074550 , version 1 (24-05-2006)


  • HAL Id : inria-00074550 , version 1


Sabine Urago, Josiane Zerubia, Marc Berthod. A Markovian Model For Contour Grouping. [Research Report] RR-2122, INRIA. 1994. ⟨inria-00074550⟩
101 View
145 Download


Gmail Facebook Twitter LinkedIn More