Results 11 to 20 of about 5,484 (295)
Sub-Riemannian Fast Marching in SE(2) [PDF]
We propose a Fast Marching based implementation for computing sub-Riemanninan (SR) geodesics in the roto-translation group SE(2), with a metric depending on a cost induced by the image data. The key ingredient is a Riemannian approximation of the SR-metric.
Gonzalo Sanguinetti +5 more
core +5 more sources
Comparison Principle for a Generalized Fast Marching Method [PDF]
In \cite{CFFM06}, the authors have proposed a generalization of the classical Fast Marching Method of Sethian for the eikonal equation in the case where the normal velocity depends on space and time and can change sign. The goal of this paper is to propose a modified version of the Generalized Fast Marching Method proposed in \cite{CFFM06} for which we
Forcadel, Nicolas
core +5 more sources
Wildfire Spreading Simulator Using Fast Marching Algorithm [PDF]
Programs that can predict wildfire behavior are a very useful tool in terms of extinguishing these fires more effectively. State of the art wildfire simulators present some drawbacks such as not being sufficiently user-friendly, being expensive, requiring great computational power or having poor graphical representation. This paper presents a prototype
Juan Carballeira +3 more
openaire +4 more sources
A comparison of fast marching, fast sweeping and fast iterative methods for the solution of the eikonal equation [PDF]
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.
CAPOZZOLI, AMEDEO +3 more
openaire +6 more sources
On the Accuracy of Anisotropic Fast Marching
15 pages, 3 ...
Mirebeau, Jean-Marie
openaire +3 more sources
A Two-Step Surface Reconstruction Method Using Signed Marching Cubes
In this paper, we explore a new approach, a two-step surface reconstruction method to extract the target isosurface from a given implicit function efficiently.
Ju Zhang, Deyun Zhong, Liguan Wang
doaj +1 more source
Fast Marching-Based Path Generating Algorithm in Anisotropic Environment With Perturbations
Fast Marching is a widely used method in path planning, especially continuity is demanded due to kinodynamic constraints of automatic vehicles. However, its application in real environment with obstacles and perturbations requires simplifications to be ...
Jinshan Xu +3 more
doaj +1 more source
Application of Fibonacci heap to fast marching method
The fast marching method (FMM) is an efficient, stable and adaptable travel time calculation method. In the realization of this method, it is necessary to select the minimum travel time node from the narrow band many times.
Meng Fanchang +5 more
doaj +1 more source
Fast marching based superpixels
AbstractIn this article, we present a fast-marching based algorithm for generating superpixel (FMS) partitions of images. The idea behind the algorithm is to draw an analogy between waves propagating in a heterogeneous medium and regions growing on an image at a rate depending on the local color and texture.
Chang, Kaiwen, Figliuzzi, Bruno
openaire +3 more sources
Path Planning and Collision Risk Management Strategy for Multi-UAV Systems in 3D Environments
Multi-UAV systems are attracting, especially in the last decade, the attention of researchers and companies of very different fields due to the great interest in developing systems capable of operating in a coordinated manner in complex scenarios and to ...
Blanca López +5 more
doaj +1 more source

