1 - Globally optimal regions and boundaries as minimum ratio weight cycles.
I. H. Jermyn et H. Ishikawa. IEEE Trans. Pattern Analysis and Machine Intelligence, 23(10): pages 1075-1088, octobre 2001.
Mots-clés : Graphe, Ratio, Cycle, Segmentation, Minimum global.
Copyright : ©2008 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
@ARTICLE{jermyn_tpami01,
|
| author |
= |
{Jermyn, I. H. and Ishikawa, H.}, |
| title |
= |
{Globally optimal regions and boundaries as minimum ratio weight cycles}, |
| year |
= |
{2001}, |
| month |
= |
{octobre}, |
| journal |
= |
{IEEE Trans. Pattern Analysis and Machine Intelligence}, |
| volume |
= |
{23}, |
| number |
= |
{10}, |
| pages |
= |
{1075-1088}, |
| url |
= |
{http://dx.doi.org/10.1109/34.954599}, |
| pdf |
= |
{ftp://ftp-sop.inria.fr/ariana/Articles/jermyn_tpami01.pdf}, |
| keyword |
= |
{Graphe, Ratio, Cycle, Segmentation, Minimum global} |
| } |
Abstract :
We describe a new form of energy functional for the modelling and identification of regions in images. The energy is defined on the space of boundaries in the image domain, and can incorporate very general combinations of modelling information both from the boundary (intensity gradients,ldots), em and from the interior of the region (texture, homogeneity,ldots). We describe two polynomial-time digraph algorithms for finding the em global minima of this energy. One of the algorithms is completely general, minimizing the functional for any choice of modelling information. It runs in a few seconds on a 256 times 256 image. The other algorithm applies to a subclass of functionals, but has the advantage of being extremely parallelizable. Neither algorithm requires initialization. |
|
haut de la page
Nouvelle page de démos
bibtex
