吉林大学学报(工学版) ›› 2012, Vol. 42 ›› Issue (02): 423-428.

Previous Articles     Next Articles

Fast stereo matching algorithm based on limited search space

MEN Chao-guang, BIAN Ji-long, LI Xiang   

  1. College of Computer Science and Technology, Harbin Engineering University, Harbin 150001, China
  • Received:2010-10-28 Online:2012-03-01 Published:2012-03-01

Abstract: A fast stereo matching algorithm based on dynamic programming on limited search space is proposed to attain an accurate dense disparity map. The proposed algorithm is built on the base of dynamic programming for stereo matching and it limits the search space by an initial match sequence to reduce the number of vertices to be expanded. The multi-window aggregation strategy based on adaptive weight is proposed to improve the matching accuracy. The brightness gradient is integrated into the smoothness constraints to avoid over-punishment on disparity discontinuity on object boundary. Experimental results show that the matching speed and accuracy of the proposed algorithm are greatly improved, and the algorithm is simple and effective for stereo matching.

Key words: computer application, stereo matching, dynamic programming, disparity estimation, search space

CLC Number: 

  • TP391.41
[1] Scharstein D, Szeliski R. A taxonomy and evaluation of dense two-frame stereo correspondence algorithms[J]. International Journal of Computer Vision, 2002, 47(1-3):7-42.

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

[3] De-maeztu L, Villanueva A, Cabeza R. Stereo matching using gradient similarity and locally adaptive support-weight[J]. Pattern Recognition Letters, 2011, 32(13): 1643-1651.

[4] Geiger D, Ladendorf B, Yuille A. Occlusions and binocular stereo[J]. International Journal of Computer Vision, 1995, 14(3):211-226.

[5] Cox I J, Hingorani S L, Rao S B, et al. A maximum likelihood stereo algorithm[J]. Computer Vision Image Understanding, 1996, 63(3):542-567.

[6] Birchfield S, Tomasi C. Depth discontinuities by pixel-to-pixel stereo[J]. International Journal of Computer Vision, 1999, 35(3):269-293.

[7] Bobick A F, Intille S S. Large occlusions stereo[J]. International Journal of Computer Vision, 1999, 33(3):181-200.

[8] 刘赫伟,汪增福.一种沿区域边界的动态规划立体匹配算法[J].模式识别与人工智能,2010,23(1):38-44. Liu He-wei, Wang Zeng-fu. Stereo matching algorithm based on dynamic programming along region boundary[J]. Pattern Recognition and Artificial Intelligence, 2010, 23(1): 38-44.

[9] Boykov Y, Veksler O, Zabih R. Fast approximate energy minimization via graph cuts[J]. IEEE Transactions on Pattern Analysis and Machine Intelligence, 2001, 23(11): 1222-1239.

[10] Sun J, Zheng N N, Shum H Y. Stereo matching using belief propagation[J]. IEEE Transactions on Pattern Analysis and Machine Intelligence, 2003, 25(7): 787-800.
[1] XI Li-he,ZHANG Xin,SUN Chuan-yang,WANG Ze-xing,JIANG Tao. Adaptive energy management strategy for extended range electric vehicle [J]. Journal of Jilin University(Engineering and Technology Edition), 2018, 48(6): 1636-1644.
[2] LIU Fu,ZONG Yu-xuan,KANG Bing,ZHANG Yi-meng,LIN Cai-xia,ZHAO Hong-wei. Dorsal hand vein recognition system based on optimized texture features [J]. Journal of Jilin University(Engineering and Technology Edition), 2018, 48(6): 1844-1850.
[3] WANG Li-min,LIU Yang,SUN Ming-hui,LI Mei-hui. Ensemble of unrestricted K-dependence Bayesian classifiers based on Markov blanket [J]. Journal of Jilin University(Engineering and Technology Edition), 2018, 48(6): 1851-1858.
[4] JIN Shun-fu,WANG Bao-shuai,HAO Shan-shan,JIA Xiao-guang,HUO Zhan-qiang. Synchronous sleeping based energy saving strategy of reservation virtual machines in cloud data centers and its performance research [J]. Journal of Jilin University(Engineering and Technology Edition), 2018, 48(6): 1859-1866.
[5] ZHAO Dong,SUN Ming-yu,ZHU Jin-long,YU Fan-hua,LIU Guang-jie,CHEN Hui-ling. Improved moth-flame optimization method based on combination of particle swarm optimization and simplex method [J]. Journal of Jilin University(Engineering and Technology Edition), 2018, 48(6): 1867-1872.
[6] LIU En-ze,WU Wen-fu. Agricultural surface multiple feature decision fusion disease judgment algorithm based on machine vision [J]. Journal of Jilin University(Engineering and Technology Edition), 2018, 48(6): 1873-1878.
[7] OUYANG Dan-tong, FAN Qi. Clause-level context-aware open information extraction [J]. Journal of Jilin University(Engineering and Technology Edition), 2018, 48(5): 1563-1570.
[8] LIU Fu, LAN Xu-teng, HOU Tao, KANG Bing, LIU Yun, LIN Cai-xia. Metagenomic clustering method based on k-mer frequency optimization [J]. Journal of Jilin University(Engineering and Technology Edition), 2018, 48(5): 1593-1599.
[9] GUI Chun, HUANG Wang-xing. Network clustering method based on improved label propagation algorithm [J]. Journal of Jilin University(Engineering and Technology Edition), 2018, 48(5): 1600-1605.
[10] LIU Yuan-ning, LIU Shuai, ZHU Xiao-dong, CHEN Yi-hao, ZHENG Shao-ge, SHEN Chun-zhuang. LOG operator and adaptive optimization Gabor filtering for iris recognition [J]. Journal of Jilin University(Engineering and Technology Edition), 2018, 48(5): 1606-1613.
[11] CHE Xiang-jiu, WANG Li, GUO Xiao-xin. Improved boundary detection based on multi-scale cues fusion [J]. Journal of Jilin University(Engineering and Technology Edition), 2018, 48(5): 1621-1628.
[12] ZHAO Hong-wei, LIU Yu-qi, DONG Li-yan, WANG Yu, LIU Pei. Dynamic route optimization algorithm based on hybrid in ITS [J]. 吉林大学学报(工学版), 2018, 48(4): 1214-1223.
[13] HUANG Hui, FENG Xi-an, WEI Yan, XU Chi, CHEN Hui-ling. An intelligent system based on enhanced kernel extreme learning machine for choosing the second major [J]. 吉林大学学报(工学版), 2018, 48(4): 1224-1230.
[14] FU Wen-bo, ZHANG Jie, CHEN Yong-le. Network topology discovery algorithm against routing spoofing attack in Internet of things [J]. 吉林大学学报(工学版), 2018, 48(4): 1231-1236.
[15] CAO Jie, SU Zhe, LI Xiao-xu. Image annotation method based on Corr-LDA model [J]. 吉林大学学报(工学版), 2018, 48(4): 1237-1243.
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!