KRMARO: Aerial Detection of Small-Size Ground Moving Objects Using Kinematic Regularization and Matrix Rank Optimization
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
Detecting moving objects has been well studied in the past due to its importance in computer vision applications. Nevertheless, in aerial imagery, the small sizes of moving objects and the camera motion present challenges to existing well-known detection methods. Most moving object detection methods have reported either high true detection rates associated with high false-detection rates, or low false-detection rates at the expense of lowering true detection rates. This paper proposes a novel method, Kinematic Regularization and Matrix Rank Optimization (KRMARO), to achieve high true-detection rates and reduce false-detection rates significantly. KRMARO introduces a formulation of the moving objects detection problem that integrates a novel kinematic regularization into the principal component pursuit. This formulation models moving objects as sparse, which is located in regions exhibiting unique kinematic properties, while the background is modeled as a low-rank matrix that is corrupted by this sparse. To solve the former formulation accurately, KRMARO proposes a solution based on the inexact Newton method and the inexact augmented Lagrange multiplier with backtracking behavior. The robustness of KRMARO is verified through testing on DARPA VIVID, UCF aerial action, and VIRAT aerial data sets and then comparing the results with relevant state-of-the-art methods.
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.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 it