Iterated dynamic programming and quadtree subregioning for fast stereo matching

Image and Vision Computing

Volumn 26, Issue 10, 2008, Pages 1371-1383

  Leung, Carlos ^a   Appleton, Ben ^a   Sun, Changming ^b  

^a UNIVERSITY OF QUEENSLAND   (Australia)

^b CSIRO   (Australia)

Author keywords

Energy minimisation; Iterated dynamic programming; Quadtree subregioning; Stereo matching

Indexed keywords

DYNAMIC PROGRAMMING; MAPS; MATHEMATICAL PROGRAMMING; SYSTEMS ENGINEERING;

COMPUTATIONALLY EXPENSIVE; DISPARITY MAPS; DYNAMIC PROGRAMMING ALGORITHMS; EFFICIENT COMPUTATION; ENERGY MINIMISATION; HIGH-QUALITY; ITERATED DYNAMIC PROGRAMMING; QUAD TREES; QUADTREE SUBREGIONING; RUNNING TIME; STEREO MATCHING;

COMPUTER SOFTWARE SELECTION AND EVALUATION;

EID: 49549112458     PISSN: 02628856     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.imavis.2007.11.013     Document Type: Article

References (22)

1. Geiger D., Ladendorf B., and Yuille A.L. Occlusions and binocular stereo. International Journal of Computer Vision 14 3 (1995) 211-226
2. Gimel'farb G.L., Krot V.M., and Grigorenko M.V. Experiments with symmetrized intensity-based dynamic programming algorithms for reconstructing digital terrain model. International Journal of Imaging Systems and Technology 4 1 (1992) 7-21
3. Lloyd S.A. A dynamic programming algorithm for binocular stereo vision. GEC Journal of Research 3 1 (1985) 18-24
4. Cox I.J., Hingorani S., Rao S., and Maggs B. A maximum likelihood stereo algorithm. Computer Vision and Image Understanding 63 3 (1996) 542-567
5. Belhumeur P.N. A Bayesian approach to binocular stereopsis. International Journal of Computer Vision 19 3 (1996) 237-262
6. Ohta Y., and Kanade T. Stereo by intra- and inter-scanline search using dynamic programming. IEEE Transactions on Pattern Analysis and Machine Intelligence PAMI-7 2 (1985) 139-154
7. Geman S., and Geman D. Stochastic relaxation, Gibbs distribution, and the Bayesian restoration of images. IEEE Transactions on Pattern Analysis and Machine Intelligence 6 6 (1984) 721-741
8. Sun C. Fast stereo matching using rectangular subregioning and 3D maximum-surface techniques. International Journal of Computer Vision 47 1/2/3 (2002) 99-117
9. S. Birchfield, C. Tomasi, Multiway cut for stereo and motion with slanted surfaces, in: Proceedings of International Conference on Computer Vision, 1999, pp. 489-495.
10. Boykov Y., Veksler O., and Zabih R. Fast approximate energy minimization via graph cuts. IEEE Transactions on Pattern Analysis and Machine Intelligence 23 11 (2001) 1222-1239
11. H. Ishikawa, D. Geiger, Occlusions, discontinuities, and epipolar lines in stereo, in: Proceedings of European Conference on Computer Vision, Freiburg, Germany, 1998, pp. 232-248.
12. V. Kolmogorov, R. Zabih, Multi-camera scene reconstruction via graph cuts, in: Proceedings of European Conference on Computer Vision, Vol. 3, London, UK, 2002, pp. 82-96.
13. S. Roy, I.J. Cox, A maximum-flow formulation of the N-camera stereo correspondence problem, in: Proceedings of International Conference on Computer Vision, IEEE, Bombay, India, 1998, pp. 492-499.
14. O. Veksler, Efficient graph-based energy minimization methods in computer vision, Ph.D. thesis, Cornell University (1999).
15. O. Faugeras, B. Hotz, H. Mathieu, T. Viéville, Z. Zhang, P. Fua, E. Théron, L. Moll, G. Berry, J. Vuillemin, P. Bertin, C. Proy, Real time correlation-based stereo: algorithm, implementations and applications, Tech. Rep. RR-2013, INRIA (1993).
16. Sun C. A fast stereo matching method. Digital Image Computing: Techniques and Applications (1997), Massey University, Auckland, New Zealand 95-100
17. Leung C., Appleton B., and Sun C. Fast stereo matching by iterated dynamic programming and quadtree subregioning. In: Hoppe A., Barman S., and Ellis T. (Eds). British Machine Vision Conference vol. 1 (2004), Kingston University, London 97-106
18. Brown M.Z., Burschka D., and Hager G.D. Advances in computational stereo. IEEE Transactions on Pattern Analysis and Machine Intelligence 25 8 (2003) 993-1008
19. Scharstein D., and Szeliski R. A taxonomy and evaluation of dense two-frame stereo correspondence algorithms. International Journal of Computer Vision 47 1/2/3 (2002) 7-42
20. Sun C., and Pallottino S. Circular shortest path in images. Pattern Recognition 36 3 (2003) 711-721
21. C. Leung, Efficient methods for 3D reconstruction from multiple images, Ph.D. thesis, University of Queensland (2006). Available from: (October 2005).
22. C. Leung, B. Appleton, C. Sun, Iterated dynamic programming and quadtree subregioning for fast stereo matching. Available from: (February 2005).