Browse > Article

Performance Analysis of Matching Cost Functions of Stereo Matching Algorithm for Making 3D Contents  

Hong, Gwang-Soo (선문대학교 컴퓨터공학과)
Jeong, Yeon-Kyu (선문대학교 컴퓨터공학과)
Kim, Byung-Gyu (선문대학교 컴퓨터공학과)
Publication Information
Convergence Security Journal / v.13, no.3, 2013 , pp. 9-15 More about this Journal
Abstract
Calculating of matching cost is an important for efficient stereo matching. To investigate the performance of matching process, the concepts of the existing methods are introduced. Also we analyze the performance and merits of them. The simplest matching costs assume constant intensities at matching image locations. We consider matching cost functions which can be distinguished between pixel-based and window-based approaches. The Pixel-based approach includes absolute differences (AD) and sampling-intensitive absolute differences (BT). The window-based approach includes the sum of the absolute differences, the sum of squared differences, the normalized cross-correlation, zero-mean normalized cross-correlation, census transform, and the absolute differences census transform (AD-Census). We evaluate matching cost functions in terms of accuracy and time complexity. In terms of the accuracy, AD-Census method shows the lowest matching error ratio (the best solution). The ZNCC method shows the lowest matching error ratio in non-occlusion and all evaluation part. But it performs high matching error ratio at the discontinuities evaluation part due to blurring effect in the boundary. The pixel-based AD method shows a low complexity in terms of time complexity.
Keywords
Depth map; Matching cost; Matching Cost function; Stereo matching;
Citations & Related Records
연도 인용수 순위
  • Reference
1 R. Zabib and J. Woodfill, "Non-parametric Local transforms for computing visual correspondence," Third Europe an conference on Computer Vision, May 1994.
2 T. Kanade, "Development of a video-rate stereomachine," In Image Understanding Workshop, pp. 549-557, 1994.
3 P. Anandan, "A computational framework and an algorithm for the measurement of visual motion," International Journal Computer Vision, vol. 2, no. 3, pp. 283-310, 1989.   DOI
4 S. Birchfield and C. Tomasi, "A pixel dissimilarity measure that is insensitive to image sampling," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 20, no. 4, pp. 401-406, April 1998.   DOI
5 X. Mei, X. Sun, M. Zhou, S. Jiao, H. Wang, and X. Zhang, "On building an accurate stereo matching system on graphics hardware," GPUCV 2011.
6 H. Hirschmuller, P. R. Innocent, and J M. Garibaldi, "Real-time correlation-based stereo vision with reduced border errors," International Journal of Computer Vision, vol. 47, no. 1/2/3, pp. 229-246, April-June 2002.   DOI
7 http://vision.middlebury.edu/stereo
8 D. Scharstein and R. Szeliski, "A Taxonomy and evaluation of dense two-frame stereo correspondence algorithms," International Journal of Computer Vision, vol. 47, no. 1, pp. 7-42, May 2002.   DOI
9 D. Scharstein and R. Szeliski, "High-Accuracy Stereo depth maps using structured light," IEEE Computer Society Conference on Computer Vision and Pattern Recognition, vol. 1, pp. 195-202, 2003.