Sciweavers

450 search results - page 67 / 90
» Estimating Search Tree Size
Sort
View
PAMI
2007
125views more  PAMI 2007»
13 years 7 months ago
Matching by Linear Programming and Successive Convexification
—We present a novel convex programming scheme to solve matching problems, focusing on the challenging problem of matching in a large search range and with cluttered background. M...
Hao Jiang, Mark S. Drew, Ze-Nian Li
ICPR
2010
IEEE
13 years 11 months ago
3D Human Pose Reconstruction Using Millions of Exemplars
We propose a novel exemplar based method to estimate 3D human poses from single images by using only the joint correspondences. Due to the inherent depth ambiguity, estimating 3D ...
Hao Jiang
ICML
2007
IEEE
14 years 8 months ago
Combining online and offline knowledge in UCT
The UCT algorithm learns a value function online using sample-based search. The TD() algorithm can learn a value function offline for the on-policy distribution. We consider three...
Sylvain Gelly, David Silver
ICVS
2009
Springer
14 years 2 months ago
Visual Registration Method for a Low Cost Robot
Abstract— An autonomous mobile robot must face the correspondence or data association problem in order to carry out tasks like place recognition or unknown environment mapping. I...
David Aldavert, Arnau Ramisa, Ricardo Toledo, Ramo...
ICTAI
2010
IEEE
13 years 4 months ago
Unsupervised Greedy Learning of Finite Mixture Models
This work deals with a new technique for the estimation of the parameters and number of components in a finite mixture model. The learning procedure is performed by means of a expe...
Nicola Greggio, Alexandre Bernardino, Cecilia Lasc...