Algorithm taxonomy for hyperspectral unmixing
The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Abstract
In this paper, we introduce a set of taxonomies that hierarchically organize and specify algorithms associated with hyperspectral unmixing. Our motivation is to collectively organize and relate algorithms in order to assess the current state-of-the-art in the field and to facilitate objective comparisons between methods. The hyperspectral sensing community is populated by investigators with disparate scientific backgrounds and, speaking in their respective languages, efforts in spectral unmixing developed within disparate communities have inevitably led to duplication. We hope our analysis removes this ambiguity and redundancy by using a standard vocabulary, and that the presentation we provide clearly summarizes what has and has not been done. As we shall see, the framework for the taxonomies derives its organization from the fundamental, philosophical assumptions imposed on the problem, rather than the common calculations they perform, or the similar outputs they might yield.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Solving Least Squares Problems
Lawson, C. L., & Hanson, R. J. (1995) · doi:10.1137/1.9781611971217 · Cited by 7,103
Cited by
Hyperspectral Unmixing Overview: Geometrical, Statistical, and Sparse Regression-Based Approaches
Bioucas-Dias, J. M., Plaza, A., Dobigeon, N., Parente, M., Du, Q., Gader, P., & Chanussot, J. (2012) · IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing · doi:10.1109/jstars.2012.2194696 · Cited by 2,836
“abundances, as illustrated in Fig. 2, then the spectrum of each pixel is well approximated by a linear mixture of endmember spectra weighted by the corresponding fractional abundances [1], [3], [29], [39]. In this case, the spectral measurement1 at channel i2f1;:::;Bg(Bis the total number of channels) from a given pix…”
MethodVertex component analysis: a fast algorithm to unmix hyperspectral data
Nascimento, J. M. P., & Dias, J. M. B. (2005) · IEEE Transactions on Geoscience and Remote Sensing · doi:10.1109/tgrs.2005.844293 · Cited by 2,669
Keshava, N., & Mustard, J. F. (2002) · IEEE Signal Processing Magazine · doi:10.1109/79.974727 · Cited by 2,549
Self-citationDetection algorithms for hyperspectral imaging applications
Manolakis, D., & Shaw, G. (2002) · IEEE Signal Processing Magazine · doi:10.1109/79.974724 · Cited by 1,116
Self-citationGhamisi, P., Yokoya, N., Li, J., Liao, W., Liu, S., Plaza, J., Rasti, B., & Plaza, A. (2017) · IEEE Geoscience and Remote Sensing Magazine · doi:10.1109/mgrs.2017.2762087 · Cited by 909
“1) Dimension (feature) reduction: As mentioned in several studies, such as [2]–[4], a high-dimensional space is almost empty, and multivariate data can be represented in a lower-dimensional space, where the undesirable effects of high-dimensional geometric characteristics and the curse of dimensionality are reduced.”
Background
Metadata
- Authors
- Keshava, N., Kerekes, J. P., Manolakis, D. G., & Shaw, G. A.
- Venue
- SPIE Proceedings
- Publisher
- SPIE
- Published
- 2000-08-23
- Volume
- 4049
- Pages
- 42-42
- ISSN
- 0277-786X (ISSN-L)
- OpenAlex
- W2003752781
- Cited by
- 84
- References
- 1
- FWCI
- 8.64
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Algorithm taxonomy for hyperspectral unmixing. https://app.cochat.ai/papers/10.1117/12.410362
- The paper
- Keshava, N., Kerekes, J. P., Manolakis, D. G., & Shaw, G. A. (2000). Algorithm taxonomy for hyperspectral unmixing. SPIE Proceedings. https://doi.org/10.1117/12.410362
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.