Results 1 to 10 of about 3,580 (288)
Applied Artificial Intelligence, 2021 The evacuation problem is usually addressed by assuming homogeneous media where pedestrians move freely in the presence of several exits and obstacles.
Severino F. Galán
doaj +4 more sources
Marine Applications of the Fast Marching Method [PDF]
Frontiers in Robotics and AI, 2020 Path planning is general problem of mobile robots, which has special characteristics when applied to marine applications. In addition to avoid colliding with obstacles, in marine scenarios, environment conditions such as water currents or wind need to be
Santiago Garrido +2 more
doaj +5 more sources
A comparison of Fast Marching, Fast Sweeping and Fast Iterative Methods for the solution of the eikonal equation [PDF]
Telfor Journal, 2013 We compare the computational performance of the Fast Marching Method, the Fast Sweeping Method and the Fast Iterative Method to determine a numerical solution to the eikonal equation. We point out how the Fast Iterative Method outperforms the other two thanks to its parallel processing capabilities.
Claudio Curcio, A Liseno
exaly +7 more sources
Nonholonomic Motion Planning Using the Fast Marching Square Method [PDF]
International Journal of Advanced Robotic Systems, 2015 This research presents two novel approaches to nonholonomic motion planning. The methodologies presented are based on the standard fast marching square path planning method and its application to car-like robots.
César Arismendi +3 more
doaj +4 more sources
Seismica, 2023 In this study, we focus on Northwest Iran and exploit a dataset of Rayleigh-wave group-velocity measurements obtained from ambient noise cross-correlations and earthquakes.
Saman Amiri +4 more
doaj +4 more sources
Fully Isotropic Fast Marching Methods on Cartesian Grids. [PDF]
Comput Vis ECCV, 2010 The existing Fast Marching methods which are used to solve the Eikonal equation use a locally continuous model to estimate the accumulated cost, but a discontinuous (discretized) model for the traveling cost around each grid point. Because the accumulated cost and the traveling (local) cost are treated differently, the estimate of the accumulated cost ...
Appia V, Yezzi A.
europepmc +4 more sources
Fast marching methods for the continuous traveling salesman problem. [PDF]
Proc Natl Acad Sci U S A, 2007 We consider a problem in which we are given a domain, a cost function which depends on position at each point in the domain, and a subset of points (“cities”) in the domain. The goal is to determine the cheapest closed path that visits each city in the domain once.
Andrews J, Sethian JA.
europepmc +4 more sources
AUTOMATED EXTRACTION OF LIVER OUTLINES FROM COMPUTED TOMOGRAPHY SCAN IMAGES USING A CUDA-BASED SEGMENTATION METHOD [PDF]
The International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences, 2019 The traditional fast marching algorithm for segmentation of the liver is suitable for processing on the central processing unit (CPU) platform, however, it is not suitable for implementation on Graphics Processing Unit (GPU).
Y. Chen, D. Li, Q. Zhu, C. Wang, J. Li
doaj +1 more source
Research on seamless image stitching based on fast marching method
IET Image Processing, 2023 Image stitching is an important way to achieve large‐field high‐resolution imaging. The inconsistencies in brightness and structure and defects in ghosting, blurring and misalignment between images, which are inevitable and difficult to eliminate, make a
Weidong Pan +4 more
doaj +1 more source
A Generalized Fast Marching Method for Dislocation Dynamics [PDF]
SIAM Journal on Numerical Analysis, 2011 In this paper, we consider a generalized fast marching method (GFMM) as a numerical method to compute dislocation dynamics. The dynamics of a dislocation hypersurface in $\mathbb{R}^N$ (with $N=2$ for physical applications) is given by its normal velocity which is a nonlocal function of the whole shape of the hypersurface itself.
Elisabetta Carlini +2 more
openaire +3 more sources