10054 search results - page 1651 / 2011 » On the Complexity of Function Learning |
208
click to vote
CVPR
2007
IEEE
16 years 9 months ago
2007
IEEE
Belief propagation over pairwise connected Markov Random Fields has become a widely used approach, and has been successfully applied to several important computer vision problems....
176
click to vote
CVPR
2007
IEEE
16 years 9 months ago
2007
IEEE
Conventional mutual information (MI)-based registration using pixel intensities is time-consuming and ignores spatial information, which can lead to misalignment. We propose a met...
197
click to vote
CVPR
2007
IEEE
16 years 9 months ago
2007
IEEE
We boost the efficiency and robustness of distributionbased matching by random subsampling which results in the minimum number of samples required to achieve a specified probabili...
187
click to vote
CVPR
2007
IEEE
16 years 9 months ago
2007
IEEE
In this paper we introduce two new methods for solving binary quadratic problems. While spectral relaxation methods have been the workhorse subroutine for a wide variety of comput...
199
click to vote
ICCV
2005
IEEE
16 years 9 months ago
2005
IEEE
In this paper we consider the problem of reconstructing the 3D position and surface normal of points on an unknown, arbitrarily-shaped refractive surface. We show that two viewpoi...