Object-based classification of hyperspectral data using Random Forest algorithm
Bibliographic record
Abstract
This paper presents a new framework for object-based classification of high-resolution hyperspectral data. This multi-step framework is based on multi-resolution segmentation (MRS) and Random Forest classifier (RFC) algorithms. The first step is to determine of weights of the input features while using the object-based approach with MRS to processing such images. Given the high number of input features, an automatic method is needed for estimation of this parameter. Moreover, we used the Variable Importance (VI), one of the outputs of the RFC, to determine the importance of each image band. Then, based on this parameter and other required parameters, the image is segmented into some homogenous regions. Finally, the RFC is carried out based on the characteristics of segments for converting them into meaningful objects. The proposed method, as well as, the conventional pixel-based RFC and Support Vector Machine (SVM) method was applied to three different hyperspectral data-sets with various spectral and spatial characteristics. These data were acquired by the HyMap, the Airborne Prism Experiment (APEX), and the Compact Airborne Spectrographic Imager (CASI) hyperspectral sensors. The experimental results show that the proposed method is more consistent for land cover mapping in various areas. The overall classification accuracy (OA), obtained by the proposed method was 95.48, 86.57, and 84.29% for the HyMap, the APEX, and the CASI data-sets, respectively. Moreover, this method showed better efficiency in comparison to the spectral-based classifications because the OAs of the proposed method was 5.67 and 3.75% higher than the conventional RFC and SVM classifiers, 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.001 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.002 | 0.002 |
| Bibliometrics | 0.003 | 0.002 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.000 |
| 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".