Constrained quadratic correlation filters for target detection
Bibliographic record
Abstract
A method for designing and implementing quadratic correlation filters (QCFs) for shift-invariant target detection in imagery is presented. The QCFs are quadratic classifiers that operate directly on the image data without feature extraction or segmentation. In this sense the QCFs retain the main advantages of conventional linear correlation filters while offering significant improvements in other respects. Not only is more processing required for detection of peaks in the outputs of multiple linear filters but choosing the most suitable among them is an error-prone task. All channels in a QCF work together to optimize the same performance metric and to produce a combined output that leads to considerable simplification of the postprocessing scheme. The QCFs that are developed involve hard constraints on the output of the filter. Inasmuch as this design methodology is indicative of the synthetic discriminant function (SDF) approach for linear filters, the filters that we develop here are referred to as quadratic SDFs (QSDFs). Two methods for designing QSDFs are presented, an efficient architecture for achieving them is discussed, and results from the Moving and Stationary Target Acquisition and Recognition synthetic aperture radar data set are presented.
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.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| 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.004 | 0.001 |
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".