Different Labels in Energy Minimized via Graph Cuts for Stereo Matching

被引:0
|
作者
Liu, Yu [1 ]
Lin, Xiaoyong [1 ]
Chen, Xiang [1 ]
Hu, Lihua [1 ]
机构
[1] Zhejiang Sci Tech Univ, Automat Inst, Hangzhou 310018, Peoples R China
关键词
Markov Random Fields; graph cuts; stereo matching; Expansion moves; Swap moves;
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Several new algorithms for stereo matching based on graph cuts have recently been developed for pixel-labeling tasks such as depth. Such problem can be expressed as Markov random fields, yet the resulting energy minimization problems have been widely viewed as intractable. In this paper, we describe energy minimization based on graph cuts. The data term of energy function adopts three different approaches to obtain labels such as Birchfield and Tomasi [2] approach, the absolute difference between corresponding pixels and the squared difference between corresponding pixels. The smoothness term of energy function uses Expansion moves and Swap moves to compute a local minimum. The experimental results demonstrate differences between the three approaches efficiently. We compared the solutions quality and running time and analyzed excellence and disadvantage.
引用
收藏
页码:455 / 459
页数:5
相关论文
共 50 条
  • [41] An improved graph cut algorithm in stereo matching
    Lu, Baoli
    Sun, Liang
    Yu, Lina
    Dong, Xiaoli
    DISPLAYS, 2021, 69
  • [42] Efficient Stereo Matching Using Dynamic Graph
    Deng, Jian
    Wang, Yuehuan
    PATTERN RECOGNITION AND COMPUTER VISION, PT IX, PRCV 2024, 2025, 15039 : 84 - 98
  • [43] Handling occlusions method for stereo correspondence using graph cuts
    Zhu, Qingbo
    Wang, Hongyuan
    Huazhong Keji Daxue Xuebao (Ziran Kexue Ban)/Journal of Huazhong University of Science and Technology (Natural Science Edition), 2010, 38 (01): : 81 - 84
  • [44] Edge and sampling based stereo correspondence using graph cuts
    Liu, Xiao
    Li, Zhaohui
    Li, Dongmei
    Jiang, Xiuhua
    Journal of Computational Information Systems, 2014, 10 (01): : 349 - 356
  • [45] Computing Stereo Correspondence based on Motion Detection and Graph Cuts
    Liu, Xiao
    Li, ZhaoHui
    Li, DongMei
    Wang, LingYun
    PROCEEDINGS OF THE 2012 SECOND INTERNATIONAL CONFERENCE ON INSTRUMENTATION & MEASUREMENT, COMPUTER, COMMUNICATION AND CONTROL (IMCCC 2012), 2012, : 1468 - 1471
  • [46] Multi-view Stereo Reconstruction via Voxel Clustering and Optimization of Parallel Volumetric Graph Cuts
    Zhu Yun-Feng
    Zhang Yu-Jin
    PARALLEL PROCESSING FOR IMAGING APPLICATIONS, 2011, 7872
  • [47] Computationally efficient graph matching via energy vector extraction
    Amato, Ariel
    Al Haj, Murad
    Llados, Josep
    Gonzalez, Jordi
    PROGRESS IN PATTERN RECOGNITION, 2007, : 47 - +
  • [48] Object Tracking via Graph Cuts
    Nelson, Alexander M.
    Neubert, Jeremiah J.
    APPLICATIONS OF DIGITAL IMAGE PROCESSING XXXII, 2009, 7443
  • [49] Tracking with Occlusions via Graph Cuts
    Papadakis, Nicolas
    Bugeau, Aurelie
    IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2011, 33 (01) : 144 - 157
  • [50] The matching energy of a graph
    Gutman, Ivan
    Wagner, Stephan
    DISCRETE APPLIED MATHEMATICS, 2012, 160 (15) : 2177 - 2187