Digital Deformable Model Simulating Active Contours

DOI10.1007/978-3-642-04397-0_18zbMath1261.68141OpenAlexW1516327362MaRDI QIDQ3648785

François de Vieilleville, Jacques-Olivier Lachaud

Publication date: 1 December 2009

Published in: Discrete Geometry for Computer Imagery (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-04397-0_18

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Computing methodologies for image processing (68U10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (5)

A polygonal approximation for general 4-contours corresponding to weakly simple curves ⋮ Combining Topological Maps, Multi-Label Simple Points, and Minimum-Length Polygons for Efficient Digital Partition Model ⋮ Dynamic Minimum Length Polygon ⋮ Faithful polygonal representation of the convex and concave parts of a digital curve ⋮ Two linear-time algorithms for computing the minimum length polygon of a digital contour

Cites Work

• Unnamed Item
• Unnamed Item
• Constraints on deformable models: Recovering 3D shape and nonrigid motion
• A geometric model for active contours in image processing
• Digital curvature flow and its application for skeletonization
• Optimal shortest path queries in a simple polygon
• Combinatorial Optimization. Polyhedra and efficiency. CD-ROM
• On piecewise linear approximation of planar Jordan curves
• Optimal approximations by piecewise smooth functions and associated variational problems
• Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
• Active contours without edges
• First Results for 3D Image Segmentation with Topological Map
• A note on minimal length polygonal approximation to a digitized contour

This page was built for publication: Digital Deformable Model Simulating Active Contours