1024 search results - page 6 / 205 » The Generalized PatchMatch Correspondence Algorithm |
78
Voted
ICCV
2005
IEEE
15 years 11 months ago
2005
IEEE
Most dense stereo correspondence algorithms start by establishing discrete pixel matches and later refine these matches to sub-pixel precision. Traditional sub-pixel refinement me...
105
click to vote
IPCO
1998
14 years 11 months ago
1998
Abstract. A well studied and difficult class of scheduling problems concerns parallel machines and precedence constraints. In order to model more realistic situations, we consider ...
CVPR
1997
IEEE
15 years 11 months ago
1997
IEEE
We present a method for computing dense visual correspondence based on general assumptions about scene geometry. Our algorithm does not rely on correlation, and uses a variable re...
ICASSP
2011
IEEE
14 years 1 months ago
2011
IEEE
In this paper, we rst present a theorem that HOSVD-based representation of high-order tensor data provides a robust framework that can be used for a uni ed representation of the H...
GEOINFORMATICA
1998
14 years 9 months ago
1998
The nature of map generalization may be non-uniform along the length of an individual line, requiring the application of methods that adapt to the local geometry and the geographi...