Robust Locally Linear Analysis with Applications to Image Denoising and Blind Inpainting

被引:29
作者
Wang, Yi [1 ]
Szlam, Arthur [2 ]
Lerman, Gilad [1 ]
机构
[1] Univ Minnesota, Sch Math, Minneapolis, MN 55455 USA
[2] CUNY City Coll, Dept Math, New York, NY 10031 USA
基金
美国国家科学基金会;
关键词
denoising; impulsive noise; blind inpainting; alternating least squares; locally linear; robust PCA; multiple subspaces modeling; subspace clustering; MATRIX FACTORIZATION; LOW-RANK; ALGORITHM;
D O I
10.1137/110843642
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
We study the related problems of denoising images corrupted by impulsive noise and blind inpainting (i.e., inpainting when the deteriorated region is unknown). Our basic approach is to model the set of patches of pixels in an image as a union of low-dimensional subspaces, corrupted by sparse but perhaps large magnitude noise. For this purpose, we develop a robust and iterative method for single subspace modeling and extend it to an iterative algorithm for modeling multiple subspaces. We prove convergence for both algorithms and carefully compare our methods with other recent ideas for such robust modeling. We demonstrate state-of-the-art performance of our method for both imaging problems.
引用
收藏
页码:526 / 562
页数:37
相关论文
共 49 条
[21]  
KYRILLIDIS A. T., 2012, ABS12033864 CORR
[22]  
Lee JA, 2007, INFORM SCI STAT, P1
[23]   ROBUST RECOVERY OF MULTIPLE SUBSPACES BY GEOMETRIC lp MINIMIZATION [J].
Lerman, Gilad ;
Zhang, Teng .
ANNALS OF STATISTICS, 2011, 39 (05) :2686-2715
[24]  
Liang X, 2012, LECT NOTES COMPUT SC, V7576, P482, DOI 10.1007/978-3-642-33715-4_35
[25]  
Liu G., 2010, P 27 INT C MACH LEAR
[26]   Robust Recovery of Subspace Structures by Low-Rank Representation [J].
Liu, Guangcan ;
Lin, Zhouchen ;
Yan, Shuicheng ;
Sun, Ju ;
Yu, Yong ;
Ma, Yi .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2013, 35 (01) :171-184
[27]  
Maronna R.A., 2018, ROBUST STAT THEORY M
[28]  
Martin D, 2001, EIGHTH IEEE INTERNATIONAL CONFERENCE ON COMPUTER VISION, VOL II, PROCEEDINGS, P416, DOI 10.1109/ICCV.2001.937655
[29]   SUFFICIENT CONDITIONS FOR CONVERGENCE OF MONOTONIC MATHEMATICAL PROGRAMMING ALGORITHMS [J].
MEYER, RR .
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1976, 12 (01) :108-121
[30]   On the Wiberg algorithm for matrix factorization in the presence of missing components [J].
Okatani, Takayuki ;
Deguchi, Koichiro .
INTERNATIONAL JOURNAL OF COMPUTER VISION, 2007, 72 (03) :329-337