Sciweavers

919 search results - page 2 / 184
» Efficient computation of view subsets
Sort
View
ECCV
2004
Springer
14 years 9 months ago
Interpolating Novel Views from Image Sequences by Probabilistic Depth Carving
Abstract. We describe a novel approach to view interpolation from image sequences based on probabilistic depth carving. This builds a multivalued representation of depth for novel ...
Annie Yao, Andrew Calway
ICCV
2009
IEEE
15 years 13 days ago
Efficient subset selection based on the Renyi entropy
Many machine learning algorithms require the summation of Gaussian kernel functions, an expensive operation if implemented straightforwardly. Several methods have been proposed t...
Vlad I. Morariu1, Balaji V. Srinivasan, Vikas C. R...
PODC
2000
ACM
13 years 11 months ago
Efficient generation of all regular non-dominated coteries
A coterie is a family of subsets such that every pair of subsets in it has at least one element in common but neither is a subset of the other. We introduce an operator , which
Kazuhisa Makino, Tiko Kameda
CORR
2010
Springer
138views Education» more  CORR 2010»
13 years 7 months ago
On building minimal automaton for subset matching queries
We address the problem of building an index for a set D of n strings, where each string location is a subset of some finite integer alphabet of size , so that we can answer effici...
Kimmo Fredriksson
CVPR
2007
IEEE
14 years 9 months ago
Efficiently Determining Silhouette Consistency
Volume intersection is a frequently used technique to solve the Shape-From-Silhouette problem, which constructs a 3D object estimate from a set of silhouettes taken with calibrate...
Li Yi, David W. Jacobs