Issue No. 05 - May (2010 vol. 32)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TPAMI.2009.77
Engin Tola , Ecole Polytechnic Fédérale de Lausanne (EPFL), Lausanne
Pascal Fua , Ecole Polytechnic Fédérale de Lausanne (EPFL), Lausanne
Vincent Lepetit , Ecole Polytechnic Fédérale de Lausanne (EPFL), Lausanne
In this paper, we introduce a local image descriptor, DAISY, which is very efficient to compute densely. We also present an EM-based algorithm to compute dense depth and occlusion maps from wide-baseline image pairs using this descriptor. This yields much better results in wide-baseline situations than the pixel and correlation-based algorithms that are commonly used in narrow-baseline stereo. Also, using a descriptor makes our algorithm robust against many photometric and geometric transformations. 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 when used densely. It is important to note that our approach is the first algorithm that attempts to estimate dense depth maps from wide-baseline image pairs, and we show that it is a good one at that with many experiments for depth estimation accuracy, occlusion detection, and comparing it against other descriptors on laser-scanned ground truth scenes. We also tested our approach on a variety of indoor and outdoor scenes with different photometric and geometric transformations and our experiments support our claim to being robust against these.
Image processing and computer vision, dense depth map estimation, local descriptors.
Engin Tola, Pascal Fua, Vincent Lepetit, "DAISY: An Efficient Dense Descriptor Applied to Wide-Baseline Stereo", IEEE Transactions on Pattern Analysis & Machine Intelligence, vol. 32, no. , pp. 815-830, May 2010, doi:10.1109/TPAMI.2009.77