A fast local descriptor for dense matching

11 years 4 months ago
A fast local descriptor for dense matching
We introduce a novel local image descriptor designed for dense wide-baseline matching purposes. We feed our descriptors to a graph-cuts based dense depth map estimation algorithm and this yields better wide-baseline performance than the commonly used correlation windows for which the size is hard to tune. As a result, unlike competing techniques that require many high-resolution images to produce good reconstructions, our descriptor can compute them from pairs of low-quality images such as the ones captured by video streams. Our descriptor is inspired from earlier ones such as SIFT and GLOH but can be computed much faster for our purposes. Unlike SURF which can also be computed efficiently at every pixel, it does not introduce artifacts that degrade the matching performance. Our approach was tested with ground truth laser scanned depth maps as well as on a wide variety of image pairs of different resolutions and we show that good reconstructions are achieved even with only two low qua...
Engin Tola, Vincent Lepetit, Pascal Fua
Added 12 Oct 2009
Updated 12 Oct 2009
Type Conference
Year 2008
Where CVPR
Authors Engin Tola, Vincent Lepetit, Pascal Fua
Comments (0)