Robust Video Restoration by Joint Sparse and Low Rank Matrix Approximation

被引:158
作者
Ji, Hui [1 ]
Huang, Sibin [1 ]
Shen, Zuowei [1 ]
Xu, Yuhong [1 ]
机构
[1] Natl Univ Singapore, Dept Math, Singapore 119073, Singapore
关键词
nuclear norm; low-rank matrix; sparse matrix; denoising; in-painting; PROXIMAL GRADIENT ALGORITHM; IMAGE; REMOVAL;
D O I
10.1137/100817206
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
This paper presents a new patch-based video restoration scheme. By grouping similar patches in the spatiotemporal domain, we formulate the video restoration problem as a joint sparse and low-rank matrix approximation problem. The resulting nuclear norm and l(1) norm related minimization problem can also be efficiently solved by many recently developed numerical methods. The effectiveness of the proposed video restoration scheme is illustrated on two applications: video denoising in the presence of random-valued noise, and video in-painting for archived films. The numerical experiments indicate that the proposed video restoration method compares favorably against many existing algorithms.
引用
收藏
页码:1122 / 1142
页数:21
相关论文
共 38 条
[1]  
[Anonymous], 2010, UILUENG092215
[2]  
[Anonymous], 2011, P 28 INT C MACHINE L
[3]  
[Anonymous], PACIFIC J O IN PRESS
[4]  
[Anonymous], P 15 EUR SIGN PROC C
[5]   A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems [J].
Beck, Amir ;
Teboulle, Marc .
SIAM JOURNAL ON IMAGING SCIENCES, 2009, 2 (01) :183-202
[6]   Image inpainting [J].
Bertalmio, M ;
Sapiro, G ;
Caselles, V ;
Ballester, C .
SIGGRAPH 2000 CONFERENCE PROCEEDINGS, 2000, :417-424
[7]  
Bohannan C, 2009, IEEE ICC, P138
[8]  
Bovik A.C., 2000, HDB IMAGE VIDEO PROC
[9]   A review of image denoising algorithms, with a new one [J].
Buades, A ;
Coll, B ;
Morel, JM .
MULTISCALE MODELING & SIMULATION, 2005, 4 (02) :490-530
[10]   A SINGULAR VALUE THRESHOLDING ALGORITHM FOR MATRIX COMPLETION [J].
Cai, Jian-Feng ;
Candes, Emmanuel J. ;
Shen, Zuowei .
SIAM JOURNAL ON OPTIMIZATION, 2010, 20 (04) :1956-1982