Generalized fast marching method: applications to image segmentation

DOI10.1007/S11075-008-9183-XMaRDI QIDQ937178zbMATH OpenOpenAlexWikidataFDO

Authors Nicolas Forcadel, Carole Le Guyader, Christian Gout

Publication date 20 August 2008

Published in Numerical Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11075-008-9183-x

zbMATH Keywords

Chan-Vese model for segmentationFast marching methodLevel set methods

Mathematics Subject Classification ID

Medical epidemiology (92C60) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Computing methodologies for image processing (68U10)

Recommendations

• scientific article; zbMATH DE number 2044153
• A fast algorithm for image segmentation of the geodesic active contour model
• A generalized fast marching method on unstructured triangular meshes
• Some improvements of the fast marching method
• Variational, Geometric, and Level Set Methods in Computer Vision

Cites work

• scientific article; zbMATH DE number 4052482 (Why is no real title available?)
• scientific article; zbMATH DE number 1349965 (Why is no real title available?)
• A Viscosity Solutions Approach to Shape-From-Shading
• A fast marching level set method for monotonically advancing fronts.
• A fast sweeping method for Eikonal equations
• A multiphase level set framework for image segmentation using the Mumford and Shah model
• A non-monotone fast marching scheme for Hamilton-Jacobi equation modelling dislocation dynamics
• A variational level set approach to multiphase motion
• Active contours without edges
• Algorithms for Finding Global Minimizers of Image Segmentation and Denoising Models
• An O(N log N) algorithm for shape modeling.
• Efficient algorithms for globally optimal trajectories
• Evolution, implementation, and application of level set and fast marching methods for advancing fronts
• Fast Sweeping Algorithms for a Class of Hamilton--Jacobi Equations
• Fronts propagating with curvature-dependent speed: Algorithms based on Hamilton-Jacobi formulations
• Geodesic active contours
• Geometric Level Set Methods in Imaging, Vision, and Graphics
• Level set methods and dynamic implicit surfaces
• Mathematical problems in image processing. Partial differential equations and the calculus of variations. Foreword by Olivier Faugeras
• O(\(N\)) implementation of the fast marching algorithm
• On active contour models and balloons
• Optimal approximations by piecewise smooth functions and associated variational problems
• Segmentation of complex geophysical structures with well data
• Segmentation under geometrical conditions using geodesic active contours and interpolation using level set methods
• Snakes, shapes, and gradient vector flow
• Using a level set approach for image segmentation under interpolation conditions
• Viscosity solutions of Hamilton-Jacobi equations

Cited in

(10)

• Fast marching based superpixels generation
• Global solution for a non-local eikonal equation modelling dislocation dynamics
• scientific article; zbMATH DE number 2110608 (Why is no real title available?)
• A local information based variational model for selective image segmentation
• Generalized fronts propagation on weighted graphs
• Fast asymmetric fronts propagation for image segmentation
• A low complexity algorithm for non-monotonically evolving fronts
• scientific article; zbMATH DE number 2044153 (Why is no real title available?)
• Global existence results for eikonal equation with \(BV\) initial data
• A geodesic-active-contour-based variational model for short-axis cardiac MR image segmentation

This page was built for publication: Generalized fast marching method: applications to image segmentation

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