1390 search results - page 102 / 278 » Computing the depth of a flat |
140
click to vote
ICPR
2010
IEEE
15 years 8 months ago
2010
IEEE
This paper proposes a method for computing a quasi-dense set of matching points between three views of a scene. The method takes a sparse set of seed matches between pairs of view...
144
click to vote
APPROX
2008
Springer
15 years 7 months ago
2008
Springer
We study the complexity of locally list-decoding binary error correcting codes with good parameters (that are polynomially related to information theoretic bounds). We show that co...
184
click to vote
CVPR
2011
IEEE
15 years 1 months ago
2011
IEEE
Unsupervised categorization of objects is a fundamental problem in computer vision. While appearance-based methods have become popular recently, other important cues like function...
157
Voted
SIGGRAPH
2000
ACM
15 years 9 months ago
2000
ACM
This paper studies the problem of plenoptic sampling in imagebased rendering (IBR). From a spectral analysis of light field signals and using the sampling theorem, we mathematica...
142
click to vote
ICRA
2010
IEEE
15 years 3 months ago
2010
IEEE
We propose a novel solution to object detection, localization and pose estimation with applications in robot vision. The proposed method is especially applicable when the objects ...