Sciweavers

VLSM
2005
Springer
13 years 10 months ago
Heuristically Driven Front Propagation for Geodesic Paths Extraction
In this paper we present a simple modification of the Fast Marching algorithm to speed up the computation using a heuristic. This modification leads to an algorithm that is simil...
Gabriel Peyré, Laurent D. Cohen
ICIP
2007
IEEE
14 years 6 months ago
Edge Preserving Filters using Geodesic Distances on Weighted Orthogonal Domains
We introduce a framework for image enhancement, which smooths images while preserving edge information. Domain (spatial) and range (feature) information are combined in one single...
Luca Bertelli, B. S. Manjunath
ICCV
2007
IEEE
14 years 6 months ago
Finding a Closed Boundary by Growing Minimal Paths from a Single Point on 2D or 3D Images
In this paper, we present a new method for segmenting closed contours and surfaces. Our work builds on a variant of the Fast Marching algorithm. First, an initial point on the des...
Fethallah Benmansour, Stephane Bonneau, Laurent D....