Given a Morse function over a 2-manifold with or without boundary, the Reeb graph is obtained by contracting the connected components of the level sets to points. We prove tight u...
Kree Cole-McLaughlin, Herbert Edelsbrunner, John H...
We present a novel non-parametric unsupervised segmentation algorithm based on Region Competition [21]; but implemented within a Level Sets framework [11]. The key novelty of the ...
The Reeb graph is a useful tool in visualizing real-valued data obtained from computational simulations of physical processes. We characterize the evolution of the Reeb graph of a...
Herbert Edelsbrunner, John Harer, Ajith Mascarenha...
We study the evolution of T-spline level sets (i.e, implicitly defined T-spline curves and surfaces). The use of T-splines leads to a sparse representation of the geometry and al...
—Path planning for mobile robots is a well researched problem for over three decades. In this paper, we test and evaluate a new approach based on Shi and Karl Level Sets for mobi...
Morphological operators designed for grey-scale functions process every points of the space identically whatever their luminance. In many situations however, it is interesting to ...
We present a region-based active contour detection algorithm
for objects that exhibit relatively homogeneous photometric
characteristics (e.g. smooth color or gray levels),
embe...
Ganesh Sundaramoorthi, Stefano Soatto, Anthony Yez...
In this work, we study the extraction of semantic objects using morphological tools. We decompose the image into its level sets and level lines (the borders of the level sets). Sp...
Particle filters encode a time-evolving probability density by maintaining a random sample from it. Level sets represent closed curves as zero crossings of functions of two variab...
In this paper a method for fitting open surfaces to an unorganized set of data points is presented using a level set representation of the surface. This is done by tracking a curv...