Results 251 to 260 of about 2,805 (284)
Underwater path planing using fast marching algorithms
In this paper, new tools for obstacle avoidance and path planning for underwater vehicles are presented. The authors' technique, based on a level set formulation of the path planning problem, extracts optimal paths from complex and continuous environments in a complete and consistent manner.
C. Petres +3 more
openaire +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Moving object localisation using a multi-label fast marching algorithm
Signal Processing: Image Communication, 2001In this paper, we address two problems crucial to motion analysis: the detection of moving objects and their localisation. Statistical and level set approaches are adopted in formulating these problems. For the change detection problem, the inter-frame difference is modelled by a mixture of two zero-mean Laplacian distributions.
Georgios Tziritas
exaly +2 more sources
Automatic image segmentation with Anisotropic Fast Marching algorithm and geodesic voting
2015 IEEE International Conference on Image Processing (ICIP), 2015Segmentation methods based on energy minimization techniques like geodesic active contour model generally needs manual intervention to provide initial points to calculate minimal paths. In this paper, we propose complete automation of segmentation. Seeds and Tips are automatically detected, and geodesics are calculated using Anisotropic Fast Marching ...
Vijaya K Ghorpade, Laurent D Cohen
exaly +2 more sources
IEEE/ASME Transactions on Mechatronics, 2021
This article presents a dual fast marching tree algorithm that consists of constrained fast marching tree planning in a Cartesian space (C_FMT∗) and human-like fast marching tree planning in self-motion manifolds (H_FMT∗) for human-like motion planning for anthropomorphic arms with task constraints.
Jing Xia, Zainan Jiang, Rongjun Zhu
exaly +2 more sources
This article presents a dual fast marching tree algorithm that consists of constrained fast marching tree planning in a Cartesian space (C_FMT∗) and human-like fast marching tree planning in self-motion manifolds (H_FMT∗) for human-like motion planning for anthropomorphic arms with task constraints.
Jing Xia, Zainan Jiang, Rongjun Zhu
exaly +2 more sources
AbstractLocal surface reconstruction by the Marching Cubes algorithm and its derivatives has a well known ambiguity, which prevents constructed surfaces from being closed and simple. We investigate this ambiguity assuming that a 3D image samples well‐defined objects.
S. Röll, Axel Haase, Markus von Kienlin
openaire +2 more sources
A Novel Fast Marching Segmentation Algorithm for Pulmonary Nodules in Chest Radiographs
2008Segmenting nodule region in chest radiographs is a particularly challenging problem due to the complexity and variability of human anatomy. In this work, in order to solve the boundary leakage problem in conventional fast marching method, we present a novel fast marching segmentation algorithm for pulmonary nodule in chest radiographs.
Qiyong Guo, Mantao Xu, Jiwu Zhang
exaly +2 more sources
Anisotropic Fast-Marching on Cartesian Grids Using Lattice Basis Reduction
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 box domain. The algorithm has a logarithmic complexity in the
Jean-Marie Mirebeau
exaly +3 more sources
A fast marching algorithm for hybrid systems
Proceedings of the 38th IEEE Conference on Decision and Control (Cat. No.99CH36304), 2003Describes an approach to solving optimal hybrid control problems using level set methods. Level set methods are powerful techniques for generating equipotential contours with applications in the realm of fluid mechanics, computer vision, material science, robotics, and geometry.
M.S. Branicky, R. Hebbar, G. Zhang
openaire +1 more source

