Sciweavers

397 search results - page 21 / 80
» Geometrical plenoptic sampling
Sort
View
TIP
2010
155views more  TIP 2010»
15 years 4 days ago
Laplacian Regularized D-Optimal Design for Active Learning and Its Application to Image Retrieval
—In increasingly many cases of interest in computer vision and pattern recognition, one is often confronted with the situation where data size is very large. Usually, the labels ...
Xiaofei He
109
Voted
JMLR
2006
143views more  JMLR 2006»
15 years 1 months ago
Geometric Variance Reduction in Markov Chains: Application to Value Function and Gradient Estimation
We study a sequential variance reduction technique for Monte Carlo estimation of functionals in Markov Chains. The method is based on designing sequential control variates using s...
Rémi Munos
126
Voted
RSA
2011
157views more  RSA 2011»
14 years 8 months ago
The cover time of random geometric graphs
We study the cover time of random geometric graphs. Let I(d) = [0, 1]d denote the unit torus in d dimensions. Let D(x, r) denote the ball (disc) of radius r. Let Υd be the volume...
Colin Cooper, Alan M. Frieze
111
Voted
IROS
2009
IEEE
200views Robotics» more  IROS 2009»
15 years 8 months ago
Fast geometric point labeling using conditional random fields
— In this paper we present a new approach for labeling 3D points with different geometric surface primitives using a novel feature descriptor – the Fast Point Feature Histogram...
Radu Bogdan Rusu, Andreas Holzbach, Nico Blodow, M...
CVPR
2007
IEEE
16 years 3 months ago
High-dimensional statistical distance for region-of-interest tracking: Application to combining a soft geometric constraint with
This paper deals with region-of-interest (ROI) tracking in video sequences. The goal is to determine in successive frames the region which best matches, in terms of a similarity m...
Sylvain Boltz, Eric Debreuve, Michel Barlaud