Optimal algorithm for shape from shading and path planning

DOI10.1023/A:1011234012449MaRDI QIDQ5947004zbMATH OpenOpenAlexFDO

Authors Ron Kimmel, James Sethian

Publication date 21 October 2001

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

Full work available at URL https://doi.org/10.1023/a:1011234012449

zbMATH Keywords

path planningrobot navigation

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Nonnumerical algorithms (68W05) Computing methodologies for image processing (68U10) Artificial intelligence for robotics (68T40)

Recommendations

• scientific article; zbMATH DE number 4090070
• Visibility-based optimal path and motion planning
• Optimal path planning based on visibility
• Optimal any-angle pathfinding in practice
• An exact geometry-based algorithm for path planning
• Optimal geometric modeler for robot motion planning
• An Optimal Algorithm for Computing Visibility in the Plane
• scientific article; zbMATH DE number 177568

Cited in

(23)

• The use of variational iteration method and Adomian decomposition method to solve the eikonal equation and its application in the reconstruction problem
• MG-FIM: a multi-GPU fast iterative method using adaptive domain decomposition
• Ordered line integral methods for solving the eikonal equation
• A variational approach to path planning in three dimensions using level set methods
• A second-order distributed memory parallel fast sweeping method for the eikonal equation
• An adaptive domain-decomposition technique for parallelization of the fast marching method
• The use of a Legendre pseudospectral viscosity technique to solve a class of nonlinear dynamic Hamilton-Jacobi equations
• A unifying and rigorous shape from shading method adapted to realistic data and applications
• O(\(N\)) implementation of the fast marching algorithm
• A multi-image shape-from-shading framework for near-lighting perspective endoscopes
• Solving the eikonal equation on an adaptive mesh
• Hybrid massively parallel fast sweeping method for static Hamilton-Jacobi equations
• Fast and accurate surface normal integration on non-rectangular domains
• The Chebyshev spectral viscosity method for the time dependent eikonal equation
• A primal-dual algorithm for computing Finsler distances and applications
• A seminumeric approach for solution of the eikonal partial differential equation and its applications
• A fast marching method for Hamilton-Jacobi equations modeling monotone front propagations
• A boundary-only meshless method for numerical solution of the eikonal equation
• A new Oren-Nayar shape-from-shading approach for 3D reconstruction using high-order Godunov-based scheme
• A unified framework for document restoration using inpainting and shape-from-shading
• Shape-from-shading under perspective projection
• Global minimum for a Finsler elastica minimal path approach
• An extension to \textsc{Voro++} for multithreaded computation of Voronoi cells

This page was built for publication: Optimal algorithm for shape from shading and path planning

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