Compressive sensing and adaptive direct sampling in hyperspectral imaging

被引:53
作者
Hahn, Juergen [1 ]
Debes, Christian [2 ]
Leigsnering, Michael [1 ]
Zoubir, Abdelhak M. [1 ]
机构
[1] Tech Univ Darmstadt, Inst Telecommun, Signal Proc Grp, D-64283 Darmstadt, Germany
[2] AGT Grp R&D GmbH, D-64295 Darmstadt, Germany
关键词
Compressive sensing; Hyperspectral imaging; Classification; Image reconstruction; Sampling strategy; ANOMALY DETECTION; CLASSIFICATION; RECONSTRUCTION; QUALITY;
D O I
10.1016/j.dsp.2013.12.001
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Hyperspectral imaging (HSI) is an emerging technique, which provides the continuous acquisition of electro-magnetic waves, usually covering the visible as well as the infrared light range. Many materials can be easily discriminated by means of their spectra rendering HSI an interesting method for the reliable classification of contents in a scene. Due to the high amount of data generated by HSI, effective compression algorithms are required. The computational complexity as well as the potentially high number of sensors render HSI an expensive technology. It is thus of practical interest to reduce the number of required sensor elements as well as computational complexity - either for cost or for energy reasons. In this paper, we present two different systems that acquire hyperspectral images with less samples than the actual number of pixels, i.e. in a low dimensional representation. First, a design based on compressive sensing (CS) is explained. Second, adaptive direct sampling (ADS) is utilized to obtain coefficients of hyperspectral images in the 3D (Haar) wavelet domain, simplifying the reconstruction process significantly. Both approaches are compared with conventionally captured images with respect to image quality and classification accuracy. Our results based on real data show that in most cases only 40% of the samples suffice to obtain high quality images. Using ADS, the rate can be reduced even to a greater extent. Further results confirm that, although the number of acquired samples is dramatically reduced, we can still obtain high classification rates. (C) 2013 Elsevier Inc. All rights reserved.
引用
收藏
页码:113 / 126
页数:14
相关论文
共 49 条
[1]  
[Anonymous], 2010, An efficient algorithm for total variation regularization with applications to the single pixel camera and compressive sensing
[2]   IEEE-SPS and connexions - An open access education collaboration [J].
Baraniuk, Richard G. ;
Burrus, C. Sidney ;
Thierstein, E. Joel .
IEEE SIGNAL PROCESSING MAGAZINE, 2007, 24 (06) :6-+
[3]  
Bayer R., 1972, Acta Informatica, V1, P290, DOI 10.1007/BF00289509
[4]  
Bishop C., 2006, PATTERN RECOGN, DOI DOI 10.1117/1.2819119
[5]  
Candes E.J., 2005, l1-MAGIC: Recovery of sparse signals via convex programming
[6]   Robust uncertainty principles:: Exact signal reconstruction from highly incomplete frequency information [J].
Candès, EJ ;
Romberg, J ;
Tao, T .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2006, 52 (02) :489-509
[7]   Stable signal recovery from incomplete and inaccurate measurements [J].
Candes, Emmanuel J. ;
Romberg, Justin K. ;
Tao, Terence .
COMMUNICATIONS ON PURE AND APPLIED MATHEMATICS, 2006, 59 (08) :1207-1223
[8]   LIBSVM: A Library for Support Vector Machines [J].
Chang, Chih-Chung ;
Lin, Chih-Jen .
ACM TRANSACTIONS ON INTELLIGENT SYSTEMS AND TECHNOLOGY, 2011, 2 (03)
[9]  
Cormen T., 2001, Introduction to Algorithms
[10]  
Debes C., 2013, IEEE J SEL IN PRESS