Signal-to-noise enhancement
10643309 ยท 2020-05-05
Assignee
Inventors
Cpc classification
International classification
Abstract
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.
Claims
1. A signal-to-noise enhancement method, comprising: 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, in which the nonlinear mathematical functions are given by S(y)=exp(|y/s|.sup.p)/[r exp(y.sup.2)+exp(|y/s|.sup.p)]; 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.
2. A signal-to-noise enhancement method, comprising: 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, in which the nonlinear mathematical functions are given by S(y)=1/[r exp(y.sup.2)+1]; 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.
3. A system, comprising: 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, in which the nonlinear mathematical functions are given by S(y)=exp(|y/s|.sup.p)/[r exp(y.sup.2)+exp(|y/s|.sup.p)]; 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.
4. A system, comprising: 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, in which the nonlinear mathematical functions are given by S(y)=1/[r exp(y.sup.2)+1]; 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.
5. The method of claim 1, in which the multiplicity of spectra comprise a hyperspectral image.
6. The method of claim 2, in which the multiplicity of spectra comprise a hyperspectral image.
7. The system of claim 3, in which the spectrometer comprises a hyperspectral imaging sensor.
8. The system of claim 4, in which the spectrometer comprises a hyperspectral imaging sensor.
Description
BRIEF DESCRIPTION OF THE DRAWINGS
(1) Other objects, features and advantages will occur to those skilled in the art from the following detailed description, and the accompanying drawings, in which:
(2)
(3)
(4)
(5)
(6)
(7)
(8)
(9)
(10)
(11)
DETAILED DESCRIPTION
(12) 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.
First Example
(13) In a first example of a signal-to-noise enhancement shown in
(14) An estimate of the NN 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.
(15) 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.
(16) 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 NN covariance matrix of the spectral data and N denote the NN covariance matrix of the noise. The matrix of N eigenvectors, V, is the solution to the equation
.sub.S.sub.N.sup.1=VV.sup.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.
(17) 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 y.sub.j for a given eigenvector j. We shall refer to the y.sub.j as the j.sup.th MNF component. If the original data comprise a hyperspectral image (data cube), then each of the N MNF components y.sub.j comprises an image. Collectively, the y.sub.j comprise the MNF-transformed spectral dataset 16.
(18) Next, we seek optimal estimates of the true MNF components, x.sub.j, which are uncontaminated with background noise, n.sub.j, based on the observed y.sub.j=x.sub.j+n.sub.j. This is done by defining a shrinkage function, denoted S.sub.j(y.sub.j), which is a multiplicative factor that converts the observed noise-containing MNF component y.sub.j into an estimate of the noise-free MNF component. That is, the optimal estimate x.sub.j is given by
x.sub.j(y.sub.j)=S.sub.j(y.sub.j)y.sub.j(2)
(19) The preferred embodiment of the shrinkage function estimator procedure 18 is shown in
(20) The optimal estimate of a noise-free MNF component value, denoted x.sub.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 x.sub.j given y.sub.j, 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 Q.sub.j(x.sub.j)=x.sub.jP.sub.j(x.sub.j). Then the Bayesian signal estimation formula may be compactly written as a quotient of convolutions,
x.sub.j(y.sub.j)=(G*Q.sub.j)(y.sub.j)/(G*P.sub.j)(y.sub.j)(3)
(21) Using Eq. (2), the shrinkage function 30 is then given by
S.sub.j(y.sub.j)=x.sub.j(y.sub.j)/y.sub.j.(4)
(22) 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.
(23) 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 x.sub.j 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 P.sub.j(x.sub.j) as a weighted sum of a broad distribution B(x.sub.j) and a Dirac delta function D(x.sub.j), the latter representing the limit of an extremely narrow distribution:
P.sub.j(x.sub.j)=w.sub.jB.sub.j(x.sub.j)+(1w.sub.j)D(x.sub.j)(5)
where w.sub.j is the weighting factor. We further approximate the convolutions in Eq. (3) by assuming that the broad PDF component, B.sub.j(x.sub.j), can be represented as constant within the narrow range of x.sub.j that comprises the bulk of the noise PDF (i.e., within one or two standard deviations of G(x.sub.j)), and accordingly we factor B.sub.j(x.sub.j) 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.sub.j(y)=y.sub.j{w.sub.jB.sub.j(y.sub.j)/[(1w.sub.j)G(y.sub.j)+w.sub.jB.sub.j(y.sub.j)]}(6)
(24) The quantity in braces is the approximate shrinkage function S.sub.j(y.sub.j). For the remainder of this discussion we drop the j subscripts for simplicity.
(25) For illustrative purposes, we follow Simoncelli [1996] and assume a generalized Laplacian distribution,
B(y)exp(|y/s|.sup.P)(7)
(26) 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|.sup.P)/[r exp(y.sup.2)+exp(|y/s|.sup.P)](8)
(27) 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).
(28)
r=qexp(|2/s|.sup.P)(9)
with q=1 (
(29)
S(y)=1/[r exp(y.sup.2)+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.
(30) 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,
(31) 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.
(32)
(33) 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: Evaluating the Bayesian signal estimation formula 28 numerically using a model for the prior PDF estimate 26, where the model is a generalized Laplacian distribution, or a model that includes a Dirac delta function, or a model that includes both; Using a user-supervised process to estimate the parameters s, p and q in the generalized Laplacian distribution model of the prior PDF estimate 26; Using a user-supervised process to estimate the parameter r in the shrinkage function equation (10); As a further approximation, using the same shrinkage function 30 for all N of the MNF components.
Second Example
(34) In an alternative embodiment of the method shown in
(35) 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, The first step in the data processing is to subtract the mean waveform (i.e., the set of image means) from the image frames 42. Let .sub.S denote the NN covariance matrix of the image data and .sub.N denote the estimated NN covariance matrix of the noise 44. The matrix of N eigenvectors, V, is the solution to Eq. (1). The projection of the mean-subtracted data onto the N eigenvectors of the V matrix yields a set of N coefficients for each pixel waveform, which we denote y.sub.j for a given eigenvector j. Each of the N MNF components y.sub.j comprises an image; collectively these are the MNF-transformed images 46. Optimal estimates of the true MNF components, x.sub.j, which are uncontaminated with background noise, n.sub.j, are obtained by defining shrinkage functions, denoted S.sub.j(y.sub.j), according to Eqs. (2), (3) and (4). For the small-eigenvalue j's, which are dominated by noise, we may assume that the vast majority of the pixel waveforms have MNF component values x.sub.j that are very close to zero, while a small minority of the pixel waveforms are associated with a relatively broad PDF. We may approximate the PDF of the true MNF coefficients P.sub.j(x.sub.j) as a weighted sum of a broad distribution B(x.sub.j) and a Dirac delta function D(x.sub.j), the latter representing the limit of an extremely narrow distribution. Then the same logic found in the preferred embodiment leads to Eqs. (5) through (10). Other methods of estimating shrinkage functions 48 from parameters of the MNF components may occur to those skilled in the art, and may include all of the methods described in the preferred embodiment. Having estimated the shrinkage functions 48, Eq. (2) is used to determine the noise-free MNF component estimates, which comprise the de-noised MNF-transformed data 50. Applying the inverse MNF transform, which includes adding back the mean waveform that was removed in the first step of the forward MNF transform, results in the de-noised images 52.
(36) 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.
(37)
(38) 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.