Python tool for aircraft Doppler audio geolocation using historical ADS-B flight data (Source-available)
Python acoustic-geolocationads-baircraft-trackingairplaneaudio-forensicsdoppler-effectdoppler-shiftgeolocationosintsignal-processing
Document adaptive search and batched clock fits
Cinna Davis059c4c146854
diff --git a/README.md b/README.mdindex 94cbda5..5aebab6 100644--- a/README.md+++ b/README.md@@ -82,7 +82,7 @@ The target is a supported location estimate within **1,000 m**, preferably **100Recording-time evidence matters: audio-relative seconds do not identify which day's flights to search. A defensible start time or bounded UTC window is needed; file modification and upload times do not establish the recording clock. The robust search considers all prepared independent flyover groups under one shared clock, with no default two- or three-event cap. Harmonics count once and unconfirmed proposals may remain unmatched. Explicit event, tile or candidate budgets can leave a search incomplete.-The automatic search uses conservative score ceilings before completing every fit: incompatible residuals and an established Top-K cutoff can stop further group fitting at a shared clock. Deferred acoustic batches avoid computing groups those trials never need. [Search screening and real-data timing](docs/DATA_AND_SCALE.md#search) describe the bounds and their measured limits.+The automatic search uses conservative score ceilings before completing every fit: incompatible residuals and an established Top-K cutoff can stop further group fitting at a shared clock. It batches eligible clock fits and divides overloaded tiles into smaller checkpointed pieces. [Search screening and real-data timing](docs/DATA_AND_SCALE.md#search) describe the bounds and their measured limits.Recent search work makes omitted alternatives and failed model evaluations visible. A disk-backed ledger records scored candidates before ranking limits discard them, including the best discarded score. Robust clock trials distinguish evaluated fits and known poor fits from missing or unsupported work; one finite winning score cannot hide unknown competing trials. This accounts for the **evaluated finite grid**. It does not prove that a better location cannot exist between grid points. See [finite-search evidence](docs/FINITE_SEARCH_PRODUCER.md) and [clock-trial accounting](docs/SCORING_ASSESSMENT.md).diff --git a/docs/DATA_AND_SCALE.md b/docs/DATA_AND_SCALE.mdindex 986bd2a..89016ca 100644--- a/docs/DATA_AND_SCALE.md+++ b/docs/DATA_AND_SCALE.md@@ -82,10 +82,14 @@ event offsets and score units are identical in every tile. One shared clock isconstrained to the supplied recording-start window. Coarse tiles use separateworker processes for the built-in cached-terrain provider, automatically choosingone fewer worker than the available logical CPUs, with a minimum of one. Custom-terrain providers use serial execution. Hard limits on grid cells, tracks, samples, CPA rows and-candidate combinations bound each worker's allocations; total memory grows with-the worker count. An overloaded tile is reported as missing work. Reducing-`tile_cells` trades scheduling overhead for smaller working sets.+terrain providers use serial execution. Hard limits on grid cells, tracks, samples,+CPA rows and candidate combinations bound each worker's allocations; total memory+grows with the worker count. When a tile exceeds a per-tile capacity limit, the+search divides it into smaller nonoverlapping grid rectangles and checkpoints+each completed piece. Fine search also divides overloaded rectangles. A capacity+failure at a single grid cell, missing data, and other errors remain visible as+incomplete work. Reducing `tile_cells` trades scheduling overhead for smaller+working sets.Workers retain private score ledgers. The parent verifies their identities andchecksums before importing a completed tile, and merges rankings in deterministic@@ -110,6 +114,10 @@ cannot enter Top-K. While fitting a shared-clock trial, validated residuals cantighten that ceiling or establish a residual rejection before the remaininggroups are fitted. Comparisons are strict, so ties remain eligible. Acousticbatches for later groups are deferred until a surviving trial needs them.+For the first event, a measured-ridge loss bound can screen individual clocks;+the remaining supported clocks are fitted together. Representative batched+fits are checked against the scalar fitter, with fallback for mismatches or+unsupported and numerically degenerate batches.Unperformed trials remain unknown with explicit conservative bounds in theretention ledger. A competitive candidate receives full evaluation, preserving@@ -130,6 +138,12 @@ about 8–28% wall time across paired runs under varying machine load; operationcounts were stable. These measurements do not predict nationwide runtime. Thegroup-count ceiling alone did not show a reliable speedup on the existing cache.+With the acoustic screen enabled in both runs, one full-day replay of a single+real grid point and 468 associations took 56.28 CPU seconds using scalar+first-event fits and 7.72 seconds when fitting only eligible clocks in batches.+The complete tile payload and retention checksum matched. This is one point,+not a nationwide runtime estimate or an independent location validation.+Manifest and tile receipts hash configuration, input index files, eventmeasurements, implementation and terrain files. Interrupted jobs reuse completedtiles with the same identity. Changed inputs require a new output directory.@@ -138,6 +152,8 @@ Reports distinguish complete/partial computation, source scope, missing tiles,refinement failure, runtime and Linux process peak RSS. A complete tile is neverlabelled a complete national search. The product/confidence workers translatethis internal report to the shared coverage and result contracts.+Search progress counts grid-cell work, not elapsed time or a guarantee that all+data and model support are complete; dense cells may take much longer to process.Source completeness includes an acoustic halo outside observer bounds: aCONUS-cropped flight table cannot establish complete border coverage.