Dictionary Learning for Noisy and Incomplete Hyperspectral Images

被引:92
作者
Xing, Zhengming [1 ]
Zhou, Mingyuan [1 ]
Castrodad, Alexey [2 ]
Sapiro, Guillermo [2 ]
Carin, Lawrence [1 ]
机构
[1] Duke Univ, Dept Elect & Comp Engn, Durham, NC 27708 USA
[2] Univ Minnesota, Dept Elect & Comp Engn, Minneapolis, MN 55455 USA
关键词
hyperspectral imagery; missing data; dictionary learning; sparse coding; Bayesian framework; Gaussian process; denoising; beta process; Indian buffet process; Gibbs sampler; parameter-free; interpolation; SPARSE REPRESENTATIONS; SEGMENTATION; ALGORITHM; SELECTION; EQUATIONS;
D O I
10.1137/110837486
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
We consider analysis of noisy and incomplete hyperspectral imagery, with the objective of removing the noise and inferring the missing data. The noise statistics may be wavelength dependent, and the fraction of data missing (at random) may be substantial, including potentially entire bands, offering the potential to significantly reduce the quantity of data that need be measured. To achieve this objective, the imagery is divided into contiguous three-dimensional (3D) spatio-spectral blocks of spatial dimension much less than the image dimension. It is assumed that each such 3D block may be represented as a linear combination of dictionary elements of the same dimension, plus noise, and the dictionary elements are learned in situ based on the observed data (no a priori training). The number of dictionary elements needed for representation of any particular block is typically small relative to the block dimensions, and all the image blocks are processed jointly ("collaboratively") to infer the underlying dictionary. We address dictionary learning from a Bayesian perspective, considering two distinct means of imposing sparse dictionary usage. These models allow inference of the number of dictionary elements needed as well as the underlying wavelength-dependent noise statistics. It is demonstrated that drawing the dictionary elements from a Gaussian process prior, imposing structure on the wavelength dependence of the dictionary elements, yields significant advantages, relative to the more conventional approach of using an independent and identically distributed Gaussian prior for the dictionary elements; this advantage is particularly evident in the presence of noise. The framework is demonstrated by processing hyperspectral imagery with a significant number of voxels missing uniformly at random, with imagery at specific wavelengths missing entirely, and in the presence of substantial additive noise.
引用
收藏
页码:33 / 56
页数:24
相关论文
共 55 条
[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], ADV NEURAL INFORM PR
[3]  
[Anonymous], P INT C COMP VIS
[4]  
[Anonymous], 2006, Advances in Neural Information Processing Systems (NIPS)
[5]  
[Anonymous], 2005, NIPS
[6]  
[Anonymous], 2009, P INT C MACH LEARN
[7]  
Bernardo J.M., 2000, BAYESIAN THEORY
[8]  
Bobin J., 2009, P SPIE, V7446
[9]   From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images [J].
Bruckstein, Alfred M. ;
Donoho, David L. ;
Elad, Michael .
SIAM REVIEW, 2009, 51 (01) :34-81
[10]   Self-Similarity Driven Color Demosaicking [J].
Buades, Antoni ;
Coll, Bartomeu ;
Morel, Jean-Michel ;
Sbert, Catalina .
IEEE TRANSACTIONS ON IMAGE PROCESSING, 2009, 18 (06) :1192-1202