Abstract:
A method of representing spectral data, such as hyperspectral imaging data (HSI) and multispectral imaging data (MSI), as a set of simplex models. The method finds end-images or end-spectra in the data (termed “endmembers”) as extreme points, and simultaneously determines the abundance of the endmembers.

Description:
CROSS REFERENCE TO RELATED APPLICATION  
       [0001]     This application claims priority of Provisional application Ser. No. 60/655,185, filed on Feb. 22, 2005. 
     
    
     FIELD OF THE INVENTION  
       [0002]     This invention relates to a process to rapidly and automatically find endmembers of a data set made up of spectra, such as a spectral image. Such endmembers are used in a number of applications, such as material classification.  
       BACKGROUND OF THE INVENTION  
       [0003]     Endmembers are spectra that are chosen to represent the most “pure” surface materials from which the pixels in a spectral image are composed. Mathematically, they are basis spectra whose physically constrained linear combinations match the pixel spectra (to within some error tolerance), but which themselves cannot be represented by such linear combinations. “Physically constrained” means constrained by positivity, at least. Endmembers that represent radiance spectra must satisfy the positivity constraint. Other physically-based constraints may be imposed, such as sum-to-unity (i.e., the pixels are weighted mixtures of the endmembers) or sum-to-unity or less (i.e., the pixels are weighted mixtures of the endmembers plus “black”). The latter constraint is common for reflectance spectra. The invention allows selection of any of these constraints.  
         [0004]     There are two different categories of endmembers and several different methods and algorithms for finding them. The first category consists of endmembers that do not necessarily correspond to specific pixels in the image. For example, they may represent materials of a purer composition than occur in the scene. Such spectra might be obtained from a library of laboratory-measured reflectances for a variety of materials that might be present. Alternatively, the endmembers may represent cluster averages, which match many spectra well but none exactly.  
         [0005]     The invention (sometimes termed “SMACC” herein) relates primarily to the second category of endmembers, which are actual pixels in the image. There are several well-known algorithms for finding these endmembers. IDL&#39;s ENVI software contains a method based on a “Pixel Purity Index” [ ENVI Users Guide , Research Systems, Inc., 2001] and supervised N-dimensional visualization. This method is not automated (it requires manual operation by an analyst) and is fairly time-consuming. Another method, called N-FINDR [http://www.sennacon.com/nfindr/], chooses endmembers based on a maximum-simplex-volume criterion, and is fully automated and reasonably fast.  
         [0006]     There are many uses of endmembers, including classification, detection and data compression. The endmembers can be used to identify unique materials in the scene, and thus can be input to classification routines. They can also be used in a constrained least-squares unmixing routine to find targets and their pixel fill fraction, as an alternative to matched filtering. If the number of spectral channels is large, the endmember abundances are sparse (most values are zero), so the abundance image represents an efficient compression of the original data cube. Upon matching the endmembers to library materials, the abundances define the surface material composition of the scene. This enables one to estimate various physical properties, such as surface reflectance at wavelengths not originally measured.  
       SUMMARY OF THE INVENTION  
       [0007]     The inventive SMACC method is similar to N-FINDR in its speed and automation. However, it uses a different mathematical criterion, termed residual minimization, for finding the endmembers, and thus produces somewhat different results. In addition, SMACC simultaneously generates estimated endmember weights (abundances) for each pixel, and, unlike N-FINDR, it can be used to generate more endmembers than there are spectral channels. This may be useful for multispectral data.  
         [0008]     A drawback of SMACC is that it can be adversely affected by noise. When a large number of endmembers is sought, there may be redundancies (i.e., pixels identified as endmembers that actually are nearly identical to one another). In addition, the SMACC endmember weights do not match full constrained least-squares results, but rather are stepwise constrained least squares results. However, the SMACC results, which are obtained with less computational and/or analyst time, are similar to those from other methods.  
         [0009]     Typical endmember algorithms are most efficient when the entire spectral image to be analyzed fits in the random access memory (RAM) of the computer processor. However, images that contain a very large number of pixels and/or spectral channels may be too large to fit in the RAM, causing the processor to spend additional time repeatedly transferring portions of the data between the RAM and the computer hard disk or other storage medium. The SMACC invention includes a method for finding endmembers for an image of arbitrary size while minimizing this additional transfer time, by dividing the image into smaller images that fit in the RAM.  
         [0010]     The SMACC method allows the user to select positivity-only, sum-to-unity, or sum-to-unity-or-less constraints on the endmember weights. The positivity-only option is appropriate for unmixing reflectance spectra under conditions of variable illumination. In this case, the sum of the endmember abundances for a given pixel may exceed unity. The sum-to-unity-or-less option is recommended when a strict physical interpretation of the abundances in terms of material and shadow fractions is desired; the results are typically similar to the positivity-only case but not identical. The sum-to-unity option is recommended for unmixing spectra, such as radiances or thermal IR emissivities, when a zero endmember is not physically plausible, or when it is desired to find very dark endmembers such as shadow endmembers. The second endmember found is among the darkest pixels in the scene, if not the darkest.  
         [0011]     This invention features a process for determining a subset of members of a group of N data vectors, such as spectra, the subset denoted as endmembers, which may be taken in positive linear combinations to approximate the other members of the group, comprising a. providing a data set (for example an image data) comprised of a plurality of spectra (for example, pixels in which each pixel comprises a spectrum), b. defining an error metric dependent on a difference between two spectra, c. selecting a first spectrum as the first endmember, d. for the member spectra in the group, determining a non-negative weighting factor such that, when the first spectrum is multiplied by the weighting factor and subtracted from the spectrum, the resulting difference generates a smallest error metric, e. selecting as a next endmember the member spectrum whose calculated difference from step d generates the largest error metric, f. for the N member spectra in the group, determining a weighting factor, determining an updated difference by subtracting from the prior difference the difference for the endmember in step e multiplied by the weighting factor, and determining an updated set of member weighting factors by subtracting from the prior set of weighting factors the set of weighting factors for the endmember in step d multiplied by the weighting factor, such that all updated weighting factors are non-negative and the updated member difference generates a smallest error metric, and g. repeating steps e and f for all or a subset of member spectra one or more times.  
         [0012]     The process may further comprise multiplying each endmember by the weighting factor, to create a weighted endmember value. The process may further comprise approximating each member of a group of N spectra by means of a sum of the weighted endmember values. The invention can also feature a process for determining a subset of members of a group of N spectra, the subset denoted as endmembers, which may be taken in positive linear combinations to approximate the other members of the group, comprising dividing the group of N spectra into sub-groups, determining endmembers of each sub-group by the process described above, forming the endmembers of the sub-groups into an endmember group, and determining endmembers of the endmember group by the process described above. The group of N spectra may be divided into sub-groups, and the weighting factors for the members in each sub-group may be determined.  
         [0013]     The error metric may be the mean squared spectrum difference. The first spectrum may include the spectrum in the group with the largest mean or mean squared value. The first spectrum may include a target spectrum in the group. The first spectrum may include a spectrum that is not in the group.  
         [0014]     The determinations may include the additional condition that the sum of the weighting factors does not exceed one, or the sum of the weighting factors may equal one. Step g above may be carried out for only those member spectra for which the differences from step d are greater than a predetermined value. Step g may be carried out for all member spectra until the largest difference from step d among all the member spectra is less than a predetermined value. In the case in which the data set comprises image data, if a sensor is used to gather the image data, the predetermined value may be estimated from the sensor noise. Step g may be terminated when a predetermined number of endmembers have been selected. The difference between one and the sum of the weighting factors is output as a shade weighting factor.  
         [0015]     This invention also features a process for approximating each member of a group of N data vectors, such as spectra, by means of a positive linear combination of a prior selected subset of members, the subset denoted as endmembers, each endmember being multiplied by a corresponding positive weighting factor, in which the process for determining the weighting factors comprises a. providing a data set (for example an image data) comprised of a plurality of spectra (for example pixels in which each pixel comprises a spectrum), b. defining an error metric dependent on a spectrum difference, c. selecting a first endmember as a starting spectrum, d. for each of the N member spectra in the group that is not the starting spectrum, determining a non-negative member weighting factor such that, when the starting spectrum is multiplied by the member weighting factor and subtracted from the member spectrum, the resulting member difference generates a smallest error metric, e. selecting a next endmember, f. for each of the N member spectra in the group that is not the starting spectrum or any selected endmember, determining a weighting factor, determining an updated member difference by subtracting from the prior member difference the difference for the endmember in step e multiplied by the weighting factor, and determining an updated set of member weighting factors by subtracting from the prior set of member weighting factors the set of weighting factors for the endmember in step e multiplied by the weighting factor, such that all updated member and endmember weighting factors are non-negative and the updated member difference generates a smallest error metric, and g. repeating steps e and f until all endmembers have been selected.  
         [0016]     In this process, a subset of members of a group of N spectra may be determined, the subset denoted as endmembers, which may be taken in positive linear combinations to approximate the other members of the group. This may be accomplished by dividing the group of N spectra into sub-groups, determining endmembers of each sub-group by the process, forming the endmembers of the sub-groups into an endmember group, and determining endmembers of the endmember group by the process. The group of N spectra may be divided into sub-groups, and the weighting factors for the members in each sub-group may be determined. 
     
    
     BRIEF DESCRIPTION OF THE DRAWING  
       [0017]     Other objects, features and advantages will occur to those skilled in the art from the following description of the invention and its preferred embodiments, including the FIGURE, which is a flow chart of the process of the two preferred embodiments described below. 
     
    
     DETAILED DESCRIPTION OF THE INVENTION  
       [0000]     Nomenclature and Definitions  
         [0018]     For ease of explanation, let the set of data vectors (which must be of equal length) be a group of N spectra (in the preferred embodiment the spectra are pixel spectra), in which each pixel spectrum consists of intensity values for a set of spectral channels.  
         [0019]     The set of pixel spectra is denoted {r 1 r 2  . . . r N }. An arbitrary individual member of this set is denoted r*.  
         [0020]     The endmembers to be determined are a subset of the pixel spectra and are denoted {e 1  e 2  . . . e M }, where M is the number of endmembers. In addition, e 0  is defined as the spectrum consisting of all zero intensities, referred to as the zero endmember; it is used as a placeholder to implement an optional summation constraint as will be described.  
         [0021]     Let R*=the pixel spectrum vector difference (also referred to as the residual) between r* and its representation via the expression Σ k A* k  e k , where k runs from 1 to M. A* k  is referred to as the weight (or weighting factor) of endmember k in the r* spectrum. In the preferred embodiments, A* k  is also defined for k=0, although its value does not affect the residual. A* 0  is set to 1 in the first preferred embodiment and 0 in the second preferred embodiment.  
         [0022]     When r* is an endmember, e j , its residual is R j . The representation of e j  is written as Σ k A jk  e k , where k≠j. A jk  is referred to as the weight (or weighting factor) of endmember k in endmember j.  
         [0023]     Let |x| denote the absolute value (length) of a spectrum vector x.  
         [0024]     Let p(x,y) denote the projection length of spectrum vector x onto spectrum vector y, given by x·y/|y|.  
         [0000]     Algorithm Description for the First Preferred Embodiment  
         [0025]     This first preferred embodiment algorithm provides a positivity constraint on the weights, and, optionally, a constraint that the weights for each pixel spectrum must sum to unity or less. If the latter constraint is not used, then the zero endmember variables (i.e., A* 0 ) are not needed; however, for ease of explanation they are retained in both cases in the following description.  
         [0000]     Step a: Define an Error Metric  
         [0026]     Define the error metric as the mean square difference between two spectra (the mean of the squares of the differences of the corresponding channels).  
         [0000]     Step b: Select a Starting Spectrum as the First Endmember  
         [0027]     Set the weights of the 0 th  endmember to unity, i.e., A* 0 =1, and select the pixel spectrum with the largest mean intensity squared or the largest mean intensity absolute value as endmember  1  (e 1 ).  
         [0000]     Step c: For Each Pixel Spectrum, Determine the Weighting Factor for the First Endmember  
         [0028]     The weighting factor, A* 1 , is given by the larger of zero and p(r*,e 1 )/|e 1 |. If it is desired to impose the optional constraint that the weights for each pixel sum to unity or less, A* 1  is restricted to be unity or less; i.e., A* 1 ≦1. With this weighting factor definition, it can be shown that the mean square of the residual
 
 R*=r*−A*   1   e   1   (1a)
 
 (i.e., the error metric) is minimized with respect to the allowable values of A* 1 . This residual represents the difference between the pixel spectrum and its representation by the first endmember alone. 
 
         [0029]     Next, the j=0 endmember weights A* 0  are updated by subtracting A* 1 ; i.e., the updated weights are A* 0 =1−A* 1 .  
         [0030]     The following steps d and e constitute an iteration, or cycle, which is repeated as described in step f.  
         [0000]     Step d: Select the Next Endmember  
         [0031]     Select as the next endmember the pixel spectrum for which the most recently calculated residual R* (from the previous iteration or from step c) yields the largest error metric.  
         [0000]     Step e: For Each Pixel Spectrum, Determine the Weighting Factor for the New Endmember Found in Step d.  
         [0032]     For ease of illustration, the method is described below for endmember k, taken as an example.  
         [0000]     Step e1: Calculate Provisional Weighting Factors by Projection.  
         [0033]     The provisional values of A* k  are larger of zero and p(R*,R k )/|R k |. The provisional updated residuals are
 
 R*=R*   prev   −A*   k   R   k. ,  (1b)
 
 where R* prev  are the most recently calculated residuals (from the previous iteration or from step c). This residual is equal to the difference between the pixel spectrum and its representation by a weighted sum of the endmembers determined up to this point. If it is desired to impose the optional constraint that the weights for each pixel must sum to unity or less, the provisional A* k  is restricted to be unity or less (i.e., A* k ≦1). 
 
         [0034]     In the updated pixel spectrum representation, the new endmember replaces a combination of prior endmembers that were used to represent it. Therefore, the previously determined weights of the prior endmembers in the pixel spectra no longer hold and must be updated; this is done in Step e2 below. In the updating process, the weights must not be allowed to become negative. This places an upper limit on the allowable value of the new endmember weight A* k , which is why the value calculated in step 1 is termed “provisional.” The A* k  value accounting for this upper limit is calculated in step e2, and the updated weights of the prior endmembers are calculated in step e4.  
         [0000]     Step e2: Find Upper Limits of New Endmember Weights  
         [0035]     For the previously determined weights to remain non-negative upon updating (step e4), an upper limit on A* k  is determined. To ensure that after A* k A jk  is subtracted A* j  remains non-negative, the inequality A* j   prev ≧A* k A jk  must be satisfied. For a given previous endmember j&gt;0, the maximum permissible value of A* k  is given by the ratio A* j   prev /A jk ; therefore, the smallest of these ratios for all j&gt;0 is found, and this ratio is set as the A* k  upper limit value. The A* k  value is then reset to be the smaller of the A* k  upper limit value and the A* k  provisional value given in Step e1.  
         [0036]     For a given pixel, the sum over all j of the endmember weights Σ j A* j  remains at unity from each iteration to the next. Therefore, if it is chosen to extend the inequality condition A* j   prev ≧A* k A jk  to j=0, thereby imposing a non-negativity constraint on A* 0 , the sum Σ j A* j  is constrained to be unity or less over j&gt;0 (i.e., over the non-zero endmembers). If this is not chosen, the sum is allowed to exceed unity.  
         [0000]     Step e3: Update the Spectral Residuals and Error Metrics  
         [0037]     The pixel and endmember residuals are updated via Eq. (1b) using the A* k  value determined from Step e2. The error metrics are recalculated using the updated residuals.  
         [0000]     Step e4: Update the Weights  
         [0038]     The weights A* j  (where j&lt;k) are updated via
 
 A*   j   =A*   j   prev   −A*   k   A   jk .  (2)
 
 Step f: Repeat Steps d and e 
 
         [0039]     Repeat steps d and e for endmembers  3 ,  4 , etc., until the desired number of endmembers has been reached (i.e., k=M) and/or the error metrics have been reduced to smaller than a desired tolerance. For example, a tolerance may placed on the individual pixel error metrics, such that the repetition of steps d and e is halted for those pixels that have a smaller error metric; the repetition continues for those pixels that have a larger error metric. Alternatively, a tolerance may be placed on the largest pixel error metric, such that the repetition of steps d and e is halted for all pixels when they all have an error metric smaller than the tolerance.  
         [0000]     Algorithm Description for the Second Preferred Embodiment  
         [0040]     This second preferred embodiment algorithm provides a strict sum-to-unity constraint on the weights for each pixel. It is identical to the first preferred embodiment algorithm except that: 
        1. the starting values of A* 0  are set to 0 in step b,     2. in step c, the A* 1  are set to 1, and     3. in step e2, the weight of the j=0 endmember is included in the determination of the upper limit, i.e. A* j   prev ≧A* k A jk  for j=0 to k−1.        
 
         [0044]     By applying the inequality (non-negativity condition) in step e.2 to j=0, A* 0  remains zero. In combination with the sum-to-unity constraint on the A* j  where j=0 is included, this forces Σ j A* j =1 for j&gt;0.  
         [0000]     Extension of the Preferred Embodiments to Arbitrarily Large Images  
         [0045]     For efficiently determining the endmembers of an image that is too large to fit into the computer RAM, the following method may be used with either the first or second preferred embodiment algorithms: 
        divide the image consisting of a group of N spectra into sub-groups of spectra;     determine endmembers of each sub-group by the preferred embodiment algorithm;     form the endmembers of the sub-group into an endmember group;     by the preferred embodiment algorithm, determine endmembers of the endmember group, which constitute endmembers of the image. 
 
 Applications to Other Data Sets 
       
 
         [0050]     The invention applies to data sets comprised of a plurality of spectra. The data vectors are typically, but not necessarily, spectra from images. Alternatively, the data vectors can be temporal, such as a time sequence of spectra.  
         [0051]     Other details may be set forth in the provisional patent application from which priority is claimed, the entire disclosure of which is incorporated herein by reference.