Linear Spectral Unmixing With Three Criteria, Least Squares Error, Simplex Volume and Orthogonal Projection



Although Linear Spectral Mixture Analysis (LSMA) and endmember finding are discussed in Chaps.  2 and  3 respectively as separate topics, both subjects are actually closely related. As a matter of fact, many Endmember-Finding Algorithms (EFAs) are indeed designed from the concept of Linear Spectral Unmixing (LSU) carried out by LSMA. Nonetheless, it does not imply that LSU is an endmember finding technique or vice versa. The link between these two is the geometric structure resulting from simplex that is shared by LSU and endmember finding. When Fully Constrained Least Squares (FLCS) performs LSU, referred to as Fully Abundance-Constrained LSU (FAC-LSU), it imposes two physical constraints, Abundance Sum-to-one Constraint (ASC) and Abundance Non-negativity Constraint (ANC), and it assumes that all data sample vectors are embraced by a simplex with vertices formed by a set of signatures of interest, known as endmembers. The vertices used to form a simplex are exactly the same signatures used to form a Linear Mixing Model (LMM) for LSMA. Basically, endmember finding does not perform LSU, but it can use FAC-LSU to produce the best possible endmembers by finding maximal Simplex Volume (SV) as does N-FINDR (Winter 1999a, b) or minimal SV as does Minimum Volume Transform (MVT) (Craig 1994). Such use of simplex may lead to a belief that endmember finding can perform LSU and vice versa. Unfortunately, it is not necessarily true as will be shown in Chap.  9. This chapter is devoted to the investigation and exploration of their relationships.


Abundance Fraction Little Square Error Endmember Extraction Linear Spectral Unmixing Simplex Volume 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. Chang, C.-I 1998. Further results on relationship between spectral unmixing and subspace projection. IEEE Transactions on Geoscience and Remote Sensing 36(3): 1030–1032.CrossRefGoogle Scholar
  2. Chang, C.-I 2003. Hyperspectral imaging: techniques for spectral detection and classification. Dordrecht/Neew York: Kluwer Academic/Plenum Publishers.CrossRefGoogle Scholar
  3. Chang, C.-I (ed.). 2007a. Hyperspectral data exploitation: theory and applications. New York: Wiley.Google Scholar
  4. Chang, C.-I 2007b. Overview, Chap. 1. In Hyperspectral data exploitation: theory and applications, ed. C.-I Chang, 1–16. New York: Wiley.Google Scholar
  5. Chang, C.-I 2007c. Information-processed matched filters for hyperspectral target detection and classification, Chap. 3. In Hyperspectral data exploitation: theory and applications, ed. C.-I Chang, 47–74. New York: Wiley.Google Scholar
  6. Chang, C.-I 2013. Hyperspectral data processing: algorithm design and analysis. New Jersey: Wiley. 2013.Google Scholar
  7. Chang, C.-I, and Q. Du. 2004. Estimation of number of spectrally distinct signal sources in hyperspectral imagery. IEEE Transactions on Geoscience and Remote Sensing 42(3): 608–619.Google Scholar
  8. Chang, C.-I, T.-L.E. Sun, and M.L.G. Althouse. 1998a. An unsupervised interference rejection approach to target detection and classification for hyperspectral imagery. Optical Engineering. 37(3): 735–743.CrossRefGoogle Scholar
  9. Chang, C.-I, X. Zhao, M.L.G. Althouse, and J.-J. Pan. 1998b. Least squares subspace projection approach to mixed pixel classification in hyperspectral images. IEEE Transactions on Geoscience and Remote Sensing 36(3): 898–912.CrossRefGoogle Scholar
  10. Chang, C.-I, C.C. Wu, and C.T. Tsai. 2011a. Random N-finder algorithm. IEEE Transactions on Image Processing 20(3): 641–656.MathSciNetCrossRefGoogle Scholar
  11. Chang, C.-I, X. Jiao, Y. Du, and H.M. Chen. 2011b. Component-based unsupervised linear spectral mixture analysis for hyperspectral imagery. IEEE Transactions on Geoscience and Remote Sensing 49(11): 4123–4137.Google Scholar
  12. Chang, C.-I, W. Xiong, H.M. Chen, and J.W. Chai. 2011c. Maximum orthogonal subspace projection to estimating number of spectral signal sources for hyperspectral images. IEEE Journal of Selected Topics in Signal Processing 5(3): 504–520.CrossRefGoogle Scholar
  13. Chang, C.-I, S. Wang, K.H. Liu, and C. Lin. 2011d. Progressive band dimensionality expansion and reduction for hyperspectral imagery. IEEE Journal of Selected Topics in Applied Earth Observation and Remote Sensing 4(3): 591–614.CrossRefGoogle Scholar
  14. Craig, M.D. 1994. Minimum-volume transforms for remotely sensed data. IEEE Transactions on Geoscience Remote Sensing 32(3): 542–552.CrossRefGoogle Scholar
  15. Harsanyi, J.C., and C.-I Chang. 1994. Hyperspectral image classification and dimensionality reduction: an orthogonal subspace projection approach. IEEE Transactions on Geoscience and Remote Sensing 32(4): 779–785.CrossRefGoogle Scholar
  16. Heinz, D., and C.-I Chang. 2001. Fully constrained least squares linear mixture analysis for material quantification in hyperspectral imagery. IEEE Transactions on Geoscience and Remote Sensing 39(3): 529–545.CrossRefGoogle Scholar
  17. Honeine, P., and C. Richard. 2012. Geometric unmixing of large hyperspectral images: a barycentric coordinate approach. IEEE Transaction on Geoscience and Remote Sensing 50(4): 2185–2195.Google Scholar
  18. Poor, H.V. 1994. An introduction to detection and estimation theory, 2nd ed. New York: Springer.CrossRefMATHGoogle Scholar
  19. Ren, H., and C.-I Chang. 2003. Automatic spectral target recognition in hyperspectral imagery. IEEE Transactions on Aerospace and Electronic Systems 39(4): 1232–1249.CrossRefGoogle Scholar
  20. Tu, T.M., C.-H. Chen, and C.-I Chang. 1997. A posteriori least squares orthogonal subspace projection approach to weak signature extraction and detection. IEEE Transactions on Geoscience and Remote Sensing 35(1): 127–139.CrossRefGoogle Scholar
  21. Winter, M. E. 1999a. Fast autonomous spectral endmember determination in hyperspectral data. In Proceedings of 13th international conference on applied geologic remote sensing, Vancouver, B.C., Canada, vol. II, 337–344.Google Scholar
  22. Winter, M.E. 1999b. N-finder: an algorithm for fast autonomous spectral endmember determination in hyperspectral data. Image Spectrometry V, Proceedings of SPIE 3753: 266–277.CrossRefGoogle Scholar
  23. Wu, C.-C., C.S. Lo, and C.-I Chang. 2009. Improved process for use of a simplex growing algorithm for endmember extraction. IEEE Geoscience and Remote Sensing Letters 6(3): 523–527.CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC 2016

Authors and Affiliations

  1. 1.BaltimoreUSA

Personalised recommendations