Results 261 to 270 of about 5,484 (295)
Topological Data Structure: The Fast Marching Example
Proceedings of the 18th International Joint Conference on Computer Vision, Imaging and Computer Graphics Theory and Applications, 2023 International audienceThis article lies in the field of front propagation algorithms on a surface represented by triangle meshes. An implementation of the fast marching algorithm using a topological structure, the generalized maps or gmaps, as the data ...
Sofian Toujja +3 more
openaire +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Fast Marching Adaptive Sampling
IEEE Robotics and Automation Letters, 2017Achallenging problem for autonomous exploration is estimating the utility of future samples. In this paper, we consider the problem of placing observations over an initially unknown continuous cost field to find the least-cost path from a fixed start to a fixed goal position.
Nicholas R. J. Lawrance +2 more
openaire +3 more sources
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
A fast marching approach to multidimensional extrapolation
Journal of Computational Physics, 2014zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jeremy O. McCaslin +2 more
openaire +1 more source
GO solutions with Fast Marching
2016 10th European Conference on Antennas and Propagation (EuCAP), 2016We develop an approach for a fast and accurate determination of the Geometrical Optics solutions to Maxwell's equations based on the determination of the eikonal function. The approach, here presented for a 3D problem, is devised to handle scenarios involving complex spatially varying refraction indices.
CAPOZZOLI, AMEDEO +3 more
openaire +2 more sources
Fast Marching to Moving Object Location
1999In this paper we address two important problems in motion analysis: the detection of moving objects and their localization. Statis- tical and level set approaches are adopted in order to formulate these problems. For the change detection problem, the inter-frame difference is modeled by a mixture of two zero-mean Laplacian distributions.
Eftychios Sifakis, George Tziritas
openaire +1 more source
Fast marching for hybrid control
Proceedings of the 1999 IEEE International Symposium on Computer Aided Control System Design (Cat. No.99TH8404), 2003This paper describes an approach to solving optimal hybrid control problems using level set methods. Level set methods are a powerful set of 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
openaire +1 more source
Fast Marching Based Superpixels Generation
2019In this article, we present a fast-marching based algorithm for generating superpixel (FMS) partitions of images. The idea behind the algorithm is to draw an analogy between waves propagating in an heterogeneous medium and regions growing on an image at a rate depending on the local color and texture.
Chang, Kaiwen, Figliuzzi, Bruno
openaire +2 more sources
Fast Marching for Robust Surface Segmentation
2011We propose a surface segmentation method based on Fast Marching Farthest Point Sampling designed for noisy, visually reconstructed point clouds or laser range data. Adjusting the distance metric between neighboring vertices we obtain robust, edge-preserving segmentations based on local curvature.
Falko Schindler, Wolfgang Förstner
openaire +1 more source
Fast march tests for defects in resistive memory
Proceedings of the 2015 IEEE/ACM International Symposium on Nanoscale Architectures (NANOARCH´15), 2015Resistive Memory is a promising candidate to several applications. However, is prone to high defects due to the nanoscale fabrication uncertainties. Test time of traditional testing techniques is dominated by writes which are slower than reads. Fast March tests for defects in resistive memory are proposed in this paper. Test application time is reduced
Seyed Nima Mozaffari +2 more
openaire +1 more source