This disclosure relates to processing a spectral dataset, such as a hyperspectral image or a large collection of individual spectra taken with the same spectrometer, to increase the signal-to-noise ratio. The methods can also be used to process a stack of images that differ by acquisition time rather than wavelength. The methods remove most of the sensor background noise with minimal corruption of image texture, anomalous or rare spectra or waveforms, and spectral or time resolution.
In hyperspectral imaging (HSI) sensors, images are collected in which each spatial pixel contains a spectrum—that is, a set of measured light intensities in a large number of spectral bands, typically tens to hundreds, each defined by a wavelength range and response function. Electronic noise, which may arise from the sensor itself or from statistical fluctuations in the background radiation, adds a corrupting component to the measurements, interfering with the data analysis. In the infrared (IR) region, optical sensors are especially susceptible to background noise. Measures to reduce noise in IR sensors, such as aggressive cooling and selection of only the best detectors, can make the superior IR sensors extremely expensive. Consequently, there is a need for data post-processing algorithms that can mitigate the effects of noise in the spectral data and provide useful data products from less expensive sensors. Certain of these algorithms might also be usefully applied to spectral datasets obtained with a non-imaging sensor that makes a large number of sequential spectral measurements, such as a laser Raman or fluorescence spectrometer, where there may be considerable noise from the scattered light background.
A number of methods for spectral imagery that reduce sensor noise, referred to as de-noising algorithms, have been described in the literature, and tend to fall into two major categories. Methods in the first category are known as spectral noise reduction methods since they work in the wavelength (spectral) coordinate and provide additional applicability to non-image datasets. Methods in the second category work in image spatial coordinates, and process one wavelength image at a time. The two methods can be combined, as in U.S. Pat. No. 8,358,866.
Qian, S., J. Lévesque and R. Neville, “Evaluation of Noise Removal of Radiance Data on Onboard Data Compression of Hyperspectral Imagery,” 2005 WSEAS Int. Conf. on Remote Sensing, Venice, Italy, pp. 37-42, Nov. 2-4, 2005 (“Qian [2005]”) describes a spectral noise reduction method for HSI data that separates the pixel spectra into distinct classes that differ by an amount greater than the noise level. The spectra in each class are then replaced by the class averages, thereby reducing the noise. A drawback of this method is that the number of required classes increases as the diversity of spectra increases and as the noise level decreases, resulting in increasing and unpredictable computation time. Another drawback is that many spectra may wind up in classes consisting only of themselves, even though they are similar to other spectra; those spectra do not undergo any noise reduction. Another drawback is that the transformation from input to output spectra is discontinuous, potentially leading to step artifacts in the output.
An alternative, more common spectral noise reduction method is to perform Maximum Noise Fraction (MNF) truncation, as first described by Green, A. A., M. Berman, P. Switzer, and M. D. Craig, “A Transformation for Ordering Multispectral Data in Terms of Image Quality with Implications for Noise Removal,” IEEE Transactions on Geoscience and Remote Sensing, 26(1):6574, 1988 (“Green [1988]”); a recent adaptation for HSI data processing is found in Bjorgan, A., and Randeberg, L L., “Real-Time Noise Removal for Line-Scanning Hyperspectral Devices Using a Maximum Noise Fraction-Based Approach,” Sensors (Basel, Switzerland), 15(2): 3362-3378, 2015, doi:10.3390/s150203362 (“Bjorgan [2015]”). The MNF operation transforms the data to an orthonormal coordinate system in which most of the noise is isolated from most of the signal. In this method, a variance or covariance linear operator describing the sensor noise is estimated from either the data itself or from a sensor specification. The data are then multiplied by the inverse square root of the operator, which “whitens” the noise, and the result is then processed with a Principal Component (PC) transformation. The PC transformation projects the spectra onto the eigenvectors of the spectral covariance matrix of the noise-whitened data. Each eigenvector has a corresponding eigenvalue. The combined noise whitening step and PC transformation can be considered as a single linear operation comprising the MNF transform, as described in Green [1988], Phillips, R. D., L. T. Watson, C. E. Blinn and R. H. Wynne, “An adaptive noise reduction technique for improving the utility of hyperspectral data,” Pecora 17, The Future of Land Imaging . . . Going Operational, Denver, Colo., Nov. 18-20, 2008 (“Phillips [2008]”) and Bjorgan [2015]. The MNF components (i.e., the projection coefficients) that correspond to very small eigenvalues, comparable to the noise variance, are dominated by noise. To suppress the noise in the data, these MNF components are set to zero. The data are then processed with the inverse MNF transform to restore the data to their original units. A serious drawback of this method is that this processing truncates the data dimensionality. This results in distortion of “rare” or anomalous spectra in the dataset, and makes it difficult, if not impossible, to use the processed data for a rare target detection application.
An improvement on the original MNF method for hyperspectral image denoising is described by Phillips [2008]. Instead of zeroing the noisy small-eigenvalue MNF components they are processed with spatial median filtering. This reduces the noise and retains the major spatial structure in those components, but their spatial resolution is reduced. As a result, rare or unusual spectra in the dataset that occupy a small area, such a few pixels or less, are distorted.
The second general class of noise reduction methods involves performing a wavelet transform on each wavelength band image. Example methods are described in Sihag, R., R. Sharma and V. Setia, “Wavelet Thresholding for Image De-noising,” ICVCI 2011, Proc. Int. J. Computer Applic. 2011 (“Sihag [2011]”) and Simoncelli, E. P. and Adelson, “Noise Removal via Bayesian Wavelet Coring,” Proc. 3rd IEEE Intl. Conf. on Image Processing, Vol I, pp. 379-382, Lausanne, 16-19 Sep. 1996 (“Simoncelli [1996]”). The sensor noise is preferentially found in the wavelet decomposition images that correspond to fine spatial structure. These decomposition images are processed with a threshold function. Signal absolute values below the threshold, which consist predominantly of noise, are set to zero, while signal absolute values above the threshold, which consist predominantly of true signal, are either left unchanged (with a “hard” threshold) or reduced (with a “soft” threshold). The soft threshold function is also known as a shrinkage function [Sihag, 2011]. The thresholded wavelet decomposition images are then processed with the inverse wavelet transform to yield a de-noised version of the original wavelength band image. A drawback of this method is that it has difficulty distinguishing sensor noise from surface texture, and thus it may over-smooth the image and degrade its sharpness. This will in turn distort the spectra. Also, wavelet methods are applicable only to image data, not individual spectra.
U.S. Pat. No. 8,358,866 for de-noising HSI data combines a wavelet transform method with a spectral filtering method. The method is also described in Othman, H. and Qian, S., “Noise reduction of hyperspectral imagery using hybrid spatial-spectral derivative-domain wavelet shrinkage”, IEEE Trans. Geosci. Remote Sensing, Vol. 44 (2), pp. 397-408, 2006 (“Othman [2006]”). First, wavelet de-noising is performed. The output is further processed by a spectral low-pass filtering step, involving taking differences of adjacent wavelengths, smoothing the result with a running low-pass filter, and then reversing the differencing process to restore the spectra, but with noise further reduced. This method has the advantages and disadvantage of other wavelet transform methods, but is capable of additional noise reduction via the spectral filtering step. On the other hand, the spectral filtering process can distort data that contain true spectral features that are comparable in resolution to the spectral resolution of the sensor. As an example of such features, remote sensing data acquired in the long wavelength infrared (LWIR) wavelength region contains fine spectral structure from atmospheric water vapor spectral lines. Since this structure is as narrow as, or narrower than, the spacing between adjacent wavelength bands of typical LWIR hyperspectral sensors, this structure may be lost in the low-pass filtering step.
Certain types of hyperspectral imaging sensors collect the data in a staring mode, in which images of a fixed view are sequentially collected at different wavelengths by tuning a wavelength-selective optical element. In this situation, the images differ in their acquisition time, and comprise staring video imagery. Therefore, it will occur to those skilled in the art that many of the HSI denoising algorithms may also be applied to ordinary staring video imagery, in which the wavelength is not being varied. These data, in which the time dimension replaces the wavelength dimension, comprise images of waveforms rather than images of spectra.
The signal-to-noise enhancement, or de-noising, of the present disclosure is aimed at improving the utility of hyperspectral imagery or other large spectral datasets without introducing significant spectral distortion in or spectral smoothing of the data, even for rare or anomalous spectra. In particular, this disclosure is aimed at enhancing the imagery from affordable infrared hyperspectral sensors, such as current commercial sensors operating in the mid-infrared to long-wavelength infrared. Since this method provides the best noise reduction for abundant spectra in the dataset, the method should especially benefit terrain classification applications, such as in minerology, agriculture, and land use. Another object of this disclosure is to provide a de-noising method for staring video imagery, which has the equivalent data structure to hyperspectral imagery. Another objective is to provide a method that is fully automated. Another objective is to provide a moderate, and predictable, computing time.
In one aspect, a signal-to-noise enhancement method includes receiving from a spectrometer a spectral dataset that comprises a multiplicity of spectra measured with the spectrometer, in which the number of spectra exceeds the number of measured wavelength bands of the spectrometer, estimating the covariance matrix of background noise associated with the measured spectra, transforming the multiplicity of spectra to Maximum Noise Fraction (MNF) components, each component comprising the coefficients resulting from projection of the multiplicity of spectra onto an individual MNF eigenvector, calculating nonlinear mathematical functions, associated with each individual MNF eigenvector, that convert the values of the MNF components of a given spectrum into estimated values of the corresponding noise-free MNF components of the given spectrum, applying the inverse MNF transform to convert the estimated noise-free MNF components of the multiplicity of spectra back into the original units of the spectra, and generating an output spectral dataset from the converted estimated noise-free MNF components of the multiplicity of spectra.
Embodiments may include one of the above and/or below features, or any combination thereof. The nonlinear mathematical functions may be given by: S(y)=exp(−|y/s|P)/[r exp(−y2)+exp(−|y/s|P)]. The nonlinear mathematical functions may be given by: S(y)=1/[r exp(−y2)+1]. The multiplicity of spectra may comprise a hyperspectral image.
In another aspect, a system includes a spectrometer that provides a multiplicity of spectra, in which the number of spectra exceeds the number of measured wavelength bands of the spectrometer, and digital image processing circuitry which, in operation: estimates the covariance matrix of background noise associated with the measured spectra, transforms the multiplicity of spectra to Maximum Noise Fraction (MNF) components, each component comprising the coefficients resulting from projection of the multiplicity of spectra onto an individual MNF eigenvector, calculates nonlinear mathematical functions, associated with each individual MNF eigenvector, that convert the values of the MNF components of a given spectrum into estimated values of the corresponding noise-free MNF components of the given spectrum, applies the inverse MNF transform to convert the estimated noise-free MNF components of the multiplicity of spectra back into the original units of the spectra, and generates an output spectral dataset from the converted estimated noise-free MNF components of the multiplicity of spectra.
Embodiments may include one of the above and/or below features, or any combination thereof. The nonlinear mathematical functions may be given by: S(y)=exp(−|y/s|P)/[r exp(−y2)+exp(−|y/s|P)]. The nonlinear mathematical functions may be given by: S(y)=1/[r exp(−y2)+1]. The spectrometer may comprise a hyperspectral imaging sensor.
In another aspect, a signal-to-noise enhancement method includes receiving from an imaging device a time series of images that comprise a multiplicity of image frames, in which the number of pixels exceeds the number of image frames, estimating the covariance matrix of the background noise associated with the images, transforming the multiplicity of images to Maximum Noise Fraction (MNF) components, each component comprising the coefficients resulting from projection of the pixel waveforms onto an individual MNF eigenvector, calculating nonlinear mathematical functions, associated with each individual MNF eigenvector, that convert the values of the MNF components of a given pixel waveform into estimated values of the corresponding noise-free MNF components of the given pixel waveform, and applying the inverse MNF transform to convert the estimated noise-free MNF components of the multiplicity of pixel waveforms back into the original units of the images. An output image dataset is generated from the converted estimated noise-free MNF components of the multiplicity of pixel waveforms.
Embodiments may include one of the above and/or below features, or any combination thereof. The nonlinear mathematical functions may be given by: S(y)=exp(−|y/s|P)/[r exp(−y2)+exp(−|y/s|P)]. The nonlinear mathematical functions may be given by: S(y)=1/[r exp(−y2)+1]. The covariance matrix of the background noise may comprise a diagonal constant matrix.
In another aspect, a system includes a camera that provides a time series of images that comprise a multiplicity of image frames, in which the number of pixels exceeds the number of image frames, and digital image processing circuitry which, in operation: estimates the covariance matrix of the background noise associated with the images, transforms the multiplicity of images to Maximum Noise Fraction (MNF) components, each component comprising the coefficients resulting from projection of the pixel waveforms onto an individual MNF eigenvector, calculates nonlinear mathematical functions, associated with each individual MNF eigenvector, that convert the values of the MNF components of a given pixel waveform into estimated values of the corresponding noise-free MNF components of the given pixel waveform, applies the inverse MNF transform to convert the estimated noise-free MNF components of the multiplicity of pixel waveforms back into the original units of the images, and generates an output image dataset from the converted estimated noise-free MNF components of the multiplicity of pixel waveforms.
Embodiments may include one of the above and/or below features, or any combination thereof. The nonlinear mathematical functions may be given by: S(y)=exp(−|y/s|P)/[r exp(−y2)+exp(−|y/s|P)]. The nonlinear mathematical functions may be given by S(y)=1/[r exp(−y2)+1]. The covariance matrix of the background noise may comprise a diagonal constant matrix.
Other objects, features and advantages will occur to those skilled in the art from the following detailed description, and the accompanying drawings, in which:
The signal-to-noise enhancement of this disclosure uses the MNF transform method for separating signal and noise components in multidimensional datasets in combination with the method of applying nonlinear multiplicative factors, called shrinkage functions, to the MNF components of each sample or pixel. In one example, a separate shrinkage function is defined for each MNF component using the Bayesian signal estimation formula. In essence, this method suppresses MNF transform values that are within the noise level, while retaining values that exceed the noise level, which arise from anomalous or rare samples.
In a first example of a signal-to-noise enhancement shown in
An estimate of the N×N noise covariance matrix 14 may be obtained by a number of different methods, including by analysis of the data itself or from a specification of the RMS noise supplied by the sensor manufacturer. Specific methods are described in Green [1988], Phillips [2008] and Bjorgan [2015]. Typically, the noise in different wavelength bands is considered to be uncorrelated, in which case the noise covariance is a diagonal matrix of noise variances for each wavelength band. If only an average noise variance is available, then the elements of the diagonal matrix are identical.
The MNF transform is described in numerous papers, including Phillips [2008] and Bjorgan [2015]. It can be regarded as a sequence of two steps. In the first step, which is a noise-whitening operation, the data are multiplied by the square root of the noise covariance matrix inverse. If the noise covariance matrix is diagonal, the whitening step is a spectral weighting of the data, in which the data are divided by the noise standard deviation. In the second step, a Principal Component (PC) transform is applied to the data. The MNF-transformed data consist of the projections of the mean spectrum-subtracted data onto the eigenvectors of the PC transform. We assume without loss of generality that the eigenvectors have been unit-normalized.
The two mathematical steps outlined above are equivalent to a single data transformation. The first step is to subtract the mean spectrum from the data. Using the notation in Phillips [2008], let Σs denote the N×N covariance matrix of the spectral data and ΣN denote the N×N covariance matrix of the noise. The matrix of N eigenvectors, V, is the solution to the equation
ΣSΣN−1=VΛV−1 (1)
where Λ is the diagonal matrix of N eigenvalues that correspond to matrix V. As is usual, for the purposes of this discussion we assume that the eigenvectors and eigenvalues, which are positive, are ordered in decreasing eigenvalue size.
The projection of the mean-subtracted data onto the N eigenvectors of the V matrix yields a set of N coefficients for each spectrum, which we denote yj for a given eigenvector j. We shall refer to the yj as the jth MNF component. If the original data comprise a hyperspectral image (data cube), then each of the N MNF components yj comprises an image. Collectively, the yj comprise the MNF-transformed spectral dataset 16.
Next, we seek optimal estimates of the “true” MNF components, xj, which are uncontaminated with background noise, nj, based on the observed yj=xj+nj. This is done by defining a shrinkage function, denoted Sj(yj), which is a multiplicative factor that converts the observed noise-containing MNF component yj into an estimate of the noise-free MNF component. That is, the optimal estimate x′j is given by
x′j(yj)=Sj(yj)yj (2)
The preferred embodiment of the shrinkage function estimator procedure 18 is shown in
The optimal estimate of a noise-free MNF component value, denoted x′j, is its mean value in the posterior PDF, which includes the added noise. This mean value, which provides an unbiased-least squares estimate of xj given yj, is computed from the Bayesian signal estimation formula 28, found in Simoncelli [1996]. We assume that the noise PDF is the unit-variance Gaussian function, G, and define the function Qj(xj)=xjPj(xj). Then the Bayesian signal estimation formula may be compactly written as a quotient of convolutions,
x′j(yj)=(G*Qj)(yj)/(G*Pj)(yj) (3)
Using Eq. (2), the shrinkage function 30 is then given by
Sj(yj)=x′j(yj)/yj. (4)
Since analytical solutions to Eq. (3) do not exist for many useful functional forms for the prior PDF, Simoncelli [1996] proposes evaluating the convolutions numerically. However, analytical approximations are useful for developing approximate shrinkage functions 30 that provide good de-noising results. Some examples are described below.
For the small-eigenvalue j's, which are dominated by noise, it is assumed that the vast majority of the spectra have MNF component values xj that are very close to zero; that is, they belong to an extremely narrow PDF. On the other hand, a small minority of the spectra, comprising anomalies and rare spectra, are associated with a relatively broad PDF. Let us therefore approximate the PDF of the true MNF coefficients Pj(xj) as a weighted sum of a broad distribution B(xj) and a Dirac delta function D(xj), the latter representing the limit of an extremely narrow distribution:
Pj(xj)=wjBj(xj)+(1−wj)D(xj) (5)
where wj is the weighting factor. We further approximate the convolutions in Eq. (3) by assuming that the broad PDF component, Bj(xj), can be represented as constant within the narrow range of xj that comprises the bulk of the noise PDF (i.e., within one or two standard deviations of G(xj)), and accordingly we factor Bj(xj) out of the restricted domain convolution integral. Noting that (1) convolutions of sums are sums of convolutions, (2) the convolution of a Dirac delta function with a Gaussian is a Gaussian, and (3) the convolution of a linear function with a Gaussian is a linear function, an approximate solution to Eq. (3) is
x′j(y)=yj{wjBj(yj)/[(1−wj)G(yj)+wjBj(yj)]} (6)
The quantity in braces is the approximate shrinkage function Sj(yj). For the remainder of this discussion we drop the j subscripts for simplicity.
For illustrative purposes, we follow Simoncelli [1996] and assume a generalized Laplacian distribution,
B(y)∝exp(−|y/s|P) (7)
Then we write S(y) in terms of the ratio of G to B at y=0, which we denote r. Simplifying the expression, the approximate shrinkage function becomes
S(y)=exp(−|y/s|P)/[r exp(−y2)+exp(−|y/s|P)] (8)
Simoncelli [1996] suggests a range of exponents, p, from 0.5 to 1.0. Adler-Golden, S. M., “Improved Hyperspectral Anomaly Detection in Heavy-Tailed Backgrounds,” IEEE, First Annual WHISPERS Conference, Grenoble, FR (2009) (“Adler-Golden [2009]”) analyzed PC transforms of HSI data, which are closely related to MNF transforms, and found that the low-noise PC components had typical p values in a similar range. Eq. (8) is a better approximation at smaller p values, and represents the exact solution to Eq. (3) when p=0 (that is, B(y) is a flat distribution up to some maximum absolute y value).
r=qexp(−|2/s|P) (9)
with q=1 (
S(y)=1/[r exp(−y2)+1] (10)
has only a single adjustable parameter, r. The excellent agreement with the p=1 results indicates that, with r properly defined, the shrinkage function has little dependence on p, and thus can be estimated well with little or no knowledge of shape of the broad component of the prior PDF. One requires only an estimate of the relative magnitudes of the narrow (delta function) and broad components of the prior PDF, which sets the value of r.
With typical hyperspectral datasets, the vast majority of the spectra are well-modeled with just the first few MNF components. Thus, for all but the lowest j values, the broad PDF component is expected to be small compared to the narrow component. In this situation, r can be estimated by histogramming the distribution of y values in the dataset and taking the ratio of the histogram populations at y=0 and y=2. As an application of this method,
Having estimated the shrinkage functions 30 by one of the above procedures, Eq. (2) is used to determine the noise-free MNF component estimates, which comprise the de-noised MNF-transformed spectra 20. Applying the inverse MNF transform, which includes adding back the mean spectrum that was removed in the first step of the forward MNF transform, results in the de-noised spectra 22.
Other methods of estimating shrinkage functions 30 from parameters of the MNF components of the spectra may occur to those skilled in the art. These may include:
In an alternative embodiment of the method shown in
The description of the alternative embodiment is identical to the description of the preferred embodiment, except that “spectrum” is replaced with “pixel waveform”, “spectral dataset” is replaced with “image dataset,” and “wavelength band” is replaced with “image frame.” Specifically,
Application of this method to a stack of image frames is most beneficial when the bulk of the pixel waveforms can be represented with a small number of independent components, i.e., a small number of dimensions. This situation may apply when there is time variation in only a small number of pixels, and/or when image-wide motion, such as pointing jitter, is of low amplitude.
A number of implementations have been described. Nevertheless, it will be understood that additional modifications may be made without departing from the scope of the inventive concepts described herein, and, accordingly, other embodiments are within the scope of the following claims.
Number | Name | Date | Kind |
---|---|---|---|
8358866 | Qian et al. | Jan 2013 | B2 |
20030187616 | Palmadesso | Oct 2003 | A1 |
20140354868 | Desmarais | Dec 2014 | A1 |
Entry |
---|
Lennon et al, (“Nonlinear filtering of hyperspectral images with anisotropic diffusion”, 2002 IEEE, p. 2477-2479) (Year: 2002). |
Adler-Golden, S.M., “Improved Hyperspectral Anomaly Detection in Heavy-Tailed Backgrounds,” IEEE, First Annual WHISPERS Conference, Grenoble, FR (2009). |
Adler-Golden, S.M., S.C. Richtsmeier, and R.M. Shroll, “Suppression of Subpixel Sensor Jitter Fluctuations using Temporal Whitening,” Proc. SPIE 6969, Signal and Data Processing of Small Targets 2008, 69691D (Apr. 16, 2008); doi: 10.1117/12.780005. |
Bjorgan, A., and Randeberg, L.L., “Real-Time Noise Removal for Line-Scanning Hyperspectral Devices Using a Maximum Noise Fraction-Based Approach,” Sensors (Basel, Switzerland),15(2): 3362-3378, 2015, doi:10.3390/s150203362. |
Green, A.A., M. Berman, P. Switzer, and M.D. Craig, “A Transformation for Ordering Multispectral Data in Terms of Image Quality with Implications for Noise Removal,” IEEE Transactions on Geoscience and Remote Sensing, 26(1):6574, 1988. |
Othman, H. and Qian, S., “Noise reduction of hyperspectral imagery using hybrid spatial-spectral derivative-domain wavelet shrinkage”, IEEE Trans. Geosci. Remote Sensing, vol. 44 (2), pp. 397-408, 2006. |
Phillips, R.D., L.T. Watson, C.E. Blinn and R.H. Wynne “An adaptive noise reduction technique for improving the utility of hyperspectral data,” Pecora 17, The Future of Land Imaging . . . Going Operational, Denver, CO, Nov. 18-20, 2008. |
Qian, S., J. Levesque and R. Neville “Evaluation of Noise Removal of Radiance Data on Onboard Data Compression of Hyperspectral Imagery,” 2005 WSEAS Int. Conf. on Remote Sensing, Venice, Italy, pp. 37-42, Nov. 2-4, 2005. |
Sihag, R., R. Sharma and V. Setia, “Wavelet Thresholding for Image De-noising,” ICVCI 2011, Proc. Int. J. Computer Applic. 2011. |
Simoncelli, E.P. and Adelson, “Noise Removal via Bayesian Wavelet Coring,” Proc. 3rd IEEE Intl. Conf. on Image Processing, vol. I, pp. 379-382, Lausanne, Sep. 16-19, 1996. |
Number | Date | Country | |
---|---|---|---|
20190139196 A1 | May 2019 | US |