A fast local descriptor for dense matching

A fast local descriptor for dense matching,10.1109/CVPR.2008.4587673,Engin Tola,Vincent Lepetit,Pascal Fua

A fast local descriptor for dense matching   (Citations: 72)
BibTex | RIS | RefWorks Download
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 esti- mation algorithm and this yields better wide-baseline per- formance than the commonly used correlation windows for which the size is hard to tune. As a result, unlike compet- ing 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 cap- tured by video streams. Ourdescriptoris inspiredfrom earlieronessuchasSIFT and GLOH but can be computed much faster for our pur- poses. 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 im- age pairs of different resolutions and we show that good reconstructions are achieved even with only two low quality images.
Cumulative Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.
Sort by: