A wide range of computer vision applications such as distance field computation, shape from shading, and shape representation require an accurate solution of a particular Hamilton...
Abstract. In this paper, an adaptation of the eikonal equation is proposed by considering the latter on weighted graphs of arbitrary structure. This novel approach is based on a fa...
Vinh-Thong Ta, Abderrahim Elmoataz, Olivier Lezora...
The eikonal equation and variants of it are of significant interest for problems in computer vision and image processing. It is the basis for continuous versions of mathematical m...
Kaleem Siddiqi, Sylvain Bouix, Allen Tannenbaum, S...
"A computational study of the Fast Marching and the Fast Sweeping methods for the Eikonal equation is given. It is shown that even though Fast Sweeping requires asymptotically...
This technical report discusses Sethian's Fast Marching Method and its higher accuracy variant. Both methods may be used to compute the arrival times at the points of a discre...
Detailed explanation of the Fast Marching Methods, which can be used to efficiently solve the Eikonal equation that models moving interfaces whose motion is either monotonically in...
In this paper, we present a novel framework for computing centerlines for both 2D and 3D shape analysis. The framework works as follows: an object centerline point is selected auto...
In this paper, we present a novel framework for computing centerlines for both 2D and 3D shape analysis. The framework works as follows: an object centerline point is
selected aut...
In this paper, we propose a new variational framework for computing continuous curve skeletons from discrete objects that are suitable for structural shape representation.
We have...
A wide range of computer vision applications require an accurate solution of a particular Hamilton-Jacobi (HJ) equation known as the Eikonal equation. In this paper, we propose an ...