Stereo matching via selective multiple windows

被引：36

作者：

Adhyapak, Satyajit Anil ^{[1
]}

Kehtarnavaz, Nasser ^{[1
]}

Nadin, Mihai ^{[1
]}

机构：

[1] Univ Texas, Dept Elect Engn, Richardson, TX 75080 USA

来源：

JOURNAL OF ELECTRONIC IMAGING | 2007年 / 16卷 / 01期

关键词：

D O I：

10.1117/1.2711817

中图分类号：

TM [电工技术]; TN [电子技术、通信技术];

学科分类号：

0808 ; 0809 ;

摘要：

Window-based correlation algorithms are widely used for stereo matching due to their computational efficiency as compared to global algorithms. In this paper, a multiple window correlation algorithm for stereo matching is presented which addresses the problems associated with a fixed window size. The developed algorithm differs from the previous multiple window algorithms by introducing a reliability test to select the most reliable window among multiple windows of increasing sizes. This ensures that at least one window is large enough to cover a region of adequate intensity variations while at the same time small enough to cover a constant depth region. A recursive computation procedure is also used to allow a computationally efficient implementation of the algorithm. The outcome obtained from a standard set of images with known disparity maps shows that the generated disparity maps are more accurate as compared to two popular stereo matching local algorithms. (c) 2007 SPIE and IS&T.

引用

页数：14

共 30 条

[21] Calculating dense disparity maps from color stereo images, an efficient implementation [J].

Mühlmann, K ;

Maier, D ;

Hesser, J ;

Männer, R .

INTERNATIONAL JOURNAL OF COMPUTER VISION, 2002, 47 (1-3) :79-88

[22] STEREO BY INTRA-SCANLINE AND INTER-SCANLINE SEARCH USING DYNAMIC-PROGRAMMING [J].

OHTA, Y ;

KANADE, T .

IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 1985, 7 (02) :139-154

[23] A MULTIPLE-BASE-LINE STEREO [J].

OKUTOMI, M ;

KANADE, T .

IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 1993, 15 (04) :353-363

[24] A simple stereo algorithm to recover precise object boundaries and smooth surfaces [J].

Okutomi, M ;

Katayama, Y ;

Oka, S .

INTERNATIONAL JOURNAL OF COMPUTER VISION, 2002, 47 (1-3) :261-273

[25] A maximum-flow formulation of the N-camera stereo correspondence problem [J].

Roy, S ;

Cox, IJ .

SIXTH INTERNATIONAL CONFERENCE ON COMPUTER VISION, 1998, :492-499

[26] A taxonomy and evaluation of dense two-frame stereo correspondence algorithms [J].

Scharstein, D ;

Szeliski, R .

INTERNATIONAL JOURNAL OF COMPUTER VISION, 2002, 47 (1-3) :7-42

[27]

Sun J, 2002, LECT NOTES COMPUT SC, V2351, P510

[28]

VEKSLER O, 2003, P COMP VIS PATT REC

[29] Adaptive support-weight approach for correspondence search [J].

Yoon, KJ ;

Kweon, IS .

IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2006, 28 (04) :650-656

[30] A cooperative algorithm for stereo matching and occlusion detection [J].

Zitnick, CL ;

Kanade, T .

IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2000, 22 (07) :675-684

← 1 2 3 →