A tree structure dynamic programming stereo matching algorithm based on linear filtering

被引：0

作者：

Chu, Jun ^{[1
,2
]}

Gong, Wen ^{[2
]}

Miao, Jun ^{[1
,2
]}

Zhang, Gui-Mei ^{[1
,2
]}

机构：

[1] Institute of Computer Vision, Nanchang Hangkong University, Nanchang

[2] Jiangxi Province Key Laboratory of Image Processing and Pattern Recognition, Nanchang

来源：

Zidonghua Xuebao/Acta Automatica Sinica | 2015年 / 41卷 / 11期

基金：

中国国家自然科学基金;

关键词：

Dynamic programming; Linear filtering; Stereo matching; Tree structure;

D O I：

10.16383/j.aas.2015.c140693

中图分类号：

学科分类号：

摘要：

The traditional dynamic programming stereo matching algorithm can effectively guarantee the precision of matching and improve the running speed; but the depth of the parallax figure has the obvious stripes phenomenon, at the same time the low texture region and edge of the image have higher mismatch. For these problems, the paper proposes a new tree structure based on the linear filtering dynamic programming stereo matching algorithm. The algorithm firstly uses an improved adjustable parameters adaptive measure function to combine the color and gradient information of the matching images. Secondly, it uses the left image to guide the figure to filter the price of stereo matching. Thirdly, it utilizes the two direction simple tree structure dynamic programming optimization; and finally uses the parallax refinement method to get the final parallax figure. Theoretical analysis and experimental results have showed that the proposed algorithm can not only effectively eliminate the stripes phenomenon of dynamic programming algorithm but also improve the mismatch of the low texture area and the edge of the image. Copyright © 2015 Acta Automatica Sinica. All rights reserved.

引用

页码：1941 / 1950

页数：9

共 15 条

[1]

Scharstein D., Szeliski R., Middlebury stereo evaluation version 2, (2011)

[2]

Scharstein D., Szeliski R., A taxonomy and evaluation of dense two-frame stereo correspondence algorithms, International Journal of Computer Vision, 47, 1-3, pp. 7-42, (2002)

[3]

Zheng Z.-G., Wang Z.-F., A region based stereo matching algorithm using cooperative optimization, Acta Automatica Sinica, 35, 5, pp. 469-477, (2009)

[4]

Yoon K.J., Kweon I.S., Adaptive support-weight approach for correspondence search, IEEE Transactions on Pattern Analysis and Machine Intelligence, 28, 4, pp. 650-656, (2006)

[5]

Li D.-G., Li K.-J., Gao L.-L., Stereo vision using multiresolution and multiorientation phase matching, Chinese Journal of Scientific Instrument, 25, 4, pp. 600-602, (2004)

[6]

Klaus A., Sormann M., Karner K., Segment-based stereo matching using belief propagation and a self-adapting dissimilarity measure, Proceedings of the 18th International Conference on Pattern Recognition, pp. 15-18, (2006)

[7]

Wang H.Q., Wu M., Zhang Y.B., Zhang L., Effective stereo matching using reliable points based graph cut, Proceedings of the 2013 Visual Communications and Image Processing, pp. 1-6, (2013)

[8]

Kim J.C., Lee K.M., Choi B.T., Lee S.U., A dense stereo matching using two-pass dynamic programming with generalized ground control points, Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, pp. 1075-1082, (2005)

[9]

Xu Z.L., Ma L.Z., Kimachi M., Suwa M., Efficient contrast invariant stereo correspondence using dynamic programming with vertical constraint, The Visual Computer, 24, 1, pp. 45-55, (2008)

[10]

Veksler O., Stereo correspondence by dynamic programming on a tree, Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, pp. 384-390, (2005)

← 1 2 →