Results 41 to 50 of about 79,971 (321)
Fast Marching Techniques for Teaming UAV’s Applications in Complex Terrain
Drones, 2023 In this paper, we present a study on coverage missions carried out by UAV formations in 3D environments. These missions are designed to be applied in tracking and search and rescue missions, especially in the case of accidents.
Santiago Garrido +5 more
doaj +1 more source
Robust semi-automated path extraction for visualising stenosis of the coronary arteries [PDF]
, 2008 Computed tomography angiography (CTA) is useful for diagnosing and planning treatment of heart disease. However, contrast agent in surrounding structures (such as the aorta and left ventricle) makes 3-D visualisation of the coronary arteries difficult ...
Achenbach +43 more
core +2 more sources
Teleseismic Tomography for Imaging the Upper Mantle Beneath Northeast China
Applied Sciences, 2020 Tomographic imaging technology is a geophysical inversion method. According to the ray scanning, this method carries on the inversion calculation to the obtained information, and reconstructs the image of the parameter distribution rule of elastic wave ...
Zhuo Jia, Gongbo Zhang
doaj +1 more source
Manitest: Are classifiers really invariant? [PDF]
, 2015 Invariance to geometric transformations is a highly desirable property of automatic classifiers in many image recognition tasks. Nevertheless, it is unclear to which extent state-of-the-art classifiers are invariant to basic transformations such as ...
Fawzi, Alhussein, Frossard, Pascal
core +2 more sources
Fast-Marching Methods for Curvature Penalized Shortest Paths [PDF]
Journal of Mathematical Imaging and Vision, 2017 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Fast marching methods for the continuous traveling salesman problem [PDF]
Proceedings of the National Academy of Sciences, 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, J. A.
openaire +2 more sources
Anisotropic Fast-Marching on cartesian grids using Lattice Basis Reduction [PDF]
, 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 +4 more sources
Motion Planning Using Fast Marching Squared Method
, 2015 Robotic motion planning have been, and still is, a very intense research field. Many problems have been already solved and even real-time, optimal motion planning algorithms have been proposed and successfully tested in real-world scenarios. However, other problems are not satisfactory solved yet and also new motion planning subproblems are appearing ...
Garrido Bullón, Luis Santiago +2 more
openaire +3 more sources
Sub-Riemannian Fast Marching in SE(2)
, 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.
E Franken +9 more
core +1 more source
Nilpotent Approximations of Sub-Riemannian Distances for Fast Perceptual Grouping of Blood Vessels in 2D and 3D [PDF]
, 2017 We propose an efficient approach for the grouping of local orientations (points on vessels) via nilpotent approximations of sub-Riemannian distances in the 2D and 3D roto-translation groups $SE(2)$ and $SE(3)$.
Bekkers, Erik J. +2 more
core +2 more sources