Sea Clutter Suppression Using Smoothed Pseudo-Wigner–Ville Distribution–Singular Value Decomposition during Sea Spikes
Bibliographic record
Abstract
The detection of small targets within the background of sea clutter is a significant challenge faced in radar signal processing. Small target echoes are weak in energy, and can be submerged by sea clutter and sea spikes, which are caused by overturning waves and breaking waves. This severely affects the radar target detection performance. This paper proposes a smoothed pseudo-Wigner–Ville distribution–singular value decomposition (SPWVD-SVD) method for sea clutter suppression. This method determines the instantaneous frequency range of the target by contrasting the time–frequency characteristics of the sea spike and the target. Subsequently, it employs a singular value difference spectrum to reduce the rank of the Hankel matrix, thereby reducing the computational burden of the instantaneous frequency estimation step in the experiment. Based on the instantaneous frequency range of the target in the time–frequency domain, the singular values of the target signal are retained, while the singular values of clutter are set to zero. This process accomplishes the reconstruction of radar echo signals and effectively achieves the suppression of sea clutter. The suppression effect is verified using simulation data alongside ten sets of Intelligent Pixel processing X-band (IPIX) radar data against the background of sea spikes. By contrasting the clutter amplitudes before and after suppression, the SPWVD-SVD algorithm demonstrated an average clutter suppression of 15.06 dB, which proves the effectiveness of the proposed algorithm in suppressing sea clutter.
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.000 | 0.001 |
| 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 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".