Vision-Based Vehicle Detection for VideoSAR Surveillance Using Low-Rank Plus Sparse Three-Term Decomposition
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
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.
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.001 |
| 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 it