Evaluation of stereo algorithms for 3D object recognition

This work aims at evaluating stereo matching algorithms in a 3D object recognition scenario, wherein objects have to be found and their 3D pose estimated efficiently and in presence of clutter and occlusions. Unlike all other surveys and evaluations of stereo methods, which compare accuracy based on a dataset of disparity maps with ground-truth, this work proposes an evaluation in terms of recognition ability which leverages on state-of-the-art approaches for 3D object recognition. The proposed evaluation methodology comprises a novel dataset characterized by realistic working conditions and compares state-of-the-art stereo algorithms potentially suitable to 3D object recognition applications.

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

[2]  In-So Kweon,et al.  Stereo Matching with Symmetric Cost Functions , 2006, 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'06).

[3]  Mohammed Bennamoun,et al.  A Novel Representation and Feature Matching Algorithm for Automatic Pairwise Registration of Range Images , 2005, International Journal of Computer Vision.

[4]  Luc Van Gool,et al.  Speeded-Up Robust Features (SURF) , 2008, Comput. Vis. Image Underst..

[5]  Andreas Geiger,et al.  Efficient Large-Scale Stereo Matching , 2010, ACCV.

[6]  Federico Tombari,et al.  Classification and evaluation of cost aggregation methods for stereo correspondence , 2008, 2008 IEEE Conference on Computer Vision and Pattern Recognition.

[7]  Federico Tombari,et al.  Near real-time stereo based on effective cost aggregation , 2008, 2008 19th International Conference on Pattern Recognition.

[8]  Szymon Rusinkiewicz,et al.  Spacetime Stereo: A Unifying Framework for Depth from Triangulation , 2005, IEEE Trans. Pattern Anal. Mach. Intell..

[9]  Vladimir Kolmogorov,et al.  What energy functions can be minimized via graph cuts? , 2002, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[10]  Yu Zhong,et al.  Intrinsic shape signatures: A shape descriptor for 3D object recognition , 2009, 2009 IEEE 12th International Conference on Computer Vision Workshops, ICCV Workshops.

[11]  Narendra Ahuja,et al.  A constant-space belief propagation algorithm for stereo matching , 2010, 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

[12]  Pascal Fua,et al.  A parallel stereo algorithm that produces dense depth maps and preserves image features , 1993, Machine Vision and Applications.

[13]  M. J. McDonnell.  Box-filtering techniques , 1981 .

[14]  Federico Tombari,et al.  Object Recognition in 3D Scenes with Occlusions and Clutter by Hough Voting , 2010, 2010 Fourth Pacific-Rim Symposium on Image and Video Technology.

[15]  Franklin C. Crow,et al.  Summed-area tables for texture mapping , 1984, SIGGRAPH.

[16]  In-So Kweon,et al.  Adaptive Support-Weight Approach for Correspondence Search , 2006, IEEE Trans. Pattern Anal. Mach. Intell..

[17]  Federico Tombari,et al.  Unique Signatures of Histograms for Local Surface Description , 2010, ECCV.

[18]  Judea Pearl,et al.  A Computational Model for Causal and Diagnostic Reasoning in Inference Systems , 1983, IJCAI.

[19]  Federico Tombari,et al.  Stereo for robots: Quantitative evaluation of efficient and low-memory dense stereo algorithms , 2010, 2010 11th International Conference on Control Automation Robotics & Vision.

[20]  Matthijs C. Dorst.  Distinctive Image Features from Scale-Invariant Keypoints , 2011 .

[21]  Margrit Gelautz,et al.  Simple but Effective Tree Structures for Dynamic Programming-Based Stereo Matching , 2008, VISAPP.

[22]  Ruigang Yang,et al.  A Performance Study on Different Cost Aggregation Approaches Used in Real-Time Stereo Matching , 2007, International Journal of Computer Vision.

[23]  Pedro F. Felzenszwalb,et al.  Efficient belief propagation for early vision , 2004, CVPR 2004.

[24]  Federico Tombari,et al.  A 3D reconstruction system based on improved spacetime stereo , 2010, 2010 11th International Conference on Control Automation Robotics & Vision.

[25]  Heiko Hirschm,et al.  Accurate and Efcient Stereo Processing by Semi-Global Matching and Mutual Information , 2005 .

[26]  Sang Uk Lee,et al.  A dense stereo matching using two-pass dynamic programming with generalized ground control points , 2005, 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05).

[27]  H. Hirschmüller.  Accurate and Efficient Stereo Processing by Semi-Global Matching and Mutual Information , 2005, CVPR.

[28]  Andrew E. Johnson,et al.  Using Spin Images for Efficient Object Recognition in Cluttered 3D Scenes , 1999, IEEE Trans. Pattern Anal. Mach. Intell..

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

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

[31]  Li Zhang,et al.  Spacetime stereo: shape recovery for dynamic scenes , 2003, 2003 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2003. Proceedings..

[32]  Tianli Yu,et al.  Efficient Message Representations for Belief Propagation , 2007, 2007 IEEE 11th International Conference on Computer Vision.

[33]  Mohammed Bennamoun,et al.  On the Repeatability and Quality of Keypoints for Local Feature-based 3D Object Retrieval from Cluttered Scenes , 2009, International Journal of Computer Vision.

[34]  Miao Liao,et al.  High-Quality Real-Time Stereo Using Adaptive Cost Aggregation and Dynamic Programming , 2006, Third International Symposium on 3D Data Processing, Visualization, and Transmission (3DPVT'06).

[35]  Roberto Manduchi,et al.  Bilateral filtering for gray and color images , 1998, Sixth International Conference on Computer Vision (IEEE Cat. No.98CH36271).