Welcome to Journal of Beijing Institute of Technology
Advance Search
Volume 19Issue 4
.
Turn off MathJax
Article Contents
Article Navigation> JOURNAL OF BEIJING INSTITUTE OF TECHNOLOGY> 2010> 19(4): 445-449
HOU Guang-qi, WEI Ping, Wang Shu-hua. Efficient Stereo Matching Scheme Based on Graph Cuts[J]. JOURNAL OF BEIJING INSTITUTE OF TECHNOLOGY, 2010, 19(4): 445-449.
Citation: HOU Guang-qi, WEI Ping, Wang Shu-hua. Efficient Stereo Matching Scheme Based on Graph Cuts[J].JOURNAL OF BEIJING INSTITUTE OF TECHNOLOGY, 2010, 19(4): 445-449.
shu

Efficient Stereo Matching Scheme Based on Graph Cuts

  • 1.

    Key Laboratory of Photo-Electronic Imaging Technology and System, Beijing Institute of Technology, Beijing 100081, China;School of Optoelectronics, Beijing Institute of Technology, Beijing 100081, China

  • 2.

    Beijing Institute of Environmental Features, Beijing 100854, China

  • Received Date:2009-12-07
    Abstract
  • A new stereo matching scheme from image pairs based on graph cuts is given, which can solve the problem of large color differences as the result of fusing matching results of graph cuts from different color spaces. This scheme builds normalized histogram and reference histogram from matching results, and uses clustering algorithm to process the two histograms. Region histogram statistical method is adopted to retrieve depth data to achieve final matching results. Regular stereo matching library is used to verify this scheme, and experiments reported in this paper support availability of this method for automatic image processing. This scheme renounces the step of manual selection for adaptive color space and can obtain stable matching results. The whole procedure can be executed automatically and improve the integration level of image analysis process.
    • FullText(HTML)
  • loading
    • References (11)
  • [1]
    Yuri B, Olga V, Ramin Z. Markov random fields with efficient approximations //1998 Conference on Computer Vision and Pattern Recognition. Washington D C, USA: IEEE Computer Society, 1998:648-655.
    [2]
    Marshall F T, William T F. Comparison of graph cuts with belief propagation for stereo, using identical MRF parameters //Ninth IEEE International Conference on Computer Vision. Washington D C, USA: IEEE Computer Society, 2003:900-906.
    [3]
    Julian B. On the statistical analysis of dirty pictures[J]. Journal of the Royal Statistical Society-Series B: Statistical Methodology, 1986, 48(3):259-312.
    [4]
    Jonathan S Y, William T F, Yair W. Generalized belief propagation //Neural Information Processing Systems 2000. La Jolla, CA, USA: Neural Information Processing Systems (NIPS) Foundation, 2000:689-695.
    [5]
    Martin J W, Tommi S J, Alan S W. Map estimation via agreement on trees: Message-passing and linear programming[J]. IEEE Transactions on Information Theory, 2005, 51(11):3697-3717.
    [6]
    Yuri B, Olga V, Ramin Z. Fast approximate energy minimization via graph cuts[J]. IEEE Transactions on Pattern Analysis and Machine Intelligence, 2001,23(11):1222-1239.
    [7]
    Richard S, Ramin Z, Daniel S, et al. A comparative study of energy minimization methods for Markov random fields with smoothness-based priors[J]. Pattern Analysis and Machine Intelligence, IEEE Transactions on, 2006, 30(6):1068-1080.
    [8]
    Cucchiara R, Grana C, Piccardi M, et al. Improving shadow suppression in moving object detection with HSV color information //The 4th International IEEE Conference on Intelligent Transportation Systems. Washington D C, USA: Intelligent Transportation Systems Society, 2001:334-339.
    [9]
    Hong Z, Shuming Z, Jianying W, et al. An algorithm of pornographic image detection //4th International Conference on Image and Graphics(ICIG 2007). Washington D C, USA: IEEE Computer Society, 2007:801-804.
    [10]
    Daniel S, Chris P. Learning conditional random fields for stereo //2007 Conference on Computer Vision and Pattern Recognition. Washington D C, USA: IEEE Computer Society, 2007:1-8.
    [11]
    Heiko H, Daniel S. Evaluation of cost functions for stereo matching //2007 Conference on Computer Vision and Pattern Recognition. Washington D C, USA: IEEE Computer Society, 2007:32-39.
    • Relative Articles
  • Supplements (0)
  • Cited By
  • 加载中

Catalog

    通讯作者:陈斌, bchen63@163.com
    • 1.

      沈阳化工大学材料科学与工程学院 沈阳 110142

    1. 本站搜索
    2. 百度学术搜索
    3. 万方数据库搜索
    4. CNKI搜索
    Get Citation
    PDF
    XML

    Article Metrics

    Article views (680) PDF downloads(237) Cited by()
    Proportional views
    Related

    Address:5 Zhongguancun South Street, Haidian District, Beijing

    Tel:86-10-68914374

    Email:blgywb@bit.edu.cn

    Copy Right © Journal of Beijing Institute of Technology

    Supported by:Beijing Renhe Information Technology Co. Ltd

    /

      Return
      Return
        Baidu
        map