Extracting Unambiguous Drone Signature Using High-Speed Camera
Bibliographic record
Abstract
In recent years, the use of drones for recreational and commercial activities has grown rapidly due to their affordability and performance. This growing use raises concerns about the threats drones pose to the security of sensitive areas such as airports, prisons, industrial and military facilities. In response to these threats, drones detection methods are being actively developed. In particular, most camera-based methods rely on appearance to perform detection. They are therefore prone to error due to the great similarity between drones and some other flying entities such as birds. However, from a kinematic perspective, unlike birds, drones, especially multicopters, have a propeller rotation speed. The method proposed in this paper uses the propeller rotation speed as the key physical parameter on which to rely to unambiguously distinguish drones from other flying entities. The basic idea consists in using discrete Fourier transform to determine the propellers rotation speed from high frame rate videos, and extracting the propellers induced drone signature as a quantitative camera-based drone signature. The proposed algorithm proceeds as follows: flying entities are continuously tracked in the sky; discrete Fourier transform, applied to the video stream within a time window ending at the current instant (frame), is used to extract the propellers induced drone signature which unambiguously confirm each flying entity as being a drone or not. Experimental results obtained using a consumer-grade camera at a frame rate of$240Hz$demonstrate the effectiveness and reliability of the proposed method.
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.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| 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".