Sparse representation for color image restoration

被引:1244
作者
Mairal, Julien [1 ,3 ]
Elad, Michael [1 ,4 ]
Sapiro, Guillermo [2 ,5 ]
机构
[1] Univ Minnesota, Dept Elect & Comp Engn, Minneapolis, MN 55455 USA
[2] Technion Israel Inst Technol, Dept Comp Sci, IL-32000 Haifa, Israel
[3] INRIA Project Odyssee, Paris, France
[4] Stanford Univ, Dept Comp Sci, SCCM Program, Stanford, CA 94305 USA
[5] HP Labs, Palo Alto, CA USA
基金
美国国家科学基金会; 以色列科学基金会;
关键词
color processing; denoising; demosaicing; image decomposition; image processing; image representations; inpainting; sparse representation;
D O I
10.1109/TIP.2007.911828
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Sparse representations of signals have drawn considerable interest in recent years. The assumption that natural signals, such as images, admit a sparse decomposition over a redundant dictionary leads to efficient algorithms for handling such sources of data. In particular, the design of well adapted dictionaries for images has been a major challenge. The K-SVD has been recently proposed for this task [1] and shown to perform very well for various grayscale image processing tasks. In this paper, we address the problem of learning dictionaries for color images and extend the K-SVD-based grayscale image denoising algorithm that appears in [2]. This work puts forward ways for handling nonhomogeneous noise and missing information, paving the way to state-of-the-art results in applications such as color image denoising, demosaicing, and inpainting, as demonstrated in this paper.
引用
收藏
页码:53 / 69
页数:17
相关论文
共 59 条
[1]   K-SVD: An algorithm for designing overcomplete dictionaries for sparse representation [J].
Aharon, Michal ;
Elad, Michael ;
Bruckstein, Alfred .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2006, 54 (11) :4311-4322
[2]  
[Anonymous], 1999, ICCV
[3]  
[Anonymous], P CVPR
[4]  
[Anonymous], 2006, P 23 INT C MACH LEAR, DOI [10.1145/1143844.1143922, DOI 10.1145/1143844.1143922]
[5]  
[Anonymous], 1999, WAVELET TOUR SIGNAL
[6]   Limits on super-resolution and how to break them [J].
Baker, S ;
Kanade, T .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2002, 24 (09) :1167-1183
[7]   Image inpainting [J].
Bertalmio, M ;
Sapiro, G ;
Caselles, V ;
Ballester, C .
SIGGRAPH 2000 CONFERENCE PROCEEDINGS, 2000, :417-424
[8]   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
[9]  
Buades A., 2005, IEEE COMP VIS PATT R
[10]   Image compression via joint statistical characterization in the wavelet domain [J].
Buccigrossi, RW ;
Simoncelli, EP .
IEEE TRANSACTIONS ON IMAGE PROCESSING, 1999, 8 (12) :1688-1701