Results 251 to 260 of about 4,163 (288)
A Generalized Fast Marching Method on Unstructured Triangular Meshes
SIAM Journal on Numerical Analysis, 2013 In this paper we extend the generalized fast marching method (GFMM) presented in [E. Carlini et al., SIAM J. Numer. Anal., 46 (2008), pp. 2920--2952] to unstructured meshes. The GFMM generalizes the classical fast marching method, in the sense that it can be applied to propagate interfaces with time-dependent and changing sign velocity.
CARLINI, Elisabetta +2 more
openaire +3 more sources
An Image Inpainting Technique Based on the Fast Marching Method [PDF]
Journal of Graphics Tools, 2004 Digital inpainting provides a means for reconstruction of small damaged portions of an image. Although the inpainting basics are straightforward, most inpainting techniques published in the literature are complex to understand and implement. We present here a new algorithm for digital inpainting based on the fast marching method for level set ...
Telea, Alexandru +2 more
openaire +2 more sources
A Fast Marching Method for the Area Based Affine Distance
Journal of Mathematical Imaging and Vision, 2007 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Moacyr A. H. B. da Silva +3 more
openaire +3 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Distributed fast marching methods
Proceedings of the 15th ACM Mardi Gras conference: From lightweight mash-ups to lambda grids: Understanding the spectrum of distributed computing requirements, applications, tools, infrastructures, interoperability, and the incremental adoption of key capabilities, 2008Fast Marching represents a very efficient technique for solving the front propagation problems which can be formulated as boundary value partial differential equations |∇T(x, y)| = 1/F(x, y) on Ω, with Dirichlet boundary condition T(x, y) = 0 on ∂Ω. We show that the problem of computing the distance map across a smooth sampling domain can be posed in ...
Maria Cristina Tugurlan, Blaise Bourdin
openaire +1 more source
On the implementation of fast marching methods for 3D lattices [PDF]
, 2001 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 discrete lattice of a front which is monotonously expanding. Applications of the method include arrival time computation and the construction of distance fields for 2D or 3D objects ...
Bærentzen, Jakob Andreas
openaire +2 more sources
Robust skeletonization using the fast marching method
IEEE International Conference on Image Processing 2005, 2005We have recently developed a level set based-framework for computing medial curves or curve skeletons CS for arbitrary 2D shapes as well as tubular and articulated 3D objects. The proposed framework is robust, fully automatic, computationally efficient, and produces curve skeletons that are connected, centered, thin, and less sensitive to boundary ...
M. Sabry Hassouna, Aly A. Farag
openaire +1 more source
SIAM Review, 1999
The author considers numerical methods for solving the nonlinear eikonal equation \[ |\nabla u(x)|= F(x)\quad\text{in }\Omega\subset \mathbb{R}^2\quad\text{or }\mathbb{R}^3,\tag{1} \] under given boundary conditions \(u=g\) on some prescribed curve or surface \(\Gamma\) in \(\Omega\).
openaire +2 more sources
The author considers numerical methods for solving the nonlinear eikonal equation \[ |\nabla u(x)|= F(x)\quad\text{in }\Omega\subset \mathbb{R}^2\quad\text{or }\mathbb{R}^3,\tag{1} \] under given boundary conditions \(u=g\) on some prescribed curve or surface \(\Gamma\) in \(\Omega\).
openaire +2 more sources
Remarks on the implementation of the fast marching method
IMA Journal of Numerical Analysis, 2008The fast marching algorithm computes an approximate solution to the eikonal equation in O(N log N) time, where the factor log N is due to the administration of a priority queue. Recently, Yatziv et al. (2006, J. Comput. Phys., 212, 393-399) have suggested using an untidy priority queue, reducing the overall complexity to O(N) at the price of a small ...
C. Rasch, T. Satzger
openaire +1 more source
A fast marching method for reservoir simulation
Computational Geosciences, 2000zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Karlsen, K. Hvistendahl +2 more
openaire +2 more sources
Shape from self-calibration and Fast Marching Method
2008 19th International Conference on Pattern Recognition, 2008Shape-from-shading methods recover 3-D shape from intensity images. Often, Lambertian reflectance is assumed. The Lambertian assumption is attractive because it simplifies the analysis. Alternatively, non-Lambertian reflectance, including specularity, is accommodated in methods that measure reflectance empirically either using a separate calibration ...
Yuji Iwahori +4 more
openaire +1 more source