Region tracking via level set PDEs without motion computation
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
We propose an approach to region tracking that is derived from a Bayesian formulation. The novelty of the approach is twofold. First, no motion field or motion parameters need to be computed. This removes a major burden since accurate motion computation has been and remains a challenging problem and the quality of region tracking algorithms based on motion critically depends on the computed motion fields and parameters. The second novelty of this approach, is that very little a priori information about the region being tracked is used in the algorithm. In particular, unlike numerous tracking algorithms, no assumption is made on the strength of the intensity edges of the boundary of the region being tracked, nor is its shape assumed to be of a certain parametric form. The problem of region tracking is formulated as a Bayesian estimation problem and the resulting tracking algorithm is expressed as a level set partial differential equation. We present further extensions to this partial differential equation, allowing the possibility of including additional information in the tracking process, such as priors on the region's intensity boundaries and we present the details of the numerical implementation. Very promising experimental results are provided.
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.001 | 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