Sciweavers

754 search results - page 120 / 151
» Local Monotonicity Reconstruction
Sort
View
ECCV
2008
Springer
15 years 11 months ago
Anisotropic Geodesics for Perceptual Grouping and Domain Meshing
This paper shows how computational Riemannian manifold can be used to solve several problems in computer vision and graphics. Indeed, Voronoi segmentations and Delaunay graphs comp...
Sébastien Bougleux, Gabriel Peyré, L...
COMPGEOM
2006
ACM
15 years 3 months ago
Provably good sampling and meshing of Lipschitz surfaces
In the last decade, a great deal of work has been devoted to the elaboration of a sampling theory for smooth surfaces. The goal was to ensure a good reconstruction of a given surf...
Jean-Daniel Boissonnat, Steve Oudot

Publication
400views
16 years 4 months ago
Enforcing Integrability by Error Correction using L1-minimization
Surface reconstruction from gradient fields is an important final step in several applications involving gradient manipulations and estimation. Typically, the resulting gradient ...
Dikpal Reddy, Amit K. Agrawal, Rama Chellappa
67
Voted
ICPR
2004
IEEE
15 years 10 months ago
Alignment of Multiple Non-Overlapping Axially Symmetric 3D Datasets
Uknown to us, an axially-symmetric surface is broken into disjoint pieces along a set of break-curves, i.e., the curves along which the surface locally breaks into two pieces. A s...
Andrew R. Willis, David B. Cooper
STOC
2007
ACM
111views Algorithms» more  STOC 2007»
15 years 10 months ago
Low-end uniform hardness vs. randomness tradeoffs for AM
In 1998, Impagliazzo and Wigderson [IW98] proved a hardness vs. randomness tradeoff for BPP in the uniform setting, which was subsequently extended to give optimal tradeoffs for t...
Ronen Shaltiel, Christopher Umans