A highly automated moving object detection package
Bibliographic record
Abstract
With the deployment of large CCD mosaic cameras and their use in large-scale surveys to discover Solar system objects, there is a need for fast detection algorithms that can handle large data loads in a nearly automatic way. We present here an algorithm that we have developed. Our approach, by using two independent detection algorithms and combining the results, maintains high efficiency while producing low false-detection rates. These properties are crucial in order to reduce the operator time associated with searching these huge data sets. We have used this algorithm on two different mosaic data sets obtained using the CFH12K camera at the Canada–France–Hawaii Telescope (CFHT). Comparing the detection efficiency and false-detection rate of each individual algorithm with the combination of both, we show that our approach decreases the false detection rate by a factor of a few hundred to a thousand, while decreasing the ‘limiting magnitude’ (where the detection rate drops to 50 per cent) by only 0.1–0.3 mag. The limiting magnitude is similar to that of a human operator blinking the images. Our full pipeline also characterizes the magnitude efficiency of the entire system by implanting artificial objects in the data set. The detection portion of the package is publicly available.
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.004 |
| Meta-epidemiology (narrow) | 0.002 | 0.001 |
| Meta-epidemiology (broad) | 0.002 | 0.002 |
| Bibliometrics | 0.002 | 0.001 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.003 | 0.002 |
| Research integrity | 0.001 | 0.002 |
| Insufficient payload (model declined to judge) | 0.058 | 0.056 |
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".