Geometrical constrained independent component analysis for hyperspectral unmixing
Bibliographic record
Abstract
One of the limitations of the hyperspectral remote sensing application is the existence of mixed pixels in image data. Spectral decomposition, which separates the mixed pixels into a set of endmember spectra and abundance fractions, is the most effective way to solve the mixed pixel problem. Due to the independence of source signals, independent component analysis (ICA) has been developed for hyperspectral unmixing by adding auxiliary constraints. Abundance sum-to-one and nonnegative constraints are two obvious features for hyperspectral data. In this paper, by processing these two constraints sequentially from the geometrical point of view to restrain the sum-to-one constraint thoroughly at each iteration, geometrical constrained ICA (GCICA) is proposed based on treating the abundance distribution as the independent signal. To validate the proposed algorithm, the synthetic data, and real image data are used for unmixing, respectively. Synthetic data are generated based on spectra from the ENVI (Environment for Visualizing Images) software spectral library. The real images are used with three hyperspectral datasets, AVIRIS (Airborne Visible Infrared Imaging Spectrometer) Cuprite dataset, AVIRIS Indiana Pine dataset and HYDICE (Hyperspectral Digital Imagery Collection Experiment) dataset. Results, in comparison with previously proposed algorithms, show that the proposed method has better performance for the decomposition of hyperspectral data in abundance and endmember spectral extraction, thus providing a new and effective method for spectral unmixing and signal separation without prior information.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.002 |
| Meta-epidemiology (narrow) | 0.002 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.002 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.002 |
| Insufficient payload (model declined to judge) | 0.002 | 0.001 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".