Spectral–Spatial Semisupervised Hyperspectral Classification Using Adaptive Neighborhood
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
Semisupervised learning (SSL) methods have shown great potential in the hyperspectral classification with a limited number of labeled samples. In this paper, we suggest a new graph-based SSL (GBSSL) using both spectral and spatial information. In the first step, we constructed two graphs using spectral and spatial information. Then, the Laplacians of both spectral and spatial graphs were merged to form a weighted joint graph. To improve the quality of spatial neighborhood for conforming the image objects, we employed the adaptive neighborhood (AN) technique. Instead of using the conventional crisp spatial neighborhood, the flat zone area filtering approach was used to define AN and extract the spatial information. By this way, each pixel is only connected to the pixels of a single flat zone, which presents a particular object in the image. Consequently, the border between different classes is extracted more precisely. As a result, the final classified map is more homogenous, and the salt and pepper effect is removed. To evaluate the efficiency of the proposed method, the experiments were carried out on three real benchmark hyperspectral data sets with different types of land cover, and different spectral and spatial resolutions. The results of the proposed method showed excellent performances in all data sets, specifically where a very limited number of labeled training samples were available. This method achieves a significant improvement compared to the state-of-the-art classifiers such as SVM, spectral-spatial SVM, and spectral-spatial GBSSL.
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.001 |
| 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