Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 199

The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.

Fully Constrained Least Squares Spectral Unmixing by Simplex Projection

Heylen, Rob, Burazerovic, Dževdet, Scheunders, Paul · 2011 · IEEE Transactions on Geoscience and Remote Sensing

Abstract

We present a new algorithm for linear spectral mixture analysis, which is capable of supervised unmixing of hyperspectral data while respecting the constraints on the abundance coefficients. This simplex-projection unmixing algorithm is based upon the equivalence of the fully constrained least squares problem and the problem of projecting a point onto a simplex. We introduce several geometrical properties of high-dimensional simplices and combine them to yield a recursive algorithm for solving the simplex-projection problem. A concrete implementation of the algorithm for large data sets is provided, and the algorithm is benchmarked against well-known fully constrained least squares unmixing (FCLSU) techniques, on both artificial data sets and real hyperspectral data collected over the Cuprite mining region. Unlike previous algorithms for FCLSU, the presented algorithm possesses no optimization steps and is completely analytical, severely reducing the required processing power.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/tgrs.2011.2155070

Cites

2 of 2 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

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

Show all 2 references

Cited by

See all 199

Metadata

Authors
Heylen, R., Burazerovic, D., & Scheunders, P.
Venue
IEEE Transactions on Geoscience and Remote Sensing
Published
2011-11
Volume
49
Issue
11
Pages
4112-4122
ISSN
  • 0196-2892 (ISSN-L)
  • 1558-0644
OpenAlex
W2113753426
Cited by
199
References
2
FWCI
36.08
Type
journal article
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: Fully Constrained Least Squares Spectral Unmixing by Simplex Projection. https://app.cochat.ai/papers/10.1109/tgrs.2011.2155070
The paper
Heylen, R., Burazerovic, D., & Scheunders, P. (2011). Fully Constrained Least Squares Spectral Unmixing by Simplex Projection. IEEE Transactions on Geoscience and Remote Sensing. https://doi.org/10.1109/tgrs.2011.2155070

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.