Sciweavers

219 search results - page 29 / 44
» Approximating and Intersecting Surfaces from Points
Sort
View
ICIP
2005
IEEE
14 years 11 months ago
Greedy non-linear approximation of the plenoptic function for interactive transmission of 3D scenes
We consider an interactive browsing environment, with greedy optimization of a current view, conditioned on the availability of previously transmitted information for other (possi...
Pietro Zanuttigh, Nicola Brusco, David Taubman, Gu...

Publication
700views
15 years 6 months ago
Optimal Approximations by Piecewise Smooth Functions and Associated Variational Problems - [ Mumford-Shah ]
"The purpose of this paper is to introduce and study the most basic properties of three new variational problems which are suggested by applications to computer vision. In com...
David Mumford and Jayant Shah
IJCAI
1989
13 years 10 months ago
A Homogeneous Framework for Visual Recognition
A homogeneous paradigm for evidence integration is presented, and a vision system to recognize 3D objects is demonstrated using this paradigm. A new concept called generalizedfeat...
Rick Kjeldsen, Ruud M. Bolle, Andrea Califano, Rus...
COMPGEOM
2009
ACM
14 years 4 months ago
Near-linear approximation algorithms for geometric hitting sets
Given a set system (X, R), the hitting set problem is to find a smallest-cardinality subset H ⊆ X, with the property that each range R ∈ R has a non-empty intersection with H...
Pankaj K. Agarwal, Esther Ezra, Micha Sharir
ECCV
2010
Springer
13 years 9 months ago
Geodesic Shape Retrieval via Optimal Mass Transport
This paper presents a new method for 2-D and 3-D shape retrieval based on geodesic signatures. These signatures are high dimensional statistical distributions computed by extractin...
Julien Rabin, Gabriel Peyré, Laurent D. Coh...