基于种子区域增长的快速图像融合  

Fast Image Blending Using Seeded Region Growing

作　　者：赵毅力[1,2] 徐丹[1] 钱文华[1] 张雁[2] 

机构地区：[1]云南大学信息学院,昆明650091 [2]西南林业大学计算机与信息学院,昆明650224

出　　处：《系统仿真学报》2016年第9期1985-1989,共5页Journal of System Simulation

基　　金：国家自然科学基金(61163019;61462093;61462078);云南省教育厅科学研究基金(2015Y285)

摘　　要：提出一种对一组配准图像进行快速无缝融合的方法。该方法使用基于优先级队列的种子区域增长算法来快速计算重叠图像之间的最优拼接线。使用种子区域增长算法在图像重叠区域搜索可能的拼接线,使得图像的融合时间显著减少。采用种子区域增长来求解图像重叠区域的拼接线能够保证图像之间的每个重叠区域都能计算得到近似最优解,这些重叠区域的独立性使得该算法适合于并行实现。对提出的方法和基于图割以及基于分水岭变换的图像融合方法进行了比较和评估。This paper presented a novel approach for combining and blending a set of aligned images into a composite mosaic with no visible seams. The compositing seam is found efficiently via seeded region growing using a photometric criterion. A contribution of this paper is to use seeded region growing on image differences to find possible seams over areas of low photometric difference. This can result in significant reduction of blending time. The using of seeded region growing over image pairs guaranteed the approximate optimal solution for each intersection region. The independence of such regions makes the algorithm suitable for parallel implementation. The proposed method is evaluated with pixel based graph cut and watershed based graph cut with qualitative and quantitative comparison.

关 键 词：图像拼接 分水岭变换 图割 种子区域增长 图像融合 

分 类 号：TP391.9[自动化与计算机技术—计算机应用技术]