Vision-Based Vehicle Detection for VideoSAR Surveillance Using Low-Rank Plus Sparse Three-Term Decomposition
Bibliographic record
Abstract
Automatic vehicle detection from a video synthetic aperture radar (VideoSAR) system presents significant potential to enhance the surveillance performance in dynamic region of interest (DROI). In this paper, a novel VideoSAR low-rank plus sparse decomposition (LRSD) perspective for single-channel single-pass configuration is proposed to track the ground defocusing vehicles. Vehicle imaging features with 2-D motion parameters are derived theoretically by exploiting a priori knowledge of polar format algorithm (PFA). In accordance with the revealed characteristics, a vision-based VideoSAR-LRSD algorithm, called three-term decomposition (TTD) with proximal exchange-based alternating directions method of multipliers (PEADMM), is then proposed to improve the performance of vehicle detection. It can be used to break the limitation for the application of emergency response not permitting the acquisition of multi-channel or multi-pass data. We comprehensively demonstrate using extensive VideoSAR DROI experiments that in comparison with the state-of-the-art algorithms, TTD-PEADMM algorithm presents the improved accuracy and is able to offer competitive results.
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.001 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.001 |
| Bibliometrics | 0.001 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 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".