Eigenvector pruning method for high resolution beamforming
Bibliographic record
Abstract
This paper introduces an eigenvector pruning algorithm for the estimation of the signal-plus-interference eigenspace, required as a preliminary step to subspace beamforming. The proposed method considers large-aperture passive array configurations operating in environments with multiple maneuvering targets in background noise, in which the available data for estimation of sample covariances and eigenvectors are limited. Based on statistical properties of scalar products between deterministic and complex random vectors, this work defines a statistically justified threshold to identify target-related features embedded in the sample eigenvectors, leading to an estimator for the signal-bearing eigenspace. It is shown that data projection into this signal subspace results in sharpening of beamforming outputs corresponding to closely spaced targets and provides better target separation compared to current subspace beamformers. In addition, the proposed threshold gives the user control over the worst-case scenario for the number of false detections by the beamformer. Simulated data are used to quantify the performance of the subspace estimator according to the distance between estimated and true signal subspaces. Beamforming resolution using the proposed method is analyzed with simulated data corresponding to a horizontal line array, as well as experimental data from the Shallow Water Array Performance experiment.
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.001 | 0.004 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.003 | 0.002 |
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".