Dictionary learning method for joint sparse representation-based image fusion

被引:133
作者
Zhang, Qiheng [1 ]
Fu, Yuli [1 ]
Li, Haifeng [1 ]
Zou, Jian [1 ]
机构
[1] S China Univ Technol, Sch Elect & Informat Engn, Guangzhou 510640, Guangdong, Peoples R China
关键词
joint sparse representation; method of optimal directions for joint sparse representation; method of optimal directions for generalized joint sparse representation; K-singular value decomposition; image fusion; RECOVERY; FOCUSS;
D O I
10.1117/1.OE.52.5.057006
中图分类号
O43 [光学];
学科分类号
070207 ; 0803 ;
摘要
Recently, sparse representation (SR) and joint sparse representation (JSR) have attracted a lot of interest in image fusion. The SR models signals by sparse linear combinations of prototype signal atoms that make a dictionary. The JSR indicates that different signals from the various sensors of the same scene form an ensemble. These signals have a common sparse component and each individual signal owns an innovation sparse component. The JSR offers lower computational complexity compared with SR. First, for JSR-based image fusion, we give a new fusion rule. Then, motivated by the method of optimal directions (MOD), for JSR, we propose a novel dictionary learning method (MODJSR) whose dictionary updating procedure is derived by employing the JSR structure one time with singular value decomposition (SVD). MODJSR has lower complexity than the K-SVD algorithm which is often used in previous JSR-based fusion algorithms. To capture the image details more efficiently, we proposed the generalized JSR in which the signals ensemble depends on two dictionaries. MODJSR is extended to MODGJSR in this case. MODJSR/MODGJSR can simultaneously carry out dictionary learning, denoising, and fusion of noisy source images. Some experiments are given to demonstrate the validity of the MODJSR/MODGJSR for image fusion. (C) 2013 Society of Photo-Optical Instrumentation Engineers (SPIE)
引用
收藏
页数:11
相关论文
共 28 条
[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]  
ANDERSON E., 1999, LAPACK USERSGUIDE, V3rd
[3]  
[Anonymous], 1951, American journal of mathematics, DOI DOI 10.2307/2372313
[4]  
[Anonymous], 2005, Distributed compressed sensing
[5]  
Chen SSB, 2001, SIAM REV, V43, P129, DOI [10.1137/S003614450037906X, 10.1137/S1064827596304010]
[6]   Stable recovery of sparse overcomplete representations in the presence of noise [J].
Donoho, DL ;
Elad, M ;
Temlyakov, VN .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2006, 52 (01) :6-18
[7]   Optimally sparse representation in general (nonorthogonal) dictionaries via l1 minimization [J].
Donoho, DL ;
Elad, M .
PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA, 2003, 100 (05) :2197-2202
[8]  
Elad M., 2011, PERSONAL PAGE
[9]   Image denoising via sparse and redundant representations over learned dictionaries [J].
Elad, Michael ;
Aharon, Michal .
IEEE TRANSACTIONS ON IMAGE PROCESSING, 2006, 15 (12) :3736-3745
[10]  
Engan K, 1999, INT CONF ACOUST SPEE, P2443, DOI 10.1109/ICASSP.1999.760624