Globally optimal geodesic active contours

DOI10.1007/S10851-005-4968-1zbMATH Open1478.94005OpenAlexW2002882465MaRDI QIDQ2573045FDOQ2573045

Authors: Ben Appleton, Hugues Talbot 

Publication date: 7 November 2005

Published in: Journal of Mathematical Imaging and Vision (Search for Journal in Brave)

Full work available at URL: https://espace.library.uq.edu.au/view/UQ:9734/GOGAC.pdf

Recommendations

• Geodesic active contours
• Active contours without edges
• Optimal level curves and global minimizers of cost functionals in image segmentation
• Image selective segmentation under geometrical constraints using an active contour approach
• Publication:4890483

zbMATH Keywords

optimal segmentationcircular shortest pathGeodesic active contour

Mathematics Subject Classification ID

Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Computing methodologies for image processing (68U10) Machine vision and scene understanding (68T45)

Cites Work

• A note on two problems in connexion with graphs
• Title not available (Why is that?)
• Fronts propagating with curvature-dependent speed: Algorithms based on Hamilton-Jacobi formulations
• Geodesic active contours
• A fast marching level set method for monotonically advancing fronts.
• Title not available (Why is that?)
• On active contour models and balloons
• Snakes, shapes, and gradient vector flow
• A geometric model for active contours in image processing
• A fast level set method for propagating interfaces
• Regularized Laplacian zero crossings as optimal edge integrators
• Minimal surfaces: A geometric three dimensional segmentation approach
• Multiple contour finding and perceptual grouping using minimal paths
• Unsupervised cell nucleus segmentation with active contours.

Cited In (21)

• Isophotes selection and reaction-diffusion model for object boundaries estimation
• Optimal level curves and global minimizers of cost functionals in image segmentation
• An unconditionally stable numerical method for bimodal image segmentation
• A Characteristic Function-Based Algorithm for Geodesic Active Contours
• Regularized Laplacian zero crossings as optimal edge integrators
• An elastica-driven digital curve evolution model for image segmentation
• Active contour with a tangential component
• An Efficient Lagrangian Algorithm for an Anisotropic Geodesic Active Contour Model
• A variational approach to vesicle membrane reconstruction from fluorescence imaging
• Diffeomorphic active contours
• Improvements on contours based segmentation for DNA microarray image processing
• Topology-preserving geodesic active contours for segmentation of high content fluorescent cellular images
• Global minimum for a Finsler elastica minimal path approach
• Convergence rate of overlapping domain decomposition methods for the Rudin-Osher-Fatemi model based on a dual formulation
• Digital curvature evolution model for image segmentation
• Mean field annealing deformable contour method: a constrained global optimization approach
• Pipette Hunter 3D: fluorescent micropipette detection
• Stationary subdivision snakes for contour detection
• Exploiting Information Geometry to Improve the Convergence of Nonparametric Active Contours
• Convergent non-overlapping domain decomposition methods for variational image segmentation
• Efficient 3D volume reconstruction from a point cloud using a phase-field method

This page was built for publication: Globally optimal geodesic active contours

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