西安电子科技大学学报（自然科学版）2016，Vol.43Issue(4)：172-177,6.DOI:10.3969/j.issn.1001-2400.2016.04.030
图像修复问题的低秩对偶逼近算法
Low-rank and dual approximation method for image inpainting problems
摘要
Abstract
A novel image inpainting algorithm is proposed to improve the traditional exemplar‐based inpainting methods . The new approach uses a salient‐based ranking method to ensure the priority of the target patch with structure edges , whose similar exemplars would be measured by the image Euclidean distance . And a low‐rank and dual approximation of the selected exemplar matrix is used to extract the available information for inpainting . Experimental results show that the new algorithm preferentially repairs significant structures accurately , and performs well in different kinds of missing or damaged cases .关键词
图像修复/边界检测/图像欧氏距离/逼近理论Key words
image restoration/edge detection/image Euclidean distance/approximation theory分类
信息技术与安全科学引用本文复制引用
冯象初,王斯琪,李小平..图像修复问题的低秩对偶逼近算法[J].西安电子科技大学学报（自然科学版）,2016,43(4):172-177,6.基金项目
国家自然科学基金资助项目（61271294，61472303）；中央高校基本科研业务费专项资金资助项目 （）
