Results 11 to 20 of about 114,423 (180)

Sub-Riemannian Fast Marching in SE(2) [PDF]

, 2015
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, Erik Bekkers, Remco Duits, Michiel H. J. Janssen, Alexey Mashtakov, Jean-Marie Mirebeau   +5 more
openaire   +4 more sources

Anisotropic Fast-Marching on cartesian grids using Lattice Basis Reduction [PDF]

SIAM Journal on Numerical Analysis, 2014
We introduce a modification of the Fast Marching Algorithm, which solves the generalized eikonal equation associated to an arbitrary continuous riemannian metric, on a two or three dimensional domain.
Jean-Marie Mirebeau, Sermesant M.
core   +5 more sources

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.
CARLINI, Elisabetta, Nicolas Forcadel, Régis Monneau   +2 more
openaire   +8 more sources

Robot Formations Control Using Fast Marching [PDF]

, 2011
This paper presents the application of the Voronoi Fast Marching (V FM) method to the Control of Robot Formations. The V FM method uses the propagation of a wave (Fast Marching) operating on the world model to de- termine a motion plan over a viscosity map (similar to the refraction index in optics) extracted from the updated map model.
Garrido Bullón, Luis Santiago, Moreno Lorente, Luis Enrique, Lima, Pedro U.   +2 more
core   +8 more sources

Fast-Marching Tractography for Connection Matrix (Fast-TraC) [PDF]

, 2008
Although high angular resolution diffusion MRI techniques are able to solve multiple intra-voxel fiber orientations, the usual streamline Diffusion Spectrum Imaging (DSI) tractography algorithms present some limitations in their ability to map complex ...
Gigandet, X, Cammoun, L., Meuli, R., Thiran, J.P., Hagmann, P.   +4 more
openaire   +3 more sources

Comparison Principle for a Generalized Fast Marching Method [PDF]

SIAM Journal on Numerical Analysis, 2009
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
openaire   +6 more sources

Elastic Fast Marching Learning from Demonstration

Advanced Intelligent Systems
This article introduces a novel approach for learning robotic skills from human demonstrations, Elastic Fast Marching Learning (EFML). This method seamlessly integrates concepts from Elastic Maps, a Learning from Demonstration (LfD) method based on a ...
Adrian Prados, Brendan Hertel, Ramon Barber, Reza Azadeh   +3 more
doaj   +2 more sources

Fast Marching Tree: a Fast Marching Sampling-Based Method for Optimal Motion Planning in Many Dimensions. [PDF]

Int J Rob Res, 2015
In this paper we present a novel probabilistic sampling-based motion planning algorithm called the Fast Marching Tree algorithm (FMT*). The algorithm is specifically aimed at solving complex motion planning problems in high-dimensional configuration spaces.
Janson L, Schmerling E, Clark A, Pavone M.   +3 more
europepmc   +5 more sources

Wildfire Spreading Simulator Using Fast Marching Algorithm [PDF]

SNE Simulation Notes Europe, 2021
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
Garrido Bullón, Luis Santiago, Carballeira López, Juan, Nicolás Martín, Carolina, Moreno Lorente, Luis Enrique   +3 more
openaire   +2 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