Low-dimension local descriptor for dense stereo matching and scene reconstruction

The DAISY descriptor has been widely used in dense stereo matching and scene reconstruction. However, DAISY is vulnerable to similar feature regions because the construction method of DAISY sequentially arranges the description of center and neighbor sample points and does not consider their relationships. To enhance the discriminative power of the local descriptor and accelerate the speed of dense matching and scene reconstruction, we propose a low-dimensional local descriptor. The proposed descriptor is inspired from the local binary pattern (LBP). In image space, LBP describes local detail texture by computing the difference between center and neighbor sample points. We introduce this advantage in scale space to extend the DAISY descriptor and make it more efficient for dense matching similar features in the different regions. On this basis, a two-dimensional discrete cosine transform (2D-DCT) is utilized to reduce the dimensions of the descriptor as well as reduce the computation cost of dense matching and scene reconstruction. Through a variety of experiments on the benchmark laser-scanned ground truth scenes as well as indoor and outdoor scenes, we show the proposed descriptor can get more accurate depth maps and more complete reconstruction results than that of using other common descriptors, and the computational speed is much faster than that of using DAISY.

[1]  David G. Lowe,et al.  Distinctive Image Features from Scale-Invariant Keypoints , 2004, International Journal of Computer Vision.

[2]  Vincent Lepetit,et al.  A fast local descriptor for dense matching , 2008, 2008 IEEE Conference on Computer Vision and Pattern Recognition.

[3]  Vincent Lepetit,et al.  BRIEF: Computing a Local Binary Descriptor Very Fast , 2012, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[4]  Yan Ke,et al.  PCA-SIFT: a more distinctive representation for local image descriptors , 2004, CVPR 2004.

[5]  Pascal Fua,et al.  LDAHash: Improved Matching with Smaller Descriptors , 2012, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[6]  Matti Pietikäinen,et al.  Multiresolution Gray-Scale and Rotation Invariant Texture Classification with Local Binary Patterns , 2002, IEEE Trans. Pattern Anal. Mach. Intell..

[7]  Pierre Vandergheynst,et al.  FREAK: Fast Retina Keypoint , 2012, 2012 IEEE Conference on Computer Vision and Pattern Recognition.

[8]  Christophe Charrier,et al.  A DCT Statistics-Based Blind Image Quality Index , 2010, IEEE Signal Processing Letters.

[9]  Peng Song,et al.  Volumetric stereo and silhouette fusion for image-based modeling , 2010, The Visual Computer.

[10]  Jean Ponce,et al.  Accurate, Dense, and Robust Multiview Stereopsis , 2010, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[11]  Pascal Fua,et al.  Efficient large-scale multi-view stereo for ultra high-resolution image sets , 2011, Machine Vision and Applications.

[12]  Qionghai Dai,et al.  Continuous depth estimation for multi-view stereo , 2009, CVPR.

[13]  Xianrong Peng,et al.  A comparison of feature description algorithms , 2015 .

[14]  Hongxun Yao,et al.  Nested-SIFT for Efficient Image Matching and Retrieval , 2013, IEEE MultiMedia.

[15]  Jean-Philippe Pons,et al.  High Accuracy and Visibility-Consistent Dense Multiview Stereo , 2012, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[16]  Gary R. Bradski,et al.  ORB: An efficient alternative to SIFT or SURF , 2011, 2011 International Conference on Computer Vision.