An Efficient Lagrangian Algorithm for an Anisotropic Geodesic Active Contour Model

DOI10.1007/978-3-319-58771-4_33MaRDI QIDQ5864026zbMATH OpenOpenAlexFDO

Authors Günay Doğan

Publication date 3 June 2022

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-58771-4_33

zbMATH Keywords

shape derivativeshape gradientvelocity equationminimization algorithmgeodesic active contour

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Recommendations

• A fast algorithm for image segmentation of the geodesic active contour model
• A Characteristic Function-Based Algorithm for Geodesic Active Contours
• A geometric model for active contours in image processing
• Geodesic active contours
• A new method of geodesic active contours for image segmentation
• Globally optimal geodesic active contours
• Geodesic active contour under geometrical conditions: theory and 3D applications
• Viscosity solutions for geodesic active contour under geometrical conditions

Cited in

(2)

• 3D Lagrangian segmentation with simultaneous mesh adjustment
• Accelerated Optimization in the PDE Framework Formulations for the Active Contour Case

This page was built for publication: An Efficient Lagrangian Algorithm for an Anisotropic Geodesic Active Contour Model

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