Sciweavers

104 search results - page 15 / 21
» Intersecting convex sets by rays
Sort
View
CORR
2010
Springer
148views Education» more  CORR 2010»
13 years 9 months ago
Perturbation Resilience and Superiorization of Iterative Algorithms
Iterative algorithms aimed at solving some problems are discussed. For certain problems, such as finding a common point in the intersection of a finite number of convex sets, there...
Yair Censor, R. Davidi, Gabor T. Herman
ICCS
2005
Springer
14 years 3 months ago
Multiresolution Reconstruction of Pipe-Shaped Objects from Contours
We reconstruct pipe-shaped objects from a set of contours, each of which is extracted from an image representing a slice sampled from 3D volume data. The contours are formed by con...
Kyung Ha Min, In-Kwon Lee
CVIU
2006
169views more  CVIU 2006»
13 years 9 months ago
A generic structure-from-motion framework
We introduce a generic structure-from-motion approach based on a previously introduced, highly general imaging model, where cameras are modeled as possibly unconstrained sets of p...
Srikumar Ramalingam, Suresh K. Lodha, Peter F. Stu...
IJCV
2006
194views more  IJCV 2006»
13 years 9 months ago
Reconstructing Open Surfaces from Image Data
In this paper a method for fitting open surfaces to data obtained from images is presented using a level set representation of the surface. This is done by tracking a curve, repres...
Jan Erik Solem, Anders Heyden
FOCS
2006
IEEE
14 years 3 months ago
On a Geometric Generalization of the Upper Bound Theorem
We prove an upper bound, tight up to a factor of 2, for the number of vertices of level at most in an arrangement of n halfspaces in Rd , for arbitrary n and d (in particular, the...
Uli Wagner