48 search results - page 2 / 10 » A fast local descriptor for dense matching |
CVPR
2004
IEEE
14 years 9 months ago
2004
IEEE
Traditionally, the problem of stereo matching has been addressed either by a local window-based approach or a dense pixel-based approach using global optimization. In this paper, ...
MICCAI
2008
Springer
14 years 8 months ago
2008
Springer
Abstract. In this paper, we propose a set of new generic automated processing tools to characterise the local asymmetries of anatomical structures (represented by surfaces) at an i...
ECCV
2010
Springer
14 years 6 days ago
2010
Springer
Abstract. PatchMatch is a fast algorithm for computing dense approximate nearest neighbor correspondences between patches of two image regions [1]. This paper generalizes PatchMatc...
IJCV
2002
13 years 6 months ago
2002
This paper presents a fast and reliable stereo matching algorithm which produces a dense disparity map by using fast cross correlation, rectangular subregioning (RSR) and 3D maxim...
CVPR
2011
IEEE
13 years 2 months ago
2011
IEEE
Feature trajectories have shown to be efficient for representing videos. Typically, they are extracted using the KLT tracker or matching SIFT descriptors between frames. However,...