Fast sparse Raman spectral unmixing for chemical fingerprinting and quantification

Raman spectroscopy is a well-established spectroscopic method for the detection of condensed phase chemicals. It is based on scattered light from exposure of a target material to a narrowband laser beam. The information generated enables presumptive identification from measuring correlation with library spectra. Whilst this approach is successful in identification of chemical information of samples with one component, it is more difficult to apply to spectral mixtures. The capability of handling spectral mixtures is crucial for defence and security applications as hazardous materials may be present as mixtures due to the presence of degradation, interferents or precursors. A novel method for spectral unmixing is proposed here. Most modern decomposition techniques are based on the sparse decomposition of mixture and the application of extra constraints to preserve the sum of concentrations. These methods have often been proposed for passive spectroscopy, where spectral baseline correction is not required. Most successful methods are computationally expensive, e.g. convex optimisation and Bayesian approaches. We present a novel low complexity sparsity based method to decompose the spectra using a reference library of spectra. It can be implemented on a hand-held spectrometer in near to real-time. The algorithm is based on iteratively subtracting the contribution of selected spectra and updating the contribution of each spectrum. The core algorithm is called fast non-negative orthogonal matching pursuit, which has been proposed by the authors in the context of nonnegative sparse representations. The iteration terminates when the maximum number of expected chemicals has been found or the residual spectrum has a negligible energy, i.e. in the order of the noise level. A backtracking step removes the least contributing spectrum from the list of detected chemicals and reports it as an alternative component. This feature is particularly useful in detection of chemicals with small contributions, which are normally not detected. The proposed algorithm is easily reconfigurable to include new library entries and optional preferential threat searches in the presence of predetermined threat indicators. Under Ministry of Defence funding, we have demonstrated the algorithm for fingerprinting and rough quantification of the concentration of chemical mixtures using a set of reference spectral mixtures. In our experiments, the algorithm successfully managed to detect the chemicals with concentrations below 10 percent. The running time of the algorithm is in the order of one second, using a single core of a desktop computer.

[1]  Zhifeng Zhang,et al.  Adaptive time-frequency decompositions with matching pursuit , 1994, Defense, Security, and Sensing.

[2]  Vincent Mazet,et al.  Background removal from spectra by designing and minimising a non-quadratic cost function , 2005 .

[3]  V. Dose,et al.  Background estimation in experimental spectra , 2000, Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics.

[4]  Yi-Zeng Liang,et al.  Baseline correction using adaptive iteratively reweighted penalized least squares. , 2010, The Analyst.

[5]  Yi-Zeng Liang,et al.  An intelligent background-correction algorithm for highly fluorescent samples in Raman spectroscopy , 2010 .

[6]  C. Andrieu,et al.  Bayesian model selection and parameter estimation of nuclear emission spectra using RJMCMC , 2003 .

[7]  Y. C. Pati,et al.  Orthogonal matching pursuit: recursive function approximation with applications to wavelet decomposition , 1993, Proceedings of 27th Asilomar Conference on Signals, Systems and Computers.

[8]  Jun Zhou,et al.  Hyperspectral Unmixing via $L_{1/2}$ Sparsity-Constrained Nonnegative Matrix Factorization , 2011, IEEE Transactions on Geoscience and Remote Sensing.

[9]  Mike E. Davies,et al.  Fast Non-Negative Orthogonal Matching Pursuit , 2015, IEEE Signal Processing Letters.

[10]  Di Wu,et al.  A sparse regularized model for Raman spectral analysis , 2014, 2014 Sensor Signal Processing for Defence (SSPD).

[11]  Manuel Martín-Pastor,et al.  A new general-purpose fully automatic baseline-correction procedure for 1D and 2D NMR data. , 2006, Journal of magnetic resonance.

[12]  A. Bruckstein,et al.  Sparse non-negative solution of a linear system of equations is unique , 2008, 2008 3rd International Symposium on Communications, Control and Signal Processing.

[13]  Antonio J. Plaza,et al.  Sparse Unmixing of Hyperspectral Data , 2011, IEEE Transactions on Geoscience and Remote Sensing.

[14]  Jens Petter Wold,et al.  Raman Spectra of Biological Samples: A Study of Preprocessing Methods , 2006, Applied spectroscopy.

[15]  Jean-Yves Tourneret,et al.  Nonlinear unmixing of hyperspectral images using a generalized bilinear model , 2011, 2011 IEEE Statistical Signal Processing Workshop (SSP).

[16]  K. Nakamoto,et al.  Introductory Raman Spectroscopy , 1994 .

[17]  Jean-Yves Tourneret,et al.  Nonlinear Spectral Unmixing of Hyperspectral Images Using Gaussian Processes , 2012, IEEE Transactions on Signal Processing.