Mapping urban land cover based on spatial-spectral classification of hyperspectral remote-sensing data
Bibliographic record
Abstract
In this article, an innovative classification framework for hyperspectral image data, based on both spectral and spatial information, is proposed. The main objective of this method is to improve the accuracy and efficiency of high-resolution land-cover mapping in urban areas. The spatial information is obtained by an enhanced marker-based minimum spanning forest (MMSF) algorithm. A pixel-based support vector machine (SVM) algorithm is first used to classify the hyperspectral image data, then the enhanced MMSF algorithm is applied in order to increase the accuracy of less accurately classified land-cover types. The enhanced MMSF algorithm is used as a binary classifier. These two classes are the low-accuracy class and remaining classes. Finally, the SVM algorithm is trained for classes with acceptable accuracy. In the proposed approach, namely MSF-SVM, the markers are extracted from the classification maps obtained by both SVM and watershed segmentation algorithms, and are then used to build the MSF. Three benchmark hyperspectral data sets are used for the assessment: Berlin, Washington DC Mall, and Quebec City. Experimental results demonstrate the superiority of the proposed approach compared with SVM and the original MMSF algorithms. It achieves approximately 5, 6, and 7% higher rates in kappa coefficients of agreement in comparison with the original MMSF algorithm for the Berlin, Washington DC Mall, and Quebec City data sets, respectively.
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.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.002 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| 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 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".