Deformable Spatial Pyramid Matching for Fast Dense Correspondences

CVPR, pp. 2307-2314, 2013.

Cited by: 253|Views28
EI WOS

Abstract:

We introduce a fast deformable spatial pyramid (DSP) matching algorithm for computing dense pixel correspondences. Dense matching methods typically enforce both appearance agreement between matched pixels as well as geometric smoothness between neighboring pixels. Whereas the prevailing approaches operate at the pixel level, we propose a ...More

Code:

Data:

Your rating :
0

 

Tags
Comments