Purifying SLIC Superpixels to Optimize Superpixel-Based Classification of High Spatial Resolution Remote Sensing Image
Bibliographic record
Abstract
Fast and accurate classification of high spatial resolution remote sensing image is important for many applications. The usage of superpixels in classification has been proposed to accelerate the speed of classification. However, although most superpixels only contain pixels from single class, there are still some mixed superpixels, which mostly locate near the edge of different classes, and contain pixels from more than one class. Such mixed superpixels will cause misclassification regardless of classification methods used. In this paper, a superpixels purification algorithm based on color quantization is proposed to purify mixed Simple Linear Iterative Clustering (SLIC) superpixels. After purifying, the mixed SLIC superpixel will be separated into smaller superpixels. These smaller superpixels are pure superpixels which only contain a single kind of ground object. The experiments on images from the dataset BSDS500 show that the purified SLIC superpixels outperform the original SLIC superpixels on three segmentation evaluation metrics. With the purified SLIC superpixels, a classification scheme in which only edge superpixels are selected to be purified is proposed. The strategy of purifying edge superpixels not only improves the efficiency of the algorithm, but also improves the accuracy of the classification. The experiments on a remote sensing image from WorldView-2 satellite demonstrate that purified SLIC superpixels at all scales can generate classification result with higher accuracy than original SLIC superpixels, especially at the scale of 20 × 20 , for which the accuracy increase is higher than 4%.
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.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.002 | 0.002 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 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".