Hyperspectral Image Classification Based on Multilayer Perceptron Trained with Eigenvalue Decay
Bibliographic record
Abstract
Hyperspectral Images (HSI) require sufficient labeled samples and a complex classifier to identify an area. Support Vector Machine (SVM) is one of the most competent algorithms in this field. Neural Networks (NN) is another approach used for classification problems, and both have been widely proposed in the literature. The Convolutional Neural Network (CNN) method has also received significant attention in the deep learning field recently. Nevertheless, during NN training, the overfitting problem may cause continuous dragging of the algorithm toward larger error. In this case, a regularization technique is needed to constitute the most useful decision boundary. The Eigenvalue Decay method is one of the regularization techniques that may be applied for HSI. This study investigates the performance of Multilayer Perceptron trained with an Eigenvalue Decay (MLP-ED) algorithm for HSI classification. The SVM, CNN with Pixel-Pair and CNN-Ensemble methods are used as comparison algorithms for MLP-ED performance assessment. All methods were tested with 3 different high-resolution HSI datasets. While SVM is one of the classic classifiers, and the 2 new CNN algorithms show high performance, the proposed MLP-ED method has more computational efficiency and achieves higher success than the others do.
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.002 | 0.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| 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.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".