MétaCan
Menu
Back to cohort
Record W1967455454 · doi:10.1109/tgrs.2014.2360943

Tensorial Independent Component Analysis-Based Feature Extraction for Polarimetric SAR Data Classification

2014· article· en· W1967455454 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.

aboutThe title or abstract carries a Canadian signal from the geographic lexicon.
no affNo Canadian affiliation: this work is invisible to an affiliation-only frame.
No Canadian affiliation. An affiliation-only frame, the usual design, would never have seen this work. It is one of the works that make the case for inverting the frame.

Bibliographic record

VenueIEEE Transactions on Geoscience and Remote Sensing · 2014
Typearticle
Languageen
FieldEngineering
TopicSynthetic Aperture Radar (SAR) Applications and Techniques
Canadian institutionsnot available
FundersFundamental Research Funds for the Central UniversitiesProgram for New Century Excellent Talents in UniversityXidian UniversityNational Natural Science Foundation of ChinaJet Propulsion LaboratoryNational Aeronautics and Space Administration
KeywordsPattern recognition (psychology)Feature extractionArtificial intelligenceSynthetic aperture radarPolarimetryPrincipal component analysisComputer scienceFeature vectorSupport vector machineFeature (linguistics)Radar imagingRemote sensingRadarGeologyScatteringPhysics

Abstract

fetched live from OpenAlex

For polarimetric synthetic aperture radar (PolSAR) data, various polarimetric signatures can be obtained by target decomposition techniques, which are of great help for characterizing the land cover. It is straightforward to combine these polarimetric features together and formulate them as a third-order polarimetric feature tensor. However, how to make full use of the abundant information provided by these polarimetric features remains a challenge. A feasible solution is applying feature extraction (FE) techniques on the high-dimensional polarimetric manifold to obtain a lower dimensional intrinsic feature set. Common FE methods, such as principal component analysis (PCA), independent component analysis (ICA), etc., use matrix linear algebra and require rearranging the original tensor into a matrix. This leads to the loss of the spatial information of the PolSAR data. In this paper, to jointly take advantage of the spatial and feature information, a novel FE scheme incorporating ICA with the tensor decomposition techniques is proposed. After applying the proposed FE method on the third-order polarimetric feature tensor, each PolSAR image pixel is represented by a low-dimensional intrinsic feature vector. Furthermore, these feature vectors are fed to the k-nearest neighbor (KNN) classifier and support-vector-machine classifier for supervised classification. Simulated data, together with two measured data sets, i.e., Flevoland of Airborne Synthetic Aperture Radar (AIRSAR) and Québec City of Uninhabited Aerial Vehicle Synthetic Aperture Radar (UAVSAR), are utilized to evaluate the performance of the proposed method. For comparison purpose, several classical and advanced FE methods, such as PCA, ICA, Laplacian eigenmaps, and LRTA <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">dr</sub> - (K <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">1</sub> ,K <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sub> ,p), are also applied. The experimental results demonstrate the superiority of the proposed FE method in three folds: 1) The extracted features by the proposed method are more discriminative, characterized by the high separability in the scatterplots; 2) the classification accuracy is improved as much as approximately 7% compared with the complex Wishart classifier; and 3) the proposed method is computational efficient and has fast convergence.

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.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Other design · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.991
Threshold uncertainty score0.584

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.001
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.000
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.027
GPT teacher head0.273
Teacher spread0.247 · 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