Abstract
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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Kolmogorov, V., Zabih, R.: Multi-camera scene reconstruction via graph cuts. In: European Conference on Computer Vision (2002)
Scharstein, D., Szeliski, R.: A taxonomy and evaluation of dense two-frame stereo correspondence algorithms. International Journal of Computer Vision 47(1) (2002)
Okutomi, M., Kanade, T.: A multiple-baseline stereo. IEEE Transactions on Pattern Analysis and Machine Intelligence 15(4) (1993)
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)
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)
Leung, C., Appleton, B., Sun, C.: Fast stereo matching by iterated dynamic programming and quadtree subregioning. In: British Machine Vision Conference (September 2004)
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)
Kolmogorov, V., Zabih, R.: Computing visual correspondence with occlusions using graph cuts. In: International Conference on Computer Vision (2001)
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)
Roy, S., Cox, I.J.: A maximum-flow formulation of the n-camera stereo correspondence problem. In: International Confernce on Computer Vision (1998)
Boykov, Y., Veksler, O., Zabih, R.: Fast approximate energy minimization via graph cuts. IEEE Transctions on Pattern Analysis and Machine Intelligence 23(11) (1999)
Kenney, J.F., Keeping, E.S.: Mathematics of Statistics, 3rd edn. Van Nostrand (1964)
Seul, M., O’Gorman, L., Sammon, M.J.: Practical Algorithms for Image Analysis: Descriptions, Examples, and Code, 1st edn. Cambridge University Press, Cambridge (2000)
Falkenhagen, L.: Hierarchical block-based disparity estimation considering neighbourhood constraints. In: International workshop on SNHC and 3D Imaging (September 1997)
Leung, C.: Efficient Methods for 3D Reconstruction from Multiple Images. PhD thesis, University of Queensland (2005)
Sun, C.: Fast stereo matching using rectangular subregioning and 3d maximum-surface techniques. International Journal of Computer Vision 47(1), 99–117 (2002)
Scharstein, D., Szeliski, R.: www.middlebury.edu/stereo
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sarkis, M., Dörfler, N., Diepold, K. (2007). Fast Adaptive Graph-Cuts Based Stereo Matching. In: Blanc-Talon, J., Philips, W., Popescu, D., Scheunders, P. (eds) Advanced Concepts for Intelligent Vision Systems. ACIVS 2007. Lecture Notes in Computer Science, vol 4678. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74607-2_74
Download citation
DOI: https://doi.org/10.1007/978-3-540-74607-2_74
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74606-5
Online ISBN: 978-3-540-74607-2
eBook Packages: Computer ScienceComputer Science (R0)