Fast-marching methods for curvature penalized shortest paths

DOI10.1007/s10851-017-0778-5zbMath1435.65041OpenAlexW2775163108MaRDI QIDQ1799534

Jean-Marie Mirebeau

Publication date: 19 October 2018

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

Full work available at URL: https://doi.org/10.1007/s10851-017-0778-5

zbMATH Keywords

Hamilton-Jacobi equationviscosity solutionDubins carEuler-Mumford elasticafast-marching algorithmReeds-Shepp carVoronoi reduction of quadratic forms

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Applications of design theory to circuits and networks (94C30)

Related Items (8)

3D curve regularization ⋮ A linear finite-difference scheme for approximating randers distances on cartesian grids ⋮ Investigations on the influence of the boundary conditions when computing the effective crack energy of random heterogeneous materials using fast marching methods ⋮ Single pass computation of first seismic wave travel time in three dimensional heterogeneous media with general anisotropy ⋮ Monotone and Second Order Consistent Scheme for the Two Dimensional Pucci Equation ⋮ Path planning for an autonomous underwater vehicle in a cluttered underwater environment based on the heat method ⋮ Second order monotone finite differences discretization of linear anisotropic differential operators ⋮ Fast asymmetric fronts propagation for image segmentation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Adjugate diffusion tensors for geodesic tractography in white matter
• Derivatives with respect to metrics and applications: subgradient marching algorithm
• Constraints on deformable models: Recovering 3D shape and nonrigid motion
• Automatic differentiation of non-holonomic fast marching for computing most threatening trajectories under sensors surveillance
• Optimal paths for variants of the 2D and 3D Reeds-Shepp car with applications in image analysis
• Shortest paths of bounded curvature in the plane
• Optimal paths for a car that goes both forwards and backwards
• Global minimum for a Finsler elastica minimal path approach
• Sparse non-negative stencils for anisotropic diffusion
• Association fields via cuspless sub-Riemannian geodesics in SE(2)
• Efficient fast marching with Finsler metrics
• Hermitian vector bundles and extension groups on arithmetic schemes. I: Geometry of numbers
• A PDE Approach to Data-Driven Sub-Riemannian Geodesics in $SE$(2)
• Minimal Stencils for Discretizations of Anisotropic PDEs Preserving Causality or the Maximum Principle
• Anisotropic Fast-Marching on Cartesian Grids Using Lattice Basis Reduction
• Geodesic Methods in Computer Vision and Graphics
• Cut locus and optimal synthesis in the sub-Riemannian problem on the group of motions of a plane
• On Curves of Minimal Length with a Constraint on Average Curvature, and with Prescribed Initial and Terminal Positions and Tangents
• On Hopf's formulas for solutions of Hamilton-Jacobi equations
• Low-dimensional lattices. VI. Voronoi reduction of three-dimensional lattices
• A Viscosity Solutions Approach to Shape-From-Shading
• Methodus inveniendi lineas curvas maximi minimive proprietate gaudentes, sive solutio problematis isoperimetrici lattissimo sensu accepti
• Active contours without edges
• Efficient algorithms for globally optimal trajectories
• A fast algorithm for the two dimensional HJB equation of stochastic control
• Algorithmic Number Theory
• Convergent Difference Schemes for Degenerate Elliptic and Parabolic Equations: Hamilton--Jacobi Equations and Free Boundary Problems
• Curve cuspless reconstructionviasub-Riemannian geometry
• Monotone and consistent discretization of the Monge-Ampère operator
• Optimal control and viscosity solutions of Hamilton-Jacobi-Bellman equations

This page was built for publication: Fast-marching methods for curvature penalized shortest paths