Combining topological maps, multi-label simple points, and minimum-length polygons for efficient digital partition model

Authors:
Guillaume Damiand;Alexandre Dupas;Jacques-Olivier Lachaud
Affiliations:
Université de Lyon, CNRS, LIRIS, UMR5205, France;Université de Poitiers, CNRS, SIC-XLIM, UMR6172, France, Paris, France;Université de Savoie, CNRS, LAMA, UMR5127, France
Venue:
IWCIA'11 Proceedings of the 14th international conference on Combinatorial image analysis
Year:
2011

Citing 16
Cited 1

Geodesic Active Contours

International Journal of Computer Vision
A note on minimal length polygonal approximation to a digitized contour

Communications of the ACM
Fast Approximate Energy Minimization via Graph Cuts

IEEE Transactions on Pattern Analysis and Machine Intelligence
A Multiphase Level Set Framework for Image Segmentation Using the Mumford and Shah Model

International Journal of Computer Vision
A topologically consistent representation for image analysis: the Topological Graph of Frontiers

DCGA '96 Proceedings of the 6th International Workshop on Discrete Geometry for Computer Imagery
Topological model for two-dimensional image representation: definition and optimal extraction algorithm

Computer Vision and Image Understanding
Globally Optimal Solutions for Energy Minimization in Stereo Vision Using Reweighted Belief Propagation

ICCV '05 Proceedings of the Tenth IEEE International Conference on Computer Vision (ICCV'05) Volume 1 - Volume 01
Topological model for 3D image representation: Definition and incremental extraction algorithm

Computer Vision and Image Understanding
Active Contours Under Topology Control--Genus Preserving Level Sets

International Journal of Computer Vision
A Comparative Study of Energy Minimization Methods for Markov Random Fields with Smoothness-Based Priors

IEEE Transactions on Pattern Analysis and Machine Intelligence
Minimum-Perimeter Polygons of Digitized Silhouettes

IEEE Transactions on Computers
New characterizations of simple points, minimal non-simple sets and P-simple points in 2D, 3D and 4D discrete spaces

DGCI'08 Proceedings of the 14th IAPR international conference on Discrete geometry for computer imagery
Two linear-time algorithms for computing the minimum length polygon of a digital contour

DGCI'09 Proceedings of the 15th IAPR international conference on Discrete geometry for computer imagery
Multi-label simple points definition for 3D images digital deformable model

DGCI'09 Proceedings of the 15th IAPR international conference on Discrete geometry for computer imagery
Digital deformable model simulating active contours

DGCI'09 Proceedings of the 15th IAPR international conference on Discrete geometry for computer imagery
Fully deformable 3D digital partition model with topological control

Pattern Recognition Letters

Dynamic minimum length polygon

IWCIA'11 Proceedings of the 14th international conference on Combinatorial image analysis

Quantified Score

Hi-index	0.00

Visualization

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.