Research of Image Stitching Method Based on Graph Cuts and Poisson Fusion

This paper considers the problem of ghosting artifacts and stitching seam caused by image stitching and fusion directly, which influenced by the registration and geometric transformation, and the differences between the two images overlap region. This paper proposed maximum flow / minimum cut in graph cut algorithm to obtain the optimal stitching line. Considering the relationship between color difference and structural changes of pixels in the neighborhood, achieving costs or energy division minimize, thereby eliminating the stitching seams. And using the Poisson fusion technology, further eliminate ghosting artifacts caused by the brightness and color differences or moving objects in the image fusion process. The experiment proved that the algorithm of searching optimal stitching line and Poisson fusion algorithm in this paper, can eliminate ghosting artifacts and also be able to maximize avoid stitching seams appears, it presents good performance in applications.

[1]  Olga Veksler,et al.  Graph Cuts in Vision and Graphics: Theories and Applications , 2006, Handbook of Mathematical Models in Computer Vision.

[2]  Gareth Funka-Lea,et al.  Graph Cuts and Efficient N-D Image Segmentation , 2006, International Journal of Computer Vision.

[3]  D. R. Fulkerson,et al.  Flows in Networks. , 1964 .

[4]  Song-tao Liu,et al.  The Basic Principle and Its New Advances of Image Segmentation Methods Based on Graph Cuts , 2012 .

[5]  Shigang Wang,et al.  Adaptive Stereo Video Object Segmentation Based on Depth and Spatio-temporal Information , 2009, 2009 WRI World Congress on Computer Science and Information Engineering.

[6]  Patrick Pérez,et al.  Poisson image editing , 2003, ACM Trans. Graph..

[7]  Andrew V. Goldberg,et al.  On Implementing the Push—Relabel Method for the Maximum Flow Problem , 1997, Algorithmica.