Abstract
Using maximal simplex volume (SV) as an optimal criterion for finding endmembers is a common approach and has been widely adopted in the literature. However, very little work has been reported on how SV is calculated because it can be simply done by finding the determinant of a matrix formed by vertices of a simplex. Interestingly, it turns out that calculating SV is much more complicated and involved than one might think. This chapter investigates this issue from two different aspects, through eigenanalysis and a geometric approach. The eigenanalysis takes advantage of the Cayley–Menger determinant to calculate the SV, referred to as determinant-based SV (DSV) calculation. The major issue with this approach is that when the matrix is of ill-rank, calculating the determinant runs into a singularity problem. To deal with this issue, two methods are generally considered. One is to perform data dimensionality reduction to make the matrix of full rank. The drawback of this method is that the original volume has been shrunk and the found volume of a dimensionality-reduced simplex is not the true original SV. The other is to use singular value decomposition to find singular values for calculating the SV. An issue arising from this method is its instability in numerical calculations. An alternative to eigenanalysis is a geometric approach derived from the simplex structure whose volume can be calculated by the product of the base and height of a simplex. The resulting approach is called geometric SV (GSV) calculation. This chapter explores DSV and GSV calculations, with further discussions in Chaps. 11 and 12.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Chang, C.-I. 2013. Hyperspectral data processing: algorithm design and analysis. Hoboken: Wiley.
———. 2016. Real time progressive hyperspectral image processing: endmember finding and anomaly detection. New York: Springer.
Craig, M.D. 1994. Minimum-volume transforms for remotely sensed data. IEEE Transactions on Geoscience and Remote Sensing 32(3): 542–552.
Moon, T.K., and W.C. Stirling. 2000. Mathematical methods and algorithms for signal processing. Upper Saddle River: Prentice-Hall.
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.
Stein, P. 1966. A note on the volume of a simplex. American Mathematical Monthly 73(3): 299–301.
Wu, C.C., S. Chu, and C.-I. Chang. 2008. Sequential N-FINDR algorithm. In SPIE conference on imaging spectrometry XIII, August 10–14, San Diego.
**ong, W., C.-C. Wu, C.-I. Chang, K. Kapalkis, and H.M. Chen. 2011. Fast algorithms to implement N-FINDR for hyperspectral endmember extraction. IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing 4(3): 545–564.
Winter, M.E. 1999a. Fast autonomous spectral endmember determination in hyperspectral data. In Proceedings of 13th international conference on applied geologic remote sensing, vol. II, 337–344, Vancouver, BC, Canada.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Chang, CI. (2017). Simplex Volume Calculation. In: Real-Time Recursive Hyperspectral Sample and Band Processing. Springer, Cham. https://doi.org/10.1007/978-3-319-45171-8_2
Download citation
DOI: https://doi.org/10.1007/978-3-319-45171-8_2
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-45170-1
Online ISBN: 978-3-319-45171-8
eBook Packages: EngineeringEngineering (R0)