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

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 multilabel 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.
Type
Publication
Proc. Int. Workshop Combinatorial Image Analysis (IWCIA2011), volume 6636 of Lecture Notes in Computer Science, pp 55-69, 2011. Springer
Digital Partition
2D
Discrete Deformable Model
Digital Topology
Simple Points
Minimum Length Polygon
Variational Model
Minimum Perimeter Polygon

Authors
Professor of Computer Science
My research interests include digital geometry, geometry processing, image analysis, variational models and discrete calculus.