西安电子科技大学学报 ›› 2016, Vol. 43 ›› Issue (4): 172-177.doi: 10.3969/j.issn.1001-2400.2016.04.030

• 研究论文 • 上一篇    下一篇

图像修复问题的低秩对偶逼近算法

冯象初;王斯琪;李小平   

  1. (西安电子科技大学 数学与统计学院,陕西 西安  710071)
  • 收稿日期:2015-05-04 出版日期:2016-08-20 发布日期:2016-10-12
  • 通讯作者: 王斯琪(1987-),女,西安电子科技大学博士研究生,E-mail:pearlwangxd@163.com.
  • 作者简介:冯象初(1962-),男,教授,E-mail:xcfeng@mail.xidian.edu.cn.
  • 基金资助:

    国家自然科学基金资助项目(61271294,61472303);中央高校基本科研业务费专项资金资助项目(NSIY21)

Low-rank and dual approximation method for  image inpainting problems

FENG Xiangchu;WANG Siqi;LI Xiaoping   

  1. (School of Mathematics and Statistics, Xidian Univ., Xi'an  710071, China)
  • Received:2015-05-04 Online:2016-08-20 Published:2016-10-12

摘要:

为改进传统基于样本修复方法在实际应用中的不足,提出了一种新的图像修复算法.新算法以显著性排序法确保优先修复含明显结构边的目标块,利用图像欧氏距离搜索与该目标块匹配的相似样本块,对由搜索样本向量化构成的相似块矩阵进一步采用低秩对偶逼近提取可用信息以修复缺失像素.实验表明,新算法能够准确地优先修复显著性结构,且对多种类型的缺失均具有较好的修复效果.

关键词: 图像修复, 边界检测, 图像欧氏距离, 逼近理论

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