Digital Deformable Model Simulating Active Contours

DOI10.1007/978-3-642-04397-0_18zbMATH Open1261.68141OpenAlexW1516327362MaRDI QIDQ3648785FDOQ3648785

Authors: 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

Recommendations

• scientific article; zbMATH DE number 5669915
• Diffeomorphic active contours
• Active contour model based on gradient vector flow
• scientific article; zbMATH DE number 1691500

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (11)

• Title not available (Why is that?)
• Title not available (Why is that?)
• A polygonal approximation for general 4-contours corresponding to weakly simple curves
• Title not available (Why is that?)
• Dynamic particle systems for object structure extraction
• Combining topological maps, multi-label simple points, and minimum-length polygons for efficient digital partition model
• 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
• Title not available (Why is that?)
• GLOBAL DEFORMABLE SURFACE OPTIMIZATION USING ADAPTIVE CONSTRAINTS AND PENALTIES
• Dynamic minimum length polygon

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3648785)