Sciweavers

48 search results - page 2 / 10
» A wide-range algorithm for minimal triangulation from an arb...
Sort
View
SIAMIS
2011
13 years 4 days ago
NESTA: A Fast and Accurate First-Order Method for Sparse Recovery
Abstract. Accurate signal recovery or image reconstruction from indirect and possibly undersampled data is a topic of considerable interest; for example, the literature in the rece...
Stephen Becker, Jérôme Bobin, Emmanue...
CVPR
2003
IEEE
14 years 7 months ago
Representation and Detection of Deformable Shapes
We describe some techniques that can be used to represent and detect deformable shapes in images. The main difficulty with deformable template models is the very large or infinite...
Pedro F. Felzenszwalb
VIS
2007
IEEE
111views Visualization» more  VIS 2007»
14 years 6 months ago
Construction of Simplified Boundary Surfaces from Serial-sectioned Metal Micrographs
We present a method for extracting boundary surfaces from segmented cross-section image data. We use a constrained Potts model to interpolate an arbitrary number of region boundar...
Scott E. Dillard, John F. Bingert, Dan Thoma, B...
GIS
2011
ACM
12 years 8 months ago
Embedding rivers in triangulated irregular networks with linear programming
Data conflation is a major issue in GIS: different geospatial data sets covering overlapping regions, possibly obtained from different sources and using different acquisition ...
Marc J. van Kreveld, Rodrigo I. Silveira
ESA
2010
Springer
246views Algorithms» more  ESA 2010»
13 years 6 months ago
Estimating the Average of a Lipschitz-Continuous Function from One Sample
We study the problem of estimating the average of a Lipschitz continuous function f defined over a metric space, by querying f at only a single point. More specifically, we explore...
Abhimanyu Das, David Kempe