Version française


Guillaume Damiand

oHome page

oResearches

oPublications

oTeaching

oSupervised Thesis

oCV

oContacts

oLinks

Combining Topological Maps, Multi-Label Simple Points, and Minimum-Length Polygons for Efficient Digital Partition Model

Damiand G., Dupas A., Lachaud J.-O.
Proc. of 14th International Workshop on Combinatorial Image Analysis (IWCIA)
Lecture Notes in Computer Science 6636, pages 56-69, May 2011, Madrid, Spain

Links:  PDF  Hal  Link  

Abstract: Deformable models have shown great potential for image segmentation. They include discrete models whose combinatorial formulation leads to efficient and sometimes optimal minimization algorithms. In this paper, we propose a new discrete framework to deform any partition while preserving its topology. We show how to combine the use of multi-label simple points, topological maps and minimum-length polygons in order to implement an efficient digital deformable partition model. Our experimental results illustrate the potential of our framework for segmenting images, since it allows the mixing of region-based, contour-based and regularization energies, while keeping the overall image structure.

Keywords: Topological Map; ML-Simple Point; Minimum-Length Polygon; Deformable Model; Interpixel Boundaries; Multi-Label Image.

BibTex references

@InProceedings{DDL11,
      author = {Damiand, G. and Dupas, A. and Lachaud, J.-O.},
      title = {Combining Topological Maps, Multi-Label Simple Points, and Minimum-Length Polygons for Efficient Digital Partition Model},
      booktitle = {Proc. of 14th International Workshop on Combinatorial Image Analysis (IWCIA)},
      series = {Lecture Notes in Computer Science},
      publisher = {Springer Berlin/Heidelberg},
      volume = {6636},
      pages = {56-69},
      month = {May},
      year = {2011},
      address = {Madrid, Spain},
      keywords = {Topological Map; ML-Simple Point; Minimum-Length Polygon; Deformable Model; Interpixel Boundaries; Multi-Label Image.},
      url = {https://doi.org/10.1007/978-3-642-21073-0_8}
}

Image


o [Back]