Classification of polarimetric SAR images using Support Vector Machines
Bibliographic record
Abstract
Recently, Support Vector Machines (SVMs) have been introduced as a promising tool for performing supervised classification. This approach has been applied in different contexts and applications, such as data mining, regression analysis, and the classification of remotely sensed data. The advantage of SVMs for data classification is their ability to be used as an efficient algorithm for nonlinear classification problems, particularly in the case of extracting feature vectors from fully polarimetric SAR data. In this research, a classification algorithm based on the SVMs technique is applied to the fully polarimetric AIRSAR L-band data from the San Francisco Bay area, with a spatial resolution of 10 m. Several parameters are extracted from SAR data, including the individual channel backscatter value, Pauli decomposition coefficients, Krogager decomposition coefficients, and eigenvector decomposition parameters. Different combinations of polarimetric parameters are considered to assess the accuracy of the classification results. The accuracy of the SVMs is then compared with that obtained from several conventional classifiers, including the Maximum Likelihood classifier, Minimum Distance classifier, Mahalanobis Distance classifier, and Wishart classifier. The accuracy analysis shows that, for classification of fully polarimetric data, SVMs perform more poorly than the Wishart classifier by approximately 16%, whereas they perform better than the Maximum Likelihood, Minimum Distance, and Mahalanobis Distance classifiers by approximately 4%, 17% and 14%, respectively. Moreover, the highest accuracy is achieved by using the coefficients of Krogager decomposition in the classification procedure. This evaluation demonstrates that the SVM classifier can be used as an effective method for analyzing fully polarimetric SAR images with acceptable levels of accuracy.
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 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.001 | 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.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 teacher head, 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".