Constrained Nonnegative Tensor Factorization for Spectral Unmixing of Hyperspectral Images: A Case Study of Urban Impervious Surface Extraction
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
In recent years, a new genre of hyperspectral unmixing methods based on nonnegative matrix factorization (NMF) have been proposed. Unlike traditional spectral unmixing methods, the NMF-based hyperspectral unmixing methods no longer depend on pure pixels in the original image. The NMF is based on linear algebra, which requires that the hyperspectral data cube is converted from 3-D cube to a 2-D matrix. Due to this conversion, the spatial information in the relative positions of the pixels is lost. With the emergence of multilinear algebra, the tensorial representation of hyperspectral imagery that preserves spectral and spatial information has become popular. The tensor-based spectral unmixing was first realized in 2017 using the matrix-vector nonnegative tensor factorization (MVNTF) decomposition. Using the construction of MVNTF spectral unmixing, this letter proposes to integrate three additional constraints (sparseness, volume, and nonlinearity) to the cost function. As we show in this letter, we found that the three constraints greatly improved the impervious surface area fraction/classification results. The constraints also shortened the processing time.
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.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
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 it