Results 261 to 270 of about 3,580 (288)
IEEE Transactions on Pattern Analysis and Machine Intelligence, 2007 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 improved version of the fast marching method (FMM) that is highly accurate
M Sabry Hassouna, A A Farag
exaly +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
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
2004
The fast marching method was introduced by Sethian [190, 191, 192] as a computationally efficient solution to eikonal equations on flat domains. A related method was presented by Tsitsiklis in [205]. The fast marching method was extended to triangulated surfaces by Kimmel and Sethian in [112].
openaire +1 more source
The fast marching method was introduced by Sethian [190, 191, 192] as a computationally efficient solution to eikonal equations on flat domains. A related method was presented by Tsitsiklis in [205]. The fast marching method was extended to triangulated surfaces by Kimmel and Sethian in [112].
openaire +1 more source
Guided depth enhancement via a fast marching method
Image and Vision Computing, 2013Range imaging sensors such as Kinect and time-of-flight cameras can produce aligned depth and color images in real time. However, the depth maps captured by such sensors contain numerous invalid regions and suffer from heavy noise. These defects more or less influence the use of depth information in practical applications. In order to enhance the depth
Xiaojin Gong +3 more
openaire +1 more source
A Massive Parallel Fast Marching Method
2016In this paper we present a novel technique based on domain decomposition which enables us to perform the fast marching method (FMM) [4] on massive parallel high performance computers (HPC) for given triangulated geometries. The FMM is a widely used numerical method and one of the fastest serial state-of-the-art techniques for computing the solution to ...
Petr Kotas +4 more
openaire +1 more source
Robust Fast Marching Method Based on Anisotropic Diffusion
Third International Conference on Natural Computation (ICNC 2007), 2007As the most powerful numerical techniques for analyzing and solving interface evolution problems, level sets display interesting elastic behaviors and level set method can handle topological changes based on partial differential equations. But there are still some difficulties it must face up to, such as poor image contrast, noise, and missing or ...
Hongwei Zhang +5 more
openaire +1 more source
Segmentation of hand radiographs using fast marching methods
SPIE Proceedings, 2006Rheumatoid Arthritis is one of the most common chronic diseases. Joint space width in hand radiographs is evaluated to assess joint damage in order to monitor progression of disease and response to treatment. Manual measurement of joint space width is time-consuming and highly prone to inter- and intra-observer variation.
Hong Chen 0005, Carol L. Novak
openaire +1 more source
An adaptive domain-decomposition technique for parallelization of the fast marching method
Applied Mathematics and Computation, 2011zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Breuss +6 more
openaire +4 more sources