MétaCan
Menu
Back to cohort
Record W2030180421 · doi:10.1080/2150704x.2014.912765

PolSAR image classification using a semi-supervised classifier based on hypergraph learning

2014· article· en· W2030180421 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

VenueRemote Sensing Letters · 2014
Typearticle
Languageen
FieldEngineering
TopicRemote-Sensing Image Classification
Canadian institutionsUniversity of Waterloo
Fundersnot available
KeywordsArtificial intelligencePattern recognition (psychology)Computer scienceClassifier (UML)Hyperspectral imagingSupport vector machineHypergraphContextual image classificationSynthetic aperture radarPolarimetryImage (mathematics)MathematicsScatteringPhysics

Abstract

fetched live from OpenAlex

This letter presents a novel semi-supervised method based on hypergraph learning for polarimetric synthetic aperture radar (PolSAR) image classification. Compared with the classic support vector machine, simple-graph learning, k-nearest neighbour (k-NN) and semi-supervised discriminant analysis (SDA) classifiers, the proposed method achieves better performance with fewer labelled points for PolSAR imagery. A hyperspectral image is used for comparison with use of PolSAR imagery, and the proposed method is found to be inferior to k-NN and SDA for the hyperspectral image. The performance of our method is evaluated in single, dual and full-polarization cases, respectively. The results demonstrate that the performance of our method in the full-polarization case is superior to that in either single or dual-polarization case.

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.

Full frame distilled prediction

Teacher imitation

Not 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.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesMeta-epidemiology (narrow)
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.853
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.001
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0010.001
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.001
Insufficient payload (model declined to judge)0.0000.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.

Opus teacher head0.020
GPT teacher head0.226
Teacher spread0.206 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it