Fast semi-global stereo matching via extracting disparity candidates from region boundaries

Fast semi-global stereo matching via extracting disparity candidates from region boundaries

For access to this article, please select a purchase option:

Buy article PDF
(plus tax if applicable)
Buy Knowledge Pack
10 articles for £75.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Your details
Why are you recommending this title?
Select reason:
IET Computer Vision — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

This study proposes a novel fast stereo matching algorithm via semi-global energy optimisation, which achieves a considerable improvement in efficiency for just a small price in accuracy. Based on some assumptions, the authors discover that at most two disparity candidates for each scanline segment of reference image can be extracted. With this observation, the authors present a disparity candidate extraction algorithm. This algorithm constructs an energy function based on colour consistency and restrictions between region boundaries. In this approach, the energy function is optimised via the graph-cuts technique, and the pixels involved are only those positioned on region boundaries, which results in greatly reduced vertex number in the constructed graph and subsequently improved efficiency. After that, a simple partial occlusions handling is conducted as a post-processing to enhance the accuracy of the final disparity map, by selecting a right disparity for each segment from extracted candidates. The performances of our method are demonstrated by experiments on the Middlebury test set.


    1. 1)
    2. 2)
      • Boykov, Y., Veksler, O., Zabih, R.: `Markov random fields with efficient approximations', Proc. IEEE Int. Conf. Pattern Analysis and Machine Intelligence, 1998, p. 648–655.
    3. 3)
    4. 4)
      • Klaus, A., Sormann, M., Karner, K.: `Segment-based stereo matching using belief propagation and a self-adapting dissimilarity measure', Proc. IEEE Int. Conf. Pattern Recognition, 2006, p. 15–18.
    5. 5)
      • Sun, J., Shum, H.Y., Zheng, N.N.: `Stereo matching using belief propagation', Proc. European Conf. Computer Vision, 2002, p. 510–524.
    6. 6)
    7. 7)
    8. 8)
      • Veksler, O.: `Stereo correspondence by dynamic programming on a tree', Proc. IEEE Int. Conf. Computer Vision and Pattern Recognition, 2005, p. 384–390.
    9. 9)
    10. 10)
      • Wang, L., Liao, M., Gong, M.: `High-quality real-time stereo using adaptive cost aggregation and dynamic programming', Proc. Third Int. Symp. 3D Data Processing, Visualization, and Transmission, 2006, p. 798–805.
    11. 11)
      • Yang, Q., Engels, C., Akbarzadeh, A.: `Near real-time stereo for weakly-textured scenes', Proc. British Machine Vision Conf., 2008.
    12. 12)
      • Tombari, F., Mattoccia, S., Stefano, L.D.: `Near real-time stereo based on effective cost aggregation', Proc. IEEE Int. Conf. Pattern Recognition, 2008, p. 1–4, 8–11.
    13. 13)
    14. 14)
      • Veksler, O.: `Reducing search space for stereo correspondence with graph cuts', Proc. British Machine Vision Conf., 2006, p. 709–718.
    15. 15)
    16. 16)
    17. 17)
    18. 18)
      • Veksler, O.: `Efficient graph-based energy minimization methods in computer vision', 1999, PhD, Cornell University.
    19. 19)
      • Wang, Z., Zheng, Z.: `A region based stereo matching algorithm using cooperative optimization', Proc. IEEE Int. Conf. Computer Vision and Pattern Recognition, 2008, p. 887–894.
    20. 20)
    21. 21)
      • Kolmogorov, V., Zabih, R.: `Multi-camera scene reconstruction via graph cuts', Proc. European Conf. Computer Vision, 2002, p. 82–96.
    22. 22)
      • Kim, J., Kolmogorov, V., Zabih, R.: `Visual correspondence using energy minimization and mutual information', Proc. IEEE Int. Conf. Computer Vision, 2003, p. 1033–1042.
    23. 23)
      • Kolmogorov, V.: `Graph based algorithms for scene reconstruction from two or more views', 2004, PhD, Cornell University.
    24. 24)

Related content

This is a required field
Please enter a valid email address