minimum length polygon

Combining Topological Maps, Multi-Label Simple Points, and Minimum-Length Polygons for Efficient Digital Partition Model
Deformable models have shown great potential for image segmentation. They include discrete models whose combinatorial formulation leads …
G. Damiand, A. Dupas, Jacques-Olivier Lachaud
PDF Cite Project
Combining Topological Maps, Multi-Label Simple Points, and Minimum-Length Polygons for Efficient Digital Partition Model
Dynamic Minimum Length Polygon
This paper presents a formal framework for representing all reversible polygonalizations of a digital contour (i.e. the boundary of a …
Jacques-Olivier Lachaud, X. Provençal
PDF Cite Project Slides (PDF)
Dynamic Minimum Length Polygon
Two linear-time algorithms for computing the minimum length polygon of a digital contour
The Minimum Length Polygon (MLP) is an interesting first order approximation of a digital contour. For instance, the convexity of the …
Jacques-Olivier Lachaud, X. Provençal
PDF Cite Project
Two linear-time algorithms for computing the minimum length polygon of a digital contour
Digital Deformable Model Simulating Active Contours
Deformable models are continuous energy-minimizing techniques that have been successfully applied to image segmentation and tracking …
F. de Vieilleville, Jacques-Olivier Lachaud
PDF Cite Project URL
Digital Deformable Model Simulating Active Contours
Top-Down Segmentation of Histological Images Using a Digital Deformable Model
This paper presents a straightforward top-down segmentation method based on a contour approach on histological images. Our approach …
F. de Vieilleville, Jacques-Olivier Lachaud, P. Herlin, O. Lezoray, B. Plancoulaine
PDF Cite Project URL
Top-Down Segmentation of Histological Images Using a Digital Deformable Model
Two linear-time algorithms for computing the minimum length polygon of a digital contour
The Minimum Length Polygon (MLP) is an interesting first order approximation of a digital contour. For instance, the convexity of the …
X. Provençal, Jacques-Olivier Lachaud
PDF Cite Project URL
Two linear-time algorithms for computing the minimum length polygon of a digital contour