Journal of the Semiconductor & Display Technology (반도체디스플레이기술학회지)

The Korean Society Of Semiconductor & Display Technology (한국반도체디스플레이기술학회)
권호 표지

A Study of the Use of step by preprocessing and Graph Cut for the exact depth map

깊이맵 향상을 위한 전처리 과정과 그래프 컷에 관한 연구

  • Kim, Young-Seop (Department of Electronics Engineering Dankook University) ;
  • Song, Eung-Yeol (Department of Electronics & Electrical Engineering, Dankook University)
  • Received : 2011.09.01
  • Accepted : 2011.09.15
  • Published : 2011.09.30
Download PDF
⟨ Previous Next ⟩

Abstract

The stereoscopic vision system is the algorithm to obtain the depth of target object of stereo vision image. This paper presents an efficient disparity matching method using blue edge filter and graph cut algorithm. We do recommend the use of the simple sobel edge operator. The application of B band sobel edge operator over image demonstrates result with somewhat noisy (distinct border). The basic technique is to construct a specialized graph for the energy function to be minimized such that the minimum cut on the graph also minimizes the energy (either globally or locally). This method has the advantage of saving a lot of data. We propose a preprocessing effective stereo matching method based on sobel algorithm which uses blue edge information and the graph cut, we could obtain effective depth map.

Keywords

References

  1. A. Redert, M. Op de Beeck, C. Fehn, W. IJsselsteijn, M. Pollefeys, L. Van Gool, E. Ofek, I. Sexton, and P. Surman, "ATTEST-advanced three-dimensional television system techniques," in Proc. 3DPVT' 02, Padova, Italy, Jun. 2002, pp. 313-319.
  2. D.Scharstein, R. Szeliski, A taxonomy and valuation of dense two-frame stereo correspondence algorithms", IJCV 2002.
  3. S. Larsen, P. Mordohai, M. Pollefeys, and H. Fuchs. Temporally consistent reconstruction from multiple video streams using enhanced belief propagation.ICCV 2007.
  4. V. Kolmogorov and R. Zabih. Computing visual correspondence with occlusions using graph cuts. ICCV 2001.
  5. K.-J. Yoon and I.-S. Kweon. Adaptive support-weight approach for correspondence search. PAMI 28(4):650- 656, 2006.
  6. T. Pock, T. Schoenemann, G. Graber, H. Bischof, and D. Cremers. A convex formulation of continuous multilabel problems. ECCV 2008.
  7. Graph cuts using alpha-beta swaps (Boykov, Veksler, and Zabih, PAMI 2001)
  8. Richard Szeliski, Ramin Zabih, Daniel Scharstein, Olga Veksler, Aseem Agarwala, Carsten Rothe, "A Comparative Study of Energy Minimization Methods for Markov Random Fields", ECCV, pp.16-29, 2006
  9. "Middlebury Stereo Vision Page," http:// vision . middlebury.edu/stereo.