Linear-Time Computation of Indexing Based Stereo Correspondence for Cameras with Automatic Gain Control

This paper is a contribution on the field of passive sparse stereo vision, specially for mobile robots navigation. A linear-time computing stereo matching algorithm based on indexing is discussed and improved for cameras with automatic gain control. Integral images and changes on data structures are used to achieve the goals. The method is evaluated by quantitative results utilizing Middlebury stereo datasets and it is able to achieve near 15 fps on a single thread process running on a Intel Ⓡ Core™ i7 without any SIMD use.

[1]  Edgar N. Sánchez,et al.  Neural Control for Driving a Mobile Robot Integrating Stereo Vision Feedback , 2015, Neural Processing Letters.

[2]  Paul A. Viola,et al.  Robust Real-Time Face Detection , 2001, International Journal of Computer Vision.

[3]  Luc Van Gool,et al.  SURF: Speeded Up Robust Features , 2006, ECCV.

[4]  Raul Sidnei Wazlawick,et al.  Linear Complexity Stereo Matching Based on Region Indexing , 2005, SIBGRAPI.

[5]  Jixiang Jiang,et al.  Robust local stereo matching under varying radiometric conditions , 2014, IET Comput. Vis..

[6]  Pierre Boulanger,et al.  Radiometric invariant stereo matching based on relative gradients , 2012, 2012 19th IEEE International Conference on Image Processing.

[7]  Lei Cao,et al.  A DAISY descriptor based multi-view stereo method for large-scale scenes , 2016, J. Vis. Commun. Image Represent..

[8]  Christopher Joseph Pal,et al.  Learning Conditional Random Fields for Stereo , 2007, 2007 IEEE Conference on Computer Vision and Pattern Recognition.

[9]  Dah-Jye Lee,et al.  Review of stereo vision algorithms and their suitability for resource-limited systems , 2013, Journal of Real-Time Image Processing.

[10]  Haibin Yu,et al.  Real-time stereo vision system using adaptive weight cost aggregation approach , 2011, EURASIP J. Image Video Process..

[11]  Gary R. Bradski,et al.  Learning OpenCV 3: Computer Vision in C++ with the OpenCV Library , 2016 .

[12]  Richard Szeliski,et al.  A Taxonomy and Evaluation of Dense Two-Frame Stereo Correspondence Algorithms , 2001, International Journal of Computer Vision.

[13]  Vincent Lepetit,et al.  DAISY: An Efficient Dense Descriptor Applied to Wide-Baseline Stereo , 2010, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[14]  Patrik Kamencay,et al.  A comparison of key-point descriptors for the stereo matching algorithm , 2016, 2016 26th International Conference Radioelektronika (RADIOELEKTRONIKA).

[15]  S. Govindarajulu,et al.  A Comparison of SIFT, PCA-SIFT and SURF , 2012 .

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

[17]  Heiko Hirschmüller,et al.  Evaluation of Cost Functions for Stereo Matching , 2007, 2007 IEEE Conference on Computer Vision and Pattern Recognition.

[18]  Richard Szeliski,et al.  High-accuracy stereo depth maps using structured light , 2003, 2003 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2003. Proceedings..