Implementation Strategies for Hyperspectral Unmixing Using Bayesian Source Separation

被引:50
作者
Schmidt, Frederic [2 ,3 ]
Schmidt, Albrecht [2 ]
Treguier, Erwan [2 ]
Guiheneuf, Mael [2 ]
Moussaoui, Said [1 ]
Dobigeon, Nicolas [4 ,5 ,6 ,7 ]
机构
[1] Ecole Cent Nantes, IRCCyN, Ctr Natl Rech, UMR 6597, F-44321 Nantes 3, France
[2] European Space Agcy, European Space Astron Ctr, Madrid 28692, Spain
[3] Univ Paris 11, Ctr Natl Rech Sci, F-91405 Orsay, France
[4] Univ Toulouse, IRIT, F-31071 Toulouse 7, France
[5] Univ Toulouse, Inst Natl Polytech Toulouse, F-31071 Toulouse 7, France
[6] Univ Toulouse, Ecole Natl Super Electrotech Elect Hydraul & Info, F-31071 Toulouse 7, France
[7] Univ Toulouse, Telecommun Space Aeronaut TeSA, F-31071 Toulouse 7, France
来源
IEEE TRANSACTIONS ON GEOSCIENCE AND REMOTE SENSING | 2010年 / 48卷 / 11期
关键词
Bayesian estimation; computation time; hyperspectral imaging; implementation strategy; source separation; INDEPENDENT COMPONENT ANALYSIS; ENDMEMBER EXTRACTION; MATRIX FACTORIZATION; ALGORITHM; DECOMPOSITION; MODEL; MARS; ICE;
D O I
10.1109/TGRS.2010.2062190
中图分类号
P3 [地球物理学]; P59 [地球化学];
学科分类号
0708 ; 070902 ;
摘要
Bayesian positive source separation (BPSS) is a useful unsupervised approach for hyperspectral data unmixing, where numerical nonnegativity of spectra and abundances has to be ensured, such as in remote sensing. Moreover, it is sensible to impose a sum-to-one (full additivity) constraint to the estimated source abundances in each pixel. Even though nonnegativity and full additivity are two necessary properties to get physically interpretable results, the use of BPSS algorithms has so far been limited by high computation time and large memory requirements due to the Markov chain Monte Carlo calculations. An implementation strategy that allows one to apply these algorithms on a full hyperspectral image, as it is typical in earth and planetary science, is introduced. The effects of pixel selection and the impact of such sampling on the relevance of the estimated component spectra and abundance maps, as well as on the computation times, are discussed. For that purpose, two different data sets have been used: a synthetic one and a real hyperspectral image from Mars.
引用
收藏
页码:4003 / 4013
页数:11
相关论文
共 49 条
[1]  
Amari, 2002, ADAPTIVE BLIND SIGNA
[2]  
[Anonymous], 2001, ADAPTIVE LEARNING SY
[3]  
[Anonymous], 2004, Mars Express: The scientific payload
[4]  
[Anonymous], P 16 IEEE INT C IM P
[5]  
[Anonymous], 2007, Hyperspectral data exploitation: theory and applications
[6]  
[Anonymous], 2007, USGS NUMBERED SERIES, DOI DOI 10.3133/DS231
[7]  
[Anonymous], P 36 LUN PLAN SCI C
[8]   Bayesian approach with hidden Markov modeling and mean field approximation for hyperspectral data analysis [J].
Bali, Nadia ;
Mohammad-Djafari, Ali .
IEEE TRANSACTIONS ON IMAGE PROCESSING, 2008, 17 (02) :217-225
[9]   The Quickhull algorithm for convex hulls [J].
Barber, CB ;
Dobkin, DP ;
Huhdanpaa, H .
ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE, 1996, 22 (04) :469-483
[10]   ICE: A statistical approach to identifying endmembers in hyperspectral images [J].
Berman, M ;
Kiiveri, H ;
Lagerstrom, R ;
Ernst, A ;
Dunne, R ;
Huntington, JF .
IEEE TRANSACTIONS ON GEOSCIENCE AND REMOTE SENSING, 2004, 42 (10) :2085-2095