Fast Adaptive Graph-Cuts Based Stereo Matching

  • Michel Sarkis
  • Nikolas Dörfler
  • Klaus Diepold
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4678)


Stereo vision is one of the central research problems in computer vision. The most difficult and important issue in this area is the stereo matching process. One technique that performs this process is the Graph-Cuts based algorithm and which provides accurate results . Nevertheless, this approach is too slow to use due to the redundant computations that it invokes. In this work, an Adaptive Graph-Cuts based algorithm is implemented. The key issue is to subdivide the image into several regions using quadtrees and then define a global energy function that adapts itself for each of these subregions. Results show that the proposed algorithm is 3 times faster than the other Graph-Cuts algorithm while keeping the same quality of the results.


Cost Function Stereo Image Coarse Level Stereo Match Stereo Match Algorithm 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Kolmogorov, V., Zabih, R.: Multi-camera scene reconstruction via graph cuts. In: European Conference on Computer Vision (2002)Google Scholar
  2. 2.
    Scharstein, D., Szeliski, R.: A taxonomy and evaluation of dense two-frame stereo correspondence algorithms. International Journal of Computer Vision 47(1) (2002)Google Scholar
  3. 3.
    Okutomi, M., Kanade, T.: A multiple-baseline stereo. IEEE Transactions on Pattern Analysis and Machine Intelligence 15(4) (1993)Google Scholar
  4. 4.
    Kanade, T., Okutomi, M.: A stereo matching algorithm with an adaptive window: Theory and experiment. IEEE Transactions on Pattern Analysis and Machine Intelligence 16(9) (1994)Google Scholar
  5. 5.
    Crimsini, A., Shotton, J., Blake, A., Rother, C., Torr, P.: Efficient dense-stereo with occlusions and new view synthesis by four state DP for gaze correction. Technical report, Microsoft Research (2003)Google Scholar
  6. 6.
    Leung, C., Appleton, B., Sun, C.: Fast stereo matching by iterated dynamic programming and quadtree subregioning. In: British Machine Vision Conference (September 2004)Google Scholar
  7. 7.
    Kim, J.C., Lee, K.M., Choi, B.T., Lee, S.U.: A dense stereo matching using two-pass dynamic programming with generalized ground control points. In: IEEE International Conference on Computer Vision and Pattern Recognition (CVPR), IEEE, Los Alamitos (2005)Google Scholar
  8. 8.
    Kolmogorov, V., Zabih, R.: Computing visual correspondence with occlusions using graph cuts. In: International Conference on Computer Vision (2001)Google Scholar
  9. 9.
    Balmelli, L., Kovacevic, J., Vetterli, M.: Quadtrees for embedded surface visualization: Constraints and efficient data structures. In: IEEE International Conference on Image Processing, IEEE, Los Alamitos (1999)Google Scholar
  10. 10.
    Roy, S., Cox, I.J.: A maximum-flow formulation of the n-camera stereo correspondence problem. In: International Confernce on Computer Vision (1998)Google Scholar
  11. 11.
    Boykov, Y., Veksler, O., Zabih, R.: Fast approximate energy minimization via graph cuts. IEEE Transctions on Pattern Analysis and Machine Intelligence 23(11) (1999)Google Scholar
  12. 12.
    Kenney, J.F., Keeping, E.S.: Mathematics of Statistics, 3rd edn. Van Nostrand (1964)Google Scholar
  13. 13.
    Seul, M., O’Gorman, L., Sammon, M.J.: Practical Algorithms for Image Analysis: Descriptions, Examples, and Code, 1st edn. Cambridge University Press, Cambridge (2000)Google Scholar
  14. 14.
    Falkenhagen, L.: Hierarchical block-based disparity estimation considering neighbourhood constraints. In: International workshop on SNHC and 3D Imaging (September 1997)Google Scholar
  15. 15.
    Leung, C.: Efficient Methods for 3D Reconstruction from Multiple Images. PhD thesis, University of Queensland (2005)Google Scholar
  16. 16.
    Sun, C.: Fast stereo matching using rectangular subregioning and 3d maximum-surface techniques. International Journal of Computer Vision 47(1), 99–117 (2002)zbMATHCrossRefGoogle Scholar
  17. 17.
    Scharstein, D., Szeliski, R.:

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Michel Sarkis
    • 1
  • Nikolas Dörfler
    • 1
  • Klaus Diepold
    • 1
  1. 1.Institute for Data Processing (LDV), Technische Universität München (TUM), MunichGermany

Personalised recommendations