SAR target recognition network based on frequency domain covariance matrix and Riemannian manifold
Bibliographic record
Abstract
Synthetic Aperture Radar (SAR) image target recognition is a critical problem in remote sensing. Traditional deep learning-based methods often overlook the rich information in the frequency domain of SAR images. Existing frequency domain based approaches typically rely on prior knowledge to select different frequency components or guide network learning, failing to fully exploit the information contained in the frequency domain. We believe that knowledge from the macroscopic high-dimensional space needs to be harnessed to learn about the frequency domain. Therefore, in this paper, we propose an innovative SAR target recognition framework known as FDCM-Net (Frequency Domain Covariance Matrix and Riemannian Manifold Network). Our method integrates the frequency domain information of SAR images with the covariance matrix, revealing the complex relationships between different frequency components and delving into the latent features within the frequency domain. Additionally, we explore the geometric properties of the covariance matrix and design an innovative network architecture based on Riemannian manifold theory. This network effectively captures important information from the frequency domain of SAR images in high-dimensional space while preserving the geometric characteristics of the original data and performing classification. We conducted comprehensive evaluations of FDCM-Net using the MSTAR, OpenSARShip 2.0 and FUSAR-Ship 1.0 datasets. Our results demonstrate that FDCM-Net outperforms previous methods based on spatial and frequency domain baselines in terms of classification performance. • FDCM-Net integrates SAR frequency info and covariance matrices for latent features. • Innovative network captures frequency info and preserves geometric properties. • Combines texture, SPD manifold, and multi-manifold fusion with classification. • Experiments show FDCM-Net outperforms baselines on three datasets.
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.000 | 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".