Active Vector Graph For Regularized Tesselation - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2009

Active Vector Graph For Regularized Tesselation

Résumé

A discretized parametric curve can be seen as a sparse graph of vectors where each vertex is linked to two other vertices. Following this observation, we propose to generalize para-metric active contours to a larger framework we call active vector graphs. This can be achieved by allowing each vertex of a graph of vectors to be linked to more than two vertices. An active graph does not need to be parameterized and the computation of its energy can be achieved by integrating over all its vertices. The optimization scheme pushes the graph toward the edges and in the direction of the normal which we show can be defined for all vertices. This offers a regularized model which adresses in an elegant and very fast way a certain set of problems such as the segmentation of connected regions. The method is described along with an exemple.
Fichier non déposé

Dates et versions

hal-02902022 , version 1 (15-08-2020)

Identifiants

Citer

Auguste Genovesio. Active Vector Graph For Regularized Tesselation. 2009 16th IEEE International Conference on Image Processing ICIP 2009, Nov 2009, Cairo, France. pp.2429-2432, ⟨10.1109/ICIP.2009.5414154⟩. ⟨hal-02902022⟩

Collections

ENS-PARIS CNRS PSL
10 Consultations
2 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More