Methane retrievals from airborne HySpex observations in the shortwave infrared

Abstract

Monitoring anthropogenic emissions is a crucial aspect in understanding the methane budget. Moreover, a reduction of methane emissions could help to mitigate global warming on a short timescale. This study compares various retrieval schemes for estimating localized methane enhancements around ventilation shafts in the Upper Silesian Coal Basin in Poland using nadir observations in the shortwave infrared acquired from the airborne imaging spectrometer HySpex. Linear and nonlinear solvers are examined and compared, with special emphasis put on strategies that tackle degeneracies between the surface reflectivity and broad-band molecular absorption features - a challenge arising from the instrument's low spectral resolution. Results reveal that the generalized nonlinear least squares fit, employed within the Beer InfraRed Retrieval Algorithm (BIRRA), can measure enhanced methane levels with notable accuracy and precision. This is accomplished by allowing the scene's background covariance structure to account for surface reflectivity statistics. Linear estimators such as matched filter (MF) and singular value decomposition (SVD) are able to detect and, under favorable conditions, quantify enhanced levels of methane quickly. Using k-means clustering as a preprocessing step can further enhance the performance of the two linear solvers. The linearized BIRRA fit (LLS) underestimates methane but agrees on the enhancement pattern. The non-quantitative spectral signature detection (SSD) method does not require any forward modeling and can be useful in the detection of relevant scenes. In conclusion, the BIRRA code, originally designed for the retrieval of atmospheric constituents from spaceborne high-resolution spectra, turned out to be applicable to hyperspectral airborne imaging data for the quantification of methane plumes from point-like sources. Moreover, it is able to outperform well-established linear schemes such as the MF or SVD at the expense of high(er) computing time.