检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]燕山大学信息科学与工程学院,秦皇岛066004 [2]上海安全生产科学研究所,上海200000
出 处:《仪器仪表学报》2010年第3期600-605,共6页Chinese Journal of Scientific Instrument
基 金:河北省自然科学基金(F200800891);中国博士后科学基金(20080440124);燕山大学博士基金(B287);第二批中国博士后基金特别资助(200902356)资助项目
摘 要:图像修复的性能依赖于局部邻域信息的利用,同时要求修复的方向与结构性内容具有一致性,针对这两个关键问题,本文提出基于局部自适应学习基稀疏约束结合信息优先权选择扩散的迭代滤波图像修复思路。该算法首先学习丢失区邻域得到一组具有局部自适应性的稀疏基,然后沿着等照度线方向按照优先权选择扩散的顺序利用稀疏重构理论以这组基逐层投影重构丢失区域,通过迭代执行分层修复实现对丢失区域的渐进逼近。实验结果表明,该算法无论对于纹理图像、边界图像还是自然图像都可达到较好的效果,而且在峰值信噪比上优于已有文献的方法。The performance of image inpainting is dependent on the utilization of local neighborhood information and the inpainting direction is supposed to keep consistent with the structure information for avoiding wrong diffusion. Aiming at these two issues,iterative image inpainting using sparse constraint with local adaptive learned dictionary and informational priority selected diffusion is proposed in this paper.Firstly,the algorithm obtains a group of local adaptive sparse bases by training a set of samples selected from the neighborhood of the lost area. Secondly,a hierarchical model is adopted in the step of image inpainting.According to sparse reconstruction theory, the lost area is reconstructed from the projection layer by layer along isophote direction using the local adaptive sparse bases with the priority selected diffusion method.This process is performed through iteration process until the result is convergent.Experiments on texture images,structure images and real images demonstrate that the proposed algorithm is efficient and could achieve better performance.
分 类 号:TP391[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.63