Optimal seamline detection in dynamic scenes via graph cuts for image mosaicking

被引:10
作者
Li, Li [1 ]
Yao, Jian [1 ]
Li, Haoang [1 ]
Xia, Menghan [1 ]
Zhang, Wei [2 ]
机构
[1] Wuhan Univ, Sch Remote Sensing & Informat Engn, Comp Vis & Remote Sensing CVRS Lab, Wuhan, Hubei, Peoples R China
[2] Shandong Univ, Sch Control Sci & Engn, Jinan, Shandong, Peoples R China
基金
中国国家自然科学基金;
关键词
Image mosaicking; Seamline detection; Dynamic object compensation; Graph cuts; Image parallax; ENERGY MINIMIZATION; QUALITY ASSESSMENT;
D O I
10.1007/s00138-017-0874-y
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In this paper, we present a novel method for creating a seamless mosaic from a set of geometrically aligned images captured from the scene with dynamic objects at different times. The artifacts caused by dynamic objects and geometric misalignments can be effectively concealed in our proposed seamline detection algorithm. In addition, we simultaneously compensate the image regions of dynamic objects based on the optimal seamline detection in the graph cuts energy minimization framework and create the mosaic with a relatively clean background. To ensure the high quality of the optimal seamline, the energy functions adopted in graph cuts combine the pixel-level similarities of image characteristics, including intensity and gradient, and the texture complexity. To successfully compensate the image regions covered by dynamic objects for creating a mosaic with a relatively clean background, we initially detect them in overlap regions between images based on pixel-level and region-level similarities, then refine them based on segments, and determine their image source in probability based on contour matching. We finally integrate all of these into the energy minimization framework to detect optimal seamlines. Experimental results on different dynamic scenes demonstrate that our proposed method is capable of generating high-quality mosaics with relatively clean backgrounds based on the detected optimal seamlines.
引用
收藏
页码:819 / 837
页数:19
相关论文
共 32 条
  • [1] SLIC Superpixels Compared to State-of-the-Art Superpixel Methods
    Achanta, Radhakrishna
    Shaji, Appu
    Smith, Kevin
    Lucchi, Aurelien
    Fua, Pascal
    Suesstrunk, Sabine
    [J]. IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2012, 34 (11) : 2274 - 2281
  • [2] [Anonymous], EUR C COMP VIS ECCV
  • [3] [Anonymous], 2006, IEEE COMP SOC C COMP
  • [4] [Anonymous], 2005, P IEEE C COMP VIS PA
  • [5] [Anonymous], 2010 IEEE INT C AC S
  • [6] Bellman R. E., 1957, Dynamic programming. Princeton landmarks in mathematics
  • [7] Boutellier J.J., 2007, P SPIE ELECT IMAGING, V6498
  • [8] Fast approximate energy minimization via graph cuts
    Boykov, Y
    Veksler, O
    Zabih, R
    [J]. IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2001, 23 (11) : 1222 - 1239
  • [9] An experimental comparison of min-cut/max-flow algorithms for energy minimization in vision
    Boykov, Y
    Kolmogorov, V
    [J]. IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2004, 26 (09) : 1124 - 1137
  • [10] Automatic panoramic image stitching using invariant features
    Brown, Matthew
    Lowe, David G.
    [J]. INTERNATIONAL JOURNAL OF COMPUTER VISION, 2007, 74 (01) : 59 - 73