Sciweavers

3946 search results - page 451 / 790
» The computational complexity of choice sets
Sort
View
ECCV
2006
Springer
16 years 8 months ago
Carved Visual Hulls for Image-Based Modeling
Abstract. This article presents a novel method for acquiring high-quality solid models of complex 3D shapes from multiple calibrated photographs. After the purely geometric constra...
Yasutaka Furukawa, Jean Ponce
ECCV
2002
Springer
16 years 8 months ago
A Probabilistic Theory of Occupancy and Emptiness
This paper studies the inference of 3D shape from a set of ? noisy photos. We derive a probabilistic framework to specify what one can infer about 3D shape for arbitrarily-shaped, ...
Rahul Bhotika, David J. Fleet, Kiriakos N. Kutulak...
ECCV
2000
Springer
16 years 8 months ago
Stochastic Tracking of 3D Human Figures Using 2D Image Motion
A probabilistic method for tracking 3D articulated human figures in monocular image sequences is presented. Within a Bayesian framework, we define a generative model of image appea...
Hedvig Sidenbladh, Michael J. Black, David J. Flee...
RECOMB
2009
Springer
16 years 7 months ago
Finding Biologically Accurate Clusterings in Hierarchical Tree Decompositions Using the Variation of Information
Abstract. Hierarchical clustering is a popular method for grouping together similar elements based on a distance measure between them. In many cases, annotation information for som...
Saket Navlakha, James Robert White, Niranjan Nagar...
DCC
2005
IEEE
16 years 6 months ago
Towards Practical Minimum-Entropy Universal Decoding
Minimum-entropy decoding is a universal decoding algorithm used in decoding block compression of discrete memoryless sources as well as block transmission of information across di...
Todd P. Coleman, Muriel Médard, Michelle Ef...